{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7B3OWV7DQK66L5AXXQEOEBH773","short_pith_number":"pith:7B3OWV7D","schema_version":"1.0","canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","source":{"kind":"arxiv","id":"1803.08145","version":2},"attestation_state":"computed","paper":{"title":"Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"James D. Currie, Lucas Mol, Narad Rampersad","submitted_at":"2018-03-21T21:43:53Z","abstract_excerpt":"A word is called $\\beta$-free if it has no factors of exponent greater than or equal to $\\beta$. The repetition threshold $\\mathrm{RT}(k)$ is the infimum of the set of all $\\beta$ such that there are arbitrarily long $k$-ary $\\beta$-free words (or equivalently, there are $k$-ary $\\beta$-free words of every sufficiently large length, or even every length). These three equivalent definitions of the repetition threshold give rise to three natural definitions of a repetition threshold for circular words. The infimum of the set of all $\\beta$ such that\n  - there are arbitrarily long $k$-ary $\\beta$"},"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":"1803.08145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1b893cee9c27763bd2cec2a1dec5c4a0653e10f280d1a473fdc83e3c18d7dabf","abstract_canon_sha256":"7ceb4ca526ed7dce8c6ee3608c0c33a96a50b4edcc651a5722fd91c0ce0cf8a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.794238Z","signature_b64":"tqvITRe5ZL5ONEhT3GujxD1Zm8fibeFNnWIer/NVZR2bHzXe52JA3VNnp8N+WBnTfelKwSEayudPk9Cy9FwGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","last_reissued_at":"2026-05-18T00:04:07.793632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.793632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"James D. Currie, Lucas Mol, Narad Rampersad","submitted_at":"2018-03-21T21:43:53Z","abstract_excerpt":"A word is called $\\beta$-free if it has no factors of exponent greater than or equal to $\\beta$. The repetition threshold $\\mathrm{RT}(k)$ is the infimum of the set of all $\\beta$ such that there are arbitrarily long $k$-ary $\\beta$-free words (or equivalently, there are $k$-ary $\\beta$-free words of every sufficiently large length, or even every length). These three equivalent definitions of the repetition threshold give rise to three natural definitions of a repetition threshold for circular words. The infimum of the set of all $\\beta$ such that\n  - there are arbitrarily long $k$-ary $\\beta$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08145","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.08145","created_at":"2026-05-18T00:04:07.793734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08145v2","created_at":"2026-05-18T00:04:07.793734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08145","created_at":"2026-05-18T00:04:07.793734+00:00"},{"alias_kind":"pith_short_12","alias_value":"7B3OWV7DQK66","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7B3OWV7DQK66L5AX","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7B3OWV7D","created_at":"2026-05-18T12:32:11.075285+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/7B3OWV7DQK66L5AXXQEOEBH773","json":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773.json","graph_json":"https://pith.science/api/pith-number/7B3OWV7DQK66L5AXXQEOEBH773/graph.json","events_json":"https://pith.science/api/pith-number/7B3OWV7DQK66L5AXXQEOEBH773/events.json","paper":"https://pith.science/paper/7B3OWV7D"},"agent_actions":{"view_html":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773","download_json":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773.json","view_paper":"https://pith.science/paper/7B3OWV7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08145&json=true","fetch_graph":"https://pith.science/api/pith-number/7B3OWV7DQK66L5AXXQEOEBH773/graph.json","fetch_events":"https://pith.science/api/pith-number/7B3OWV7DQK66L5AXXQEOEBH773/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/action/storage_attestation","attest_author":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/action/author_attestation","sign_citation":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/action/citation_signature","submit_replication":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/action/replication_record"}},"created_at":"2026-05-18T00:04:07.793734+00:00","updated_at":"2026-05-18T00:04:07.793734+00:00"}