{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EG5N5PRNZYLPUP63QDBXCSFMSH","short_pith_number":"pith:EG5N5PRN","schema_version":"1.0","canonical_sha256":"21badebe2dce16fa3fdb80c37148ac91cb3b930f5baa2468d020f1561c85772d","source":{"kind":"arxiv","id":"2208.04931","version":3},"attestation_state":"computed","paper":{"title":"Co-lexicographically Ordering Automata and Regular Languages -- Part I","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Alberto Policriti, Giovanna D'Agostino, Nicola Cotumaccio, Nicola Prezza","submitted_at":"2022-08-09T17:51:20Z","abstract_excerpt":"In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width $p$ of one of their admissible co-lex partial orders - dubbed here the automaton's co-lex width. We first show that this new measure captures at once the complexity of several seemingly-unrelated hard problems on automata. Any NFA of co-lex width $p$: (i) has an equivalent powerset DFA whose size is exponential in $p$ rather than (as a classic analysis shows)"},"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":"2208.04931","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.FL","submitted_at":"2022-08-09T17:51:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c22435fd83ca383ebf7ee9428376d2d640115d6c9ad23598b659df736f00dec8","abstract_canon_sha256":"0533c73e21e0543eda1c98803e7b73c2c51a525d555a79b54b8704d143341064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:40.682109Z","signature_b64":"ezwzpMVzuHIfoNlNYtCvXuC9kOExEJ+X1mKw4z05vL3fPS3DQkCy74Kee8E4U1LrWcxCfYUytAnKmToHqEFxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21badebe2dce16fa3fdb80c37148ac91cb3b930f5baa2468d020f1561c85772d","last_reissued_at":"2026-07-05T06:06:40.681642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:40.681642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-lexicographically Ordering Automata and Regular Languages -- Part I","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Alberto Policriti, Giovanna D'Agostino, Nicola Cotumaccio, Nicola Prezza","submitted_at":"2022-08-09T17:51:20Z","abstract_excerpt":"In the present work, we lay out a new theory showing that all automata can always be co-lexicographically partially ordered, and an intrinsic measure of their complexity can be defined and effectively determined, namely, the minimum width $p$ of one of their admissible co-lex partial orders - dubbed here the automaton's co-lex width. We first show that this new measure captures at once the complexity of several seemingly-unrelated hard problems on automata. Any NFA of co-lex width $p$: (i) has an equivalent powerset DFA whose size is exponential in $p$ rather than (as a classic analysis shows)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04931","kind":"arxiv","version":3},"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/2208.04931/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":"2208.04931","created_at":"2026-07-05T06:06:40.681700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.04931v3","created_at":"2026-07-05T06:06:40.681700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04931","created_at":"2026-07-05T06:06:40.681700+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG5N5PRNZYLP","created_at":"2026-07-05T06:06:40.681700+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG5N5PRNZYLPUP63","created_at":"2026-07-05T06:06:40.681700+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG5N5PRN","created_at":"2026-07-05T06:06:40.681700+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/EG5N5PRNZYLPUP63QDBXCSFMSH","json":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH.json","graph_json":"https://pith.science/api/pith-number/EG5N5PRNZYLPUP63QDBXCSFMSH/graph.json","events_json":"https://pith.science/api/pith-number/EG5N5PRNZYLPUP63QDBXCSFMSH/events.json","paper":"https://pith.science/paper/EG5N5PRN"},"agent_actions":{"view_html":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH","download_json":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH.json","view_paper":"https://pith.science/paper/EG5N5PRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.04931&json=true","fetch_graph":"https://pith.science/api/pith-number/EG5N5PRNZYLPUP63QDBXCSFMSH/graph.json","fetch_events":"https://pith.science/api/pith-number/EG5N5PRNZYLPUP63QDBXCSFMSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH/action/storage_attestation","attest_author":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH/action/author_attestation","sign_citation":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH/action/citation_signature","submit_replication":"https://pith.science/pith/EG5N5PRNZYLPUP63QDBXCSFMSH/action/replication_record"}},"created_at":"2026-07-05T06:06:40.681700+00:00","updated_at":"2026-07-05T06:06:40.681700+00:00"}