{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5VNCTQ7UYHBGALXG3X7BORI2GS","short_pith_number":"pith:5VNCTQ7U","schema_version":"1.0","canonical_sha256":"ed5a29c3f4c1c2602ee6ddfe17451a34af6bf2c2f39d1881375228a597a7be6d","source":{"kind":"arxiv","id":"1402.3010","version":1},"attestation_state":"computed","paper":{"title":"1-D and 2-D Parallel Algorithms for All-Pairs Similarity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.IR","authors_text":"Cevdet Aykanat, Eray \\\"Ozkural","submitted_at":"2014-02-13T00:14:33Z","abstract_excerpt":"All-pairs similarity problem asks to find all vector pairs in a set of vectors the similarities of which surpass a given similarity threshold, and it is a computational kernel in data mining and information retrieval for several tasks. We investigate the parallelization of a recent fast sequential algorithm. We propose effective 1-D and 2-D data distribution strategies that preserve the essential optimizations in the fast algorithm. 1-D parallel algorithms distribute either dimensions or vectors, whereas the 2-D parallel algorithm distributes data both ways. Additional contributions to the 1-D"},"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":"1402.3010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-02-13T00:14:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"63700da1661e34f7afda7a15254794db1b0f16bc595313a4ddbbc154025806d7","abstract_canon_sha256":"14816a8c0e72bd4b18e410eb0f0845a04784fc152840a8ce3efcf5f91924a2b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.069012Z","signature_b64":"9KpE6IOkQNTbqHzQT93alYZ/FXNlFGWpSw6L79pWVJwYhEmtRPT+VjvRLCW0GgYg2dt4NoXd3098BAsoQYl3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed5a29c3f4c1c2602ee6ddfe17451a34af6bf2c2f39d1881375228a597a7be6d","last_reissued_at":"2026-05-18T02:59:08.068212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.068212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-D and 2-D Parallel Algorithms for All-Pairs Similarity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.IR","authors_text":"Cevdet Aykanat, Eray \\\"Ozkural","submitted_at":"2014-02-13T00:14:33Z","abstract_excerpt":"All-pairs similarity problem asks to find all vector pairs in a set of vectors the similarities of which surpass a given similarity threshold, and it is a computational kernel in data mining and information retrieval for several tasks. We investigate the parallelization of a recent fast sequential algorithm. We propose effective 1-D and 2-D data distribution strategies that preserve the essential optimizations in the fast algorithm. 1-D parallel algorithms distribute either dimensions or vectors, whereas the 2-D parallel algorithm distributes data both ways. Additional contributions to the 1-D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3010","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":"1402.3010","created_at":"2026-05-18T02:59:08.068349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3010v1","created_at":"2026-05-18T02:59:08.068349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3010","created_at":"2026-05-18T02:59:08.068349+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VNCTQ7UYHBG","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VNCTQ7UYHBGALXG","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VNCTQ7U","created_at":"2026-05-18T12:28:16.859392+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/5VNCTQ7UYHBGALXG3X7BORI2GS","json":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS.json","graph_json":"https://pith.science/api/pith-number/5VNCTQ7UYHBGALXG3X7BORI2GS/graph.json","events_json":"https://pith.science/api/pith-number/5VNCTQ7UYHBGALXG3X7BORI2GS/events.json","paper":"https://pith.science/paper/5VNCTQ7U"},"agent_actions":{"view_html":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS","download_json":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS.json","view_paper":"https://pith.science/paper/5VNCTQ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3010&json=true","fetch_graph":"https://pith.science/api/pith-number/5VNCTQ7UYHBGALXG3X7BORI2GS/graph.json","fetch_events":"https://pith.science/api/pith-number/5VNCTQ7UYHBGALXG3X7BORI2GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS/action/storage_attestation","attest_author":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS/action/author_attestation","sign_citation":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS/action/citation_signature","submit_replication":"https://pith.science/pith/5VNCTQ7UYHBGALXG3X7BORI2GS/action/replication_record"}},"created_at":"2026-05-18T02:59:08.068349+00:00","updated_at":"2026-05-18T02:59:08.068349+00:00"}