{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WAHFBEEMUIFCUQRPARO5E5C26R","short_pith_number":"pith:WAHFBEEM","schema_version":"1.0","canonical_sha256":"b00e50908ca20a2a422f045dd2745af4652b6b7fff73ff5b628e0711dfa774e4","source":{"kind":"arxiv","id":"1302.3844","version":3},"attestation_state":"computed","paper":{"title":"Infinite Self-Shuffling Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"\\'Emilie Charlier, Luca Q. Zamboni, Svetlana Puzynina, Teturo Kamae","submitted_at":"2013-02-15T18:42:20Z","abstract_excerpt":"In this paper we introduce and study a new property of infinite words: An infinite word $x\\in A^\\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\\geq 2)$ if $x$ admits factorizations: $x=\\prod_{i=0}^\\infty U_i^{(1)}\\cdots U_i^{(k)}=\\prod_{i=0}^\\infty U_i^{(1)}=\\cdots =\\prod_{i=0}^\\infty U_i^{(k)}$. In other words, there exists a shuffle of $k$-copies of $x$ which produces $x$. We are particularly interested in the case $k=2$, in which case we say $x$ is self-shuffling. This property of infinite words is shown to be an intrinsic property of the word and not of i"},"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":"1302.3844","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-15T18:42:20Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f218b1e067cfa1502a04ef23cdc7cc5746548e7ad8284211a50119e820339e84","abstract_canon_sha256":"bc17b80969283812e269757bc07b44a5dbfa9ce30e94f9630b35d5f5d285f555"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.059959Z","signature_b64":"kZxRh3ET/fa4k5xmeMue/0NQYIIZg00u3UIW8TzS7Qoyln4IfsGVkop+2KIlRTsIewKLMexaKG44VNPmAVGRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b00e50908ca20a2a422f045dd2745af4652b6b7fff73ff5b628e0711dfa774e4","last_reissued_at":"2026-05-18T02:37:43.059431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.059431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite Self-Shuffling Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"\\'Emilie Charlier, Luca Q. Zamboni, Svetlana Puzynina, Teturo Kamae","submitted_at":"2013-02-15T18:42:20Z","abstract_excerpt":"In this paper we introduce and study a new property of infinite words: An infinite word $x\\in A^\\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\\geq 2)$ if $x$ admits factorizations: $x=\\prod_{i=0}^\\infty U_i^{(1)}\\cdots U_i^{(k)}=\\prod_{i=0}^\\infty U_i^{(1)}=\\cdots =\\prod_{i=0}^\\infty U_i^{(k)}$. In other words, there exists a shuffle of $k$-copies of $x$ which produces $x$. We are particularly interested in the case $k=2$, in which case we say $x$ is self-shuffling. This property of infinite words is shown to be an intrinsic property of the word and not of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3844","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":"1302.3844","created_at":"2026-05-18T02:37:43.059506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3844v3","created_at":"2026-05-18T02:37:43.059506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3844","created_at":"2026-05-18T02:37:43.059506+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAHFBEEMUIFC","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAHFBEEMUIFCUQRP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAHFBEEM","created_at":"2026-05-18T12:28:04.890932+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/WAHFBEEMUIFCUQRPARO5E5C26R","json":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R.json","graph_json":"https://pith.science/api/pith-number/WAHFBEEMUIFCUQRPARO5E5C26R/graph.json","events_json":"https://pith.science/api/pith-number/WAHFBEEMUIFCUQRPARO5E5C26R/events.json","paper":"https://pith.science/paper/WAHFBEEM"},"agent_actions":{"view_html":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R","download_json":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R.json","view_paper":"https://pith.science/paper/WAHFBEEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3844&json=true","fetch_graph":"https://pith.science/api/pith-number/WAHFBEEMUIFCUQRPARO5E5C26R/graph.json","fetch_events":"https://pith.science/api/pith-number/WAHFBEEMUIFCUQRPARO5E5C26R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R/action/storage_attestation","attest_author":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R/action/author_attestation","sign_citation":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R/action/citation_signature","submit_replication":"https://pith.science/pith/WAHFBEEMUIFCUQRPARO5E5C26R/action/replication_record"}},"created_at":"2026-05-18T02:37:43.059506+00:00","updated_at":"2026-05-18T02:37:43.059506+00:00"}