{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2A6IKVJDBMC5MCYPUF3IJ5M6AX","short_pith_number":"pith:2A6IKVJD","canonical_record":{"source":{"id":"1208.2956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-14T19:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"3d999c3168cf5ee8dc866e1f46ae3720add726296d74228aaab9df062bef9ac4","abstract_canon_sha256":"9cafe17267417bb7c33272d2febae46d6dced6978fe5d39ad60b6ec6ec4faf58"},"schema_version":"1.0"},"canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","source":{"kind":"arxiv","id":"1208.2956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2956","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2956v2","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2956","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"2A6IKVJDBMC5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2A6IKVJDBMC5MCYP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2A6IKVJD","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2A6IKVJDBMC5MCYPUF3IJ5M6AX","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-14T19:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"3d999c3168cf5ee8dc866e1f46ae3720add726296d74228aaab9df062bef9ac4","abstract_canon_sha256":"9cafe17267417bb7c33272d2febae46d6dced6978fe5d39ad60b6ec6ec4faf58"},"schema_version":"1.0"},"canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:20.759492Z","signature_b64":"sJM889J4dqU6ZalMar4WKJQJ9K1y9st90jdLI3Apqv8qX9PRkcoTErBmlhuRnEQ5r1tLJ5OrzBJ1evGchoxyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","last_reissued_at":"2026-05-18T03:20:20.758381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:20.758381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2956","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-18T03:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Empooe85alkHCqg/GdBLei+vtezb7mTUqqp02YkRK9p4Tdf8Mk0zK3nLeOQZzyzu1JMgayXjpS29mCsW4lRbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:41:05.930634Z"},"content_sha256":"0991783d1d269f378bedbe4df536aef087be287588b532ffc7e9757285d3b0d6","schema_version":"1.0","event_id":"sha256:0991783d1d269f378bedbe4df536aef087be287588b532ffc7e9757285d3b0d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2A6IKVJDBMC5MCYPUF3IJ5M6AX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local reconstructors and tolerant testers for connectivity and diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Guo, Andrea Campagna, Ronitt Rubinfeld","submitted_at":"2012-08-14T19:46:41Z","abstract_excerpt":"A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is \"close\" to having the property, provides oracle access to the adjacency matrix of a \"correction\" of the graph, i.e. a graph which has the property and is close to the given graph. For this model, we achieve local property reconstructors for the properties of connectivity and $k$-connectivity in undirected graphs, and the property of strong connectivity in directed graphs. Along the way, we present a method of transforming a local reconstructor (which acts as a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2956","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-18T03:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JfDAjNNUXjhZBI4jutUCAiiRhnZRJofGYdmRvHxJtFBXZeAbqQvYnuXF7OxpTFneDwG9t1nDgmPCg/wGu/FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:41:05.931165Z"},"content_sha256":"99569c2f2b2d98c2d741f27fe3f6c9b3020593fe039d03d544353125cd18ca25","schema_version":"1.0","event_id":"sha256:99569c2f2b2d98c2d741f27fe3f6c9b3020593fe039d03d544353125cd18ca25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/bundle.json","state_url":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/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-03T05:41:05Z","links":{"resolver":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX","bundle":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/bundle.json","state":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2A6IKVJDBMC5MCYPUF3IJ5M6AX","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":"9cafe17267417bb7c33272d2febae46d6dced6978fe5d39ad60b6ec6ec4faf58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-14T19:46:41Z","title_canon_sha256":"3d999c3168cf5ee8dc866e1f46ae3720add726296d74228aaab9df062bef9ac4"},"schema_version":"1.0","source":{"id":"1208.2956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2956","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2956v2","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2956","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"2A6IKVJDBMC5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2A6IKVJDBMC5MCYP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2A6IKVJD","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:99569c2f2b2d98c2d741f27fe3f6c9b3020593fe039d03d544353125cd18ca25","target":"graph","created_at":"2026-05-18T03:20:20Z","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":"A local property reconstructor for a graph property is an algorithm which, given oracle access to the adjacency list of a graph that is \"close\" to having the property, provides oracle access to the adjacency matrix of a \"correction\" of the graph, i.e. a graph which has the property and is close to the given graph. For this model, we achieve local property reconstructors for the properties of connectivity and $k$-connectivity in undirected graphs, and the property of strong connectivity in directed graphs. Along the way, we present a method of transforming a local reconstructor (which acts as a","authors_text":"Alan Guo, Andrea Campagna, Ronitt Rubinfeld","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-14T19:46:41Z","title":"Local reconstructors and tolerant testers for connectivity and diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2956","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:0991783d1d269f378bedbe4df536aef087be287588b532ffc7e9757285d3b0d6","target":"record","created_at":"2026-05-18T03:20:20Z","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":"9cafe17267417bb7c33272d2febae46d6dced6978fe5d39ad60b6ec6ec4faf58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-14T19:46:41Z","title_canon_sha256":"3d999c3168cf5ee8dc866e1f46ae3720add726296d74228aaab9df062bef9ac4"},"schema_version":"1.0","source":{"id":"1208.2956","kind":"arxiv","version":2}},"canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","first_computed_at":"2026-05-18T03:20:20.758381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:20.758381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sJM889J4dqU6ZalMar4WKJQJ9K1y9st90jdLI3Apqv8qX9PRkcoTErBmlhuRnEQ5r1tLJ5OrzBJ1evGchoxyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:20.759492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0991783d1d269f378bedbe4df536aef087be287588b532ffc7e9757285d3b0d6","sha256:99569c2f2b2d98c2d741f27fe3f6c9b3020593fe039d03d544353125cd18ca25"],"state_sha256":"2a8b14ea216a019a8d4fc9fdee0991996874340acdb892e4796773e693a98c39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFMpfALVUtxnAt7bVixRFe2Eh/BCaBhwYY+YWgvqXDvPny5PAGR4YbDQe9Om9djRg9w9ktLtUsp2tHmyAdVECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:41:05.934155Z","bundle_sha256":"0cdc0cddd1607d7899e2acc8008abf43536e0a594296279264ec5925709294f9"}}