{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L4H6B5MRLPMEO3PXRNXAH6NI5T","short_pith_number":"pith:L4H6B5MR","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"},"canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","source":{"kind":"arxiv","id":"1708.06465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06465","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06465v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06465","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"L4H6B5MRLPME","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L4H6B5MRLPMEO3PX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L4H6B5MR","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L4H6B5MRLPMEO3PXRNXAH6NI5T","target":"record","payload":{"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"},"canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","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"},"source_kind":"arxiv","source_id":"1708.06465","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pZ9LAdPuUALItlqtPOheBL4I2Iivy05agjaXFO2iTNRwbEojuu9tPDAZRNitut5z9G852F8IUjTnDAIGTawBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:52:23.078846Z"},"content_sha256":"f0d98748fbcf7aac4400cdccd1e0e93fcfd5f63c8719cfe5d2078e6d8f3b9d40","schema_version":"1.0","event_id":"sha256:f0d98748fbcf7aac4400cdccd1e0e93fcfd5f63c8719cfe5d2078e6d8f3b9d40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L4H6B5MRLPMEO3PXRNXAH6NI5T","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goMSiUPp8kcwwA876H/pVIQ9yYVT6Vstl04z8Se9H9CFa9jdCGuN1XCwJ1tsyvQBRYyQmd81XQojIBTMo9Z/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:52:23.079197Z"},"content_sha256":"859a549a348c22debb4c812ac078a7138407e41b830f3e2c46cdbe6e06f6a981","schema_version":"1.0","event_id":"sha256:859a549a348c22debb4c812ac078a7138407e41b830f3e2c46cdbe6e06f6a981"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/bundle.json","state_url":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:52:23Z","links":{"resolver":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T","bundle":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/bundle.json","state":"https://pith.science/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4H6B5MRLPMEO3PXRNXAH6NI5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L4H6B5MRLPMEO3PXRNXAH6NI5T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d1fb5d377bca04def2c490644d0f99e236771f512ad0c12a0ec6be2ceafccdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:50:39Z","title_canon_sha256":"5ae580a56d0406975fda68b660cea5553509bd696f1c9d2407f078f092240921"},"schema_version":"1.0","source":{"id":"1708.06465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06465","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06465v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06465","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"L4H6B5MRLPME","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L4H6B5MRLPMEO3PX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L4H6B5MR","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:859a549a348c22debb4c812ac078a7138407e41b830f3e2c46cdbe6e06f6a981","target":"graph","created_at":"2026-05-18T00:37:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Giovanna J. Lavado (Dipartimento di Informatica, Giovanni Pighizzini (Dipartimento di Informatica, Luca Prigioniero (Dipartimento di Informatica, Universit\\`a degli Studi di Milano)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:50:39Z","title":"Weakly and Strongly Irreversible Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06465","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f0d98748fbcf7aac4400cdccd1e0e93fcfd5f63c8719cfe5d2078e6d8f3b9d40","target":"record","created_at":"2026-05-18T00:37:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d1fb5d377bca04def2c490644d0f99e236771f512ad0c12a0ec6be2ceafccdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:50:39Z","title_canon_sha256":"5ae580a56d0406975fda68b660cea5553509bd696f1c9d2407f078f092240921"},"schema_version":"1.0","source":{"id":"1708.06465","kind":"arxiv","version":1}},"canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0fe0f5915bd8476df78b6e03f9a8ecfd542b5839ee858c2ff5621182737737","first_computed_at":"2026-05-18T00:37:41.405634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.405634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nE/UeQjZjbgolcJG1mijcJ9q/3CbDUk/IftLF59dvAEzMzxqM6CMXals8F3WLaOLS4NgSlavhdMQl6qbqpCVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.406407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0d98748fbcf7aac4400cdccd1e0e93fcfd5f63c8719cfe5d2078e6d8f3b9d40","sha256:859a549a348c22debb4c812ac078a7138407e41b830f3e2c46cdbe6e06f6a981"],"state_sha256":"e26961c41265e3eb99390d5ce809659a6168f2f7917ea8b5115caf3701a74324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+6Qj5zO8cKN7gKGskmx3cMe5xwakY6jiKD/8J9Ey+AgOZ/2Gw2oWEYyeU5bqUYX329pSeh4LMfSPkul1wU7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:52:23.081128Z","bundle_sha256":"2c564e43934480091ed6a4b15a8f06b0e3d8734e16e7001ddc6f843fd38f93b2"}}