{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HIMKYP4MRTXB656GHXIDQ2HU7I","short_pith_number":"pith:HIMKYP4M","canonical_record":{"source":{"id":"1907.07982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T10:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"e61f6f1d4f5fed448f171c9e1e050c54f33916c46c5eb09823eaf08e036ae2ca","abstract_canon_sha256":"f9aab4bfaa2b80ff64b633b09fcb392f22d497a8ee064b584fc35962fb841034"},"schema_version":"1.0"},"canonical_sha256":"3a18ac3f8c8cee1f77c63dd03868f4fa3c668fcff148c759100092d18dcec04d","source":{"kind":"arxiv","id":"1907.07982","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07982","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07982v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07982","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"HIMKYP4MRTXB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIMKYP4MRTXB656G","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIMKYP4M","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HIMKYP4MRTXB656GHXIDQ2HU7I","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T10:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"e61f6f1d4f5fed448f171c9e1e050c54f33916c46c5eb09823eaf08e036ae2ca","abstract_canon_sha256":"f9aab4bfaa2b80ff64b633b09fcb392f22d497a8ee064b584fc35962fb841034"},"schema_version":"1.0"},"canonical_sha256":"3a18ac3f8c8cee1f77c63dd03868f4fa3c668fcff148c759100092d18dcec04d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:03.105873Z","signature_b64":"oCYo/W5wI27VCPhm0mN7ebiiDGm4DuCPsrBI4o/lsH7rVc0Y3lF3DwieG7vYLfLHA1v2ByoX0M1fnFAokuRpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a18ac3f8c8cee1f77c63dd03868f4fa3c668fcff148c759100092d18dcec04d","last_reissued_at":"2026-05-17T23:40:03.105137Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:03.105137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07982","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-05-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgXaGkcZCpQWbPGCFXXfynDfVzXfbaW59u9t32AOMluKMqEAd3Dg3ovBLkR5NVfA8u4K8ucv9wI4qF3VkqHrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:15:33.034930Z"},"content_sha256":"4ac81ea63b7c46aa57c4231f8ee8e605555bd38c20608567c2bee0118272f51c","schema_version":"1.0","event_id":"sha256:4ac81ea63b7c46aa57c4231f8ee8e605555bd38c20608567c2bee0118272f51c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HIMKYP4MRTXB656GHXIDQ2HU7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensitive Distance and Reachability Oracles for Large Batch Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan van den Brand, Thatchaphol Saranurak","submitted_at":"2019-07-18T10:52:13Z","abstract_excerpt":"In the sensitive distance oracle problem, there are three phases. We first preprocess a given directed graph $G$ with $n$ nodes and integer weights from $[-W,W]$. Second, given a single batch of $f$ edge insertions and deletions, we update the data structure. Third, given a query pair of nodes $(u,v)$, return the distance from $u$ to $v$. In the easier problem called sensitive reachability oracle problem, we only ask if there exists a directed path from $u$ to $v$.\n  Our first result is a sensitive distance oracle with $\\tilde{O}(Wn^{\\omega+(3-\\omega)\\mu})$ preprocessing time, $\\tilde{O}(Wn^{2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07982","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":""},"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-05-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MljkRhy9IIoYTqeP7X9uvFMBNVXOI5HI0r+v9u2FQH+EuDzLYbFnKqBPpO5xhvDMgPAF1mCzI//Hx/iEueJJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:15:33.035272Z"},"content_sha256":"339c0baed7bb129a3760927e80f5773931d2e28a95f40e609b8b2797595930b0","schema_version":"1.0","event_id":"sha256:339c0baed7bb129a3760927e80f5773931d2e28a95f40e609b8b2797595930b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/bundle.json","state_url":"https://pith.science/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/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-06-03T01:15:33Z","links":{"resolver":"https://pith.science/pith/HIMKYP4MRTXB656GHXIDQ2HU7I","bundle":"https://pith.science/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/bundle.json","state":"https://pith.science/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIMKYP4MRTXB656GHXIDQ2HU7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HIMKYP4MRTXB656GHXIDQ2HU7I","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":"f9aab4bfaa2b80ff64b633b09fcb392f22d497a8ee064b584fc35962fb841034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T10:52:13Z","title_canon_sha256":"e61f6f1d4f5fed448f171c9e1e050c54f33916c46c5eb09823eaf08e036ae2ca"},"schema_version":"1.0","source":{"id":"1907.07982","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07982","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07982v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07982","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"HIMKYP4MRTXB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIMKYP4MRTXB656G","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIMKYP4M","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:339c0baed7bb129a3760927e80f5773931d2e28a95f40e609b8b2797595930b0","target":"graph","created_at":"2026-05-17T23:40:03Z","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"},"paper":{"abstract_excerpt":"In the sensitive distance oracle problem, there are three phases. We first preprocess a given directed graph $G$ with $n$ nodes and integer weights from $[-W,W]$. Second, given a single batch of $f$ edge insertions and deletions, we update the data structure. Third, given a query pair of nodes $(u,v)$, return the distance from $u$ to $v$. In the easier problem called sensitive reachability oracle problem, we only ask if there exists a directed path from $u$ to $v$.\n  Our first result is a sensitive distance oracle with $\\tilde{O}(Wn^{\\omega+(3-\\omega)\\mu})$ preprocessing time, $\\tilde{O}(Wn^{2","authors_text":"Jan van den Brand, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T10:52:13Z","title":"Sensitive Distance and Reachability Oracles for Large Batch Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07982","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:4ac81ea63b7c46aa57c4231f8ee8e605555bd38c20608567c2bee0118272f51c","target":"record","created_at":"2026-05-17T23:40:03Z","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":"f9aab4bfaa2b80ff64b633b09fcb392f22d497a8ee064b584fc35962fb841034","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T10:52:13Z","title_canon_sha256":"e61f6f1d4f5fed448f171c9e1e050c54f33916c46c5eb09823eaf08e036ae2ca"},"schema_version":"1.0","source":{"id":"1907.07982","kind":"arxiv","version":2}},"canonical_sha256":"3a18ac3f8c8cee1f77c63dd03868f4fa3c668fcff148c759100092d18dcec04d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a18ac3f8c8cee1f77c63dd03868f4fa3c668fcff148c759100092d18dcec04d","first_computed_at":"2026-05-17T23:40:03.105137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:03.105137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCYo/W5wI27VCPhm0mN7ebiiDGm4DuCPsrBI4o/lsH7rVc0Y3lF3DwieG7vYLfLHA1v2ByoX0M1fnFAokuRpDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:03.105873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07982","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ac81ea63b7c46aa57c4231f8ee8e605555bd38c20608567c2bee0118272f51c","sha256:339c0baed7bb129a3760927e80f5773931d2e28a95f40e609b8b2797595930b0"],"state_sha256":"4a9139be859145fd94f281485b8a8226444402ac2805d8c34291b2641963d903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QrM8ZU/NHglDPx/AEWfU5AbfKjNB9iCfluO06n5xGIKlg2FHeyLODzRy0aGRHt8OoNKVaLdgPXgv/9jkbjrDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:15:33.037192Z","bundle_sha256":"55469dce4b644c8f9ade7bc1352a214b706ee519063d75744f7bdc0d6221919f"}}