{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SLN5DOERB34DDNGT644G3OYCM6","short_pith_number":"pith:SLN5DOER","schema_version":"1.0","canonical_sha256":"92dbd1b8910ef831b4d3f7386dbb026785b5acb9fec7caef13812611311fe760","source":{"kind":"arxiv","id":"2004.04496","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.04496","created_at":"2026-07-05T01:33:06.732120+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04496v2","created_at":"2026-07-05T01:33:06.732120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04496","created_at":"2026-07-05T01:33:06.732120+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLN5DOERB34D","created_at":"2026-07-05T01:33:06.732120+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLN5DOERB34DDNGT","created_at":"2026-07-05T01:33:06.732120+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLN5DOER","created_at":"2026-07-05T01:33:06.732120+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6","json":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6.json","graph_json":"https://pith.science/api/pith-number/SLN5DOERB34DDNGT644G3OYCM6/graph.json","events_json":"https://pith.science/api/pith-number/SLN5DOERB34DDNGT644G3OYCM6/events.json","paper":"https://pith.science/paper/SLN5DOER"},"agent_actions":{"view_html":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6","download_json":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6.json","view_paper":"https://pith.science/paper/SLN5DOER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04496&json=true","fetch_graph":"https://pith.science/api/pith-number/SLN5DOERB34DDNGT644G3OYCM6/graph.json","fetch_events":"https://pith.science/api/pith-number/SLN5DOERB34DDNGT644G3OYCM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/action/storage_attestation","attest_author":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/action/author_attestation","sign_citation":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/action/citation_signature","submit_replication":"https://pith.science/pith/SLN5DOERB34DDNGT644G3OYCM6/action/replication_record"}},"created_at":"2026-07-05T01:33:06.732120+00:00","updated_at":"2026-07-05T01:33:06.732120+00:00"}