{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:A73ZM7ZQPURK7JLEQSWYGALBMU","short_pith_number":"pith:A73ZM7ZQ","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"},"canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","source":{"kind":"arxiv","id":"2502.08125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08125","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08125v1","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08125","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"A73ZM7ZQPURK","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_16","alias_value":"A73ZM7ZQPURK7JLE","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_8","alias_value":"A73ZM7ZQ","created_at":"2026-07-05T10:13:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:A73ZM7ZQPURK7JLEQSWYGALBMU","target":"record","payload":{"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"},"canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","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"},"source_kind":"arxiv","source_id":"2502.08125","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-05T10:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIQyfOlPWsjK8fpZOvewHdJKnO8SqwQHcTmiAQKFtrCKcX5Fm4mzkk3c5rarXwX4O9uHmSg+rtcAHsuh4lWHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:25:05.457927Z"},"content_sha256":"4861fb318a3d3a48afb1c475822e7d6be5fbabe5aebc118863d8ff17ab0433d7","schema_version":"1.0","event_id":"sha256:4861fb318a3d3a48afb1c475822e7d6be5fbabe5aebc118863d8ff17ab0433d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:A73ZM7ZQPURK7JLEQSWYGALBMU","target":"graph","payload":{"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"},"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-05T10:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZtlUKT+X0g0UImzMy+kZeSqMjwc0VDV9L5VPGDU+wHhnv8MHnLQWQmtkT1+OJmfnRyKIsBn/ax6kxS8WTNzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:25:05.458449Z"},"content_sha256":"d4735f0ba70428b0abe41078b42e1f906c432b83486c1387f3ab95a1d6896867","schema_version":"1.0","event_id":"sha256:d4735f0ba70428b0abe41078b42e1f906c432b83486c1387f3ab95a1d6896867"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/bundle.json","state_url":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/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-11T10:25:05Z","links":{"resolver":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU","bundle":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/bundle.json","state":"https://pith.science/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A73ZM7ZQPURK7JLEQSWYGALBMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A73ZM7ZQPURK7JLEQSWYGALBMU","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":"d315b7a0a86c6fc30870f1cfcb5b065a4205676d93acb0c45efdd55b0ea77622","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T05:06:23Z","title_canon_sha256":"c275f72c425ef3632a1eafdc9467b8b5cf80b889eb9ee9188cef9c242812e819"},"schema_version":"1.0","source":{"id":"2502.08125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08125","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08125v1","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08125","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"A73ZM7ZQPURK","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_16","alias_value":"A73ZM7ZQPURK7JLE","created_at":"2026-07-05T10:13:15Z"},{"alias_kind":"pith_short_8","alias_value":"A73ZM7ZQ","created_at":"2026-07-05T10:13:15Z"}],"graph_snapshots":[{"event_id":"sha256:d4735f0ba70428b0abe41078b42e1f906c432b83486c1387f3ab95a1d6896867","target":"graph","created_at":"2026-07-05T10:13:15Z","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/2502.08125/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Aidin Niaparast, Benjamin Moseley, Helia Niaparast, Samuel McCauley, Shikha Singh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08125","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:4861fb318a3d3a48afb1c475822e7d6be5fbabe5aebc118863d8ff17ab0433d7","target":"record","created_at":"2026-07-05T10:13:15Z","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":"d315b7a0a86c6fc30870f1cfcb5b065a4205676d93acb0c45efdd55b0ea77622","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-12T05:06:23Z","title_canon_sha256":"c275f72c425ef3632a1eafdc9467b8b5cf80b889eb9ee9188cef9c242812e819"},"schema_version":"1.0","source":{"id":"2502.08125","kind":"arxiv","version":1}},"canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07f7967f307d22afa56484ad830161652a3a37c8274d5735562db5671cdf7229","first_computed_at":"2026-07-05T10:13:15.872504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:15.872504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fiZwh1cptQkXSIOP3c8IVoVTKCC9hh3GBvt8FzrdwilUQGWIz+pnos9Zdbp5Z7OYon6AMi4DB3n3CG3ji6ODDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:15.873046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4861fb318a3d3a48afb1c475822e7d6be5fbabe5aebc118863d8ff17ab0433d7","sha256:d4735f0ba70428b0abe41078b42e1f906c432b83486c1387f3ab95a1d6896867"],"state_sha256":"71c6ca686edfc3e3cc16fdaef17a70a9bb85639f9131c3953dcd989fef457bf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgfGqUySi5jWDWHxc6RfjlrmoT22bW+Cx52lNiUuZxqxC88j85Vr7TACbSCd0vwK8bCE+dxR+jIxJy9ZrwWYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:25:05.463125Z","bundle_sha256":"c47b924831694f0d2fcd89713284e0f2e0d719179849a13ad9e9afccdf717886"}}