{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MMHFFWE4X5JZGQFE6KSSSYELX3","short_pith_number":"pith:MMHFFWE4","schema_version":"1.0","canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","source":{"kind":"arxiv","id":"1310.4743","version":1},"attestation_state":"computed","paper":{"title":"Avoiding 2-binomial squares and cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"M. Rao, M. Rigo, P. Salimov","submitted_at":"2013-10-17T15:22:49Z","abstract_excerpt":"Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement of the usual abelian equivalence. A 2-binomial square is a word $uv$ where $u$ and $v$ are 2-binomially equivalent.\n  In this paper, considering pure morphic words, we prove that 2-binomial squares (resp. cubes) are avoidable over a 3-letter (resp. 2-letter) alphabet. The sizes of the alphabets are optimal."},"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":"1310.4743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-17T15:22:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"81b564abe9954d850c18d0247cb70befb486d9e32a692dba58252593852aca4a","abstract_canon_sha256":"2a41ee73ba519be77c139af5800e96be96c68659a4716d5ce06a99e047e7417c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.934698Z","signature_b64":"Z3IXgVSzAsC0LFAlkYDI/p4te4PbmuqmJK28Q7t+J7IRDeSW4Ahny/4iiZxXjvjKsXJ6ot/Le1KdlGZi5JOpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","last_reissued_at":"2026-05-18T03:10:12.933857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.933857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding 2-binomial squares and cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"M. Rao, M. Rigo, P. Salimov","submitted_at":"2013-10-17T15:22:49Z","abstract_excerpt":"Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement of the usual abelian equivalence. A 2-binomial square is a word $uv$ where $u$ and $v$ are 2-binomially equivalent.\n  In this paper, considering pure morphic words, we prove that 2-binomial squares (resp. cubes) are avoidable over a 3-letter (resp. 2-letter) alphabet. The sizes of the alphabets are optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4743","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":"1310.4743","created_at":"2026-05-18T03:10:12.933998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4743v1","created_at":"2026-05-18T03:10:12.933998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4743","created_at":"2026-05-18T03:10:12.933998+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMHFFWE4X5JZ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMHFFWE4X5JZGQFE","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMHFFWE4","created_at":"2026-05-18T12:27:52.871228+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/MMHFFWE4X5JZGQFE6KSSSYELX3","json":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3.json","graph_json":"https://pith.science/api/pith-number/MMHFFWE4X5JZGQFE6KSSSYELX3/graph.json","events_json":"https://pith.science/api/pith-number/MMHFFWE4X5JZGQFE6KSSSYELX3/events.json","paper":"https://pith.science/paper/MMHFFWE4"},"agent_actions":{"view_html":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3","download_json":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3.json","view_paper":"https://pith.science/paper/MMHFFWE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4743&json=true","fetch_graph":"https://pith.science/api/pith-number/MMHFFWE4X5JZGQFE6KSSSYELX3/graph.json","fetch_events":"https://pith.science/api/pith-number/MMHFFWE4X5JZGQFE6KSSSYELX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/action/storage_attestation","attest_author":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/action/author_attestation","sign_citation":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/action/citation_signature","submit_replication":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/action/replication_record"}},"created_at":"2026-05-18T03:10:12.933998+00:00","updated_at":"2026-05-18T03:10:12.933998+00:00"}