{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A73ZM7ZQPURK7JLEQSWYGALBMU","short_pith_number":"pith:A73ZM7ZQ","schema_version":"1.0","canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","source":{"kind":"arxiv","id":"2502.08125","version":1},"attestation_state":"computed","paper":{"title":"Incremental Approximate Single-Source Shortest Paths with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aidin Niaparast, Benjamin Moseley, Helia Niaparast, Samuel McCauley, Shikha Singh","submitted_at":"2025-02-12T05:06:23Z","abstract_excerpt":"The algorithms-with-predictions framework has been used extensively to develop online algorithms with improved beyond-worst-case competitive ratios. Recently, there is growing interest in leveraging predictions for designing data structures with improved beyond-worst-case running times. In this paper, we study the fundamental data structure problem of maintaining approximate shortest paths in incremental graphs in the algorithms-with-predictions model. Given a sequence $\\sigma$ of edges that are inserted one at a time, the goal is to maintain approximate shortest paths from the source to each "},"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":"2502.08125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T05:06:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c275f72c425ef3632a1eafdc9467b8b5cf80b889eb9ee9188cef9c242812e819","abstract_canon_sha256":"d315b7a0a86c6fc30870f1cfcb5b065a4205676d93acb0c45efdd55b0ea77622"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:15.873046Z","signature_b64":"fiZwh1cptQkXSIOP3c8IVoVTKCC9hh3GBvt8FzrdwilUQGWIz+pnos9Zdbp5Z7OYon6AMi4DB3n3CG3ji6ODDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","last_reissued_at":"2026-07-05T10:13:15.872504Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:15.872504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Approximate Single-Source Shortest Paths with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Aidin Niaparast, Benjamin Moseley, Helia Niaparast, Samuel McCauley, Shikha Singh","submitted_at":"2025-02-12T05:06:23Z","abstract_excerpt":"The algorithms-with-predictions framework has been used extensively to develop online algorithms with improved beyond-worst-case competitive ratios. Recently, there is growing interest in leveraging predictions for designing data structures with improved beyond-worst-case running times. In this paper, we study the fundamental data structure problem of maintaining approximate shortest paths in incremental graphs in the algorithms-with-predictions model. Given a sequence $\\sigma$ of edges that are inserted one at a time, the goal is to maintain approximate shortest paths from the source to each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08125","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/2502.08125/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":"2502.08125","created_at":"2026-07-05T10:13:15.872572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08125v1","created_at":"2026-07-05T10:13:15.872572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08125","created_at":"2026-07-05T10:13:15.872572+00:00"},{"alias_kind":"pith_short_12","alias_value":"A73ZM7ZQPURK","created_at":"2026-07-05T10:13:15.872572+00:00"},{"alias_kind":"pith_short_16","alias_value":"A73ZM7ZQPURK7JLE","created_at":"2026-07-05T10:13:15.872572+00:00"},{"alias_kind":"pith_short_8","alias_value":"A73ZM7ZQ","created_at":"2026-07-05T10:13:15.872572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10348","citing_title":"On Incremental Approximate Shortest Paths in Directed Graphs","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU","json":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU.json","graph_json":"https://pith.science/api/pith-number/A73ZM7ZQPURK7JLEQSWYGALBMU/graph.json","events_json":"https://pith.science/api/pith-number/A73ZM7ZQPURK7JLEQSWYGALBMU/events.json","paper":"https://pith.science/paper/A73ZM7ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU","download_json":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU.json","view_paper":"https://pith.science/paper/A73ZM7ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08125&json=true","fetch_graph":"https://pith.science/api/pith-number/A73ZM7ZQPURK7JLEQSWYGALBMU/graph.json","fetch_events":"https://pith.science/api/pith-number/A73ZM7ZQPURK7JLEQSWYGALBMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/action/storage_attestation","attest_author":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/action/author_attestation","sign_citation":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/action/citation_signature","submit_replication":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/action/replication_record"}},"created_at":"2026-07-05T10:13:15.872572+00:00","updated_at":"2026-07-05T10:13:15.872572+00:00"}