{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MBPLB5DZOLF2GOVTTZOUY4OZIG","short_pith_number":"pith:MBPLB5DZ","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"},"canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","source":{"kind":"arxiv","id":"2301.05338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05338","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05338v1","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05338","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"MBPLB5DZOLF2","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBPLB5DZOLF2GOVT","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBPLB5DZ","created_at":"2026-07-05T05:32:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MBPLB5DZOLF2GOVTTZOUY4OZIG","target":"record","payload":{"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"},"canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","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"},"source_kind":"arxiv","source_id":"2301.05338","source_version":1,"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-07-05T05:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPMzuCeAgToAkYVsOKM+Kiw3OC9Tcn1O+zpk9OT3rDqths6Hq6DONbyjl+NiKDg1RHoJ2cxWE3OOmjvPYXAqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:20:44.211038Z"},"content_sha256":"230849df772e8ac157af36a2bfb5d40e60fa262ddc211ea1c4060b80f94fae81","schema_version":"1.0","event_id":"sha256:230849df772e8ac157af36a2bfb5d40e60fa262ddc211ea1c4060b80f94fae81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MBPLB5DZOLF2GOVTTZOUY4OZIG","target":"graph","payload":{"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"},"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-07-05T05:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrYsO4P3sDr2+5EUZ8RTQEoJnSbKkswaFA0XExDVXN87aBalM9RpO74DgzUQv7NjxaBY0RG81mXfzBHaFtq/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:20:44.211425Z"},"content_sha256":"0404bd338d2036d13ff9780585d093da35ba8f6d8f0731b6534d7427e44de25b","schema_version":"1.0","event_id":"sha256:0404bd338d2036d13ff9780585d093da35ba8f6d8f0731b6534d7427e44de25b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/bundle.json","state_url":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/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-07-07T10:20:44Z","links":{"resolver":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG","bundle":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/bundle.json","state":"https://pith.science/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBPLB5DZOLF2GOVTTZOUY4OZIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MBPLB5DZOLF2GOVTTZOUY4OZIG","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":"e4f07c0b690a92a4ab314a0629460b6cde1fdebddd8179a4a388bdfb87a45768","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-13T00:18:45Z","title_canon_sha256":"74601402bd07484879274560933796c84d3346bd5d646b681118bb5e4170fb46"},"schema_version":"1.0","source":{"id":"2301.05338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05338","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05338v1","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05338","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"MBPLB5DZOLF2","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_16","alias_value":"MBPLB5DZOLF2GOVT","created_at":"2026-07-05T05:32:51Z"},{"alias_kind":"pith_short_8","alias_value":"MBPLB5DZ","created_at":"2026-07-05T05:32:51Z"}],"graph_snapshots":[{"event_id":"sha256:0404bd338d2036d13ff9780585d093da35ba8f6d8f0731b6534d7427e44de25b","target":"graph","created_at":"2026-07-05T05:32:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.05338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alessio Conte, Giovanni Manzini, Marinella Sciortino, Nicola Cotumaccio, Nicola Prezza, Travis Gagie","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-13T00:18:45Z","title":"Computing matching statistics on Wheeler DFAs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05338","kind":"arxiv","version":1},"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:230849df772e8ac157af36a2bfb5d40e60fa262ddc211ea1c4060b80f94fae81","target":"record","created_at":"2026-07-05T05:32:51Z","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":"e4f07c0b690a92a4ab314a0629460b6cde1fdebddd8179a4a388bdfb87a45768","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-13T00:18:45Z","title_canon_sha256":"74601402bd07484879274560933796c84d3346bd5d646b681118bb5e4170fb46"},"schema_version":"1.0","source":{"id":"2301.05338","kind":"arxiv","version":1}},"canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"605eb0f47972cba33ab39e5d4c71d941a41eb7c75851799a2d9f7c32d4cf7b35","first_computed_at":"2026-07-05T05:32:51.956293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:51.956293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eEtqyGgYUgbSyeLvDWhKkXtwZCYMocEYXhHpDIbMQ7j36ZTa8mJAeHREwMJ1tAxaYtPaf9BTe00r5/7kpppaAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:51.956718Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.05338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230849df772e8ac157af36a2bfb5d40e60fa262ddc211ea1c4060b80f94fae81","sha256:0404bd338d2036d13ff9780585d093da35ba8f6d8f0731b6534d7427e44de25b"],"state_sha256":"5db9bbffec86ca5ae7e2caa02f223a3c5675f9732881da5d3b3066fdff76124b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uInkJHa6lLm412DdzJ3VHdow+yhuZKQwW/k80pT/z3dsUFfBbZ+5qusiUkO7mjG3SqUF+dbmA1suS0RZrv16DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:20:44.213388Z","bundle_sha256":"aba9a21599a439d315f49cf6e8701e608ac705d73f4ca24658f850e296209c11"}}