{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","short_pith_number":"pith:IPMV5QKR","canonical_record":{"source":{"id":"2001.10751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"9c661e8669b2d8b3ecd41da83cbf290c06caa1f37afd4fd3aed77175d4a6e72c","abstract_canon_sha256":"624f32e9e798d9c157b0beccd70f1191ea4703a2c4753099b52808300571af78"},"schema_version":"1.0"},"canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","source":{"kind":"arxiv","id":"2001.10751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10751","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10751v1","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10751","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"IPMV5QKR5GW7","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_16","alias_value":"IPMV5QKR5GW7UK6K","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_8","alias_value":"IPMV5QKR","created_at":"2026-07-05T00:37:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","target":"record","payload":{"canonical_record":{"source":{"id":"2001.10751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"9c661e8669b2d8b3ecd41da83cbf290c06caa1f37afd4fd3aed77175d4a6e72c","abstract_canon_sha256":"624f32e9e798d9c157b0beccd70f1191ea4703a2c4753099b52808300571af78"},"schema_version":"1.0"},"canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:11.878689Z","signature_b64":"zeABjquejmFHqdAWuG6xRb4II8FWc9A3uWgcbXzZ8/OD/2wCn+Qpl0Ep+pt2omtHz9M5KFA8WZwecOu9mt6UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","last_reissued_at":"2026-07-05T00:37:11.878193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:11.878193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.10751","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-07-05T00:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ge0uS5jkr2o0tkL2PSW8ID/bMrnCdWfIZ5WWIp5vAsDHMJA9nwZvkVW6gORpGC4aeM5O88dRhr9cCXcsGu8wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:51:45.543063Z"},"content_sha256":"5c1e50e4a4c9a928029a238ad0596976f0aae005265089cad1056b027e342c52","schema_version":"1.0","event_id":"sha256:5c1e50e4a4c9a928029a238ad0596976f0aae005265089cad1056b027e342c52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Nicole Wein, Virginia Vassilevska Williams","submitted_at":"2020-01-29T10:36:30Z","abstract_excerpt":"In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph $G=(V,E)$ subject to edge insertions and deletions and a source vertex $s\\in V$, and the goal is to maintain the distance $d(s,t)$ for all $t\\in V$.\n  Fine-grained complexity has provided strong lower bounds for exact partially dynamic SSSP and approximate fully dynamic SSSP [ESA'04, FOCS'14, STOC'15]. Thus much focus has been directed towards finding efficient partially dynamic $(1+\\epsilon)$-approximate SSSP algorithms [STOC'14, ICALP'15, SODA'14, FOCS'14, STOC'16, SODA'17, ICALP'17, ICALP'19, STOC'19, SODA'20, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10751","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.10751/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXVhL/RCC3OPZY5wXdc+ttQefY7zRMx82uiBjdvS/CW+A/3SUv3fi3etlrJAD+AfiKFAdS4/uDmVSF92/KFmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:51:45.543833Z"},"content_sha256":"ca97d3412284f0633d61d606483cbeebfed3f001f251b0939a16649b39b42d92","schema_version":"1.0","event_id":"sha256:ca97d3412284f0633d61d606483cbeebfed3f001f251b0939a16649b39b42d92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/bundle.json","state_url":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/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-08-06T17:51:45Z","links":{"resolver":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37","bundle":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/bundle.json","state":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","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":"624f32e9e798d9c157b0beccd70f1191ea4703a2c4753099b52808300571af78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","title_canon_sha256":"9c661e8669b2d8b3ecd41da83cbf290c06caa1f37afd4fd3aed77175d4a6e72c"},"schema_version":"1.0","source":{"id":"2001.10751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10751","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10751v1","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10751","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"IPMV5QKR5GW7","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_16","alias_value":"IPMV5QKR5GW7UK6K","created_at":"2026-07-05T00:37:11Z"},{"alias_kind":"pith_short_8","alias_value":"IPMV5QKR","created_at":"2026-07-05T00:37:11Z"}],"graph_snapshots":[{"event_id":"sha256:ca97d3412284f0633d61d606483cbeebfed3f001f251b0939a16649b39b42d92","target":"graph","created_at":"2026-07-05T00:37:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.10751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph $G=(V,E)$ subject to edge insertions and deletions and a source vertex $s\\in V$, and the goal is to maintain the distance $d(s,t)$ for all $t\\in V$.\n  Fine-grained complexity has provided strong lower bounds for exact partially dynamic SSSP and approximate fully dynamic SSSP [ESA'04, FOCS'14, STOC'15]. Thus much focus has been directed towards finding efficient partially dynamic $(1+\\epsilon)$-approximate SSSP algorithms [STOC'14, ICALP'15, SODA'14, FOCS'14, STOC'16, SODA'17, ICALP'17, ICALP'19, STOC'19, SODA'20, ","authors_text":"Maximilian Probst Gutenberg, Nicole Wein, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","title":"New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10751","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:5c1e50e4a4c9a928029a238ad0596976f0aae005265089cad1056b027e342c52","target":"record","created_at":"2026-07-05T00:37:11Z","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":"624f32e9e798d9c157b0beccd70f1191ea4703a2c4753099b52808300571af78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","title_canon_sha256":"9c661e8669b2d8b3ecd41da83cbf290c06caa1f37afd4fd3aed77175d4a6e72c"},"schema_version":"1.0","source":{"id":"2001.10751","kind":"arxiv","version":1}},"canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","first_computed_at":"2026-07-05T00:37:11.878193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:37:11.878193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zeABjquejmFHqdAWuG6xRb4II8FWc9A3uWgcbXzZ8/OD/2wCn+Qpl0Ep+pt2omtHz9M5KFA8WZwecOu9mt6UAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:37:11.878689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.10751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c1e50e4a4c9a928029a238ad0596976f0aae005265089cad1056b027e342c52","sha256:ca97d3412284f0633d61d606483cbeebfed3f001f251b0939a16649b39b42d92"],"state_sha256":"e50ecd8e8ab60e0a7343e96fc13e3da379365f5d7cc31c9a46887afa8d066015"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0tIBOhzwv1tOKCt0w2DSng5QWEHFBgNRQOZaNZTCFzNhNqx4OqkgcmInMsTRK40CdtymkwzChFbc1XyCX6xCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T17:51:45.550789Z","bundle_sha256":"e00c28cd614ad4a255de71fc258988b62f12bd88b01bc56096063bdd0ed940e1"}}