{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZTK7OYMERXJLYZUBPAUBRF3G2S","short_pith_number":"pith:ZTK7OYME","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"},"canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","source":{"kind":"arxiv","id":"1704.04615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04615","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04615v2","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04615","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZTK7OYMERXJL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTK7OYMERXJLYZUB","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTK7OYME","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZTK7OYMERXJLYZUBPAUBRF3G2S","target":"record","payload":{"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"},"canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","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"},"source_kind":"arxiv","source_id":"1704.04615","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQi/6VBaR6uUsbJk2dI3aq5Ibg543vJ7jiEKmOPLGwNX2T+fUz/LS/mqCrUIK6vnerUhXTX2MTAt8eAgn/blCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:55:32.154956Z"},"content_sha256":"e451834399ecb9cadf4ca1052715f79b33466b771a30cad4ad0533472b444f7d","schema_version":"1.0","event_id":"sha256:e451834399ecb9cadf4ca1052715f79b33466b771a30cad4ad0533472b444f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZTK7OYMERXJLYZUBPAUBRF3G2S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBgGM54wrlam/+oSeWNNHKU9M4Nb4nJh7OFXNKt+EaBatM2/IOxChl5p/Nzm+gLzCgwN59J1ppB9P6k4Na35AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:55:32.155542Z"},"content_sha256":"c3c7f8b3aea58a019075728af299634bf0f23917d9df0801056813e038a9c095","schema_version":"1.0","event_id":"sha256:c3c7f8b3aea58a019075728af299634bf0f23917d9df0801056813e038a9c095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/bundle.json","state_url":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T20:55:32Z","links":{"resolver":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S","bundle":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/bundle.json","state":"https://pith.science/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTK7OYMERXJLYZUBPAUBRF3G2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZTK7OYMERXJLYZUBPAUBRF3G2S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1a3c9fd8441b729dc8d6bf2c1e2822e1da288e6a3df45787b641d16548311e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-15T09:58:02Z","title_canon_sha256":"f6ec3331a9e6807de02d37a0961dcfc8e1bb58b9161a9940fdf3bbbc9aa5d5b1"},"schema_version":"1.0","source":{"id":"1704.04615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04615","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04615v2","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04615","created_at":"2026-05-18T00:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZTK7OYMERXJL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTK7OYMERXJLYZUB","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTK7OYME","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c3c7f8b3aea58a019075728af299634bf0f23917d9df0801056813e038a9c095","target":"graph","created_at":"2026-05-18T00:46:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Haoyu Cheng, Ming Wu, Yun Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-15T09:58:02Z","title":"FMtree: A fast locating algorithm of FM-indexes for genomic data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04615","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e451834399ecb9cadf4ca1052715f79b33466b771a30cad4ad0533472b444f7d","target":"record","created_at":"2026-05-18T00:46:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1a3c9fd8441b729dc8d6bf2c1e2822e1da288e6a3df45787b641d16548311e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-15T09:58:02Z","title_canon_sha256":"f6ec3331a9e6807de02d37a0961dcfc8e1bb58b9161a9940fdf3bbbc9aa5d5b1"},"schema_version":"1.0","source":{"id":"1704.04615","kind":"arxiv","version":2}},"canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccd5f761848dd2bc66817828189766d4802f5aa5e8679f561e049771b2d5684e","first_computed_at":"2026-05-18T00:46:11.836784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:11.836784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rJwFJf6DyVhrDDihW53aDnnc/CJ2PqX4e0ZUYIaF4vF6BIFcIasdvuRO+gEBkCuY5bixuWda/VIUzgNrS15uAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:11.837167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e451834399ecb9cadf4ca1052715f79b33466b771a30cad4ad0533472b444f7d","sha256:c3c7f8b3aea58a019075728af299634bf0f23917d9df0801056813e038a9c095"],"state_sha256":"4595ceb7079525b6238e353a445fbe28ddfa193f262c1c4a0d3ab933f97eecac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnIcLqMFdDOJwJicxLTFT1Oz2ETp3if5rgqGpFuJHsdM3qwCLe4uEsgkidTZF6MVvRZj4qKjk9b7v+MLMFUlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:55:32.159419Z","bundle_sha256":"bceb09b580691388ec9b0569559ebcfb6180ce390899033859c405de1a971fd0"}}