{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OWAFYQSOZSOVLZDAFYH7EB44RG","short_pith_number":"pith:OWAFYQSO","schema_version":"1.0","canonical_sha256":"75805c424ecc9d55e4602e0ff2079c8986dabe3748132333ea9ffd93c8987aef","source":{"kind":"arxiv","id":"2305.05129","version":2},"attestation_state":"computed","paper":{"title":"Sorting Finite Automata via Partition Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojana Kodric, Davide Cenzato, Francisco Olivares, Manuel C\\'aceres, Nicola Prezza, Ruben Becker, Sung-Hwan Kim","submitted_at":"2023-05-09T02:22:24Z","abstract_excerpt":"Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard problems on labeled graphs and languages. The problem of deciding whether a given NFA is Wheeler is known to be NP-complete. Recently, however, Alanko et al. showed how to side-step this complexity by switching to preorders: letting $Q$ be the set of states, $E$ the set of transitions, $|Q|=n$, and $|E|=m$, they provided a $O(mn^2)$-time algorithm computing a totally-ordered partition of the WNFA's states such that "},"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":"2305.05129","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-09T02:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"e3ca8000d59fbbb536a10d61c93b392e32a2b530d3279ec1c6479f87c70064e1","abstract_canon_sha256":"eefec81b1faa3fb25991cfce687adff66efd8f12d9be6c56cbdd0dab50980ae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:23.100979Z","signature_b64":"KCf+K2O1jWJrxZqKgE82WEt1Qom6ktRoHwefkMv1gR9OaLLI2eRfgLm+OfbZJYhHUGeIgnYwk6ladmQ5AY2zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75805c424ecc9d55e4602e0ff2079c8986dabe3748132333ea9ffd93c8987aef","last_reissued_at":"2026-07-05T07:25:23.100585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:23.100585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting Finite Automata via Partition Refinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojana Kodric, Davide Cenzato, Francisco Olivares, Manuel C\\'aceres, Nicola Prezza, Ruben Becker, Sung-Hwan Kim","submitted_at":"2023-05-09T02:22:24Z","abstract_excerpt":"Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard problems on labeled graphs and languages. The problem of deciding whether a given NFA is Wheeler is known to be NP-complete. Recently, however, Alanko et al. showed how to side-step this complexity by switching to preorders: letting $Q$ be the set of states, $E$ the set of transitions, $|Q|=n$, and $|E|=m$, they provided a $O(mn^2)$-time algorithm computing a totally-ordered partition of the WNFA's states such that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05129","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.05129/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":"2305.05129","created_at":"2026-07-05T07:25:23.100641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.05129v2","created_at":"2026-07-05T07:25:23.100641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05129","created_at":"2026-07-05T07:25:23.100641+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWAFYQSOZSOV","created_at":"2026-07-05T07:25:23.100641+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWAFYQSOZSOVLZDA","created_at":"2026-07-05T07:25:23.100641+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWAFYQSO","created_at":"2026-07-05T07:25:23.100641+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/OWAFYQSOZSOVLZDAFYH7EB44RG","json":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG.json","graph_json":"https://pith.science/api/pith-number/OWAFYQSOZSOVLZDAFYH7EB44RG/graph.json","events_json":"https://pith.science/api/pith-number/OWAFYQSOZSOVLZDAFYH7EB44RG/events.json","paper":"https://pith.science/paper/OWAFYQSO"},"agent_actions":{"view_html":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG","download_json":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG.json","view_paper":"https://pith.science/paper/OWAFYQSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.05129&json=true","fetch_graph":"https://pith.science/api/pith-number/OWAFYQSOZSOVLZDAFYH7EB44RG/graph.json","fetch_events":"https://pith.science/api/pith-number/OWAFYQSOZSOVLZDAFYH7EB44RG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG/action/storage_attestation","attest_author":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG/action/author_attestation","sign_citation":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG/action/citation_signature","submit_replication":"https://pith.science/pith/OWAFYQSOZSOVLZDAFYH7EB44RG/action/replication_record"}},"created_at":"2026-07-05T07:25:23.100641+00:00","updated_at":"2026-07-05T07:25:23.100641+00:00"}