{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MMHFFWE4X5JZGQFE6KSSSYELX3","short_pith_number":"pith:MMHFFWE4","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"},"canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","source":{"kind":"arxiv","id":"1310.4743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4743","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4743v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4743","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"MMHFFWE4X5JZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMHFFWE4X5JZGQFE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMHFFWE4","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MMHFFWE4X5JZGQFE6KSSSYELX3","target":"record","payload":{"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"},"canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","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"},"source_kind":"arxiv","source_id":"1310.4743","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lb+QESAY1kmnn9ijONi8UaoXBc0DMBaIPMTRNgiwKqZVVwYB3YqDJtdoHYfVaIxoikdnHSvMLCGj78ow3RKVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:29.491189Z"},"content_sha256":"d130b8b92c3e59558641f05fcb050bcffec07e1db7328ab075865307c9022e9a","schema_version":"1.0","event_id":"sha256:d130b8b92c3e59558641f05fcb050bcffec07e1db7328ab075865307c9022e9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MMHFFWE4X5JZGQFE6KSSSYELX3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWriDYF8Vx3IWCcMEC07Ab9WL/X1W5gnth6442K4hMFfG3pEo31X9US3NHMt91kUAwsaXi2J8sCmUDCU98S6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:14:29.491541Z"},"content_sha256":"d15b21448abdb325b3ffa5729bbbd0486e92927e2ec92767ba5d7b5ad5084657","schema_version":"1.0","event_id":"sha256:d15b21448abdb325b3ffa5729bbbd0486e92927e2ec92767ba5d7b5ad5084657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/bundle.json","state_url":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T14:14:29Z","links":{"resolver":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3","bundle":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/bundle.json","state":"https://pith.science/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMHFFWE4X5JZGQFE6KSSSYELX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MMHFFWE4X5JZGQFE6KSSSYELX3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2a41ee73ba519be77c139af5800e96be96c68659a4716d5ce06a99e047e7417c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-17T15:22:49Z","title_canon_sha256":"81b564abe9954d850c18d0247cb70befb486d9e32a692dba58252593852aca4a"},"schema_version":"1.0","source":{"id":"1310.4743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4743","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4743v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4743","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"MMHFFWE4X5JZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMHFFWE4X5JZGQFE","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMHFFWE4","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:d15b21448abdb325b3ffa5729bbbd0486e92927e2ec92767ba5d7b5ad5084657","target":"graph","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"M. Rao, M. Rigo, P. Salimov","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-17T15:22:49Z","title":"Avoiding 2-binomial squares and cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4743","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d130b8b92c3e59558641f05fcb050bcffec07e1db7328ab075865307c9022e9a","target":"record","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2a41ee73ba519be77c139af5800e96be96c68659a4716d5ce06a99e047e7417c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-17T15:22:49Z","title_canon_sha256":"81b564abe9954d850c18d0247cb70befb486d9e32a692dba58252593852aca4a"},"schema_version":"1.0","source":{"id":"1310.4743","kind":"arxiv","version":1}},"canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630e52d89cbf539340a4f2a529608bbecb4768c7fefa350419df0a7db60fc3ad","first_computed_at":"2026-05-18T03:10:12.933857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.933857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3IXgVSzAsC0LFAlkYDI/p4te4PbmuqmJK28Q7t+J7IRDeSW4Ahny/4iiZxXjvjKsXJ6ot/Le1KdlGZi5JOpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.934698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d130b8b92c3e59558641f05fcb050bcffec07e1db7328ab075865307c9022e9a","sha256:d15b21448abdb325b3ffa5729bbbd0486e92927e2ec92767ba5d7b5ad5084657"],"state_sha256":"503b106a76d99c5c3f22b48c5d2a70170898af96a785544a8ea1019420377f2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2SWHd2wbKO4xCNlr/QpwOf38lioQMUdFOikTRjx+0ZyiKpWjbuudPjaTCiqOKlnHQkrcwnHboS7vIrf+ZHBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:14:29.493526Z","bundle_sha256":"dd9575192f0445dd852f6dded62323368722e2a8b6ee53fddbce03c59acbcf1c"}}