{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4PG42TECQWGL4WN6WGYYNWEJKV","short_pith_number":"pith:4PG42TEC","schema_version":"1.0","canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","source":{"kind":"arxiv","id":"1907.02251","version":1},"attestation_state":"computed","paper":{"title":"Hardness of Bichromatic Closest Pair with Jaccard Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mikkel Thorup, Nina Stausholm, Rasmus Pagh","submitted_at":"2019-07-04T07:03:53Z","abstract_excerpt":"Consider collections $\\mathcal{A}$ and $\\mathcal{B}$ of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from $\\mathcal{A}\\times \\mathcal{B}$ that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity $|\\textbf{a}\\cap \\textbf{b}|/|\\textbf{a}\\cup \\textbf{b}|$ for $(\\textbf{a},\\textbf{b})\\in \\mathcal{A}\\times \\mathcal{B}$.\n  We consider the approximate version of the problem where we are given thresholds $j_1>j_2$ and wish to return a pair from $\\mathcal{A}\\times \\mathcal{B}$ t"},"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":"1907.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T07:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"8b6758fe6fd4638a5abf8a64fa295276de1b75498c88d25110e072bab4780693","abstract_canon_sha256":"ed3284f06bea849a34c2466d18aabdaac69e85d82a521c4a310b115df83384f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.231680Z","signature_b64":"7xo7jgjBzGwxsJfDghOHsMifYPbWulJ0M7I8waaZfyAoiRU5U4sF1ehZ9obUuGsYy7tHr3dPtTxr0kO4IsJyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","last_reissued_at":"2026-05-17T23:41:29.230971Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.230971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Bichromatic Closest Pair with Jaccard Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mikkel Thorup, Nina Stausholm, Rasmus Pagh","submitted_at":"2019-07-04T07:03:53Z","abstract_excerpt":"Consider collections $\\mathcal{A}$ and $\\mathcal{B}$ of red and blue sets, respectively. Bichromatic Closest Pair is the problem of finding a pair from $\\mathcal{A}\\times \\mathcal{B}$ that has similarity higher than a given threshold according to some similarity measure. Our focus here is the classic Jaccard similarity $|\\textbf{a}\\cap \\textbf{b}|/|\\textbf{a}\\cup \\textbf{b}|$ for $(\\textbf{a},\\textbf{b})\\in \\mathcal{A}\\times \\mathcal{B}$.\n  We consider the approximate version of the problem where we are given thresholds $j_1>j_2$ and wish to return a pair from $\\mathcal{A}\\times \\mathcal{B}$ t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02251","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.02251","created_at":"2026-05-17T23:41:29.231093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02251v1","created_at":"2026-05-17T23:41:29.231093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02251","created_at":"2026-05-17T23:41:29.231093+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PG42TECQWGL","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PG42TECQWGL4WN6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PG42TEC","created_at":"2026-05-18T12:33:10.108867+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/4PG42TECQWGL4WN6WGYYNWEJKV","json":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV.json","graph_json":"https://pith.science/api/pith-number/4PG42TECQWGL4WN6WGYYNWEJKV/graph.json","events_json":"https://pith.science/api/pith-number/4PG42TECQWGL4WN6WGYYNWEJKV/events.json","paper":"https://pith.science/paper/4PG42TEC"},"agent_actions":{"view_html":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV","download_json":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV.json","view_paper":"https://pith.science/paper/4PG42TEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02251&json=true","fetch_graph":"https://pith.science/api/pith-number/4PG42TECQWGL4WN6WGYYNWEJKV/graph.json","fetch_events":"https://pith.science/api/pith-number/4PG42TECQWGL4WN6WGYYNWEJKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/action/storage_attestation","attest_author":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/action/author_attestation","sign_citation":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/action/citation_signature","submit_replication":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/action/replication_record"}},"created_at":"2026-05-17T23:41:29.231093+00:00","updated_at":"2026-05-17T23:41:29.231093+00:00"}