{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ADYJD4RCUEZT4RSCH6JR4U6RW2","short_pith_number":"pith:ADYJD4RC","canonical_record":{"source":{"id":"1409.2003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-06T10:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"1c243342e5fbdf125e09549f59895ed0f4d272104965e7b48e01200b7d15bd15","abstract_canon_sha256":"44a44bebdd48103c13a83e2793e803f80113b199124944277b3569fce62aea24"},"schema_version":"1.0"},"canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","source":{"kind":"arxiv","id":"1409.2003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2003","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2003v1","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2003","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"ADYJD4RCUEZT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADYJD4RCUEZT4RSC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADYJD4RC","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ADYJD4RCUEZT4RSCH6JR4U6RW2","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-06T10:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"1c243342e5fbdf125e09549f59895ed0f4d272104965e7b48e01200b7d15bd15","abstract_canon_sha256":"44a44bebdd48103c13a83e2793e803f80113b199124944277b3569fce62aea24"},"schema_version":"1.0"},"canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:18.185673Z","signature_b64":"JlBUEX1fagiSdpJYy/+YkggJH6P2FULkTwHNk/wnefN5U0nLmLUREoaGCqOyYxUcY9YKF2O5g0ba+Lui8qhQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","last_reissued_at":"2026-05-18T02:43:18.185079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:18.185079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2003","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-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oas6cLTbIBTRj9f0rcwe2nhkjjulXBQNXVcgEvVHCpVQkFg79jAKCgnKksIzjGNbNEaj7VJZovZTJcUH36IIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:54.503556Z"},"content_sha256":"26c692872bec6f35d04eb3c67860c9b63144beebabb3ae6c2bae02bb4db4ddec","schema_version":"1.0","event_id":"sha256:26c692872bec6f35d04eb3c67860c9b63144beebabb3ae6c2bae02bb4db4ddec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ADYJD4RCUEZT4RSCH6JR4U6RW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Vojt\\v{e}ch Vorel","submitted_at":"2014-09-06T10:33:00Z","abstract_excerpt":"A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets, as it has been conjectured by Martyugin (2011)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2003","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-18T02:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cZ/wKhIAGXjvQuotNOE6ltQ4VrUZcHNr5Qtd2m6rJGOY3y8iztVwvofBn61lpXIEQ/G5BOfMWBajDTIvqfwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:00:54.504185Z"},"content_sha256":"85824140004fa198922b8d58b2a09e07c6154f6e76e67b85fddceab428aa028f","schema_version":"1.0","event_id":"sha256:85824140004fa198922b8d58b2a09e07c6154f6e76e67b85fddceab428aa028f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/bundle.json","state_url":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/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-25T20:00:54Z","links":{"resolver":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2","bundle":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/bundle.json","state":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ADYJD4RCUEZT4RSCH6JR4U6RW2","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":"44a44bebdd48103c13a83e2793e803f80113b199124944277b3569fce62aea24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-06T10:33:00Z","title_canon_sha256":"1c243342e5fbdf125e09549f59895ed0f4d272104965e7b48e01200b7d15bd15"},"schema_version":"1.0","source":{"id":"1409.2003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2003","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2003v1","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2003","created_at":"2026-05-18T02:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"ADYJD4RCUEZT","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"ADYJD4RCUEZT4RSC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"ADYJD4RC","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:85824140004fa198922b8d58b2a09e07c6154f6e76e67b85fddceab428aa028f","target":"graph","created_at":"2026-05-18T02:43:18Z","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 word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets, as it has been conjectured by Martyugin (2011).","authors_text":"Vojt\\v{e}ch Vorel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-06T10:33:00Z","title":"Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2003","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:26c692872bec6f35d04eb3c67860c9b63144beebabb3ae6c2bae02bb4db4ddec","target":"record","created_at":"2026-05-18T02:43:18Z","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":"44a44bebdd48103c13a83e2793e803f80113b199124944277b3569fce62aea24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-06T10:33:00Z","title_canon_sha256":"1c243342e5fbdf125e09549f59895ed0f4d272104965e7b48e01200b7d15bd15"},"schema_version":"1.0","source":{"id":"1409.2003","kind":"arxiv","version":1}},"canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","first_computed_at":"2026-05-18T02:43:18.185079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:18.185079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JlBUEX1fagiSdpJYy/+YkggJH6P2FULkTwHNk/wnefN5U0nLmLUREoaGCqOyYxUcY9YKF2O5g0ba+Lui8qhQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:18.185673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26c692872bec6f35d04eb3c67860c9b63144beebabb3ae6c2bae02bb4db4ddec","sha256:85824140004fa198922b8d58b2a09e07c6154f6e76e67b85fddceab428aa028f"],"state_sha256":"96d18fc30da7fec38628cdac3f18528fbe5ca6aec260397d334b7c4a7d2df3a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Tu8td/kX2jKieFY3bbDoHEkdvG9qWRJldH+jNLPkCa2k3YTJKNg5odfYPrVbJlULqNKc1BdurX7VluFkdWqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:00:54.507213Z","bundle_sha256":"96489ae49c7da880bc2e3cbfc5d3466a58cdac9d056365ce85dbd13c1ed9b871"}}