{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JLB5FXFGQ5EG7QF4N2T3BYRUE4","short_pith_number":"pith:JLB5FXFG","schema_version":"1.0","canonical_sha256":"4ac3d2dca687486fc0bc6ea7b0e23427226d4840136341b41e8eee802ec1de36","source":{"kind":"arxiv","id":"2109.06355","version":1},"attestation_state":"computed","paper":{"title":"Optimizing FPGA-based Accelerator Design for Large-Scale Molecular Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ang Li, Caiwen Ding, Hang Liu, Hongwu Peng, Jinbo Bi, Junhuan Yang, Minghu Song, Scott A. Weitze, Shiyang Chen, Tong Geng, Weiwen Jiang, Zhepeng Wang","submitted_at":"2021-09-13T23:00:35Z","abstract_excerpt":"Molecular similarity search has been widely used in drug discovery to identify structurally similar compounds from large molecular databases rapidly. With the increasing size of chemical libraries, there is growing interest in the efficient acceleration of large-scale similarity search. Existing works mainly focus on CPU and GPU to accelerate the computation of the Tanimoto coefficient in measuring the pairwise similarity between different molecular fingerprints. In this paper, we propose and optimize an FPGA-based accelerator design on exhaustive and approximate search algorithms. On exhausti"},"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":"2109.06355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2021-09-13T23:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"575131a8b5c712f80007596f82a02678e1a3f2e942e888d5aeec8b54a9defb85","abstract_canon_sha256":"e2fef0c8232bf455d2843d3b42b6db47f62f8d9fef457c3cdefeea6fe04c1d30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:53.507549Z","signature_b64":"N2PSMY3653b4Wud/s6yHhQGMIUXhDVGbxk1NwEQzZ9B6zD9fTQq51RzUqxttrKWtabVGbhGYf74wOHuVMHKDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ac3d2dca687486fc0bc6ea7b0e23427226d4840136341b41e8eee802ec1de36","last_reissued_at":"2026-07-05T03:13:53.507124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:53.507124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing FPGA-based Accelerator Design for Large-Scale Molecular Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ang Li, Caiwen Ding, Hang Liu, Hongwu Peng, Jinbo Bi, Junhuan Yang, Minghu Song, Scott A. Weitze, Shiyang Chen, Tong Geng, Weiwen Jiang, Zhepeng Wang","submitted_at":"2021-09-13T23:00:35Z","abstract_excerpt":"Molecular similarity search has been widely used in drug discovery to identify structurally similar compounds from large molecular databases rapidly. With the increasing size of chemical libraries, there is growing interest in the efficient acceleration of large-scale similarity search. Existing works mainly focus on CPU and GPU to accelerate the computation of the Tanimoto coefficient in measuring the pairwise similarity between different molecular fingerprints. In this paper, we propose and optimize an FPGA-based accelerator design on exhaustive and approximate search algorithms. On exhausti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.06355","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.06355/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.06355","created_at":"2026-07-05T03:13:53.507193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.06355v1","created_at":"2026-07-05T03:13:53.507193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06355","created_at":"2026-07-05T03:13:53.507193+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLB5FXFGQ5EG","created_at":"2026-07-05T03:13:53.507193+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLB5FXFGQ5EG7QF4","created_at":"2026-07-05T03:13:53.507193+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLB5FXFG","created_at":"2026-07-05T03:13:53.507193+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/JLB5FXFGQ5EG7QF4N2T3BYRUE4","json":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4.json","graph_json":"https://pith.science/api/pith-number/JLB5FXFGQ5EG7QF4N2T3BYRUE4/graph.json","events_json":"https://pith.science/api/pith-number/JLB5FXFGQ5EG7QF4N2T3BYRUE4/events.json","paper":"https://pith.science/paper/JLB5FXFG"},"agent_actions":{"view_html":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4","download_json":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4.json","view_paper":"https://pith.science/paper/JLB5FXFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.06355&json=true","fetch_graph":"https://pith.science/api/pith-number/JLB5FXFGQ5EG7QF4N2T3BYRUE4/graph.json","fetch_events":"https://pith.science/api/pith-number/JLB5FXFGQ5EG7QF4N2T3BYRUE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4/action/storage_attestation","attest_author":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4/action/author_attestation","sign_citation":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4/action/citation_signature","submit_replication":"https://pith.science/pith/JLB5FXFGQ5EG7QF4N2T3BYRUE4/action/replication_record"}},"created_at":"2026-07-05T03:13:53.507193+00:00","updated_at":"2026-07-05T03:13:53.507193+00:00"}