{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ECAVBSVCYKJVKBSKSRQOXPKYQD","short_pith_number":"pith:ECAVBSVC","schema_version":"1.0","canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","source":{"kind":"arxiv","id":"1011.3049","version":3},"attestation_state":"computed","paper":{"title":"Distributed Verification and Hardness of Distributed Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Amos Korman, Atish Das Sarma, Danupon Nanongkai, David Peleg, Gopal Pandurangan, Liah Kor, Roger Wattenhofer, Stephan Holzer","submitted_at":"2010-11-12T21:06:13Z","abstract_excerpt":"We study the {\\em verification} problem in distributed networks, stated as follows. Let $H$ be a subgraph of a network $G$ where each vertex of $G$ knows which edges incident on it are in $H$. We would like to verify whether $H$ has some properties, e.g., if it is a tree or if it is connected. We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification, and give almost tight lower bo"},"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":"1011.3049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T21:06:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c6b4fdd99a3ed74e9a92f89e7279f959d404387510bdcac33ce4c6e9ff417b8f","abstract_canon_sha256":"e5075e219be6f93f58f6b5cfae9b02af759d0f89efe06e120973c2aeb5c47d4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:56.982229Z","signature_b64":"LJLw1r7735T1LBImCQH6aCSxr9vxc+dNwbIY8fGTX1smH378GnYgZvJeNvuyj+T+WSFC7Fjr3eH4uui4IofwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","last_reissued_at":"2026-05-18T04:10:56.981706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:56.981706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Verification and Hardness of Distributed Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Amos Korman, Atish Das Sarma, Danupon Nanongkai, David Peleg, Gopal Pandurangan, Liah Kor, Roger Wattenhofer, Stephan Holzer","submitted_at":"2010-11-12T21:06:13Z","abstract_excerpt":"We study the {\\em verification} problem in distributed networks, stated as follows. Let $H$ be a subgraph of a network $G$ where each vertex of $G$ knows which edges incident on it are in $H$. We would like to verify whether $H$ has some properties, e.g., if it is a tree or if it is connected. We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification, and give almost tight lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3049","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":"1011.3049","created_at":"2026-05-18T04:10:56.981802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3049v3","created_at":"2026-05-18T04:10:56.981802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3049","created_at":"2026-05-18T04:10:56.981802+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECAVBSVCYKJV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECAVBSVCYKJVKBSK","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECAVBSVC","created_at":"2026-05-18T12:26:06.534383+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/ECAVBSVCYKJVKBSKSRQOXPKYQD","json":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD.json","graph_json":"https://pith.science/api/pith-number/ECAVBSVCYKJVKBSKSRQOXPKYQD/graph.json","events_json":"https://pith.science/api/pith-number/ECAVBSVCYKJVKBSKSRQOXPKYQD/events.json","paper":"https://pith.science/paper/ECAVBSVC"},"agent_actions":{"view_html":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD","download_json":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD.json","view_paper":"https://pith.science/paper/ECAVBSVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3049&json=true","fetch_graph":"https://pith.science/api/pith-number/ECAVBSVCYKJVKBSKSRQOXPKYQD/graph.json","fetch_events":"https://pith.science/api/pith-number/ECAVBSVCYKJVKBSKSRQOXPKYQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/action/storage_attestation","attest_author":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/action/author_attestation","sign_citation":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/action/citation_signature","submit_replication":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/action/replication_record"}},"created_at":"2026-05-18T04:10:56.981802+00:00","updated_at":"2026-05-18T04:10:56.981802+00:00"}