{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NEQXHPT4ZP63PDTWTDVY57ISRW","short_pith_number":"pith:NEQXHPT4","canonical_record":{"source":{"id":"1611.04999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-15T19:36:28Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"29abaa370654f7281f11ac4af8bc64126ea7c6963e66cc5daeb51d8b1e8e73e5","abstract_canon_sha256":"f0db37c81af9e4be39d9fe32b8670761216e524e5a714ecdd590ba53a8cb0511"},"schema_version":"1.0"},"canonical_sha256":"692173be7ccbfdb78e7698eb8efd128daa964a1b40d348c8423828599317e32e","source":{"kind":"arxiv","id":"1611.04999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04999","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04999v1","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04999","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"pith_short_12","alias_value":"NEQXHPT4ZP63","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEQXHPT4ZP63PDTW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEQXHPT4","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NEQXHPT4ZP63PDTWTDVY57ISRW","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-15T19:36:28Z","cross_cats_sorted":["cs.CC","cs.DC"],"title_canon_sha256":"29abaa370654f7281f11ac4af8bc64126ea7c6963e66cc5daeb51d8b1e8e73e5","abstract_canon_sha256":"f0db37c81af9e4be39d9fe32b8670761216e524e5a714ecdd590ba53a8cb0511"},"schema_version":"1.0"},"canonical_sha256":"692173be7ccbfdb78e7698eb8efd128daa964a1b40d348c8423828599317e32e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:49.298162Z","signature_b64":"6bJ0jZA3YZzJPWH+U9I6PQ/cv+BmA22wbK04mPVlaRO2RBZp75D9LUY7yIlIHD/35x+itPG86ZPJwkcUCNlOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692173be7ccbfdb78e7698eb8efd128daa964a1b40d348c8423828599317e32e","last_reissued_at":"2026-05-18T00:58:49.297580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:49.297580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04999","source_version":1,"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-18T00:58:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4f00G4yYpDkXT1PkA+GeO1PVqXd2XSXhzDNx05Bo0qDTE9m+7PEhi23DIsjFHNnmM1j18N05s9bfH1V2YAeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:19.823360Z"},"content_sha256":"068f51468da5ed142cf1a2af707a5c46e36f16c0010fc0ac87a19299b6dbdef3","schema_version":"1.0","event_id":"sha256:068f51468da5ed142cf1a2af707a5c46e36f16c0010fc0ac87a19299b6dbdef3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NEQXHPT4ZP63PDTWTDVY57ISRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC"],"primary_cat":"cs.DS","authors_text":"Cyrus Rashtchian, Paul Beame","submitted_at":"2016-11-15T19:36:28Z","abstract_excerpt":"We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved upper bounds on the overhead required for similarity defined by Hamming distance $r>1$ and prove a lower bound showing qualitative optimality of the overhead required for similarity over any Hamming distance $r$. Our main conceptual contribution is a connection between similarity search algorithms and certain graph-theoretic quantities. For our upper bounds, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04999","kind":"arxiv","version":1},"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-18T00:58:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wL4fsMOklzLPsaTwJPs/DxQViIC+tDMvzBBKB8PfwjKpnjMJ+Y1VebJEEYa5joC57kv34CUSMjoGumx0KxUoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:19.823716Z"},"content_sha256":"08ffaf4f21bcbbf5f8b8bb2fa1d27e7333e4a0be560e362efbf2615596eb5625","schema_version":"1.0","event_id":"sha256:08ffaf4f21bcbbf5f8b8bb2fa1d27e7333e4a0be560e362efbf2615596eb5625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/bundle.json","state_url":"https://pith.science/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/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-08T14:23:19Z","links":{"resolver":"https://pith.science/pith/NEQXHPT4ZP63PDTWTDVY57ISRW","bundle":"https://pith.science/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/bundle.json","state":"https://pith.science/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEQXHPT4ZP63PDTWTDVY57ISRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEQXHPT4ZP63PDTWTDVY57ISRW","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":"f0db37c81af9e4be39d9fe32b8670761216e524e5a714ecdd590ba53a8cb0511","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-15T19:36:28Z","title_canon_sha256":"29abaa370654f7281f11ac4af8bc64126ea7c6963e66cc5daeb51d8b1e8e73e5"},"schema_version":"1.0","source":{"id":"1611.04999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04999","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04999v1","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04999","created_at":"2026-05-18T00:58:49Z"},{"alias_kind":"pith_short_12","alias_value":"NEQXHPT4ZP63","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEQXHPT4ZP63PDTW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEQXHPT4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:08ffaf4f21bcbbf5f8b8bb2fa1d27e7333e4a0be560e362efbf2615596eb5625","target":"graph","created_at":"2026-05-18T00:58:49Z","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 distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved upper bounds on the overhead required for similarity defined by Hamming distance $r>1$ and prove a lower bound showing qualitative optimality of the overhead required for similarity over any Hamming distance $r$. Our main conceptual contribution is a connection between similarity search algorithms and certain graph-theoretic quantities. For our upper bounds, we ","authors_text":"Cyrus Rashtchian, Paul Beame","cross_cats":["cs.CC","cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-15T19:36:28Z","title":"Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04999","kind":"arxiv","version":1},"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:068f51468da5ed142cf1a2af707a5c46e36f16c0010fc0ac87a19299b6dbdef3","target":"record","created_at":"2026-05-18T00:58:49Z","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":"f0db37c81af9e4be39d9fe32b8670761216e524e5a714ecdd590ba53a8cb0511","cross_cats_sorted":["cs.CC","cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-15T19:36:28Z","title_canon_sha256":"29abaa370654f7281f11ac4af8bc64126ea7c6963e66cc5daeb51d8b1e8e73e5"},"schema_version":"1.0","source":{"id":"1611.04999","kind":"arxiv","version":1}},"canonical_sha256":"692173be7ccbfdb78e7698eb8efd128daa964a1b40d348c8423828599317e32e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"692173be7ccbfdb78e7698eb8efd128daa964a1b40d348c8423828599317e32e","first_computed_at":"2026-05-18T00:58:49.297580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:49.297580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6bJ0jZA3YZzJPWH+U9I6PQ/cv+BmA22wbK04mPVlaRO2RBZp75D9LUY7yIlIHD/35x+itPG86ZPJwkcUCNlOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:49.298162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:068f51468da5ed142cf1a2af707a5c46e36f16c0010fc0ac87a19299b6dbdef3","sha256:08ffaf4f21bcbbf5f8b8bb2fa1d27e7333e4a0be560e362efbf2615596eb5625"],"state_sha256":"64c1b7f474cecd3f39c08b92377f1bcd35a6ea494b56906db55d994d4a2eb97e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrqzzQjh9dwnb2gTRBTZw3PWABJoMT7FOZ9uaZjuWLr/+UaG5XOePq5+xGX9bFZMOTdiqwkeP7hu+j4zq7Z2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:23:19.826053Z","bundle_sha256":"27af24db95d83b939b79ab2a58c49514342949d2d3daba3e8379884407cbe86c"}}