{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","short_pith_number":"pith:FFUXJBQY","schema_version":"1.0","canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","source":{"kind":"arxiv","id":"2605.14955","version":1},"attestation_state":"computed","paper":{"title":"On the Number of Rational Power Factors in a Finite Word","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuo Li, Yuan Song","submitted_at":"2026-05-14T15:25:12Z","abstract_excerpt":"Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \\leq \\frac{n-1}{k-1}$. However, the number of rational powers "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"545ca7762cf22780b4c63214f1a170e3084563afd35d3bf9cd43fee7aa11522d","abstract_canon_sha256":"0497009d330b50d64027c48d200f5730c050bec7ae07c732a07084156597926a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:55.348091Z","signature_b64":"C6+KigHowZOWL+IKG3v28rKOFRP+G12Of/lLcLdqdeMz8PaZYm33dBZIck1bKGLDDZ/QUPAnDZHggpcx04ELCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","last_reissued_at":"2026-05-17T23:38:55.347424Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:55.347424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Rational Power Factors in a Finite Word","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuo Li, Yuan Song","submitted_at":"2026-05-14T15:25:12Z","abstract_excerpt":"Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \\leq \\frac{n-1}{k-1}$. However, the number of rational powers "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2686e557d667dcac9deb38302826e272676179f45207459c1c443a1a037ab342"},"source":{"id":"2605.14955","kind":"arxiv","version":1},"verdict":{"id":"e62748b8-27d7-479d-9466-8c33f3d610bb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:16:04.714835Z","strongest_claim":"we prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)","one_line_summary":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting.","pith_extraction_headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors."},"references":{"count":171,"sample":[{"doi":"10.1007/11505877","year":2005,"title":"Bidimensional Sturmian Sequences and Substitutions , Url =","work_id":"4c604755-5bac-4c9d-9351-bc5fbb83acf9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ali Aberkane and Sre. Suites de m. Actes des Journ","work_id":"f5c8d6ba-180a-47a2-81bf-7069517c72a2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Reversals and palindromes in continued fractions , Volume =","work_id":"9d118cc7-1114-465e-a844-ddaf5d56ea29","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Palindromic continued fractions , Volume =","work_id":"94d436de-3abc-4567-931f-e51d48ea64e4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"On Repeated Factors in","work_id":"220afaf3-514b-49e3-8b9d-52e920c56992","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":171,"snapshot_sha256":"f68cfcb3e4ddd595b3d5c3fe85411d054164406cef677b462a8c42948bed8dde","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"be8a7ec1f6272b1c3d768562fd5e1281e4894ce581d34910b1519cf2001ac1ca"},"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":"2605.14955","created_at":"2026-05-17T23:38:55.347539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14955v1","created_at":"2026-05-17T23:38:55.347539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14955","created_at":"2026-05-17T23:38:55.347539+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFUXJBQYJ5EN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFUXJBQYJ5EN5LXG","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFUXJBQY","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG","json":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG.json","graph_json":"https://pith.science/api/pith-number/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/graph.json","events_json":"https://pith.science/api/pith-number/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/events.json","paper":"https://pith.science/paper/FFUXJBQY"},"agent_actions":{"view_html":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG","download_json":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG.json","view_paper":"https://pith.science/paper/FFUXJBQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14955&json=true","fetch_graph":"https://pith.science/api/pith-number/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/graph.json","fetch_events":"https://pith.science/api/pith-number/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/action/storage_attestation","attest_author":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/action/author_attestation","sign_citation":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/action/citation_signature","submit_replication":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/action/replication_record"}},"created_at":"2026-05-17T23:38:55.347539+00:00","updated_at":"2026-05-17T23:38:55.347539+00:00"}