{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OT5VDXHUMO23UPDYUUPSKZAYHF","short_pith_number":"pith:OT5VDXHU","canonical_record":{"source":{"id":"1009.3460","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-17T15:53:26Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a49d574e785421b13597fe1447186c91c718a792c7ab38cc370e2589d73919ec","abstract_canon_sha256":"9b9187348e737fdba683b49c876325a77573732aca0d094a67aead08a0ee8ebd"},"schema_version":"1.0"},"canonical_sha256":"74fb51dcf463b5ba3c78a51f25641839642b95dc70c53ec74ea2b56dff73fa5e","source":{"kind":"arxiv","id":"1009.3460","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3460","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3460v3","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3460","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"OT5VDXHUMO23","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OT5VDXHUMO23UPDY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OT5VDXHU","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OT5VDXHUMO23UPDYUUPSKZAYHF","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3460","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-17T15:53:26Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a49d574e785421b13597fe1447186c91c718a792c7ab38cc370e2589d73919ec","abstract_canon_sha256":"9b9187348e737fdba683b49c876325a77573732aca0d094a67aead08a0ee8ebd"},"schema_version":"1.0"},"canonical_sha256":"74fb51dcf463b5ba3c78a51f25641839642b95dc70c53ec74ea2b56dff73fa5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.178159Z","signature_b64":"ID8tkKCI6sfMSbuPOR9FvhUqOgdRVwPbTK6H8XLfHBXnk0RL8whenkCrmxaBOVWMSHSag7r7Gcj0BnOpmDK7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74fb51dcf463b5ba3c78a51f25641839642b95dc70c53ec74ea2b56dff73fa5e","last_reissued_at":"2026-05-18T03:52:15.177614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.177614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3460","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-18T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7tJWQam4Z0JbVAncIX9VXIRR1sopT14SjivAoWC0np8ju3Gjk9MygfeHGpVAx7jS/zLQKVEyN966eDlKg4tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:37:00.503609Z"},"content_sha256":"9faf4ea17b7bac200af731559104e75fbba95527bc47e0ca69aaeaacac81e802","schema_version":"1.0","event_id":"sha256:9faf4ea17b7bac200af731559104e75fbba95527bc47e0ca69aaeaacac81e802"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OT5VDXHUMO23UPDYUUPSKZAYHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CC","authors_text":"Amit Chakrabarti, Oded Regev","submitted_at":"2010-09-17T15:53:26Z","abstract_excerpt":"We prove an optimal $\\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model for a number of fundamental problems, including the estimation of frequency moments.\n  The Gap-Hamming-Distance problem is a communication problem, wherein Alice and Bob receive $n$-bit strings $x$ and $y$, respectively. They are promised that the Hamming distance between $x$ and $y$ is either at least $n/2+\\sqrt{n}$ or at most $n/2-\\sqrt{n}$, and their goal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3460","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-18T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bhiof3zwZUIc4VN9OFSW/2teUDnjQvCgvZ/A+qQ72cUHMMSjpRjKdz9YN7pYzyGXs4fdNVk2DwbBCK2XqzMzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:37:00.504378Z"},"content_sha256":"81f4bec5eb07398b200e44e8e9bb0132f53894e3db9aea619772b533557d4927","schema_version":"1.0","event_id":"sha256:81f4bec5eb07398b200e44e8e9bb0132f53894e3db9aea619772b533557d4927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/bundle.json","state_url":"https://pith.science/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/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-09T08:37:00Z","links":{"resolver":"https://pith.science/pith/OT5VDXHUMO23UPDYUUPSKZAYHF","bundle":"https://pith.science/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/bundle.json","state":"https://pith.science/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OT5VDXHUMO23UPDYUUPSKZAYHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OT5VDXHUMO23UPDYUUPSKZAYHF","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":"9b9187348e737fdba683b49c876325a77573732aca0d094a67aead08a0ee8ebd","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-17T15:53:26Z","title_canon_sha256":"a49d574e785421b13597fe1447186c91c718a792c7ab38cc370e2589d73919ec"},"schema_version":"1.0","source":{"id":"1009.3460","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3460","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3460v3","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3460","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"OT5VDXHUMO23","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OT5VDXHUMO23UPDY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OT5VDXHU","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:81f4bec5eb07398b200e44e8e9bb0132f53894e3db9aea619772b533557d4927","target":"graph","created_at":"2026-05-18T03:52:15Z","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 prove an optimal $\\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model for a number of fundamental problems, including the estimation of frequency moments.\n  The Gap-Hamming-Distance problem is a communication problem, wherein Alice and Bob receive $n$-bit strings $x$ and $y$, respectively. They are promised that the Hamming distance between $x$ and $y$ is either at least $n/2+\\sqrt{n}$ or at most $n/2-\\sqrt{n}$, and their goal","authors_text":"Amit Chakrabarti, Oded Regev","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-17T15:53:26Z","title":"An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3460","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:9faf4ea17b7bac200af731559104e75fbba95527bc47e0ca69aaeaacac81e802","target":"record","created_at":"2026-05-18T03:52:15Z","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":"9b9187348e737fdba683b49c876325a77573732aca0d094a67aead08a0ee8ebd","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-17T15:53:26Z","title_canon_sha256":"a49d574e785421b13597fe1447186c91c718a792c7ab38cc370e2589d73919ec"},"schema_version":"1.0","source":{"id":"1009.3460","kind":"arxiv","version":3}},"canonical_sha256":"74fb51dcf463b5ba3c78a51f25641839642b95dc70c53ec74ea2b56dff73fa5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74fb51dcf463b5ba3c78a51f25641839642b95dc70c53ec74ea2b56dff73fa5e","first_computed_at":"2026-05-18T03:52:15.177614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.177614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ID8tkKCI6sfMSbuPOR9FvhUqOgdRVwPbTK6H8XLfHBXnk0RL8whenkCrmxaBOVWMSHSag7r7Gcj0BnOpmDK7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.178159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3460","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9faf4ea17b7bac200af731559104e75fbba95527bc47e0ca69aaeaacac81e802","sha256:81f4bec5eb07398b200e44e8e9bb0132f53894e3db9aea619772b533557d4927"],"state_sha256":"b0f1fd401486d1c9e26288a76c5570c9981fc5a3cab9ffa6e30c6dfc75e68152"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuLkXHGnJrrkE9F5sNNEJo9ur25cigXJulcV1/XYiPDE6ulqA6+K4jAp/aecuKJfhDBSGk6GCvw8ZIYTIJzADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:37:00.508163Z","bundle_sha256":"826c87738b5002d35dfff01ab8a78a45934646703b2b40812cf9232b8a5ff145"}}