{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GXUP3NYOG5VKF66IFV5WGMF26T","short_pith_number":"pith:GXUP3NYO","canonical_record":{"source":{"id":"1611.06840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T15:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"1a43f569f73deafdb4e04b94aa009b34aade3a8ee356ffecc6b43d43eb4c9bcb","abstract_canon_sha256":"fafb854020d1ff321840ec6cb017ccf9d696a573f6631d0fea3df520a2aa6201"},"schema_version":"1.0"},"canonical_sha256":"35e8fdb70e376aa2fbc82d7b6330baf4fc546082ee7b5c525dcc84131764dc60","source":{"kind":"arxiv","id":"1611.06840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06840","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06840v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06840","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"GXUP3NYOG5VK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GXUP3NYOG5VKF66I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GXUP3NYO","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GXUP3NYOG5VKF66IFV5WGMF26T","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T15:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"1a43f569f73deafdb4e04b94aa009b34aade3a8ee356ffecc6b43d43eb4c9bcb","abstract_canon_sha256":"fafb854020d1ff321840ec6cb017ccf9d696a573f6631d0fea3df520a2aa6201"},"schema_version":"1.0"},"canonical_sha256":"35e8fdb70e376aa2fbc82d7b6330baf4fc546082ee7b5c525dcc84131764dc60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.747196Z","signature_b64":"ZeYCwaGgvLCO2D6VzcRi4+jQL+Girs7Lo4oGPPKvwvKvO01P5nbufEK8fHzILlNaghtar7z+QyvqWCBvdghqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35e8fdb70e376aa2fbc82d7b6330baf4fc546082ee7b5c525dcc84131764dc60","last_reissued_at":"2026-05-18T00:57:32.746730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.746730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06840","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:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0UsWm3paXjHpC2WhcWs493wm24lTp45s9+xNKbgt5TMuogdiOgJOq3NILsQWy2c1GV7IGRadpoOkRVol9BeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:20:10.510150Z"},"content_sha256":"95982f9b2b9a5070e2802ab3f692c03a47e6e5039199413eec0d97525d845634","schema_version":"1.0","event_id":"sha256:95982f9b2b9a5070e2802ab3f692c03a47e6e5039199413eec0d97525d845634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GXUP3NYOG5VKF66IFV5WGMF26T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal and Reduced Reversible Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero","submitted_at":"2016-11-21T15:38:32Z","abstract_excerpt":"A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration. It is also observed that there exist reduced reversible automata which are not minimal, in the sense that all the automata obtained by merging some of their equivalent states are irreversible. Furthermore, a sufficient condition for the existence of infinitely many reduced reversible automata accepting a same language is given. It is also proved that, when th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06840","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:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfWrnFq+H2SN3sOKvGWdOJlqYGSX6KF99afw3Cg09uM1qzz4KzrHm8ynlIAfohnr8dN1yQiFfB6gEIIHHKVNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:20:10.510512Z"},"content_sha256":"d5b017237b7a743a65461a1e0bdb53f11800c5e212c8680a5334bdcda937bdf9","schema_version":"1.0","event_id":"sha256:d5b017237b7a743a65461a1e0bdb53f11800c5e212c8680a5334bdcda937bdf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXUP3NYOG5VKF66IFV5WGMF26T/bundle.json","state_url":"https://pith.science/pith/GXUP3NYOG5VKF66IFV5WGMF26T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXUP3NYOG5VKF66IFV5WGMF26T/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-24T23:20:10Z","links":{"resolver":"https://pith.science/pith/GXUP3NYOG5VKF66IFV5WGMF26T","bundle":"https://pith.science/pith/GXUP3NYOG5VKF66IFV5WGMF26T/bundle.json","state":"https://pith.science/pith/GXUP3NYOG5VKF66IFV5WGMF26T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXUP3NYOG5VKF66IFV5WGMF26T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GXUP3NYOG5VKF66IFV5WGMF26T","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":"fafb854020d1ff321840ec6cb017ccf9d696a573f6631d0fea3df520a2aa6201","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T15:38:32Z","title_canon_sha256":"1a43f569f73deafdb4e04b94aa009b34aade3a8ee356ffecc6b43d43eb4c9bcb"},"schema_version":"1.0","source":{"id":"1611.06840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06840","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06840v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06840","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"GXUP3NYOG5VK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GXUP3NYOG5VKF66I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GXUP3NYO","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:d5b017237b7a743a65461a1e0bdb53f11800c5e212c8680a5334bdcda937bdf9","target":"graph","created_at":"2026-05-18T00:57:32Z","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":"A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration. It is also observed that there exist reduced reversible automata which are not minimal, in the sense that all the automata obtained by merging some of their equivalent states are irreversible. Furthermore, a sufficient condition for the existence of infinitely many reduced reversible automata accepting a same language is given. It is also proved that, when th","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T15:38:32Z","title":"Minimal and Reduced Reversible Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06840","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:95982f9b2b9a5070e2802ab3f692c03a47e6e5039199413eec0d97525d845634","target":"record","created_at":"2026-05-18T00:57:32Z","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":"fafb854020d1ff321840ec6cb017ccf9d696a573f6631d0fea3df520a2aa6201","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T15:38:32Z","title_canon_sha256":"1a43f569f73deafdb4e04b94aa009b34aade3a8ee356ffecc6b43d43eb4c9bcb"},"schema_version":"1.0","source":{"id":"1611.06840","kind":"arxiv","version":1}},"canonical_sha256":"35e8fdb70e376aa2fbc82d7b6330baf4fc546082ee7b5c525dcc84131764dc60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35e8fdb70e376aa2fbc82d7b6330baf4fc546082ee7b5c525dcc84131764dc60","first_computed_at":"2026-05-18T00:57:32.746730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:32.746730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZeYCwaGgvLCO2D6VzcRi4+jQL+Girs7Lo4oGPPKvwvKvO01P5nbufEK8fHzILlNaghtar7z+QyvqWCBvdghqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:32.747196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95982f9b2b9a5070e2802ab3f692c03a47e6e5039199413eec0d97525d845634","sha256:d5b017237b7a743a65461a1e0bdb53f11800c5e212c8680a5334bdcda937bdf9"],"state_sha256":"a94ef007983f48bfd86701d7e746e44ef2f128a4577065ba6a9a9a6182e944ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wI202YCZnb59fN5s2iZ3Rv/hRs9e075XOsDhjndeBA/ET4v5GDEOQDPBKlvB1HWFFEeSSNRirLL4yGSoYUtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:20:10.512545Z","bundle_sha256":"e2f951e8a393e678bb66d3b891ab0ea8b495097a383c0e65311c4f017f702500"}}