{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5A3KMYSTOSB2ALXPTVMYI6PG4H","short_pith_number":"pith:5A3KMYST","schema_version":"1.0","canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","source":{"kind":"arxiv","id":"1607.06865","version":3},"attestation_state":"computed","paper":{"title":"Connectivity Oracles for Graphs Subject to Vertex Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ran Duan, Seth Pettie","submitted_at":"2016-07-23T00:19:08Z","abstract_excerpt":"We introduce new data structures for answering connectivity queries in graphs subject to batched vertex failures. A deterministic structure processes a batch of $d\\leq d_{\\star}$ failed vertices in $\\tilde{O}(d^3)$ time and thereafter answers connectivity queries in $O(d)$ time. It occupies space $O(d_{\\star} m\\log n)$. We develop a randomized Monte Carlo version of our data structure with update time $\\tilde{O}(d^2)$, query time $O(d)$, and space $\\tilde{O}(m)$ for any failure bound $d\\le n$. This is the first connectivity oracle for general graphs that can efficiently deal with an unbounded "},"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":"1607.06865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-23T00:19:08Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e426a9793ff9b187eaa436c65976ab7eee1b8c1ab279c241c8a6f90ca76650bb","abstract_canon_sha256":"6d362fbc531d3292b5e666e9b9179300c601a05352b5e4d90cd192c1f0275b51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.774060Z","signature_b64":"c5TlFGdPTR0JC3KLw4peuxeAP+focXam1kSztzFp+SiCN/a5CY3YFEX2q5k//JuGpQ2CjoSd1treZqo4yUAsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","last_reissued_at":"2026-05-18T00:35:51.773590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.773590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity Oracles for Graphs Subject to Vertex Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ran Duan, Seth Pettie","submitted_at":"2016-07-23T00:19:08Z","abstract_excerpt":"We introduce new data structures for answering connectivity queries in graphs subject to batched vertex failures. A deterministic structure processes a batch of $d\\leq d_{\\star}$ failed vertices in $\\tilde{O}(d^3)$ time and thereafter answers connectivity queries in $O(d)$ time. It occupies space $O(d_{\\star} m\\log n)$. We develop a randomized Monte Carlo version of our data structure with update time $\\tilde{O}(d^2)$, query time $O(d)$, and space $\\tilde{O}(m)$ for any failure bound $d\\le n$. This is the first connectivity oracle for general graphs that can efficiently deal with an unbounded "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06865","kind":"arxiv","version":3},"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":"1607.06865","created_at":"2026-05-18T00:35:51.773660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06865v3","created_at":"2026-05-18T00:35:51.773660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06865","created_at":"2026-05-18T00:35:51.773660+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A3KMYSTOSB2","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A3KMYSTOSB2ALXP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A3KMYST","created_at":"2026-05-18T12:29:58.707656+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/5A3KMYSTOSB2ALXPTVMYI6PG4H","json":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H.json","graph_json":"https://pith.science/api/pith-number/5A3KMYSTOSB2ALXPTVMYI6PG4H/graph.json","events_json":"https://pith.science/api/pith-number/5A3KMYSTOSB2ALXPTVMYI6PG4H/events.json","paper":"https://pith.science/paper/5A3KMYST"},"agent_actions":{"view_html":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H","download_json":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H.json","view_paper":"https://pith.science/paper/5A3KMYST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06865&json=true","fetch_graph":"https://pith.science/api/pith-number/5A3KMYSTOSB2ALXPTVMYI6PG4H/graph.json","fetch_events":"https://pith.science/api/pith-number/5A3KMYSTOSB2ALXPTVMYI6PG4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/action/storage_attestation","attest_author":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/action/author_attestation","sign_citation":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/action/citation_signature","submit_replication":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/action/replication_record"}},"created_at":"2026-05-18T00:35:51.773660+00:00","updated_at":"2026-05-18T00:35:51.773660+00:00"}