{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R76FEC7HXULMIC42ZEHIUTRZ7P","short_pith_number":"pith:R76FEC7H","canonical_record":{"source":{"id":"1506.03872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-11T23:45:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d91e811052649141c77a4415c40d08b4ef762d15c0e0f3301db8ef2613bd6220","abstract_canon_sha256":"ab4df408a29a12cf229056a5bec9a659f1327c92bb4b3fc7afe543030a085775"},"schema_version":"1.0"},"canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","source":{"kind":"arxiv","id":"1506.03872","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03872","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03872v3","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03872","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"R76FEC7HXULM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R76FEC7HXULMIC42","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R76FEC7H","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R76FEC7HXULMIC42ZEHIUTRZ7P","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-11T23:45:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d91e811052649141c77a4415c40d08b4ef762d15c0e0f3301db8ef2613bd6220","abstract_canon_sha256":"ab4df408a29a12cf229056a5bec9a659f1327c92bb4b3fc7afe543030a085775"},"schema_version":"1.0"},"canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.430943Z","signature_b64":"2KDXYBg0d2RUoPrKrHvHO7RXnTgqobi9XK6mgSacIhIVr1bHTyGKPZnEfRVxqVN7fBoVm09+944x9rJ1uvhjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","last_reissued_at":"2026-05-18T00:07:33.430415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.430415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03872","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3goDtwx88sd/7zFie4m8+YQT9HYOUu9j8nFK/xPyPRyyUxnbuWQ27dkujK2uNeUs91WoQnV+4rSjzLjJ46byDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:01:57.722784Z"},"content_sha256":"1399d75c0cb3be838b687153854670029c6d4de3ee5313563cee58ea42110722","schema_version":"1.0","event_id":"sha256:1399d75c0cb3be838b687153854670029c6d4de3ee5313563cee58ea42110722"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R76FEC7HXULMIC42ZEHIUTRZ7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ali Pinar, C. Seshadhri, Grey Ballard, Tamara G. Kolda","submitted_at":"2015-06-11T23:45:36Z","abstract_excerpt":"Given two sets of vectors, $A = \\{{a_1}, \\dots, {a_m}\\}$ and $B=\\{{b_1},\\dots,{b_n}\\}$, our problem is to find the top-$t$ dot products, i.e., the largest $|{a_i}\\cdot{b_j}|$ among all possible pairs. This is a fundamental mathematical problem that appears in numerous data applications involving similarity search, link prediction, and collaborative filtering. We propose a sampling-based approach that avoids direct computation of all $mn$ dot products. We select diamonds (i.e., four-cycles) from the weighted tripartite representation of $A$ and $B$. The probability of selecting a diamond corres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03872","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcZzcB3Hc2D/a8FEmLMBYxFBwQLMehLo6LNmM9iZBh3q0/mm0pkd7JzhtMifWs4iADafNdQPhx8l0SMnSK2UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:01:57.723136Z"},"content_sha256":"529df5e300e0193736c4afa844a4e8a983525b32eb7e5e5c03982698b3d7f4c3","schema_version":"1.0","event_id":"sha256:529df5e300e0193736c4afa844a4e8a983525b32eb7e5e5c03982698b3d7f4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/bundle.json","state_url":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/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-02T23:01:57Z","links":{"resolver":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P","bundle":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/bundle.json","state":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R76FEC7HXULMIC42ZEHIUTRZ7P","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":"ab4df408a29a12cf229056a5bec9a659f1327c92bb4b3fc7afe543030a085775","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-11T23:45:36Z","title_canon_sha256":"d91e811052649141c77a4415c40d08b4ef762d15c0e0f3301db8ef2613bd6220"},"schema_version":"1.0","source":{"id":"1506.03872","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03872","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03872v3","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03872","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"R76FEC7HXULM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R76FEC7HXULMIC42","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R76FEC7H","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:529df5e300e0193736c4afa844a4e8a983525b32eb7e5e5c03982698b3d7f4c3","target":"graph","created_at":"2026-05-18T00:07:33Z","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":"Given two sets of vectors, $A = \\{{a_1}, \\dots, {a_m}\\}$ and $B=\\{{b_1},\\dots,{b_n}\\}$, our problem is to find the top-$t$ dot products, i.e., the largest $|{a_i}\\cdot{b_j}|$ among all possible pairs. This is a fundamental mathematical problem that appears in numerous data applications involving similarity search, link prediction, and collaborative filtering. We propose a sampling-based approach that avoids direct computation of all $mn$ dot products. We select diamonds (i.e., four-cycles) from the weighted tripartite representation of $A$ and $B$. The probability of selecting a diamond corres","authors_text":"Ali Pinar, C. Seshadhri, Grey Ballard, Tamara G. Kolda","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-11T23:45:36Z","title":"Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03872","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:1399d75c0cb3be838b687153854670029c6d4de3ee5313563cee58ea42110722","target":"record","created_at":"2026-05-18T00:07:33Z","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":"ab4df408a29a12cf229056a5bec9a659f1327c92bb4b3fc7afe543030a085775","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-11T23:45:36Z","title_canon_sha256":"d91e811052649141c77a4415c40d08b4ef762d15c0e0f3301db8ef2613bd6220"},"schema_version":"1.0","source":{"id":"1506.03872","kind":"arxiv","version":3}},"canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","first_computed_at":"2026-05-18T00:07:33.430415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:33.430415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2KDXYBg0d2RUoPrKrHvHO7RXnTgqobi9XK6mgSacIhIVr1bHTyGKPZnEfRVxqVN7fBoVm09+944x9rJ1uvhjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:33.430943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03872","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1399d75c0cb3be838b687153854670029c6d4de3ee5313563cee58ea42110722","sha256:529df5e300e0193736c4afa844a4e8a983525b32eb7e5e5c03982698b3d7f4c3"],"state_sha256":"201364ce77da1f4edb5da311f252b05d07265219b47c61d23c7c935c634f0013"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQYjCV8yrJU2StisjEDa6jRD1e77FKQLQgflLYHYvC0NknXLtKO5oMWJhGMhvNy16pr/3WzpMQN0TdFPrJgvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:01:57.725087Z","bundle_sha256":"8ecc55b8899acebe5d6c082fb6d7d92b326e32a4b7128254253d8da963cf17fd"}}