{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4BL24SIK7RYYHUS2PZCXP4XADO","short_pith_number":"pith:4BL24SIK","canonical_record":{"source":{"id":"1605.03797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T13:12:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"91d12009a6d00b33a1b8d4d00d39f940e91e03fb7ab0e879aa3b0cf7ad08a6f5","abstract_canon_sha256":"6625a1899f06376ef0da5c28f7eacdca61964619c244a3b3c63ae0bd5022d611"},"schema_version":"1.0"},"canonical_sha256":"e057ae490afc7183d25a7e4577f2e01babf379f08cfb4a8f908186eb8a077ec9","source":{"kind":"arxiv","id":"1605.03797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03797","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03797v1","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03797","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"4BL24SIK7RYY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BL24SIK7RYYHUS2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BL24SIK","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4BL24SIK7RYYHUS2PZCXP4XADO","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T13:12:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"91d12009a6d00b33a1b8d4d00d39f940e91e03fb7ab0e879aa3b0cf7ad08a6f5","abstract_canon_sha256":"6625a1899f06376ef0da5c28f7eacdca61964619c244a3b3c63ae0bd5022d611"},"schema_version":"1.0"},"canonical_sha256":"e057ae490afc7183d25a7e4577f2e01babf379f08cfb4a8f908186eb8a077ec9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:59.466070Z","signature_b64":"5NyJ0NahqXxpbysQVXVwJfXR2n3fGAg7cbLvEfgCIm4TkC5PMfwwa7ET+vcSa3rBGjuSG8pM3Enn96hGdMxmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e057ae490afc7183d25a7e4577f2e01babf379f08cfb4a8f908186eb8a077ec9","last_reissued_at":"2026-05-18T01:14:59.465617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:59.465617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03797","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bo4BLhL7BauG1r8++pt0RUDxYpoGWppeEBN5UR6CeG+N3xzbJxiRjNN/OEFzobNUv42SIa6L/GXi0xSYt+0aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:41:49.508065Z"},"content_sha256":"6c7e4892880ab328e3a590cd736693ad303cae9816d8ddf6cb8f04dfda6459f4","schema_version":"1.0","event_id":"sha256:6c7e4892880ab328e3a590cd736693ad303cae9816d8ddf6cb8f04dfda6459f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4BL24SIK7RYYHUS2PZCXP4XADO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Amir Abboud, S{\\o}ren Dahlgaard","submitted_at":"2016-05-12T13:12:58Z","abstract_excerpt":"The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph $G$ such that we may support insertions and deletions of edges in $G$ as well as distance queries between any two nodes $u,v$ subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades and gets solved millions of times every day by companies like Google, Microsoft, and Uber. The best known algorithm performs queries and updates in $\\tilde{O}(n^{2/3})$ time, based on ideas of a seminal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03797","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9sMMWj07vBN+ICIl2qj0dTO6egvVkV6xPU/chFC3/AGO54fROtYk1s/378TzUZwJ62kAKe/KBdzwGA9CAQ9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:41:49.508707Z"},"content_sha256":"d1b4bd1a494914eb95ce1e6acef6ee499ccfadc783839c33e97e9259e731861b","schema_version":"1.0","event_id":"sha256:d1b4bd1a494914eb95ce1e6acef6ee499ccfadc783839c33e97e9259e731861b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BL24SIK7RYYHUS2PZCXP4XADO/bundle.json","state_url":"https://pith.science/pith/4BL24SIK7RYYHUS2PZCXP4XADO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BL24SIK7RYYHUS2PZCXP4XADO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:41:49Z","links":{"resolver":"https://pith.science/pith/4BL24SIK7RYYHUS2PZCXP4XADO","bundle":"https://pith.science/pith/4BL24SIK7RYYHUS2PZCXP4XADO/bundle.json","state":"https://pith.science/pith/4BL24SIK7RYYHUS2PZCXP4XADO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BL24SIK7RYYHUS2PZCXP4XADO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4BL24SIK7RYYHUS2PZCXP4XADO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6625a1899f06376ef0da5c28f7eacdca61964619c244a3b3c63ae0bd5022d611","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T13:12:58Z","title_canon_sha256":"91d12009a6d00b33a1b8d4d00d39f940e91e03fb7ab0e879aa3b0cf7ad08a6f5"},"schema_version":"1.0","source":{"id":"1605.03797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03797","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03797v1","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03797","created_at":"2026-05-18T01:14:59Z"},{"alias_kind":"pith_short_12","alias_value":"4BL24SIK7RYY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4BL24SIK7RYYHUS2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4BL24SIK","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:d1b4bd1a494914eb95ce1e6acef6ee499ccfadc783839c33e97e9259e731861b","target":"graph","created_at":"2026-05-18T01:14:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph $G$ such that we may support insertions and deletions of edges in $G$ as well as distance queries between any two nodes $u,v$ subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental communities over the past decades and gets solved millions of times every day by companies like Google, Microsoft, and Uber. The best known algorithm performs queries and updates in $\\tilde{O}(n^{2/3})$ time, based on ideas of a seminal ","authors_text":"Amir Abboud, S{\\o}ren Dahlgaard","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T13:12:58Z","title":"Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03797","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6c7e4892880ab328e3a590cd736693ad303cae9816d8ddf6cb8f04dfda6459f4","target":"record","created_at":"2026-05-18T01:14:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6625a1899f06376ef0da5c28f7eacdca61964619c244a3b3c63ae0bd5022d611","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-12T13:12:58Z","title_canon_sha256":"91d12009a6d00b33a1b8d4d00d39f940e91e03fb7ab0e879aa3b0cf7ad08a6f5"},"schema_version":"1.0","source":{"id":"1605.03797","kind":"arxiv","version":1}},"canonical_sha256":"e057ae490afc7183d25a7e4577f2e01babf379f08cfb4a8f908186eb8a077ec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e057ae490afc7183d25a7e4577f2e01babf379f08cfb4a8f908186eb8a077ec9","first_computed_at":"2026-05-18T01:14:59.465617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:59.465617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NyJ0NahqXxpbysQVXVwJfXR2n3fGAg7cbLvEfgCIm4TkC5PMfwwa7ET+vcSa3rBGjuSG8pM3Enn96hGdMxmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:59.466070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c7e4892880ab328e3a590cd736693ad303cae9816d8ddf6cb8f04dfda6459f4","sha256:d1b4bd1a494914eb95ce1e6acef6ee499ccfadc783839c33e97e9259e731861b"],"state_sha256":"27a1b0e7f67f379b3a5fd24a9d66182f7f5c0bcafeb73b9aa76038b7a7221355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbidUnzxnQt3Q23W46gjx4tkqWuinCCY7kjkxQGrE91ua594u2MA4Msbr1ZPuqkkC+t98ToTf7SdlAC0XUYQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:41:49.511825Z","bundle_sha256":"17ab188a62588e31b7088051155e38f1c9c0e2f0cacf6d7c528bd91bae5b6c17"}}