{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TRZD4D4JZF4XTFH46RJWDTRFNW","short_pith_number":"pith:TRZD4D4J","schema_version":"1.0","canonical_sha256":"9c723e0f89c9797994fcf45361ce256da4e21ede2da8e86f4cf301dad5dba26f","source":{"kind":"arxiv","id":"2401.11685","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Seed Location Filtering in DNA Read Mapping Using a Commercial Compute-in-SRAM Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.AR","authors_text":"Christopher Batten, Courtney Golden, Dan Ilan, Nicholas Cebry","submitted_at":"2024-01-22T04:44:50Z","abstract_excerpt":"DNA sequence alignment is an important workload in computational genomics. Reference-guided DNA assembly involves aligning many read sequences against candidate locations in a long reference genome. To reduce the computational load of this alignment, candidate locations can be pre-filtered using simpler alignment algorithms like edit distance. Prior work has explored accelerating filtering on simulated compute-in-DRAM, due to the massive parallelism of compute-in-memory architectures. In this paper, we present work-in-progress on accelerating filtering using a commercial compute-in-SRAM accele"},"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":"2401.11685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-01-22T04:44:50Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"1fc44b749aa62935e7272264c43d2925f3b6d93c4a788408cc54c331b97de9a9","abstract_canon_sha256":"c6cb81bbb04142d6fd2f3af7e0d4c5ad0a4cac24a8a693f22747bcd2f9eab105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:08.373941Z","signature_b64":"hDJVeHXXb5ccs9Sa/xE5XLRT2puYl6okOygYYQXHQzrGy5nEMl+wvh0OdrG8WwgdiG+dJjsjU09aYvSaZoKfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c723e0f89c9797994fcf45361ce256da4e21ede2da8e86f4cf301dad5dba26f","last_reissued_at":"2026-07-05T07:36:08.373451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:08.373451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Seed Location Filtering in DNA Read Mapping Using a Commercial Compute-in-SRAM Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.AR","authors_text":"Christopher Batten, Courtney Golden, Dan Ilan, Nicholas Cebry","submitted_at":"2024-01-22T04:44:50Z","abstract_excerpt":"DNA sequence alignment is an important workload in computational genomics. Reference-guided DNA assembly involves aligning many read sequences against candidate locations in a long reference genome. To reduce the computational load of this alignment, candidate locations can be pre-filtered using simpler alignment algorithms like edit distance. Prior work has explored accelerating filtering on simulated compute-in-DRAM, due to the massive parallelism of compute-in-memory architectures. In this paper, we present work-in-progress on accelerating filtering using a commercial compute-in-SRAM accele"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11685","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/2401.11685/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":"2401.11685","created_at":"2026-07-05T07:36:08.373516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11685v1","created_at":"2026-07-05T07:36:08.373516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11685","created_at":"2026-07-05T07:36:08.373516+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRZD4D4JZF4X","created_at":"2026-07-05T07:36:08.373516+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRZD4D4JZF4XTFH4","created_at":"2026-07-05T07:36:08.373516+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRZD4D4J","created_at":"2026-07-05T07:36:08.373516+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05451","citing_title":"Characterizing and Optimizing Realistic Workloads on a Commercial Compute-in-SRAM Device","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW","json":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW.json","graph_json":"https://pith.science/api/pith-number/TRZD4D4JZF4XTFH46RJWDTRFNW/graph.json","events_json":"https://pith.science/api/pith-number/TRZD4D4JZF4XTFH46RJWDTRFNW/events.json","paper":"https://pith.science/paper/TRZD4D4J"},"agent_actions":{"view_html":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW","download_json":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW.json","view_paper":"https://pith.science/paper/TRZD4D4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11685&json=true","fetch_graph":"https://pith.science/api/pith-number/TRZD4D4JZF4XTFH46RJWDTRFNW/graph.json","fetch_events":"https://pith.science/api/pith-number/TRZD4D4JZF4XTFH46RJWDTRFNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW/action/storage_attestation","attest_author":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW/action/author_attestation","sign_citation":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW/action/citation_signature","submit_replication":"https://pith.science/pith/TRZD4D4JZF4XTFH46RJWDTRFNW/action/replication_record"}},"created_at":"2026-07-05T07:36:08.373516+00:00","updated_at":"2026-07-05T07:36:08.373516+00:00"}