{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5EAINHJADCAKRIHABN27LZHTD6","short_pith_number":"pith:5EAINHJA","schema_version":"1.0","canonical_sha256":"e900869d201880a8a0e00b75f5e4f31f9721a99baae5788e1001a3e043aff1a1","source":{"kind":"arxiv","id":"1304.2959","version":1},"attestation_state":"computed","paper":{"title":"Shortest Repetition-Free Words Accepted by Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2013-04-10T13:47:22Z","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."},"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":"1304.2959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-10T13:47:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1e57abdfcb13263510279716982206df0a4572f94a377eb8d2ff555921077b6f","abstract_canon_sha256":"6f913eed8eef7bc8bea46172cebdcd8781e3d73793359226672c03630bef0dc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:20.274469Z","signature_b64":"W0dGsMtAz1VpGsRtcjU6qVTJmRCR9y3E3Dei+c5NnZ1AumYclrvoesKX6mChy3nAY64CcWVdHRK9aaObmQM/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e900869d201880a8a0e00b75f5e4f31f9721a99baae5788e1001a3e043aff1a1","last_reissued_at":"2026-05-18T03:28:20.273853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:20.273853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Repetition-Free Words Accepted by Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2013-04-10T13:47:22Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2959","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":"1304.2959","created_at":"2026-05-18T03:28:20.273942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2959v1","created_at":"2026-05-18T03:28:20.273942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2959","created_at":"2026-05-18T03:28:20.273942+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EAINHJADCAK","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EAINHJADCAKRIHA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EAINHJA","created_at":"2026-05-18T12:27:34.582898+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/5EAINHJADCAKRIHABN27LZHTD6","json":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6.json","graph_json":"https://pith.science/api/pith-number/5EAINHJADCAKRIHABN27LZHTD6/graph.json","events_json":"https://pith.science/api/pith-number/5EAINHJADCAKRIHABN27LZHTD6/events.json","paper":"https://pith.science/paper/5EAINHJA"},"agent_actions":{"view_html":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6","download_json":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6.json","view_paper":"https://pith.science/paper/5EAINHJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2959&json=true","fetch_graph":"https://pith.science/api/pith-number/5EAINHJADCAKRIHABN27LZHTD6/graph.json","fetch_events":"https://pith.science/api/pith-number/5EAINHJADCAKRIHABN27LZHTD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6/action/storage_attestation","attest_author":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6/action/author_attestation","sign_citation":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6/action/citation_signature","submit_replication":"https://pith.science/pith/5EAINHJADCAKRIHABN27LZHTD6/action/replication_record"}},"created_at":"2026-05-18T03:28:20.273942+00:00","updated_at":"2026-05-18T03:28:20.273942+00:00"}