{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ADAJTY6RO4E5DEDSXYOUXEDUB4","short_pith_number":"pith:ADAJTY6R","schema_version":"1.0","canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","source":{"kind":"arxiv","id":"1207.5723","version":1},"attestation_state":"computed","paper":{"title":"Fewest repetitions in infinite binary words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Golnaz Badkobeh, Maxime Crochemore","submitted_at":"2012-07-24T15:20:47Z","abstract_excerpt":"A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period.\n  In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 "},"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":"1207.5723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"e73db3e48f65b5bca7ef3bf3df783dc939f4971483c9fc8ce41c16e34635dbe3","abstract_canon_sha256":"c395004962bb7e89c98e6b03b89f80e119aab5088f30a6fbcc2cc367eba09e0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.496418Z","signature_b64":"xh/X4Pefcn7+Dw0F0L9AZf/7CvDWWFzy8eWEfLqpnp66bFAuv+E4IL0890SzjtDbi13V1D7E4ElEJUopb/ZvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","last_reissued_at":"2026-05-18T03:50:11.495588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.495588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fewest repetitions in infinite binary words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Golnaz Badkobeh, Maxime Crochemore","submitted_at":"2012-07-24T15:20:47Z","abstract_excerpt":"A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period.\n  In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5723","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":"1207.5723","created_at":"2026-05-18T03:50:11.495718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5723v1","created_at":"2026-05-18T03:50:11.495718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5723","created_at":"2026-05-18T03:50:11.495718+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADAJTY6RO4E5","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADAJTY6RO4E5DEDS","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADAJTY6R","created_at":"2026-05-18T12:26:58.693483+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/ADAJTY6RO4E5DEDSXYOUXEDUB4","json":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4.json","graph_json":"https://pith.science/api/pith-number/ADAJTY6RO4E5DEDSXYOUXEDUB4/graph.json","events_json":"https://pith.science/api/pith-number/ADAJTY6RO4E5DEDSXYOUXEDUB4/events.json","paper":"https://pith.science/paper/ADAJTY6R"},"agent_actions":{"view_html":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4","download_json":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4.json","view_paper":"https://pith.science/paper/ADAJTY6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5723&json=true","fetch_graph":"https://pith.science/api/pith-number/ADAJTY6RO4E5DEDSXYOUXEDUB4/graph.json","fetch_events":"https://pith.science/api/pith-number/ADAJTY6RO4E5DEDSXYOUXEDUB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/action/storage_attestation","attest_author":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/action/author_attestation","sign_citation":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/action/citation_signature","submit_replication":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/action/replication_record"}},"created_at":"2026-05-18T03:50:11.495718+00:00","updated_at":"2026-05-18T03:50:11.495718+00:00"}