{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2A6IKVJDBMC5MCYPUF3IJ5M6AX","short_pith_number":"pith:2A6IKVJD","schema_version":"1.0","canonical_sha256":"d03c8555230b05d60b0fa17684f59e05d121f110feebf5b22305d168efd49306","source":{"kind":"arxiv","id":"1208.2956","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.2956","created_at":"2026-05-18T03:20:20.758482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2956v2","created_at":"2026-05-18T03:20:20.758482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2956","created_at":"2026-05-18T03:20:20.758482+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A6IKVJDBMC5","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A6IKVJDBMC5MCYP","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A6IKVJD","created_at":"2026-05-18T12:26:50.516681+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/2A6IKVJDBMC5MCYPUF3IJ5M6AX","json":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX.json","graph_json":"https://pith.science/api/pith-number/2A6IKVJDBMC5MCYPUF3IJ5M6AX/graph.json","events_json":"https://pith.science/api/pith-number/2A6IKVJDBMC5MCYPUF3IJ5M6AX/events.json","paper":"https://pith.science/paper/2A6IKVJD"},"agent_actions":{"view_html":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX","download_json":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX.json","view_paper":"https://pith.science/paper/2A6IKVJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2956&json=true","fetch_graph":"https://pith.science/api/pith-number/2A6IKVJDBMC5MCYPUF3IJ5M6AX/graph.json","fetch_events":"https://pith.science/api/pith-number/2A6IKVJDBMC5MCYPUF3IJ5M6AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/action/storage_attestation","attest_author":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/action/author_attestation","sign_citation":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/action/citation_signature","submit_replication":"https://pith.science/pith/2A6IKVJDBMC5MCYPUF3IJ5M6AX/action/replication_record"}},"created_at":"2026-05-18T03:20:20.758482+00:00","updated_at":"2026-05-18T03:20:20.758482+00:00"}