{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IILOEN5U5KVLFOFWRTENAW4G5F","short_pith_number":"pith:IILOEN5U","canonical_record":{"source":{"id":"2502.10348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-14T18:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"b0ed40a39337131bc5a8266be99f44e30f5a408cb32467813b52c496fa09ffe5","abstract_canon_sha256":"3330c69ab18f6d795605e0555b3651181656a816539c08f24a7ddc939ee827aa"},"schema_version":"1.0"},"canonical_sha256":"4216e237b4eaaab2b8b68cc8d05b86e940dbe4af6af0d04fb8cb6b29fcd44aca","source":{"kind":"arxiv","id":"2502.10348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10348","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10348v1","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10348","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"IILOEN5U5KVL","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"IILOEN5U5KVLFOFW","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"IILOEN5U","created_at":"2026-07-05T10:14:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IILOEN5U5KVLFOFWRTENAW4G5F","target":"record","payload":{"canonical_record":{"source":{"id":"2502.10348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-14T18:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"b0ed40a39337131bc5a8266be99f44e30f5a408cb32467813b52c496fa09ffe5","abstract_canon_sha256":"3330c69ab18f6d795605e0555b3651181656a816539c08f24a7ddc939ee827aa"},"schema_version":"1.0"},"canonical_sha256":"4216e237b4eaaab2b8b68cc8d05b86e940dbe4af6af0d04fb8cb6b29fcd44aca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:32.914227Z","signature_b64":"CSgDdrPDUFbzI8QBo+LVC8ncealOzB7rkCLUTm6p0sKgtHEyfEeVD1tWdALPwVwxgxPTuejqiQPk4pxC/IjlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4216e237b4eaaab2b8b68cc8d05b86e940dbe4af6af0d04fb8cb6b29fcd44aca","last_reissued_at":"2026-07-05T10:14:32.913734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:32.913734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.10348","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:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqCi5Ak8/H0ujHy4AifDfPrY9u+iSAdIUHH3uDE60ODsi9KL7DdLxRPzFBz4KZ7xDGAv9PotBfNFSMnXdjYoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:15:55.901705Z"},"content_sha256":"4b2a3dbfa4bfd78c033d8d0ccfcf945eed0c23258a3918f28724e8f619b328b1","schema_version":"1.0","event_id":"sha256:4b2a3dbfa4bfd78c033d8d0ccfcf945eed0c23258a3918f28724e8f619b328b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IILOEN5U5KVLFOFWRTENAW4G5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Incremental Approximate Shortest Paths in Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam G\\'orkiewicz, Adam Karczmarz","submitted_at":"2025-02-14T18:20:45Z","abstract_excerpt":"In this paper, we show new data structures maintaining approximate shortest paths in sparse directed graphs with polynomially bounded non-negative edge weights under edge insertions.\n  We give more efficient incremental $(1+\\epsilon)$-approximate APSP data structures that work against an adaptive adversary: a deterministic one with $\\tilde{O}(m^{3/2}n^{3/4})$ total update time and a randomized one with $\\tilde{O}(m^{4/3}n^{5/6})$ total update time. For sparse graphs, these both improve polynomially upon the best-known bound against an adaptive adversary. To achieve that, building on the ideas "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10348","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.10348/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:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Vht+gjs6EYA7swhfo8MLmG6kWsNebrDsHQp7GaBEvPuWWXPiqF5km4uh3kstG0kmHHkLzZARkF+o96eI6y3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:15:55.902222Z"},"content_sha256":"98ac5481fdf2526d8dde7fd07b572edd310b7f88c232920770a1f19e83e3e05e","schema_version":"1.0","event_id":"sha256:98ac5481fdf2526d8dde7fd07b572edd310b7f88c232920770a1f19e83e3e05e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IILOEN5U5KVLFOFWRTENAW4G5F/bundle.json","state_url":"https://pith.science/pith/IILOEN5U5KVLFOFWRTENAW4G5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IILOEN5U5KVLFOFWRTENAW4G5F/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-11T13:15:55Z","links":{"resolver":"https://pith.science/pith/IILOEN5U5KVLFOFWRTENAW4G5F","bundle":"https://pith.science/pith/IILOEN5U5KVLFOFWRTENAW4G5F/bundle.json","state":"https://pith.science/pith/IILOEN5U5KVLFOFWRTENAW4G5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IILOEN5U5KVLFOFWRTENAW4G5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IILOEN5U5KVLFOFWRTENAW4G5F","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":"3330c69ab18f6d795605e0555b3651181656a816539c08f24a7ddc939ee827aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-14T18:20:45Z","title_canon_sha256":"b0ed40a39337131bc5a8266be99f44e30f5a408cb32467813b52c496fa09ffe5"},"schema_version":"1.0","source":{"id":"2502.10348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.10348","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.10348v1","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10348","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"IILOEN5U5KVL","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"IILOEN5U5KVLFOFW","created_at":"2026-07-05T10:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"IILOEN5U","created_at":"2026-07-05T10:14:32Z"}],"graph_snapshots":[{"event_id":"sha256:98ac5481fdf2526d8dde7fd07b572edd310b7f88c232920770a1f19e83e3e05e","target":"graph","created_at":"2026-07-05T10:14:32Z","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.10348/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we show new data structures maintaining approximate shortest paths in sparse directed graphs with polynomially bounded non-negative edge weights under edge insertions.\n  We give more efficient incremental $(1+\\epsilon)$-approximate APSP data structures that work against an adaptive adversary: a deterministic one with $\\tilde{O}(m^{3/2}n^{3/4})$ total update time and a randomized one with $\\tilde{O}(m^{4/3}n^{5/6})$ total update time. For sparse graphs, these both improve polynomially upon the best-known bound against an adaptive adversary. To achieve that, building on the ideas ","authors_text":"Adam G\\'orkiewicz, Adam Karczmarz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10348","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:4b2a3dbfa4bfd78c033d8d0ccfcf945eed0c23258a3918f28724e8f619b328b1","target":"record","created_at":"2026-07-05T10:14:32Z","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":"3330c69ab18f6d795605e0555b3651181656a816539c08f24a7ddc939ee827aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-14T18:20:45Z","title_canon_sha256":"b0ed40a39337131bc5a8266be99f44e30f5a408cb32467813b52c496fa09ffe5"},"schema_version":"1.0","source":{"id":"2502.10348","kind":"arxiv","version":1}},"canonical_sha256":"4216e237b4eaaab2b8b68cc8d05b86e940dbe4af6af0d04fb8cb6b29fcd44aca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4216e237b4eaaab2b8b68cc8d05b86e940dbe4af6af0d04fb8cb6b29fcd44aca","first_computed_at":"2026-07-05T10:14:32.913734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:32.913734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSgDdrPDUFbzI8QBo+LVC8ncealOzB7rkCLUTm6p0sKgtHEyfEeVD1tWdALPwVwxgxPTuejqiQPk4pxC/IjlBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:32.914227Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.10348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b2a3dbfa4bfd78c033d8d0ccfcf945eed0c23258a3918f28724e8f619b328b1","sha256:98ac5481fdf2526d8dde7fd07b572edd310b7f88c232920770a1f19e83e3e05e"],"state_sha256":"18dc940b1effc0f4228b9f97ba3fad5db116e327a8e0f024b25581c0072d8b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/mtiy1lsc86lym+dMkVObnl0Ek2BT++aCIxq4Bm/3wbSAXzFOLxKEsvq3ANUyzMdprq77pJFdmrYPwqoQjnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:15:55.925762Z","bundle_sha256":"a8671071a2ff488583ec51480013d9de04e5cf13aef16f059926f7a90b931557"}}