{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:SLN5DOERB34DDNGT644G3OYCM6","short_pith_number":"pith:SLN5DOER","canonical_record":{"source":{"id":"2004.04496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-09T11:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"64fa86cd60a507ed7ce14bbf8eaf82e59f72eb822e3c388023bec0445d7ee7ea","abstract_canon_sha256":"3f9ef4bbfce1575d55d077a6192ebf6922f9c7ba72780ecc8d72e87b53431e28"},"schema_version":"1.0"},"canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","source":{"kind":"arxiv","id":"2004.04496","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.04496","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"2004.04496v2","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04496","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"SLN5DOERB34D","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_16","alias_value":"SLN5DOERB34DDNGT","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_8","alias_value":"SLN5DOER","created_at":"2026-07-05T01:33:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:SLN5DOERB34DDNGT644G3OYCM6","target":"record","payload":{"canonical_record":{"source":{"id":"2004.04496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-09T11:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"64fa86cd60a507ed7ce14bbf8eaf82e59f72eb822e3c388023bec0445d7ee7ea","abstract_canon_sha256":"3f9ef4bbfce1575d55d077a6192ebf6922f9c7ba72780ecc8d72e87b53431e28"},"schema_version":"1.0"},"canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:06.732436Z","signature_b64":"mUlDZoQiy148Y+R9Fjw1uIUy0rjxn114zsyObPpFYwgOZNCrmdZ5bucs4Wgut9UbZldft0VaqrMIEOaj6VQ9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","last_reissued_at":"2026-07-05T01:33:06.732062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:06.732062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.04496","source_version":2,"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-05T01:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULZNe5+4Rq+EmXXxo4ZEKLFkUjLO8GpWe+rYr6/CKmLflZsF3OIOmntgb0OaNbntpLfwHpkM4W2m5uawLRI3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T21:03:04.789449Z"},"content_sha256":"55bb385e027c6e9d3d77fb799a7af6c1012765b7fd5a1e52e226fd193fa5cff5","schema_version":"1.0","event_id":"sha256:55bb385e027c6e9d3d77fb799a7af6c1012765b7fd5a1e52e226fd193fa5cff5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:SLN5DOERB34DDNGT644G3OYCM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Decremental SSSP in Dense Weighted Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Maximilian Probst Gutenberg","submitted_at":"2020-04-09T11:50:41Z","abstract_excerpt":"In the decremental Single-Source Shortest Path problem (SSSP), we are given a weighted directed graph $G=(V,E,w)$ undergoing edge deletions and a source vertex $r \\in V$; let $n = |V|, m = |E|$ and $W$ be the aspect ratio of the graph. The goal is to obtain a data structure that maintains shortest paths from $r$ to all vertices in $V$ and can answer distance queries in $O(1)$ time, as well as return the corresponding path $P$ in $O(|P|)$ time.\n  This problem was first considered by Even and Shiloach [JACM'81], who provided an algorithm with total update time $O(mn)$ for unweighted undirected g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04496","kind":"arxiv","version":2},"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/2004.04496/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-05T01:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhjz+RGWDtrTsHlTdNQbjkQdQj283jjmog+ybEZ7GN3e2n9pvq4RRGlL+y/JBImPirMhWmXv8NcpjRCGrhnMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T21:03:04.789977Z"},"content_sha256":"bc3f95090a79dac93a0b236b9c460e950e2ad65e045ff98f895c894fa5b59c46","schema_version":"1.0","event_id":"sha256:bc3f95090a79dac93a0b236b9c460e950e2ad65e045ff98f895c894fa5b59c46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/bundle.json","state_url":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLN5DOERB34DDNGT644G3OYCM6/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-01T21:03:04Z","links":{"resolver":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6","bundle":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/bundle.json","state":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLN5DOERB34DDNGT644G3OYCM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:SLN5DOERB34DDNGT644G3OYCM6","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":"3f9ef4bbfce1575d55d077a6192ebf6922f9c7ba72780ecc8d72e87b53431e28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-09T11:50:41Z","title_canon_sha256":"64fa86cd60a507ed7ce14bbf8eaf82e59f72eb822e3c388023bec0445d7ee7ea"},"schema_version":"1.0","source":{"id":"2004.04496","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.04496","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"2004.04496v2","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04496","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"SLN5DOERB34D","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_16","alias_value":"SLN5DOERB34DDNGT","created_at":"2026-07-05T01:33:06Z"},{"alias_kind":"pith_short_8","alias_value":"SLN5DOER","created_at":"2026-07-05T01:33:06Z"}],"graph_snapshots":[{"event_id":"sha256:bc3f95090a79dac93a0b236b9c460e950e2ad65e045ff98f895c894fa5b59c46","target":"graph","created_at":"2026-07-05T01:33:06Z","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/2004.04496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the decremental Single-Source Shortest Path problem (SSSP), we are given a weighted directed graph $G=(V,E,w)$ undergoing edge deletions and a source vertex $r \\in V$; let $n = |V|, m = |E|$ and $W$ be the aspect ratio of the graph. The goal is to obtain a data structure that maintains shortest paths from $r$ to all vertices in $V$ and can answer distance queries in $O(1)$ time, as well as return the corresponding path $P$ in $O(|P|)$ time.\n  This problem was first considered by Even and Shiloach [JACM'81], who provided an algorithm with total update time $O(mn)$ for unweighted undirected g","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Maximilian Probst Gutenberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-09T11:50:41Z","title":"Near-Optimal Decremental SSSP in Dense Weighted Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04496","kind":"arxiv","version":2},"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:55bb385e027c6e9d3d77fb799a7af6c1012765b7fd5a1e52e226fd193fa5cff5","target":"record","created_at":"2026-07-05T01:33:06Z","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":"3f9ef4bbfce1575d55d077a6192ebf6922f9c7ba72780ecc8d72e87b53431e28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-04-09T11:50:41Z","title_canon_sha256":"64fa86cd60a507ed7ce14bbf8eaf82e59f72eb822e3c388023bec0445d7ee7ea"},"schema_version":"1.0","source":{"id":"2004.04496","kind":"arxiv","version":2}},"canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","first_computed_at":"2026-07-05T01:33:06.732062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:33:06.732062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUlDZoQiy148Y+R9Fjw1uIUy0rjxn114zsyObPpFYwgOZNCrmdZ5bucs4Wgut9UbZldft0VaqrMIEOaj6VQ9DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:33:06.732436Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.04496","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55bb385e027c6e9d3d77fb799a7af6c1012765b7fd5a1e52e226fd193fa5cff5","sha256:bc3f95090a79dac93a0b236b9c460e950e2ad65e045ff98f895c894fa5b59c46"],"state_sha256":"0d98982dec3020135b0d93ca8fca9194734e5f9a5a560b1e07a46d0f8f2d1a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83qQyCdavyRiZ/R2d10v22xi7IOGDOz+7T/vaHamPrMVLWV4g9kCZTP/sGiZimT47y/B55SpousNnEYujgzqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T21:03:04.794221Z","bundle_sha256":"aa86f43132dcb150da486c7dc70256d7ea04c212e8cecafe3b84c86ec8744244"}}