{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3L5ZUFDAXBGZ7D6DC6G5Q5ROM3","short_pith_number":"pith:3L5ZUFDA","schema_version":"1.0","canonical_sha256":"dafb9a1460b84d9f8fc3178dd8762e66e0ab0c752ca3b23b5e9662c486debd34","source":{"kind":"arxiv","id":"1604.01789","version":3},"attestation_state":"computed","paper":{"title":"GateKeeper: A New Hardware Architecture for Accelerating Pre-Alignment in DNA Short Read Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Can Alkan, Hasan Hassan, Hongyi Xin, Mohammed Alser, Onur Mutlu, O\\u{g}uz Ergin","submitted_at":"2016-04-06T20:04:56Z","abstract_excerpt":"Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden. To analyze the entire genome, each of the billions of short reads must be mapped to a reference genome based on the similarity between a read and \"candidate\" locations in that reference genome. The similarity measurement, called alignment, formulated as an approximate string matching problem, is the computational bottleneck because: (1) it is implemented using quadratic-time dynamic programming algorithms, and (2)"},"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":"1604.01789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2016-04-06T20:04:56Z","cross_cats_sorted":["cs.AR","cs.DS"],"title_canon_sha256":"ea259e5591e050a5be682b09c312fc3871442e8942e60c84ade45c8b4c0c324f","abstract_canon_sha256":"02be1d717aae64010bd8f6e3353b9860623cb33bfb3ed0b23a23f810972efd29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:11.712289Z","signature_b64":"OwEEo3b8b3/Ivp3EAme5+nBEd4Co5Q0mVjy74IrgIcS8OmXVM6DX0ViY6rNOp6Jn/9ccrRmKz1aQWsv7W4QxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dafb9a1460b84d9f8fc3178dd8762e66e0ab0c752ca3b23b5e9662c486debd34","last_reissued_at":"2026-07-05T01:38:11.711930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:11.711930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GateKeeper: A New Hardware Architecture for Accelerating Pre-Alignment in DNA Short Read Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Can Alkan, Hasan Hassan, Hongyi Xin, Mohammed Alser, Onur Mutlu, O\\u{g}uz Ergin","submitted_at":"2016-04-06T20:04:56Z","abstract_excerpt":"Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden. To analyze the entire genome, each of the billions of short reads must be mapped to a reference genome based on the similarity between a read and \"candidate\" locations in that reference genome. The similarity measurement, called alignment, formulated as an approximate string matching problem, is the computational bottleneck because: (1) it is implemented using quadratic-time dynamic programming algorithms, and (2)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01789","kind":"arxiv","version":3},"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/1604.01789/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":"1604.01789","created_at":"2026-07-05T01:38:11.711992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01789v3","created_at":"2026-07-05T01:38:11.711992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01789","created_at":"2026-07-05T01:38:11.711992+00:00"},{"alias_kind":"pith_short_12","alias_value":"3L5ZUFDAXBGZ","created_at":"2026-07-05T01:38:11.711992+00:00"},{"alias_kind":"pith_short_16","alias_value":"3L5ZUFDAXBGZ7D6D","created_at":"2026-07-05T01:38:11.711992+00:00"},{"alias_kind":"pith_short_8","alias_value":"3L5ZUFDA","created_at":"2026-07-05T01:38:11.711992+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/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3","json":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3.json","graph_json":"https://pith.science/api/pith-number/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/graph.json","events_json":"https://pith.science/api/pith-number/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/events.json","paper":"https://pith.science/paper/3L5ZUFDA"},"agent_actions":{"view_html":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3","download_json":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3.json","view_paper":"https://pith.science/paper/3L5ZUFDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01789&json=true","fetch_graph":"https://pith.science/api/pith-number/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/graph.json","fetch_events":"https://pith.science/api/pith-number/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/action/storage_attestation","attest_author":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/action/author_attestation","sign_citation":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/action/citation_signature","submit_replication":"https://pith.science/pith/3L5ZUFDAXBGZ7D6DC6G5Q5ROM3/action/replication_record"}},"created_at":"2026-07-05T01:38:11.711992+00:00","updated_at":"2026-07-05T01:38:11.711992+00:00"}