{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7OWWICQLCE6SWWVER2CJGMJH54","short_pith_number":"pith:7OWWICQL","schema_version":"1.0","canonical_sha256":"fbad640a0b113d2b5aa48e84933127ef11fd994480afca528922f0ec90547c10","source":{"kind":"arxiv","id":"2411.14538","version":1},"attestation_state":"computed","paper":{"title":"A hierarchy of reversible finite automata","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Okhotin, Maria Radionova","submitted_at":"2024-11-21T19:10:08Z","abstract_excerpt":"In this paper, different variants of reversible finite automata are compared, and their hierarchy by the expressive power is established. It is shown that one-way reversible automata with multiple initial states (MRFA) recognize strictly more languages than sweeping reversible automata (sRFA), which are in turn stronger than one-way reversible automata with a single initial state (1RFA). The latter recognize strictly more languages than one-way permutation automata (1PerFA). It is also shown that the hierarchy of sRFA by the number of passes over the input string collapses: it turns out that t"},"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":"2411.14538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.FL","submitted_at":"2024-11-21T19:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"2232d0d17b3757695bcd0485775f4a06517d453bb255afd61b8a0989b1555a3f","abstract_canon_sha256":"8ca85a711bc3f6af98d4c0cbd21117b006c1aea722f681976b773b9c19544c04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:52.898072Z","signature_b64":"TVa62WuLz67YJ4uGUVfqtxv9nRtHls2C92pUyVpczfy110lsnx24LeTLZEqjJUKrxagZ/AQwRhh761xGwyhYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbad640a0b113d2b5aa48e84933127ef11fd994480afca528922f0ec90547c10","last_reissued_at":"2026-07-05T09:38:52.897654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:52.897654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hierarchy of reversible finite automata","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Okhotin, Maria Radionova","submitted_at":"2024-11-21T19:10:08Z","abstract_excerpt":"In this paper, different variants of reversible finite automata are compared, and their hierarchy by the expressive power is established. It is shown that one-way reversible automata with multiple initial states (MRFA) recognize strictly more languages than sweeping reversible automata (sRFA), which are in turn stronger than one-way reversible automata with a single initial state (1RFA). The latter recognize strictly more languages than one-way permutation automata (1PerFA). It is also shown that the hierarchy of sRFA by the number of passes over the input string collapses: it turns out that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14538","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/2411.14538/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":"2411.14538","created_at":"2026-07-05T09:38:52.897711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14538v1","created_at":"2026-07-05T09:38:52.897711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14538","created_at":"2026-07-05T09:38:52.897711+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OWWICQLCE6S","created_at":"2026-07-05T09:38:52.897711+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OWWICQLCE6SWWVE","created_at":"2026-07-05T09:38:52.897711+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OWWICQL","created_at":"2026-07-05T09:38:52.897711+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/7OWWICQLCE6SWWVER2CJGMJH54","json":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54.json","graph_json":"https://pith.science/api/pith-number/7OWWICQLCE6SWWVER2CJGMJH54/graph.json","events_json":"https://pith.science/api/pith-number/7OWWICQLCE6SWWVER2CJGMJH54/events.json","paper":"https://pith.science/paper/7OWWICQL"},"agent_actions":{"view_html":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54","download_json":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54.json","view_paper":"https://pith.science/paper/7OWWICQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14538&json=true","fetch_graph":"https://pith.science/api/pith-number/7OWWICQLCE6SWWVER2CJGMJH54/graph.json","fetch_events":"https://pith.science/api/pith-number/7OWWICQLCE6SWWVER2CJGMJH54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54/action/storage_attestation","attest_author":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54/action/author_attestation","sign_citation":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54/action/citation_signature","submit_replication":"https://pith.science/pith/7OWWICQLCE6SWWVER2CJGMJH54/action/replication_record"}},"created_at":"2026-07-05T09:38:52.897711+00:00","updated_at":"2026-07-05T09:38:52.897711+00:00"}