{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AK2V75WOFDVKPO3CCC2NIEKISZ","short_pith_number":"pith:AK2V75WO","schema_version":"1.0","canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","source":{"kind":"arxiv","id":"1804.05615","version":1},"attestation_state":"computed","paper":{"title":"Adaptive MapReduce Similarity Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Samuel McCauley","submitted_at":"2018-04-16T11:35:32Z","abstract_excerpt":"Similarity joins are a fundamental database operation. Given data sets S and R, the goal of a similarity join is to find all points x in S and y in R with distance at most r. Recent research has investigated how locality-sensitive hashing (LSH) can be used for similarity join, and in particular two recent lines of work have made exciting progress on LSH-based join performance. Hu, Tao, and Yi (PODS 17) investigated joins in a massively parallel setting, showing strong results that adapt to the size of the output. Meanwhile, Ahle, Aum\\\"uller, and Pagh (SODA 17) showed a sequential algorithm tha"},"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":"1804.05615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T11:35:32Z","cross_cats_sorted":[],"title_canon_sha256":"40795af134926b085d3005834f4cf3aa97117d52fd847764ed36ab4c32c99c4a","abstract_canon_sha256":"09b50466756fa5205e376df08d3be9ed21019e54401c66c836d70ff9bad1c3a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.751242Z","signature_b64":"vukI2swq7yafbIzUXEeHNnucbltf1ZFXdCzyhZDgvFbl9uqVQezjGg4UEJes2Hf4XJzoVt88lxMek9LAx/V2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","last_reissued_at":"2026-05-18T00:18:27.750744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.750744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive MapReduce Similarity Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Samuel McCauley","submitted_at":"2018-04-16T11:35:32Z","abstract_excerpt":"Similarity joins are a fundamental database operation. Given data sets S and R, the goal of a similarity join is to find all points x in S and y in R with distance at most r. Recent research has investigated how locality-sensitive hashing (LSH) can be used for similarity join, and in particular two recent lines of work have made exciting progress on LSH-based join performance. Hu, Tao, and Yi (PODS 17) investigated joins in a massively parallel setting, showing strong results that adapt to the size of the output. Meanwhile, Ahle, Aum\\\"uller, and Pagh (SODA 17) showed a sequential algorithm tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05615","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":"1804.05615","created_at":"2026-05-18T00:18:27.750827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05615v1","created_at":"2026-05-18T00:18:27.750827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05615","created_at":"2026-05-18T00:18:27.750827+00:00"},{"alias_kind":"pith_short_12","alias_value":"AK2V75WOFDVK","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AK2V75WOFDVKPO3C","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AK2V75WO","created_at":"2026-05-18T12:32:13.499390+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/AK2V75WOFDVKPO3CCC2NIEKISZ","json":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ.json","graph_json":"https://pith.science/api/pith-number/AK2V75WOFDVKPO3CCC2NIEKISZ/graph.json","events_json":"https://pith.science/api/pith-number/AK2V75WOFDVKPO3CCC2NIEKISZ/events.json","paper":"https://pith.science/paper/AK2V75WO"},"agent_actions":{"view_html":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ","download_json":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ.json","view_paper":"https://pith.science/paper/AK2V75WO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05615&json=true","fetch_graph":"https://pith.science/api/pith-number/AK2V75WOFDVKPO3CCC2NIEKISZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AK2V75WOFDVKPO3CCC2NIEKISZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/action/storage_attestation","attest_author":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/action/author_attestation","sign_citation":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/action/citation_signature","submit_replication":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/action/replication_record"}},"created_at":"2026-05-18T00:18:27.750827+00:00","updated_at":"2026-05-18T00:18:27.750827+00:00"}