{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EWYWT6F5JWO7WD3AKOYQVSMUXI","short_pith_number":"pith:EWYWT6F5","schema_version":"1.0","canonical_sha256":"25b169f8bd4d9dfb0f6053b10ac994ba19ff30ab53cb4ec508c9370c4956cb28","source":{"kind":"arxiv","id":"1212.0052","version":3},"attestation_state":"computed","paper":{"title":"Repetition Avoidance in Circular Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2012-12-01T01:35:53Z","abstract_excerpt":"We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered as a \"circular word\", i.e., the end of the word wraps around to the beginning. We determine the best possible avoidance exponent for alphabet size 2 and 3, and provide a lower bound for larger alphabets."},"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":"1212.0052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-01T01:35:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5c0ad7d473b470f30fd326fef32d1e329028832d22f2cd5c7dd4d8abcb1c14d0","abstract_canon_sha256":"a870f3617f72353a1909ed6df9fdbf6d3355f364b75ad2efebcd0d440f736647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:41.322910Z","signature_b64":"UOzdZOVlJyk3JfTIhIeg8s7BnSIImFSsUBFSOj34fmHV1RuLSQINIwqOXIf3YuoXSEpuyFAOZV6yEZQ1A3A3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b169f8bd4d9dfb0f6053b10ac994ba19ff30ab53cb4ec508c9370c4956cb28","last_reissued_at":"2026-05-18T03:30:41.322002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:41.322002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repetition Avoidance in Circular Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Hamoon Mousavi, Jeffrey Shallit","submitted_at":"2012-12-01T01:35:53Z","abstract_excerpt":"We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered as a \"circular word\", i.e., the end of the word wraps around to the beginning. We determine the best possible avoidance exponent for alphabet size 2 and 3, and provide a lower bound for larger alphabets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0052","kind":"arxiv","version":3},"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":"1212.0052","created_at":"2026-05-18T03:30:41.322178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0052v3","created_at":"2026-05-18T03:30:41.322178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0052","created_at":"2026-05-18T03:30:41.322178+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWYWT6F5JWO7","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWYWT6F5JWO7WD3A","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWYWT6F5","created_at":"2026-05-18T12:27:04.183437+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/EWYWT6F5JWO7WD3AKOYQVSMUXI","json":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI.json","graph_json":"https://pith.science/api/pith-number/EWYWT6F5JWO7WD3AKOYQVSMUXI/graph.json","events_json":"https://pith.science/api/pith-number/EWYWT6F5JWO7WD3AKOYQVSMUXI/events.json","paper":"https://pith.science/paper/EWYWT6F5"},"agent_actions":{"view_html":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI","download_json":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI.json","view_paper":"https://pith.science/paper/EWYWT6F5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0052&json=true","fetch_graph":"https://pith.science/api/pith-number/EWYWT6F5JWO7WD3AKOYQVSMUXI/graph.json","fetch_events":"https://pith.science/api/pith-number/EWYWT6F5JWO7WD3AKOYQVSMUXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI/action/storage_attestation","attest_author":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI/action/author_attestation","sign_citation":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI/action/citation_signature","submit_replication":"https://pith.science/pith/EWYWT6F5JWO7WD3AKOYQVSMUXI/action/replication_record"}},"created_at":"2026-05-18T03:30:41.322178+00:00","updated_at":"2026-05-18T03:30:41.322178+00:00"}