{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AK2V75WOFDVKPO3CCC2NIEKISZ","short_pith_number":"pith:AK2V75WO","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"},"canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","source":{"kind":"arxiv","id":"1804.05615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05615","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05615v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05615","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"AK2V75WOFDVK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AK2V75WOFDVKPO3C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AK2V75WO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AK2V75WOFDVKPO3CCC2NIEKISZ","target":"record","payload":{"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"},"canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","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"},"source_kind":"arxiv","source_id":"1804.05615","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-18T00:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51E2w5edQbioHRTYLXcYfXj6fNYsK3/YnP3EBtJrJlc0GG4xkQmJ7LARzLNjRRsqaBxIK/Wp2W5iJ4cJazxeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:30.952051Z"},"content_sha256":"b5bdee65791e0359c4f4d2a67c03ca575ed50d35bb791ca76f162e0763b32d49","schema_version":"1.0","event_id":"sha256:b5bdee65791e0359c4f4d2a67c03ca575ed50d35bb791ca76f162e0763b32d49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AK2V75WOFDVKPO3CCC2NIEKISZ","target":"graph","payload":{"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"},"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:18:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImiyyfHB6yvbO3ohvhG+uE8qbW/+ru+ANNqUHSVulpyARtkOk1+0nKn+O8hN9zdJTnQjBKJ8O1D5HqyfICMpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:30.952536Z"},"content_sha256":"f188ac31874e4f35e3c1166fb77c74e65ee505403f6ffcaf2154d52096fec5a5","schema_version":"1.0","event_id":"sha256:f188ac31874e4f35e3c1166fb77c74e65ee505403f6ffcaf2154d52096fec5a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/bundle.json","state_url":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/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-05-26T19:06:30Z","links":{"resolver":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ","bundle":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/bundle.json","state":"https://pith.science/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AK2V75WOFDVKPO3CCC2NIEKISZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AK2V75WOFDVKPO3CCC2NIEKISZ","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":"09b50466756fa5205e376df08d3be9ed21019e54401c66c836d70ff9bad1c3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T11:35:32Z","title_canon_sha256":"40795af134926b085d3005834f4cf3aa97117d52fd847764ed36ab4c32c99c4a"},"schema_version":"1.0","source":{"id":"1804.05615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05615","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05615v1","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05615","created_at":"2026-05-18T00:18:27Z"},{"alias_kind":"pith_short_12","alias_value":"AK2V75WOFDVK","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AK2V75WOFDVKPO3C","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AK2V75WO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:f188ac31874e4f35e3c1166fb77c74e65ee505403f6ffcaf2154d52096fec5a5","target":"graph","created_at":"2026-05-18T00:18:27Z","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":"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","authors_text":"Francesco Silvestri, Samuel McCauley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T11:35:32Z","title":"Adaptive MapReduce Similarity Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05615","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:b5bdee65791e0359c4f4d2a67c03ca575ed50d35bb791ca76f162e0763b32d49","target":"record","created_at":"2026-05-18T00:18:27Z","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":"09b50466756fa5205e376df08d3be9ed21019e54401c66c836d70ff9bad1c3a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T11:35:32Z","title_canon_sha256":"40795af134926b085d3005834f4cf3aa97117d52fd847764ed36ab4c32c99c4a"},"schema_version":"1.0","source":{"id":"1804.05615","kind":"arxiv","version":1}},"canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02b55ff6ce28eaa7bb6210b4d4114896747a4aecf4c89637f2354643a1673025","first_computed_at":"2026-05-18T00:18:27.750744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:27.750744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vukI2swq7yafbIzUXEeHNnucbltf1ZFXdCzyhZDgvFbl9uqVQezjGg4UEJes2Hf4XJzoVt88lxMek9LAx/V2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:27.751242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5bdee65791e0359c4f4d2a67c03ca575ed50d35bb791ca76f162e0763b32d49","sha256:f188ac31874e4f35e3c1166fb77c74e65ee505403f6ffcaf2154d52096fec5a5"],"state_sha256":"c5044d4af07cb91cb7caab516204215c3e7467aa2cc68df57bcf3c6002c0bdfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh4R0dmDhtOeLa5YnfNzER11Hhybbvh69Y/y9gmsbFdGUJl4o8UcUBPhtrwnK87hsFs8VA4FLIkY1ItrlhcLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:30.955066Z","bundle_sha256":"274860d17c3709e0f2b51e253a695e41a94aea2355b6b78b8b6bf0c0101a9281"}}