{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ADYJD4RCUEZT4RSCH6JR4U6RW2","short_pith_number":"pith:ADYJD4RC","schema_version":"1.0","canonical_sha256":"00f091f222a1333e46423f931e53d1b6af69d211fe325d76b4385aaa7ca60b99","source":{"kind":"arxiv","id":"1409.2003","version":1},"attestation_state":"computed","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)."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.2003","created_at":"2026-05-18T02:43:18.185168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2003v1","created_at":"2026-05-18T02:43:18.185168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2003","created_at":"2026-05-18T02:43:18.185168+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADYJD4RCUEZT","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADYJD4RCUEZT4RSC","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADYJD4RC","created_at":"2026-05-18T12:28:19.803747+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/ADYJD4RCUEZT4RSCH6JR4U6RW2","json":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2.json","graph_json":"https://pith.science/api/pith-number/ADYJD4RCUEZT4RSCH6JR4U6RW2/graph.json","events_json":"https://pith.science/api/pith-number/ADYJD4RCUEZT4RSCH6JR4U6RW2/events.json","paper":"https://pith.science/paper/ADYJD4RC"},"agent_actions":{"view_html":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2","download_json":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2.json","view_paper":"https://pith.science/paper/ADYJD4RC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2003&json=true","fetch_graph":"https://pith.science/api/pith-number/ADYJD4RCUEZT4RSCH6JR4U6RW2/graph.json","fetch_events":"https://pith.science/api/pith-number/ADYJD4RCUEZT4RSCH6JR4U6RW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/action/storage_attestation","attest_author":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/action/author_attestation","sign_citation":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/action/citation_signature","submit_replication":"https://pith.science/pith/ADYJD4RCUEZT4RSCH6JR4U6RW2/action/replication_record"}},"created_at":"2026-05-18T02:43:18.185168+00:00","updated_at":"2026-05-18T02:43:18.185168+00:00"}