{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:R76FEC7HXULMIC42ZEHIUTRZ7P","short_pith_number":"pith:R76FEC7H","schema_version":"1.0","canonical_sha256":"8ffc520be7bd16c40b9ac90e8a4e39fbd6215e484aca3261d278b8eeb59022e3","source":{"kind":"arxiv","id":"1506.03872","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03872","created_at":"2026-05-18T00:07:33.430491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03872v3","created_at":"2026-05-18T00:07:33.430491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03872","created_at":"2026-05-18T00:07:33.430491+00:00"},{"alias_kind":"pith_short_12","alias_value":"R76FEC7HXULM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"R76FEC7HXULMIC42","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"R76FEC7H","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P","json":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P.json","graph_json":"https://pith.science/api/pith-number/R76FEC7HXULMIC42ZEHIUTRZ7P/graph.json","events_json":"https://pith.science/api/pith-number/R76FEC7HXULMIC42ZEHIUTRZ7P/events.json","paper":"https://pith.science/paper/R76FEC7H"},"agent_actions":{"view_html":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P","download_json":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P.json","view_paper":"https://pith.science/paper/R76FEC7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03872&json=true","fetch_graph":"https://pith.science/api/pith-number/R76FEC7HXULMIC42ZEHIUTRZ7P/graph.json","fetch_events":"https://pith.science/api/pith-number/R76FEC7HXULMIC42ZEHIUTRZ7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/action/storage_attestation","attest_author":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/action/author_attestation","sign_citation":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/action/citation_signature","submit_replication":"https://pith.science/pith/R76FEC7HXULMIC42ZEHIUTRZ7P/action/replication_record"}},"created_at":"2026-05-18T00:07:33.430491+00:00","updated_at":"2026-05-18T00:07:33.430491+00:00"}