{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PFKIMPDGJREKYM2LVT7T2GFZOU","short_pith_number":"pith:PFKIMPDG","schema_version":"1.0","canonical_sha256":"7954863c664c48ac334bacff3d18b9753822b2f5d99ae4aa2dce2e9e0d2737be","source":{"kind":"arxiv","id":"1309.2137","version":1},"attestation_state":"computed","paper":{"title":"Square-Free Shuffles of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Mike M\\\"uller, Tero Harju","submitted_at":"2013-09-09T12:47:07Z","abstract_excerpt":"Let $u \\shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \\geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\\shuffle u$ contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word $u$ on three letters such that $u$ can be shuffled with itself to produce an infinite square-free word $w \\in u \\shuffle u$."},"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":"1309.2137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-09T12:47:07Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"1a346c9d42188514181813b2c903e26ad50b46de9e36908381d0da547e4a4edc","abstract_canon_sha256":"99068d9ba0a99eeb183344774fecdf0628fb2166ff154cdf7115fa52c09082fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:47.059433Z","signature_b64":"7r/z6VXJYABj5XQty2UHaPfiNht+krtQYEvnOJpJW0CcyKtXtzbvEO3YWXE7lOJGBIQXlDRNkEPAzzOsrZ5rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7954863c664c48ac334bacff3d18b9753822b2f5d99ae4aa2dce2e9e0d2737be","last_reissued_at":"2026-05-18T03:13:47.058893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:47.058893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square-Free Shuffles of Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Mike M\\\"uller, Tero Harju","submitted_at":"2013-09-09T12:47:07Z","abstract_excerpt":"Let $u \\shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \\geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\\shuffle u$ contains a square-free word. This property is then shown to also hold for infinite words, i.e., there exists an infinite square-free word $u$ on three letters such that $u$ can be shuffled with itself to produce an infinite square-free word $w \\in u \\shuffle u$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2137","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":"1309.2137","created_at":"2026-05-18T03:13:47.058972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2137v1","created_at":"2026-05-18T03:13:47.058972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2137","created_at":"2026-05-18T03:13:47.058972+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFKIMPDGJREK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFKIMPDGJREKYM2L","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFKIMPDG","created_at":"2026-05-18T12:27:54.935989+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/PFKIMPDGJREKYM2LVT7T2GFZOU","json":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU.json","graph_json":"https://pith.science/api/pith-number/PFKIMPDGJREKYM2LVT7T2GFZOU/graph.json","events_json":"https://pith.science/api/pith-number/PFKIMPDGJREKYM2LVT7T2GFZOU/events.json","paper":"https://pith.science/paper/PFKIMPDG"},"agent_actions":{"view_html":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU","download_json":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU.json","view_paper":"https://pith.science/paper/PFKIMPDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2137&json=true","fetch_graph":"https://pith.science/api/pith-number/PFKIMPDGJREKYM2LVT7T2GFZOU/graph.json","fetch_events":"https://pith.science/api/pith-number/PFKIMPDGJREKYM2LVT7T2GFZOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU/action/storage_attestation","attest_author":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU/action/author_attestation","sign_citation":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU/action/citation_signature","submit_replication":"https://pith.science/pith/PFKIMPDGJREKYM2LVT7T2GFZOU/action/replication_record"}},"created_at":"2026-05-18T03:13:47.058972+00:00","updated_at":"2026-05-18T03:13:47.058972+00:00"}