{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L4H6B5MRLPMEO3PXRNXAH6NI5T","short_pith_number":"pith:L4H6B5MR","schema_version":"1.0","canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","source":{"kind":"arxiv","id":"1708.06465","version":1},"attestation_state":"computed","paper":{"title":"Weakly and Strongly Irreversible Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado (Dipartimento di Informatica, Giovanni Pighizzini (Dipartimento di Informatica, Luca Prigioniero (Dipartimento di Informatica, Universit\\`a degli Studi di Milano)","submitted_at":"2017-08-22T00:50:39Z","abstract_excerpt":"Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages, respectively. The existence of k-reversible languages which are not (k-1)-reversible is known, for each k>1. This gives an infinite hierarchy of weakly irreversible languages, i.e., languages which are k-reversible for some k. Conditions characterizing the class of k-reversible languages, for each fixed k, and the class of weakly irreversible lan"},"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":"1708.06465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:50:39Z","cross_cats_sorted":[],"title_canon_sha256":"5ae580a56d0406975fda68b660cea5553509bd696f1c9d2407f078f092240921","abstract_canon_sha256":"8d1fb5d377bca04def2c490644d0f99e236771f512ad0c12a0ec6be2ceafccdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.406407Z","signature_b64":"nE/UeQjZjbgolcJG1mijcJ9q/3CbDUk/IftLF59dvAEzMzxqM6CMXals8F3WLaOLS4NgSlavhdMQl6qbqpCVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","last_reissued_at":"2026-05-18T00:37:41.405634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.405634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weakly and Strongly Irreversible Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado (Dipartimento di Informatica, Giovanni Pighizzini (Dipartimento di Informatica, Luca Prigioniero (Dipartimento di Informatica, Universit\\`a degli Studi di Milano)","submitted_at":"2017-08-22T00:50:39Z","abstract_excerpt":"Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages, respectively. The existence of k-reversible languages which are not (k-1)-reversible is known, for each k>1. This gives an infinite hierarchy of weakly irreversible languages, i.e., languages which are k-reversible for some k. Conditions characterizing the class of k-reversible languages, for each fixed k, and the class of weakly irreversible lan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06465","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":""},"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":"1708.06465","created_at":"2026-05-18T00:37:41.405736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06465v1","created_at":"2026-05-18T00:37:41.405736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06465","created_at":"2026-05-18T00:37:41.405736+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4H6B5MRLPME","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4H6B5MRLPMEO3PX","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4H6B5MR","created_at":"2026-05-18T12:31:28.150371+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/L4H6B5MRLPMEO3PXRNXAH6NI5T","json":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T.json","graph_json":"https://pith.science/api/pith-number/L4H6B5MRLPMEO3PXRNXAH6NI5T/graph.json","events_json":"https://pith.science/api/pith-number/L4H6B5MRLPMEO3PXRNXAH6NI5T/events.json","paper":"https://pith.science/paper/L4H6B5MR"},"agent_actions":{"view_html":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T","download_json":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T.json","view_paper":"https://pith.science/paper/L4H6B5MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06465&json=true","fetch_graph":"https://pith.science/api/pith-number/L4H6B5MRLPMEO3PXRNXAH6NI5T/graph.json","fetch_events":"https://pith.science/api/pith-number/L4H6B5MRLPMEO3PXRNXAH6NI5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/action/storage_attestation","attest_author":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/action/author_attestation","sign_citation":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/action/citation_signature","submit_replication":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/action/replication_record"}},"created_at":"2026-05-18T00:37:41.405736+00:00","updated_at":"2026-05-18T00:37:41.405736+00:00"}