{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ECAVBSVCYKJVKBSKSRQOXPKYQD","short_pith_number":"pith:ECAVBSVC","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"},"canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","source":{"kind":"arxiv","id":"1011.3049","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3049","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3049v3","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3049","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"ECAVBSVCYKJV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ECAVBSVCYKJVKBSK","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ECAVBSVC","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ECAVBSVCYKJVKBSKSRQOXPKYQD","target":"record","payload":{"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"},"canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","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"},"source_kind":"arxiv","source_id":"1011.3049","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-18T04:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0vIpPOpAF9xx0OYu7ptpvUhpAF8PzGC2fVBbBEvmStPEMEiQjZmWMj4WJOaGBj6dhRlyxwPoDyzXjGG9nWLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:00.240447Z"},"content_sha256":"716cf52ea4f452036c0889cfe5aa24a6f3738c9970f8a7287685ff2e5e6f7ef2","schema_version":"1.0","event_id":"sha256:716cf52ea4f452036c0889cfe5aa24a6f3738c9970f8a7287685ff2e5e6f7ef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ECAVBSVCYKJVKBSKSRQOXPKYQD","target":"graph","payload":{"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"},"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-18T04:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvV4co3D/nxD/qQAlJry2GNFRcZJefZF1ha7V740gxDgLZM1u690Asqf9w8VFn8WdNKh4xiy5BzNTUi4HFW+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:00.241190Z"},"content_sha256":"483c0406775a9886512d7322320b6cc3344d7d2604632c3d773c9b5b1c87ee05","schema_version":"1.0","event_id":"sha256:483c0406775a9886512d7322320b6cc3344d7d2604632c3d773c9b5b1c87ee05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/bundle.json","state_url":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/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-05-26T17:54:00Z","links":{"resolver":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD","bundle":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/bundle.json","state":"https://pith.science/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECAVBSVCYKJVKBSKSRQOXPKYQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ECAVBSVCYKJVKBSKSRQOXPKYQD","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":"e5075e219be6f93f58f6b5cfae9b02af759d0f89efe06e120973c2aeb5c47d4e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T21:06:13Z","title_canon_sha256":"c6b4fdd99a3ed74e9a92f89e7279f959d404387510bdcac33ce4c6e9ff417b8f"},"schema_version":"1.0","source":{"id":"1011.3049","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3049","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3049v3","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3049","created_at":"2026-05-18T04:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"ECAVBSVCYKJV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"ECAVBSVCYKJVKBSK","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"ECAVBSVC","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:483c0406775a9886512d7322320b6cc3344d7d2604632c3d773c9b5b1c87ee05","target":"graph","created_at":"2026-05-18T04:10:56Z","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 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","authors_text":"Amos Korman, Atish Das Sarma, Danupon Nanongkai, David Peleg, Gopal Pandurangan, Liah Kor, Roger Wattenhofer, Stephan Holzer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T21:06:13Z","title":"Distributed Verification and Hardness of Distributed Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3049","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:716cf52ea4f452036c0889cfe5aa24a6f3738c9970f8a7287685ff2e5e6f7ef2","target":"record","created_at":"2026-05-18T04:10:56Z","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":"e5075e219be6f93f58f6b5cfae9b02af759d0f89efe06e120973c2aeb5c47d4e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-12T21:06:13Z","title_canon_sha256":"c6b4fdd99a3ed74e9a92f89e7279f959d404387510bdcac33ce4c6e9ff417b8f"},"schema_version":"1.0","source":{"id":"1011.3049","kind":"arxiv","version":3}},"canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"208150caa2c29355064a9460ebbd5880f52de10e0c2db0df6e779de2d02998c9","first_computed_at":"2026-05-18T04:10:56.981706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:56.981706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LJLw1r7735T1LBImCQH6aCSxr9vxc+dNwbIY8fGTX1smH378GnYgZvJeNvuyj+T+WSFC7Fjr3eH4uui4IofwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:56.982229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3049","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:716cf52ea4f452036c0889cfe5aa24a6f3738c9970f8a7287685ff2e5e6f7ef2","sha256:483c0406775a9886512d7322320b6cc3344d7d2604632c3d773c9b5b1c87ee05"],"state_sha256":"4892112d259a631fe98bd038d37b85ab555224ab60d206751e23fec1f12a7e78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSsGx2fI3kTRnDPh3j0OmBHHoyLCJR8y2APfxxEETPj/vw8D83L+ycsCjKu8p9TKSEDGkcY8IkGAeQYLuvC5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:54:00.245358Z","bundle_sha256":"6a197ccecb55ed1250ab5c8119363d8b97e3e59ab869787894647ae9850f1488"}}