{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5EAINHJADCAKRIHABN27LZHTD6","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":"6f913eed8eef7bc8bea46172cebdcd8781e3d73793359226672c03630bef0dc0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-10T13:47:22Z","title_canon_sha256":"1e57abdfcb13263510279716982206df0a4572f94a377eb8d2ff555921077b6f"},"schema_version":"1.0","source":{"id":"1304.2959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2959","created_at":"2026-05-18T03:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2959v1","created_at":"2026-05-18T03:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2959","created_at":"2026-05-18T03:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"5EAINHJADCAK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5EAINHJADCAKRIHA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5EAINHJA","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:2176cee9c27fd4b3feacbbeacb82ecc61c95f35692cc0e2d29a1b88367faa567","target":"graph","created_at":"2026-05-18T03:28:20Z","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 consider the following problem: given that a finite automaton $M$ of $N$ states accepts at least one $k$-power-free (resp., overlap-free) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.","authors_text":"Hamoon Mousavi, Jeffrey Shallit","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-10T13:47:22Z","title":"Shortest Repetition-Free Words Accepted by Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2959","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:6d32e577ddcbedb6cd8a4d09805c201fcd3a8007ced17353652c74b3e0eefdf6","target":"record","created_at":"2026-05-18T03:28:20Z","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":"6f913eed8eef7bc8bea46172cebdcd8781e3d73793359226672c03630bef0dc0","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-10T13:47:22Z","title_canon_sha256":"1e57abdfcb13263510279716982206df0a4572f94a377eb8d2ff555921077b6f"},"schema_version":"1.0","source":{"id":"1304.2959","kind":"arxiv","version":1}},"canonical_sha256":"e900869d201880a8a0e00b75f5e4f31f9721a99baae5788e1001a3e043aff1a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e900869d201880a8a0e00b75f5e4f31f9721a99baae5788e1001a3e043aff1a1","first_computed_at":"2026-05-18T03:28:20.273853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:20.273853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0dGsMtAz1VpGsRtcjU6qVTJmRCR9y3E3Dei+c5NnZ1AumYclrvoesKX6mChy3nAY64CcWVdHRK9aaObmQM/CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:20.274469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d32e577ddcbedb6cd8a4d09805c201fcd3a8007ced17353652c74b3e0eefdf6","sha256:2176cee9c27fd4b3feacbbeacb82ecc61c95f35692cc0e2d29a1b88367faa567"],"state_sha256":"6060bbaa68398917928ca17f648c0139e858953f15cde83e5f782777e4f5df1e"}