{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UCS3NS6KYIGL6NKV6ENRBPD6LI","short_pith_number":"pith:UCS3NS6K","canonical_record":{"source":{"id":"1805.00190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T05:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"d86fc29749e7eec87d8bb601086b6ba1c5f9243e804ca929243ae139c4a344e1","abstract_canon_sha256":"cbaa7e0f9e75fb1a1bc164ef4bb38e9366e47da43e49e0d50e4c8fc2beac0539"},"schema_version":"1.0"},"canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","source":{"kind":"arxiv","id":"1805.00190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00190","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00190v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00190","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"UCS3NS6KYIGL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UCS3NS6KYIGL6NKV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UCS3NS6K","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UCS3NS6KYIGL6NKV6ENRBPD6LI","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T05:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"d86fc29749e7eec87d8bb601086b6ba1c5f9243e804ca929243ae139c4a344e1","abstract_canon_sha256":"cbaa7e0f9e75fb1a1bc164ef4bb38e9366e47da43e49e0d50e4c8fc2beac0539"},"schema_version":"1.0"},"canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.329566Z","signature_b64":"LSwM5L/IJ+ONJtQ++xqQUO7sOtdSXztoF4S/GjItvR/Y2j7sUnoiueDnfOArczypSgWIZgYulAVPAoxeawObCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","last_reissued_at":"2026-05-18T00:17:10.329033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.329033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00190","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-05-18T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCllgkaNlHzGMZrE0iH/zy+RfUPai7/UJvFMqnwNbXsFhYJ9+5gcnLcW+qnBAyaBt8g8+lohikTeRgZmmc0+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:09:40.944406Z"},"content_sha256":"709f46266683da538dce3169054779fa6457600acbe513dc7738d863fad137cd","schema_version":"1.0","event_id":"sha256:709f46266683da538dce3169054779fa6457600acbe513dc7738d863fad137cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UCS3NS6KYIGL6NKV6ENRBPD6LI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic Single Edge Fault Tolerant Exact Distance Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditi Singh, Manoj Gupta","submitted_at":"2018-05-01T05:13:25Z","abstract_excerpt":"Given an undirected unweighted graph $G$ and a source set $S$ of $|S| = \\sigma $ sources, we want to build a data structure which can process the following query {\\sc Q}$(s,t,e):$ find the shortest distance from $s$ to $t$ avoiding an edge $e$, where $s \\in S$ and $t \\in V$. When $\\sigma=n$, Demetrescu, Thorup, Chowdhury and Ramachandran (SIAM Journal of Computing, 2008) designed an algorithm with $\\tilde O(n^2)$ space ($\\tilde O(\\cdot)$ hides poly $\\log n$ factor.) and $O(1)$ query time. A natural open question is to generalize this result to any number of sources. Recently, Bil{\\`o} et. al. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00190","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":""},"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-18T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6T72Ib12UFG+nEV7LKtHFS+t6iWKC/OgYQh113KhsMKsLs3Yx/T2EKTy5eMqH1RDG05PrtOCaK4EGM2r7Ls6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:09:40.944751Z"},"content_sha256":"cf5bb62515acbb070c7b3af1fcae977e5ec9371d858bab8ccbfe0ab27e88b469","schema_version":"1.0","event_id":"sha256:cf5bb62515acbb070c7b3af1fcae977e5ec9371d858bab8ccbfe0ab27e88b469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/bundle.json","state_url":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/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-20T07:09:40Z","links":{"resolver":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI","bundle":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/bundle.json","state":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UCS3NS6KYIGL6NKV6ENRBPD6LI","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":"cbaa7e0f9e75fb1a1bc164ef4bb38e9366e47da43e49e0d50e4c8fc2beac0539","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T05:13:25Z","title_canon_sha256":"d86fc29749e7eec87d8bb601086b6ba1c5f9243e804ca929243ae139c4a344e1"},"schema_version":"1.0","source":{"id":"1805.00190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00190","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00190v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00190","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"UCS3NS6KYIGL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UCS3NS6KYIGL6NKV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UCS3NS6K","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:cf5bb62515acbb070c7b3af1fcae977e5ec9371d858bab8ccbfe0ab27e88b469","target":"graph","created_at":"2026-05-18T00:17:10Z","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":"Given an undirected unweighted graph $G$ and a source set $S$ of $|S| = \\sigma $ sources, we want to build a data structure which can process the following query {\\sc Q}$(s,t,e):$ find the shortest distance from $s$ to $t$ avoiding an edge $e$, where $s \\in S$ and $t \\in V$. When $\\sigma=n$, Demetrescu, Thorup, Chowdhury and Ramachandran (SIAM Journal of Computing, 2008) designed an algorithm with $\\tilde O(n^2)$ space ($\\tilde O(\\cdot)$ hides poly $\\log n$ factor.) and $O(1)$ query time. A natural open question is to generalize this result to any number of sources. Recently, Bil{\\`o} et. al. ","authors_text":"Aditi Singh, Manoj Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T05:13:25Z","title":"Generic Single Edge Fault Tolerant Exact Distance Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00190","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:709f46266683da538dce3169054779fa6457600acbe513dc7738d863fad137cd","target":"record","created_at":"2026-05-18T00:17:10Z","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":"cbaa7e0f9e75fb1a1bc164ef4bb38e9366e47da43e49e0d50e4c8fc2beac0539","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-01T05:13:25Z","title_canon_sha256":"d86fc29749e7eec87d8bb601086b6ba1c5f9243e804ca929243ae139c4a344e1"},"schema_version":"1.0","source":{"id":"1805.00190","kind":"arxiv","version":1}},"canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","first_computed_at":"2026-05-18T00:17:10.329033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:10.329033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LSwM5L/IJ+ONJtQ++xqQUO7sOtdSXztoF4S/GjItvR/Y2j7sUnoiueDnfOArczypSgWIZgYulAVPAoxeawObCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:10.329566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:709f46266683da538dce3169054779fa6457600acbe513dc7738d863fad137cd","sha256:cf5bb62515acbb070c7b3af1fcae977e5ec9371d858bab8ccbfe0ab27e88b469"],"state_sha256":"eea3b5e66bbe55927a6b4491cacaa978a3c824417c6bbb0273a545681528364c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrz1LBbFXJx6wq19iKEq8Bv7O4kL/lLmPbz97TmPdzVmFWswV+5bE4fEzNcp/uVuyesrd5QBydeoWJY42XqSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:09:40.946637Z","bundle_sha256":"a47b1befaa9d03d06e14048898370f4996c252cb8f5b6574f8b625bafcf30a9e"}}