{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BGMT4SF22TLKEBBXCAKKIMAS74","short_pith_number":"pith:BGMT4SF2","schema_version":"1.0","canonical_sha256":"09993e48bad4d6a204371014a43012ff18b12f75f9712d07f36297392c940e39","source":{"kind":"arxiv","id":"1009.5759","version":1},"attestation_state":"computed","paper":{"title":"On ternary square-free circular words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Arseny M. Shur","submitted_at":"2010-09-29T03:18:26Z","abstract_excerpt":"Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the $K_{3{,}3}$ graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length $l$ and allows one to list all lengths $l$ for which such a circular word is unique up to isomorphism."},"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":"1009.5759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-09-29T03:18:26Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"af0d98f6bd6fed6c1218df60b6dc2b870ee426dfd6963b82591548d75924113b","abstract_canon_sha256":"5a56b5b4b599d79d46ce881f8ab5431d43c99a60d66e17e6ee325c19b8ea11d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:50.227679Z","signature_b64":"zhMrAyGCh5lczbRLlB2U2PHSDL6tcD9o37HyeRc4CTRmAYFpi2euHXnR0jdo9xhqdzU75RdkZpusNkJrKoywBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09993e48bad4d6a204371014a43012ff18b12f75f9712d07f36297392c940e39","last_reissued_at":"2026-05-18T04:38:50.227162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:50.227162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On ternary square-free circular words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Arseny M. Shur","submitted_at":"2010-09-29T03:18:26Z","abstract_excerpt":"Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the $K_{3{,}3}$ graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length $l$ and allows one to list all lengths $l$ for which such a circular word is unique up to isomorphism."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5759","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":"1009.5759","created_at":"2026-05-18T04:38:50.227243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5759v1","created_at":"2026-05-18T04:38:50.227243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5759","created_at":"2026-05-18T04:38:50.227243+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGMT4SF22TLK","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGMT4SF22TLKEBBX","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGMT4SF2","created_at":"2026-05-18T12:26:05.355336+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/BGMT4SF22TLKEBBXCAKKIMAS74","json":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74.json","graph_json":"https://pith.science/api/pith-number/BGMT4SF22TLKEBBXCAKKIMAS74/graph.json","events_json":"https://pith.science/api/pith-number/BGMT4SF22TLKEBBXCAKKIMAS74/events.json","paper":"https://pith.science/paper/BGMT4SF2"},"agent_actions":{"view_html":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74","download_json":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74.json","view_paper":"https://pith.science/paper/BGMT4SF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5759&json=true","fetch_graph":"https://pith.science/api/pith-number/BGMT4SF22TLKEBBXCAKKIMAS74/graph.json","fetch_events":"https://pith.science/api/pith-number/BGMT4SF22TLKEBBXCAKKIMAS74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74/action/storage_attestation","attest_author":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74/action/author_attestation","sign_citation":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74/action/citation_signature","submit_replication":"https://pith.science/pith/BGMT4SF22TLKEBBXCAKKIMAS74/action/replication_record"}},"created_at":"2026-05-18T04:38:50.227243+00:00","updated_at":"2026-05-18T04:38:50.227243+00:00"}