{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4PG42TECQWGL4WN6WGYYNWEJKV","short_pith_number":"pith:4PG42TEC","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"},"canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","source":{"kind":"arxiv","id":"1907.02251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02251","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02251v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02251","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"4PG42TECQWGL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4PG42TECQWGL4WN6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4PG42TEC","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4PG42TECQWGL4WN6WGYYNWEJKV","target":"record","payload":{"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"},"canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","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"},"source_kind":"arxiv","source_id":"1907.02251","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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oc0C2fmkUeRp/eMXR2e92ZVHRm1DeqVJIUtKAD7CygvgaHtMrouMD29U15HNM70nKuBvaEAezEINNDAW83YYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:58:57.469499Z"},"content_sha256":"6a40fcea9b9d306e37f8bc3e945bd6865e1067c575542bc17d4a231154e48756","schema_version":"1.0","event_id":"sha256:6a40fcea9b9d306e37f8bc3e945bd6865e1067c575542bc17d4a231154e48756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4PG42TECQWGL4WN6WGYYNWEJKV","target":"graph","payload":{"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"},"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-17T23:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6YnRl8cP/WQ9Ie8ir6MfbQAoOwPUydi+QzdbOEGUS2vLgejMKw3D4IUH2GAOrxRsvXncLzzC/RMWtYo0/SEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:58:57.470142Z"},"content_sha256":"78d918e653f88e922fb8b0d9e339d72643270f0c5203898c16c89c82542e48db","schema_version":"1.0","event_id":"sha256:78d918e653f88e922fb8b0d9e339d72643270f0c5203898c16c89c82542e48db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/bundle.json","state_url":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PG42TECQWGL4WN6WGYYNWEJKV/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-10T10:58:57Z","links":{"resolver":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV","bundle":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/bundle.json","state":"https://pith.science/pith/4PG42TECQWGL4WN6WGYYNWEJKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PG42TECQWGL4WN6WGYYNWEJKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4PG42TECQWGL4WN6WGYYNWEJKV","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":"ed3284f06bea849a34c2466d18aabdaac69e85d82a521c4a310b115df83384f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T07:03:53Z","title_canon_sha256":"8b6758fe6fd4638a5abf8a64fa295276de1b75498c88d25110e072bab4780693"},"schema_version":"1.0","source":{"id":"1907.02251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02251","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02251v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02251","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"4PG42TECQWGL","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4PG42TECQWGL4WN6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4PG42TEC","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:78d918e653f88e922fb8b0d9e339d72643270f0c5203898c16c89c82542e48db","target":"graph","created_at":"2026-05-17T23:41:29Z","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":"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","authors_text":"Mikkel Thorup, Nina Stausholm, Rasmus Pagh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T07:03:53Z","title":"Hardness of Bichromatic Closest Pair with Jaccard Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02251","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:6a40fcea9b9d306e37f8bc3e945bd6865e1067c575542bc17d4a231154e48756","target":"record","created_at":"2026-05-17T23:41:29Z","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":"ed3284f06bea849a34c2466d18aabdaac69e85d82a521c4a310b115df83384f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-04T07:03:53Z","title_canon_sha256":"8b6758fe6fd4638a5abf8a64fa295276de1b75498c88d25110e072bab4780693"},"schema_version":"1.0","source":{"id":"1907.02251","kind":"arxiv","version":1}},"canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3cdcd4c82858cbe59beb1b186d88955737d711739bd3983bea390a6715d6df1","first_computed_at":"2026-05-17T23:41:29.230971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.230971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7xo7jgjBzGwxsJfDghOHsMifYPbWulJ0M7I8waaZfyAoiRU5U4sF1ehZ9obUuGsYy7tHr3dPtTxr0kO4IsJyAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.231680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a40fcea9b9d306e37f8bc3e945bd6865e1067c575542bc17d4a231154e48756","sha256:78d918e653f88e922fb8b0d9e339d72643270f0c5203898c16c89c82542e48db"],"state_sha256":"57a6241e12d416095a98e2718dff927c85d252455242520d327b40dc9aed5aea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjldJDzggCxT8Wx5ZxHEkLf7YJ0PtgWDrwq+iHJYVRTBtHTsvMDFlJEpJ82L9EfHEFTUWpzM6PEsu9Es9S+dAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:58:57.474024Z","bundle_sha256":"d3dc3790437bc45621ecba46fc6a031e0d2b5f1e5d46a02f2eefbfebcec5670e"}}