{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3Z534MTVSH2Q5QNIINXTO554E6","short_pith_number":"pith:3Z534MTV","schema_version":"1.0","canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","source":{"kind":"arxiv","id":"1908.03169","version":4},"attestation_state":"computed","paper":{"title":"The repetition threshold for binary rich words","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":"2019-08-08T17:02:16Z","abstract_excerpt":"A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\\sqrt{2}/2$ ($\\approx 2.707$) and conjectured that this was the least possible critical exponent for infinite binary rich words (i.e., that the repetition threshold for binary rich words is $2+\\sqrt{2}/2$). In this article, we give a structure theorem for infinite binary rich words that avoid $14/5$-powers (i.e., repetitions with exponent at least 2.8). As a consequence,"},"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":"1908.03169","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:02:16Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"da0ca07d6a11b5586af4f1c29d1eb1da2505b87894513e61f625bfdf6e469b13","abstract_canon_sha256":"db2eabafc696f5541b1a69ed275d0f72f6b6d247cfe8afbf0c918433de75e492"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:27.757480Z","signature_b64":"IkwKjmotEuOEFx7PPuRjnjyWIuEuXcpqm9PCK1XddOoK2kUB3i/qFHdv2fB1Og81zNqRYUH3Roa8w5JE+YMrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","last_reissued_at":"2026-07-05T06:23:27.757062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:27.757062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The repetition threshold for binary rich words","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":"2019-08-08T17:02:16Z","abstract_excerpt":"A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\\sqrt{2}/2$ ($\\approx 2.707$) and conjectured that this was the least possible critical exponent for infinite binary rich words (i.e., that the repetition threshold for binary rich words is $2+\\sqrt{2}/2$). In this article, we give a structure theorem for infinite binary rich words that avoid $14/5$-powers (i.e., repetitions with exponent at least 2.8). As a consequence,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03169","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03169/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.03169","created_at":"2026-07-05T06:23:27.757124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03169v4","created_at":"2026-07-05T06:23:27.757124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03169","created_at":"2026-07-05T06:23:27.757124+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z534MTVSH2Q","created_at":"2026-07-05T06:23:27.757124+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z534MTVSH2Q5QNI","created_at":"2026-07-05T06:23:27.757124+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z534MTV","created_at":"2026-07-05T06:23:27.757124+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/3Z534MTVSH2Q5QNIINXTO554E6","json":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6.json","graph_json":"https://pith.science/api/pith-number/3Z534MTVSH2Q5QNIINXTO554E6/graph.json","events_json":"https://pith.science/api/pith-number/3Z534MTVSH2Q5QNIINXTO554E6/events.json","paper":"https://pith.science/paper/3Z534MTV"},"agent_actions":{"view_html":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6","download_json":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6.json","view_paper":"https://pith.science/paper/3Z534MTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03169&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z534MTVSH2Q5QNIINXTO554E6/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z534MTVSH2Q5QNIINXTO554E6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/action/storage_attestation","attest_author":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/action/author_attestation","sign_citation":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/action/citation_signature","submit_replication":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/action/replication_record"}},"created_at":"2026-07-05T06:23:27.757124+00:00","updated_at":"2026-07-05T06:23:27.757124+00:00"}