{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JQFD3T56IX6ODYNJNPO6ZBXD57","short_pith_number":"pith:JQFD3T56","schema_version":"1.0","canonical_sha256":"4c0a3dcfbe45fce1e1a96bddec86e3efe5ca568f3f25cc52c5760eebaf20f087","source":{"kind":"arxiv","id":"1403.2136","version":3},"attestation_state":"computed","paper":{"title":"MaxSSmap: A GPU program for mapping divergent short reads to genomes with the maximum scoring subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Turki Turki, Usman Roshan","submitted_at":"2014-03-10T04:40:46Z","abstract_excerpt":"Programs based on hash tables and Burrows-Wheeler are very fast for mapping short reads to genomes but have low accuracy in the presence of mismatches and gaps. Such reads can be aligned accurately with the Smith-Waterman algorithm but it can take hours and days to map millions of reads even for bacteria genomes. We introduce a GPU program called MaxSSmap with the aim of achieving comparable accuracy to Smith-Waterman but with faster runtimes. Similar to most programs MaxSSmap identifies a local region of the genome followed by exact alignment. Instead of using hash tables or Burrows-Wheeler i"},"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":"1403.2136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2014-03-10T04:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"3ba272f7bd5fbbcca66c53f40c1ba66a8e70fce1816875ce5bdf8089a83d52d3","abstract_canon_sha256":"5602a4a76919ad357b4889f9a7df01545456cc20c1eb889d77060ec44869c5a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:52.447163Z","signature_b64":"72gA3g65rPAvaShy8UkLgygmklLinlbGab6ueDff7ce5AtBPvsWnOkuRAXnQxApcpGCtkzWDSuQQTwPJatyCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c0a3dcfbe45fce1e1a96bddec86e3efe5ca568f3f25cc52c5760eebaf20f087","last_reissued_at":"2026-05-18T02:34:52.446757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:52.446757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MaxSSmap: A GPU program for mapping divergent short reads to genomes with the maximum scoring subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Turki Turki, Usman Roshan","submitted_at":"2014-03-10T04:40:46Z","abstract_excerpt":"Programs based on hash tables and Burrows-Wheeler are very fast for mapping short reads to genomes but have low accuracy in the presence of mismatches and gaps. Such reads can be aligned accurately with the Smith-Waterman algorithm but it can take hours and days to map millions of reads even for bacteria genomes. We introduce a GPU program called MaxSSmap with the aim of achieving comparable accuracy to Smith-Waterman but with faster runtimes. Similar to most programs MaxSSmap identifies a local region of the genome followed by exact alignment. Instead of using hash tables or Burrows-Wheeler i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2136","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":""},"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":"1403.2136","created_at":"2026-05-18T02:34:52.446821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2136v3","created_at":"2026-05-18T02:34:52.446821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2136","created_at":"2026-05-18T02:34:52.446821+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQFD3T56IX6O","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQFD3T56IX6ODYNJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQFD3T56","created_at":"2026-05-18T12:28:35.611951+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/JQFD3T56IX6ODYNJNPO6ZBXD57","json":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57.json","graph_json":"https://pith.science/api/pith-number/JQFD3T56IX6ODYNJNPO6ZBXD57/graph.json","events_json":"https://pith.science/api/pith-number/JQFD3T56IX6ODYNJNPO6ZBXD57/events.json","paper":"https://pith.science/paper/JQFD3T56"},"agent_actions":{"view_html":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57","download_json":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57.json","view_paper":"https://pith.science/paper/JQFD3T56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2136&json=true","fetch_graph":"https://pith.science/api/pith-number/JQFD3T56IX6ODYNJNPO6ZBXD57/graph.json","fetch_events":"https://pith.science/api/pith-number/JQFD3T56IX6ODYNJNPO6ZBXD57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57/action/storage_attestation","attest_author":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57/action/author_attestation","sign_citation":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57/action/citation_signature","submit_replication":"https://pith.science/pith/JQFD3T56IX6ODYNJNPO6ZBXD57/action/replication_record"}},"created_at":"2026-05-18T02:34:52.446821+00:00","updated_at":"2026-05-18T02:34:52.446821+00:00"}