{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZTK7OYMERXJLYZUBPAUBRF3G2S","short_pith_number":"pith:ZTK7OYME","schema_version":"1.0","canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","source":{"kind":"arxiv","id":"1704.04615","version":2},"attestation_state":"computed","paper":{"title":"FMtree: A fast locating algorithm of FM-indexes for genomic data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haoyu Cheng, Ming Wu, Yun Xu","submitted_at":"2017-04-15T09:58:02Z","abstract_excerpt":"Motivation: As a fundamental task in bioinformatics, searching for massive short patterns over a long text is widely accelerated by various compressed full-text indexes. These indexes are able to provide similar searching functionalities to classical indexes, e.g., suffix trees and suffix arrays, while requiring less space. For genomic data, a well-known family of compressed full-text index, called FM-indexes, presents unmatched performance in practice. One major drawback of FM-indexes is that their locating operations, which report all occurrence positions of patterns in a given text, are par"},"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":"1704.04615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-15T09:58:02Z","cross_cats_sorted":[],"title_canon_sha256":"f6ec3331a9e6807de02d37a0961dcfc8e1bb58b9161a9940fdf3bbbc9aa5d5b1","abstract_canon_sha256":"1a3c9fd8441b729dc8d6bf2c1e2822e1da288e6a3df45787b641d16548311e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:11.837167Z","signature_b64":"rJwFJf6DyVhrDDihW53aDnnc/CJ2PqX4e0ZUYIaF4vF6BIFcIasdvuRO+gEBkCuY5bixuWda/VIUzgNrS15uAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","last_reissued_at":"2026-05-18T00:46:11.836784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:11.836784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FMtree: A fast locating algorithm of FM-indexes for genomic data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haoyu Cheng, Ming Wu, Yun Xu","submitted_at":"2017-04-15T09:58:02Z","abstract_excerpt":"Motivation: As a fundamental task in bioinformatics, searching for massive short patterns over a long text is widely accelerated by various compressed full-text indexes. These indexes are able to provide similar searching functionalities to classical indexes, e.g., suffix trees and suffix arrays, while requiring less space. For genomic data, a well-known family of compressed full-text index, called FM-indexes, presents unmatched performance in practice. One major drawback of FM-indexes is that their locating operations, which report all occurrence positions of patterns in a given text, are par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04615","kind":"arxiv","version":2},"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":"1704.04615","created_at":"2026-05-18T00:46:11.836841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04615v2","created_at":"2026-05-18T00:46:11.836841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04615","created_at":"2026-05-18T00:46:11.836841+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTK7OYMERXJL","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTK7OYMERXJLYZUB","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTK7OYME","created_at":"2026-05-18T12:31:59.375834+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/ZTK7OYMERXJLYZUBPAUBRF3G2S","json":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S.json","graph_json":"https://pith.science/api/pith-number/ZTK7OYMERXJLYZUBPAUBRF3G2S/graph.json","events_json":"https://pith.science/api/pith-number/ZTK7OYMERXJLYZUBPAUBRF3G2S/events.json","paper":"https://pith.science/paper/ZTK7OYME"},"agent_actions":{"view_html":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S","download_json":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S.json","view_paper":"https://pith.science/paper/ZTK7OYME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04615&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTK7OYMERXJLYZUBPAUBRF3G2S/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTK7OYMERXJLYZUBPAUBRF3G2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/action/storage_attestation","attest_author":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/action/author_attestation","sign_citation":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/action/citation_signature","submit_replication":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/action/replication_record"}},"created_at":"2026-05-18T00:46:11.836841+00:00","updated_at":"2026-05-18T00:46:11.836841+00:00"}