{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UCS3NS6KYIGL6NKV6ENRBPD6LI","short_pith_number":"pith:UCS3NS6K","schema_version":"1.0","canonical_sha256":"a0a5b6cbcac20cbf3555f11b10bc7e5a3889a875fef93b60cd359091036b2a39","source":{"kind":"arxiv","id":"1805.00190","version":1},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.00190","created_at":"2026-05-18T00:17:10.329122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00190v1","created_at":"2026-05-18T00:17:10.329122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00190","created_at":"2026-05-18T00:17:10.329122+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCS3NS6KYIGL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCS3NS6KYIGL6NKV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCS3NS6K","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI","json":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI.json","graph_json":"https://pith.science/api/pith-number/UCS3NS6KYIGL6NKV6ENRBPD6LI/graph.json","events_json":"https://pith.science/api/pith-number/UCS3NS6KYIGL6NKV6ENRBPD6LI/events.json","paper":"https://pith.science/paper/UCS3NS6K"},"agent_actions":{"view_html":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI","download_json":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI.json","view_paper":"https://pith.science/paper/UCS3NS6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00190&json=true","fetch_graph":"https://pith.science/api/pith-number/UCS3NS6KYIGL6NKV6ENRBPD6LI/graph.json","fetch_events":"https://pith.science/api/pith-number/UCS3NS6KYIGL6NKV6ENRBPD6LI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/action/storage_attestation","attest_author":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/action/author_attestation","sign_citation":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/action/citation_signature","submit_replication":"https://pith.science/pith/UCS3NS6KYIGL6NKV6ENRBPD6LI/action/replication_record"}},"created_at":"2026-05-18T00:17:10.329122+00:00","updated_at":"2026-05-18T00:17:10.329122+00:00"}