{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LOYFKA5X3BFPMJZCV2DLMB27AR","short_pith_number":"pith:LOYFKA5X","schema_version":"1.0","canonical_sha256":"5bb05503b7d84af62722ae86b6075f0455acd2c2f7d1cd4db6d9de831447cc3d","source":{"kind":"arxiv","id":"1406.0426","version":1},"attestation_state":"computed","paper":{"title":"Fast construction of FM-index for long sequence reads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Heng Li","submitted_at":"2014-06-02T16:06:04Z","abstract_excerpt":"Summary: We present a new method to incrementally construct the FM-index for both short and long sequence reads, up to the size of a genome. It is the first algorithm that can build the index while implicitly sorting the sequences in the reverse (complement) lexicographical order without a separate sorting step. The implementation is among the fastest for indexing short reads and the only one that practically works for reads of averaged kilobases in length.\n  Availability and implementation: https://github.com/lh3/ropebwt2\n  Contact: hengli@broadinstitute.org"},"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":"1406.0426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2014-06-02T16:06:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f8e5aff6491fa3a0d03028863987ebdfab4c630cb7cfd8913b3b5b3eeeb95164","abstract_canon_sha256":"e6cc773efafdb05f2ec6188edeae95d9b6dd417bdcec1c52b87de2d4e06bb75a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:01.686390Z","signature_b64":"4QXjXheXYVpZTu6Gai+BsU39hKLVFN/MPtQqxTKpAhiFT29aYdUjAeffE1foIT2dasxpr6G/i8IYH6WGAzvDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bb05503b7d84af62722ae86b6075f0455acd2c2f7d1cd4db6d9de831447cc3d","last_reissued_at":"2026-05-18T02:44:01.685925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:01.685925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast construction of FM-index for long sequence reads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"q-bio.GN","authors_text":"Heng Li","submitted_at":"2014-06-02T16:06:04Z","abstract_excerpt":"Summary: We present a new method to incrementally construct the FM-index for both short and long sequence reads, up to the size of a genome. It is the first algorithm that can build the index while implicitly sorting the sequences in the reverse (complement) lexicographical order without a separate sorting step. The implementation is among the fastest for indexing short reads and the only one that practically works for reads of averaged kilobases in length.\n  Availability and implementation: https://github.com/lh3/ropebwt2\n  Contact: hengli@broadinstitute.org"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0426","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":"1406.0426","created_at":"2026-05-18T02:44:01.685994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0426v1","created_at":"2026-05-18T02:44:01.685994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0426","created_at":"2026-05-18T02:44:01.685994+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOYFKA5X3BFP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOYFKA5X3BFPMJZC","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOYFKA5X","created_at":"2026-05-18T12:28:38.356838+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/LOYFKA5X3BFPMJZCV2DLMB27AR","json":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR.json","graph_json":"https://pith.science/api/pith-number/LOYFKA5X3BFPMJZCV2DLMB27AR/graph.json","events_json":"https://pith.science/api/pith-number/LOYFKA5X3BFPMJZCV2DLMB27AR/events.json","paper":"https://pith.science/paper/LOYFKA5X"},"agent_actions":{"view_html":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR","download_json":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR.json","view_paper":"https://pith.science/paper/LOYFKA5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0426&json=true","fetch_graph":"https://pith.science/api/pith-number/LOYFKA5X3BFPMJZCV2DLMB27AR/graph.json","fetch_events":"https://pith.science/api/pith-number/LOYFKA5X3BFPMJZCV2DLMB27AR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR/action/storage_attestation","attest_author":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR/action/author_attestation","sign_citation":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR/action/citation_signature","submit_replication":"https://pith.science/pith/LOYFKA5X3BFPMJZCV2DLMB27AR/action/replication_record"}},"created_at":"2026-05-18T02:44:01.685994+00:00","updated_at":"2026-05-18T02:44:01.685994+00:00"}