{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PCURYRZXRLDFEXKDWBEXJDM3C2","short_pith_number":"pith:PCURYRZX","canonical_record":{"source":{"id":"1004.3246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"46509df29906a115b4ef9bf7bfc329219164c394849ebb93b95c6578133c1cd7","abstract_canon_sha256":"a30ef90d86efa8fdc45ff5abab4b5e10676e3cf47f6717802841cec69c9c95fe"},"schema_version":"1.0"},"canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","source":{"kind":"arxiv","id":"1004.3246","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3246","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3246v2","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3246","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"PCURYRZXRLDF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PCURYRZXRLDFEXKD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PCURYRZX","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PCURYRZXRLDFEXKDWBEXJDM3C2","target":"record","payload":{"canonical_record":{"source":{"id":"1004.3246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"46509df29906a115b4ef9bf7bfc329219164c394849ebb93b95c6578133c1cd7","abstract_canon_sha256":"a30ef90d86efa8fdc45ff5abab4b5e10676e3cf47f6717802841cec69c9c95fe"},"schema_version":"1.0"},"canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:21.706552Z","signature_b64":"1cqSRFXO6a/mFU1qSYuTAg8fOQoXTg/8bchHjjBO0Bhl3SRpmTcY6myUOtDRnOxjhIImUyFm83Y/LlL0Gd8UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","last_reissued_at":"2026-05-18T04:28:21.706103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:21.706103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.3246","source_version":2,"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-18T04:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EYFgMgbYV+/kib0UgLupbsxj5Fl+oCkUPEZNY0Gy09kJcytIbGOuVorIU+ud2Paawj3loDFDA8oPCnqWh2ZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:34:30.970903Z"},"content_sha256":"89c8bf32d49648e3959877a374f3fb1203f6e390acf65671757829736c3d971d","schema_version":"1.0","event_id":"sha256:89c8bf32d49648e3959877a374f3fb1203f6e390acf65671757829736c3d971d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PCURYRZXRLDFEXKDWBEXJDM3C2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Finding Reset Words in Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"J\\\"org Olschewski, Michael Ummels","submitted_at":"2010-04-19T16:27:03Z","abstract_excerpt":"We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3246","kind":"arxiv","version":2},"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-18T04:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQgDQI+7f0wMiS17Ot/CPOAU2j0eL/GL4dprL0gX5YbmA+fmEKMnULuMuKm8INQM0VsZjpET5I6qx59a1MDBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:34:30.971684Z"},"content_sha256":"9c52a48ba5fd6956410eb4efcee5f6e1aa65e2b6383ab31e54cb82d3a82c58b2","schema_version":"1.0","event_id":"sha256:9c52a48ba5fd6956410eb4efcee5f6e1aa65e2b6383ab31e54cb82d3a82c58b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/bundle.json","state_url":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/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-11T17:34:30Z","links":{"resolver":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2","bundle":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/bundle.json","state":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PCURYRZXRLDFEXKDWBEXJDM3C2","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":"a30ef90d86efa8fdc45ff5abab4b5e10676e3cf47f6717802841cec69c9c95fe","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","title_canon_sha256":"46509df29906a115b4ef9bf7bfc329219164c394849ebb93b95c6578133c1cd7"},"schema_version":"1.0","source":{"id":"1004.3246","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3246","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3246v2","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3246","created_at":"2026-05-18T04:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"PCURYRZXRLDF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PCURYRZXRLDFEXKD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PCURYRZX","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:9c52a48ba5fd6956410eb4efcee5f6e1aa65e2b6383ab31e54cb82d3a82c58b2","target":"graph","created_at":"2026-05-18T04:28:21Z","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":"We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is","authors_text":"J\\\"org Olschewski, Michael Ummels","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","title":"The Complexity of Finding Reset Words in Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3246","kind":"arxiv","version":2},"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:89c8bf32d49648e3959877a374f3fb1203f6e390acf65671757829736c3d971d","target":"record","created_at":"2026-05-18T04:28:21Z","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":"a30ef90d86efa8fdc45ff5abab4b5e10676e3cf47f6717802841cec69c9c95fe","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","title_canon_sha256":"46509df29906a115b4ef9bf7bfc329219164c394849ebb93b95c6578133c1cd7"},"schema_version":"1.0","source":{"id":"1004.3246","kind":"arxiv","version":2}},"canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","first_computed_at":"2026-05-18T04:28:21.706103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:21.706103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1cqSRFXO6a/mFU1qSYuTAg8fOQoXTg/8bchHjjBO0Bhl3SRpmTcY6myUOtDRnOxjhIImUyFm83Y/LlL0Gd8UAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:21.706552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3246","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89c8bf32d49648e3959877a374f3fb1203f6e390acf65671757829736c3d971d","sha256:9c52a48ba5fd6956410eb4efcee5f6e1aa65e2b6383ab31e54cb82d3a82c58b2"],"state_sha256":"c3dafa54ff63e067434e245e9fad9a7536544f9ffe1e322ba1c4cfe66490c796"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4r5rVstY5lqGn8gIlmMMhfsfXRUQ42CM9kjQMOo0qQd/cAJXaHKoJCpIzYDO7ge+wuv35rzO6Ph+bG/fXG4BDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:34:30.976300Z","bundle_sha256":"834a45826e6c1e8bcc333d1d2e6a8a348b2eae9a6626336d725c1b5f2b237493"}}