{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SJAXTF2CA6ERYDUK4CWXEVC5NO","short_pith_number":"pith:SJAXTF2C","canonical_record":{"source":{"id":"1711.03887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"01050fa1ed5587fe705fe9295121d745e449b23a11406ff99a256bb5859f1fa4","abstract_canon_sha256":"9eaeefb386461623feb4b9d2430ac36354e09f7c9361c1dcf5506c861c4d7dcb"},"schema_version":"1.0"},"canonical_sha256":"924179974207891c0e8ae0ad72545d6bb512d78a310f4f5c8952626f5d2586d5","source":{"kind":"arxiv","id":"1711.03887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03887","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03887v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03887","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"SJAXTF2CA6ER","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJAXTF2CA6ERYDUK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJAXTF2C","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SJAXTF2CA6ERYDUK4CWXEVC5NO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"01050fa1ed5587fe705fe9295121d745e449b23a11406ff99a256bb5859f1fa4","abstract_canon_sha256":"9eaeefb386461623feb4b9d2430ac36354e09f7c9361c1dcf5506c861c4d7dcb"},"schema_version":"1.0"},"canonical_sha256":"924179974207891c0e8ae0ad72545d6bb512d78a310f4f5c8952626f5d2586d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.420058Z","signature_b64":"DQiWy7KfWcjytfXQASDJYvnqWHwh5fAzLDYIeiUrRRz0AVq28YvlWFTOJqMv9yCagqmG5HU1AZBFRE0BVuXtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"924179974207891c0e8ae0ad72545d6bb512d78a310f4f5c8952626f5d2586d5","last_reissued_at":"2026-05-18T00:16:50.419532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.419532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03887","source_version":2,"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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jepAsgMDxq4OwYR9XbLtQO7lcXO7W8QG+yGMbxvnhn/5cYk6T4q0Vkhps2ph8HglcW9a5DreErUbWJsTya5mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:52:43.889267Z"},"content_sha256":"58fc32a9a999140c387a99897fed21237e4ce99ce92acff85ac0fcab4a4208f3","schema_version":"1.0","event_id":"sha256:58fc32a9a999140c387a99897fed21237e4ce99ce92acff85ac0fcab4a4208f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SJAXTF2CA6ERYDUK4CWXEVC5NO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamming distance completeness and sparse matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Graf, Karim Labib, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2017-11-10T15:41:53Z","abstract_excerpt":"We show that a broad class of $(+,\\diamond)$ vector products (for binary integer functions $\\diamond$) are equivalent under one-to-polylog reductions to the computation of the Hamming distance. Examples include: the dominance product, the threshold product and $\\ell_{2p+1}$ distances for constant $p$. Our results imply equivalence (up to polylog factors) between complexity of computation of All Pairs: Hamming Distances, $\\ell_{2p+1}$ Distances, Dominance Products and Threshold Products. As a consequence, Yuster's~(SODA'09) algorithm improves not only Matou\\v{s}ek's (IPL'91), but also the resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03887","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"},"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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL7u5sWeVAkCulMaSAIVK+LOwDNWrGFax0LlU+bqQ0oYUmWokRF71/QDf5BxTICY2iwNb5Wc+hWF6orfuCuJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:52:43.889934Z"},"content_sha256":"d719d8ab7599956558cac708ba4ff24ea80cfc17dc928d13f1a7ecebee5ce19c","schema_version":"1.0","event_id":"sha256:d719d8ab7599956558cac708ba4ff24ea80cfc17dc928d13f1a7ecebee5ce19c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/bundle.json","state_url":"https://pith.science/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/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-09T04:52:43Z","links":{"resolver":"https://pith.science/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO","bundle":"https://pith.science/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/bundle.json","state":"https://pith.science/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJAXTF2CA6ERYDUK4CWXEVC5NO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SJAXTF2CA6ERYDUK4CWXEVC5NO","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":"9eaeefb386461623feb4b9d2430ac36354e09f7c9361c1dcf5506c861c4d7dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:53Z","title_canon_sha256":"01050fa1ed5587fe705fe9295121d745e449b23a11406ff99a256bb5859f1fa4"},"schema_version":"1.0","source":{"id":"1711.03887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03887","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03887v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03887","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"SJAXTF2CA6ER","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJAXTF2CA6ERYDUK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJAXTF2C","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:d719d8ab7599956558cac708ba4ff24ea80cfc17dc928d13f1a7ecebee5ce19c","target":"graph","created_at":"2026-05-18T00:16:50Z","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 show that a broad class of $(+,\\diamond)$ vector products (for binary integer functions $\\diamond$) are equivalent under one-to-polylog reductions to the computation of the Hamming distance. Examples include: the dominance product, the threshold product and $\\ell_{2p+1}$ distances for constant $p$. Our results imply equivalence (up to polylog factors) between complexity of computation of All Pairs: Hamming Distances, $\\ell_{2p+1}$ Distances, Dominance Products and Threshold Products. As a consequence, Yuster's~(SODA'09) algorithm improves not only Matou\\v{s}ek's (IPL'91), but also the resul","authors_text":"Daniel Graf, Karim Labib, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:53Z","title":"Hamming distance completeness and sparse matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03887","kind":"arxiv","version":2},"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:58fc32a9a999140c387a99897fed21237e4ce99ce92acff85ac0fcab4a4208f3","target":"record","created_at":"2026-05-18T00:16:50Z","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":"9eaeefb386461623feb4b9d2430ac36354e09f7c9361c1dcf5506c861c4d7dcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-10T15:41:53Z","title_canon_sha256":"01050fa1ed5587fe705fe9295121d745e449b23a11406ff99a256bb5859f1fa4"},"schema_version":"1.0","source":{"id":"1711.03887","kind":"arxiv","version":2}},"canonical_sha256":"924179974207891c0e8ae0ad72545d6bb512d78a310f4f5c8952626f5d2586d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"924179974207891c0e8ae0ad72545d6bb512d78a310f4f5c8952626f5d2586d5","first_computed_at":"2026-05-18T00:16:50.419532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.419532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DQiWy7KfWcjytfXQASDJYvnqWHwh5fAzLDYIeiUrRRz0AVq28YvlWFTOJqMv9yCagqmG5HU1AZBFRE0BVuXtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.420058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58fc32a9a999140c387a99897fed21237e4ce99ce92acff85ac0fcab4a4208f3","sha256:d719d8ab7599956558cac708ba4ff24ea80cfc17dc928d13f1a7ecebee5ce19c"],"state_sha256":"f8094e74fa8c97d235bed4d42cd7c9b21fde0a3456e825385a59e5988dd0a7de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQgGO1hH8x+DOftd4jOXwup9+HsicnaJ94oGnqwVCFCCotnPicrtOTFSd9tOLPozqyzsxve0NJzR5nZjpyOdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:52:43.893364Z","bundle_sha256":"1e0d746b00769439581ca37c5e7f51d2fc47f70f6a8fd59f87167284160f204f"}}