{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3IK42UYSDAVAFHTYYJIWMUTMY2","short_pith_number":"pith:3IK42UYS","schema_version":"1.0","canonical_sha256":"da15cd5312182a029e78c25166526cc69fcdd2a6f003b3e13f571f96ab8d0e18","source":{"kind":"arxiv","id":"1111.5572","version":1},"attestation_state":"computed","paper":{"title":"Faster and More Accurate Sequence Alignment with SNAP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Armando Fox, David Patterson, Ion Stoica, Kristal Curtis, Matei Zaharia, Richard M. Karp, Scott Shenker, Taylor Sittler, William J. Bolosky","submitted_at":"2011-11-23T17:46:03Z","abstract_excerpt":"We present the Scalable Nucleotide Alignment Program (SNAP), a new short and long read aligner that is both more accurate (i.e., aligns more reads with fewer errors) and 10-100x faster than state-of-the-art tools such as BWA. Unlike recent aligners based on the Burrows-Wheeler transform, SNAP uses a simple hash index of short seed sequences from the genome, similar to BLAST's. However, SNAP greatly reduces the number and cost of local alignment checks performed through several measures: it uses longer seeds to reduce the false positive locations considered, leverages larger memory capacities t"},"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":"1111.5572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-23T17:46:03Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"4f3768d2ec368479747224f65b051b8aebfd32e133ee04e659991dcb996e17f4","abstract_canon_sha256":"6e641117a97e6fe4b27ca069b3d9a5c3870e1762d59bc65d7c6466de3719829e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:43.472998Z","signature_b64":"NY20WP+IQDz/XQYpk2Ech9pH2k70/yn4Jsks0sZ49QGuoMaoje+WKBKb9eOGUJM4bWbbJWhNvUbkb8/14h+NDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da15cd5312182a029e78c25166526cc69fcdd2a6f003b3e13f571f96ab8d0e18","last_reissued_at":"2026-05-18T04:07:43.472410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:43.472410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and More Accurate Sequence Alignment with SNAP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Armando Fox, David Patterson, Ion Stoica, Kristal Curtis, Matei Zaharia, Richard M. Karp, Scott Shenker, Taylor Sittler, William J. Bolosky","submitted_at":"2011-11-23T17:46:03Z","abstract_excerpt":"We present the Scalable Nucleotide Alignment Program (SNAP), a new short and long read aligner that is both more accurate (i.e., aligns more reads with fewer errors) and 10-100x faster than state-of-the-art tools such as BWA. Unlike recent aligners based on the Burrows-Wheeler transform, SNAP uses a simple hash index of short seed sequences from the genome, similar to BLAST's. However, SNAP greatly reduces the number and cost of local alignment checks performed through several measures: it uses longer seeds to reduce the false positive locations considered, leverages larger memory capacities t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5572","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":"1111.5572","created_at":"2026-05-18T04:07:43.472489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5572v1","created_at":"2026-05-18T04:07:43.472489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5572","created_at":"2026-05-18T04:07:43.472489+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IK42UYSDAVA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IK42UYSDAVAFHTY","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IK42UYS","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01190","citing_title":"The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme","ref_index":147,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2","json":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2.json","graph_json":"https://pith.science/api/pith-number/3IK42UYSDAVAFHTYYJIWMUTMY2/graph.json","events_json":"https://pith.science/api/pith-number/3IK42UYSDAVAFHTYYJIWMUTMY2/events.json","paper":"https://pith.science/paper/3IK42UYS"},"agent_actions":{"view_html":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2","download_json":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2.json","view_paper":"https://pith.science/paper/3IK42UYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5572&json=true","fetch_graph":"https://pith.science/api/pith-number/3IK42UYSDAVAFHTYYJIWMUTMY2/graph.json","fetch_events":"https://pith.science/api/pith-number/3IK42UYSDAVAFHTYYJIWMUTMY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2/action/storage_attestation","attest_author":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2/action/author_attestation","sign_citation":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2/action/citation_signature","submit_replication":"https://pith.science/pith/3IK42UYSDAVAFHTYYJIWMUTMY2/action/replication_record"}},"created_at":"2026-05-18T04:07:43.472489+00:00","updated_at":"2026-05-18T04:07:43.472489+00:00"}