{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5A3KMYSTOSB2ALXPTVMYI6PG4H","short_pith_number":"pith:5A3KMYST","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"},"canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","source":{"kind":"arxiv","id":"1607.06865","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06865","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06865v3","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06865","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"5A3KMYSTOSB2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5A3KMYSTOSB2ALXP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5A3KMYST","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5A3KMYSTOSB2ALXPTVMYI6PG4H","target":"record","payload":{"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"},"canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","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"},"source_kind":"arxiv","source_id":"1607.06865","source_version":3,"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:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPFg5G8Rmi/qp5EOiKdWHUINqCZMET2DXGhBtEWvpJ4oVJHwSDUJ8oBe79Dtf2u1UlSAjq5T9khTSqf9lc3/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:30:41.814834Z"},"content_sha256":"6ee86725726c628d5841f9cd62becd7886c3429acbbfc93db582c33f6c1dcddf","schema_version":"1.0","event_id":"sha256:6ee86725726c628d5841f9cd62becd7886c3429acbbfc93db582c33f6c1dcddf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5A3KMYSTOSB2ALXPTVMYI6PG4H","target":"graph","payload":{"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"},"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:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aL8uKAcVOIQ+o0D5AGIjprNz2ZzLWiiC+ETqEyJOoJzZ4y5uSnWgv5v6PSoiP4EUzr8ySKCFJJhjd2f94znkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:30:41.815471Z"},"content_sha256":"f68ea4d73e41d7a50dadd02ebf2f13de520204744bf756643a4219f472a4d68e","schema_version":"1.0","event_id":"sha256:f68ea4d73e41d7a50dadd02ebf2f13de520204744bf756643a4219f472a4d68e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/bundle.json","state_url":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/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-04T03:30:41Z","links":{"resolver":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H","bundle":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/bundle.json","state":"https://pith.science/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5A3KMYSTOSB2ALXPTVMYI6PG4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5A3KMYSTOSB2ALXPTVMYI6PG4H","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":"6d362fbc531d3292b5e666e9b9179300c601a05352b5e4d90cd192c1f0275b51","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-23T00:19:08Z","title_canon_sha256":"e426a9793ff9b187eaa436c65976ab7eee1b8c1ab279c241c8a6f90ca76650bb"},"schema_version":"1.0","source":{"id":"1607.06865","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06865","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06865v3","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06865","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"5A3KMYSTOSB2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5A3KMYSTOSB2ALXP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5A3KMYST","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:f68ea4d73e41d7a50dadd02ebf2f13de520204744bf756643a4219f472a4d68e","target":"graph","created_at":"2026-05-18T00:35:51Z","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":"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 ","authors_text":"Ran Duan, Seth Pettie","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-23T00:19:08Z","title":"Connectivity Oracles for Graphs Subject to Vertex Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06865","kind":"arxiv","version":3},"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:6ee86725726c628d5841f9cd62becd7886c3429acbbfc93db582c33f6c1dcddf","target":"record","created_at":"2026-05-18T00:35:51Z","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":"6d362fbc531d3292b5e666e9b9179300c601a05352b5e4d90cd192c1f0275b51","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-23T00:19:08Z","title_canon_sha256":"e426a9793ff9b187eaa436c65976ab7eee1b8c1ab279c241c8a6f90ca76650bb"},"schema_version":"1.0","source":{"id":"1607.06865","kind":"arxiv","version":3}},"canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e836a662537483a02eef9d598479e6e1ca0b8a899faf8f33b3157faa129594c0","first_computed_at":"2026-05-18T00:35:51.773590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:51.773590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5TlFGdPTR0JC3KLw4peuxeAP+focXam1kSztzFp+SiCN/a5CY3YFEX2q5k//JuGpQ2CjoSd1treZqo4yUAsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:51.774060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06865","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee86725726c628d5841f9cd62becd7886c3429acbbfc93db582c33f6c1dcddf","sha256:f68ea4d73e41d7a50dadd02ebf2f13de520204744bf756643a4219f472a4d68e"],"state_sha256":"0359eaf79ead1b31c8e52904ef3ea50ff90a10a2fa1861687bb21c81bb635d35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sjcaXs0C/r6FEZSzT+xNE6YTMSScY2zujxMnlDMSXAJn//KfUMmbFCQzJlfEqO2XTVPoONrq7OPJXV6UwBMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:30:41.818672Z","bundle_sha256":"8081dbae7bbe6fe031431492b3bedf549cc680eb22faf9e3ac01dfa59c70bb4a"}}