{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EICPPTS62E6Q376UIH7XE5FXB5","short_pith_number":"pith:EICPPTS6","schema_version":"1.0","canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","source":{"kind":"arxiv","id":"2111.02480","version":1},"attestation_state":"computed","paper":{"title":"Linear-time Minimization of Wheeler DFAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jarno Alanko, Nicola Cotumaccio, Nicola Prezza","submitted_at":"2021-11-03T19:15:54Z","abstract_excerpt":"Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata, WDFAs can be stored in just $\\log\\sigma + O(1)$ bits per edge, $\\sigma$ being the alphabet's size, and support optimal-time pattern matching queries on the substring closure of the language they recognize. An important step to achieve further compression is minimization. When the input $\\mathcal A$ is a general deterministic finite-state automaton (DFA), the state-of-the-art is represented by the classic Hopcroft's"},"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":"2111.02480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-11-03T19:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"7f0a3e713f177db0d71dde13f42ee3fbdc867a30839e7e8e267f055d1bcf264b","abstract_canon_sha256":"c80805ba2bef7ec41599834a300e39b96335ccaf8e4867947f8557477ffc6936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:52.031178Z","signature_b64":"7hmgIMzPAPTQkF/fxhPXMoAB9rgoG7dLB069yRIxtIEPaAThDO89pCuDmVbNuOgc7DDxcXW1yVkMT14nopSdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2204f7ce5ed13d0dffd441ff7274b70f64c66dd76cbead92e66c20a67abf1c1b","last_reissued_at":"2026-07-05T03:28:52.030680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:52.030680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-time Minimization of Wheeler DFAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jarno Alanko, Nicola Cotumaccio, Nicola Prezza","submitted_at":"2021-11-03T19:15:54Z","abstract_excerpt":"Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is playing an important role in the emerging field of compressed data structures: as opposed to general automata, WDFAs can be stored in just $\\log\\sigma + O(1)$ bits per edge, $\\sigma$ being the alphabet's size, and support optimal-time pattern matching queries on the substring closure of the language they recognize. An important step to achieve further compression is minimization. When the input $\\mathcal A$ is a general deterministic finite-state automaton (DFA), the state-of-the-art is represented by the classic Hopcroft's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02480","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/2111.02480/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":"2111.02480","created_at":"2026-07-05T03:28:52.030759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02480v1","created_at":"2026-07-05T03:28:52.030759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02480","created_at":"2026-07-05T03:28:52.030759+00:00"},{"alias_kind":"pith_short_12","alias_value":"EICPPTS62E6Q","created_at":"2026-07-05T03:28:52.030759+00:00"},{"alias_kind":"pith_short_16","alias_value":"EICPPTS62E6Q376U","created_at":"2026-07-05T03:28:52.030759+00:00"},{"alias_kind":"pith_short_8","alias_value":"EICPPTS6","created_at":"2026-07-05T03:28:52.030759+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/EICPPTS62E6Q376UIH7XE5FXB5","json":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5.json","graph_json":"https://pith.science/api/pith-number/EICPPTS62E6Q376UIH7XE5FXB5/graph.json","events_json":"https://pith.science/api/pith-number/EICPPTS62E6Q376UIH7XE5FXB5/events.json","paper":"https://pith.science/paper/EICPPTS6"},"agent_actions":{"view_html":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5","download_json":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5.json","view_paper":"https://pith.science/paper/EICPPTS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02480&json=true","fetch_graph":"https://pith.science/api/pith-number/EICPPTS62E6Q376UIH7XE5FXB5/graph.json","fetch_events":"https://pith.science/api/pith-number/EICPPTS62E6Q376UIH7XE5FXB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/action/storage_attestation","attest_author":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/action/author_attestation","sign_citation":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/action/citation_signature","submit_replication":"https://pith.science/pith/EICPPTS62E6Q376UIH7XE5FXB5/action/replication_record"}},"created_at":"2026-07-05T03:28:52.030759+00:00","updated_at":"2026-07-05T03:28:52.030759+00:00"}