{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MBPLB5DZOLF2GOVTTZOUY4OZIG","short_pith_number":"pith:MBPLB5DZ","schema_version":"1.0","canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","source":{"kind":"arxiv","id":"2301.05338","version":1},"attestation_state":"computed","paper":{"title":"Computing matching statistics on Wheeler DFAs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessio Conte, Giovanni Manzini, Marinella Sciortino, Nicola Cotumaccio, Nicola Prezza, Travis Gagie","submitted_at":"2023-01-13T00:18:45Z","abstract_excerpt":"Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPIRE 2010] proposed a time and space efficient algorithm for computing matching statistics which relies on some components of a compressed suffix tree - notably, the longest common prefix (LCP) array. In this paper, we show how their algorithm can be generalized from strings to Wheeler deterministic finite automata. Most importantly, we introduce a notion of LCP array for Wheeler automata, thus establishing a first cle"},"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":"2301.05338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-13T00:18:45Z","cross_cats_sorted":[],"title_canon_sha256":"74601402bd07484879274560933796c84d3346bd5d646b681118bb5e4170fb46","abstract_canon_sha256":"e4f07c0b690a92a4ab314a0629460b6cde1fdebddd8179a4a388bdfb87a45768"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:51.956718Z","signature_b64":"eEtqyGgYUgbSyeLvDWhKkXtwZCYMocEYXhHpDIbMQ7j36ZTa8mJAeHREwMJ1tAxaYtPaf9BTe00r5/7kpppaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","last_reissued_at":"2026-07-05T05:32:51.956293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:51.956293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing matching statistics on Wheeler DFAs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessio Conte, Giovanni Manzini, Marinella Sciortino, Nicola Cotumaccio, Nicola Prezza, Travis Gagie","submitted_at":"2023-01-13T00:18:45Z","abstract_excerpt":"Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPIRE 2010] proposed a time and space efficient algorithm for computing matching statistics which relies on some components of a compressed suffix tree - notably, the longest common prefix (LCP) array. In this paper, we show how their algorithm can be generalized from strings to Wheeler deterministic finite automata. Most importantly, we introduce a notion of LCP array for Wheeler automata, thus establishing a first cle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05338","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.05338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.05338","created_at":"2026-07-05T05:32:51.956363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.05338v1","created_at":"2026-07-05T05:32:51.956363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05338","created_at":"2026-07-05T05:32:51.956363+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBPLB5DZOLF2","created_at":"2026-07-05T05:32:51.956363+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBPLB5DZOLF2GOVT","created_at":"2026-07-05T05:32:51.956363+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBPLB5DZ","created_at":"2026-07-05T05:32:51.956363+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/MBPLB5DZOLF2GOVTTZOUY4OZIG","json":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG.json","graph_json":"https://pith.science/api/pith-number/MBPLB5DZOLF2GOVTTZOUY4OZIG/graph.json","events_json":"https://pith.science/api/pith-number/MBPLB5DZOLF2GOVTTZOUY4OZIG/events.json","paper":"https://pith.science/paper/MBPLB5DZ"},"agent_actions":{"view_html":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG","download_json":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG.json","view_paper":"https://pith.science/paper/MBPLB5DZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.05338&json=true","fetch_graph":"https://pith.science/api/pith-number/MBPLB5DZOLF2GOVTTZOUY4OZIG/graph.json","fetch_events":"https://pith.science/api/pith-number/MBPLB5DZOLF2GOVTTZOUY4OZIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/action/storage_attestation","attest_author":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/action/author_attestation","sign_citation":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/action/citation_signature","submit_replication":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/action/replication_record"}},"created_at":"2026-07-05T05:32:51.956363+00:00","updated_at":"2026-07-05T05:32:51.956363+00:00"}