{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:L6QBSMQYBK3FQVJ5DWOSUZF2B4","short_pith_number":"pith:L6QBSMQY","schema_version":"1.0","canonical_sha256":"5fa01932180ab658553d1d9d2a64ba0f301c02f4fa5e6882fda89aa0da208882","source":{"kind":"arxiv","id":"1105.3116","version":1},"attestation_state":"computed","paper":{"title":"On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Michael Rao, Roman Kolpakov","submitted_at":"2011-05-16T15:06:26Z","abstract_excerpt":"We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0,005. As an consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10."},"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":"1105.3116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-16T15:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"9cacfda88313a0a2dcd3325e87a9a0db3573bfa9b8d168850916797d1a74fcf1","abstract_canon_sha256":"25914f2a49eb86ff85f58ab3b13d9a45d514f04be9979d6860846976fd0b5f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:01.379787Z","signature_b64":"7Q4p2nasm9BYbpk4EiVeJnJUDl3XuklRMDx3Mg+WNN0LUy3Buku5g/xOzrf0ANvHqoeW6mtDnMzc8DYQrBrtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa01932180ab658553d1d9d2a64ba0f301c02f4fa5e6882fda89aa0da208882","last_reissued_at":"2026-05-18T04:22:01.379380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:01.379380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Michael Rao, Roman Kolpakov","submitted_at":"2011-05-16T15:06:26Z","abstract_excerpt":"We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0,005. As an consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for k=5, 6, 7, 8, 9, 10."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3116","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":"1105.3116","created_at":"2026-05-18T04:22:01.379442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3116v1","created_at":"2026-05-18T04:22:01.379442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3116","created_at":"2026-05-18T04:22:01.379442+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6QBSMQYBK3F","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6QBSMQYBK3FQVJ5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6QBSMQY","created_at":"2026-05-18T12:26:34.985390+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/L6QBSMQYBK3FQVJ5DWOSUZF2B4","json":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4.json","graph_json":"https://pith.science/api/pith-number/L6QBSMQYBK3FQVJ5DWOSUZF2B4/graph.json","events_json":"https://pith.science/api/pith-number/L6QBSMQYBK3FQVJ5DWOSUZF2B4/events.json","paper":"https://pith.science/paper/L6QBSMQY"},"agent_actions":{"view_html":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4","download_json":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4.json","view_paper":"https://pith.science/paper/L6QBSMQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3116&json=true","fetch_graph":"https://pith.science/api/pith-number/L6QBSMQYBK3FQVJ5DWOSUZF2B4/graph.json","fetch_events":"https://pith.science/api/pith-number/L6QBSMQYBK3FQVJ5DWOSUZF2B4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4/action/storage_attestation","attest_author":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4/action/author_attestation","sign_citation":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4/action/citation_signature","submit_replication":"https://pith.science/pith/L6QBSMQYBK3FQVJ5DWOSUZF2B4/action/replication_record"}},"created_at":"2026-05-18T04:22:01.379442+00:00","updated_at":"2026-05-18T04:22:01.379442+00:00"}