{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ST3SHRGLRJTTEW6BDC6EYQHO6","short_pith_number":"pith:7ST3SHRG","schema_version":"1.0","canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","source":{"kind":"arxiv","id":"1301.4682","version":1},"attestation_state":"computed","paper":{"title":"Binary Patterns in Binary Cube-Free Words: Avoidability and Growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Alexei V. Samsonov, Arseny M. Shur, Pascal Ochem, Robert Mercas","submitted_at":"2013-01-20T20:05:49Z","abstract_excerpt":"The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growth rates of languages avoiding minimal avoidable patterns are approximated through computer-assisted upper bounds. Finally, a new example of a pattern-avoiding language of polynomial growth is given."},"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":"1301.4682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-20T20:05:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d94146fb06d742b9d0469287ee04c94b9c63624b2b674fedd7d73486d48941c9","abstract_canon_sha256":"f68172a8a36f2aa123827d3b21c6bd7d317cc24fa19bae9f434b393675770bd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:35.849483Z","signature_b64":"ENf3IExxpw5nBZMql5AlQlZKBHe2OJ14qKH7Cmn3lyMrBXBVWZNAS0JHtx/E33CZ5EsbEATkt3YYqT1MxevqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","last_reissued_at":"2026-05-17T23:53:35.848789Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:35.848789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Patterns in Binary Cube-Free Words: Avoidability and Growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Alexei V. Samsonov, Arseny M. Shur, Pascal Ochem, Robert Mercas","submitted_at":"2013-01-20T20:05:49Z","abstract_excerpt":"The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growth rates of languages avoiding minimal avoidable patterns are approximated through computer-assisted upper bounds. Finally, a new example of a pattern-avoiding language of polynomial growth is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4682","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":"1301.4682","created_at":"2026-05-17T23:53:35.848901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4682v1","created_at":"2026-05-17T23:53:35.848901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4682","created_at":"2026-05-17T23:53:35.848901+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ST3SHRGLRJT","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ST3SHRGLRJTTEW6","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ST3SHRG","created_at":"2026-05-18T12:27:36.564083+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/7ST3SHRGLRJTTEW6BDC6EYQHO6","json":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6.json","graph_json":"https://pith.science/api/pith-number/7ST3SHRGLRJTTEW6BDC6EYQHO6/graph.json","events_json":"https://pith.science/api/pith-number/7ST3SHRGLRJTTEW6BDC6EYQHO6/events.json","paper":"https://pith.science/paper/7ST3SHRG"},"agent_actions":{"view_html":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6","download_json":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6.json","view_paper":"https://pith.science/paper/7ST3SHRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4682&json=true","fetch_graph":"https://pith.science/api/pith-number/7ST3SHRGLRJTTEW6BDC6EYQHO6/graph.json","fetch_events":"https://pith.science/api/pith-number/7ST3SHRGLRJTTEW6BDC6EYQHO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/action/storage_attestation","attest_author":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/action/author_attestation","sign_citation":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/action/citation_signature","submit_replication":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/action/replication_record"}},"created_at":"2026-05-17T23:53:35.848901+00:00","updated_at":"2026-05-17T23:53:35.848901+00:00"}