{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7ST3SHRGLRJTTEW6BDC6EYQHO6","short_pith_number":"pith:7ST3SHRG","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"},"canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","source":{"kind":"arxiv","id":"1301.4682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4682","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4682v1","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4682","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"7ST3SHRGLRJT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7ST3SHRGLRJTTEW6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7ST3SHRG","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7ST3SHRGLRJTTEW6BDC6EYQHO6","target":"record","payload":{"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"},"canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","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"},"source_kind":"arxiv","source_id":"1301.4682","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-17T23:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sBiBFyVdABHNn/cXJS11twKGFAJQg/VrBbiActw0zBUTHjhoqORmvo9B4dRhWl4HghgihHvKvteoacBC2HXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:24.050358Z"},"content_sha256":"99b9af080255413aae4031bb4b2e39e9fb488c1c7df1370b55426905131acc47","schema_version":"1.0","event_id":"sha256:99b9af080255413aae4031bb4b2e39e9fb488c1c7df1370b55426905131acc47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7ST3SHRGLRJTTEW6BDC6EYQHO6","target":"graph","payload":{"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"},"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-17T23:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5huLyom5AWd7Qqp3W4A9NbKxEbTqJr/H8BxVxSNGjSzC1CJmDd9C2QqORe9kgtG/+cNe2MB2LPvQbobMdhffCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:24.050716Z"},"content_sha256":"12f95d381edfaaa71f460abc4f1adc6c7d3583df6f3b590e14496021fd24537a","schema_version":"1.0","event_id":"sha256:12f95d381edfaaa71f460abc4f1adc6c7d3583df6f3b590e14496021fd24537a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/bundle.json","state_url":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/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-05-27T19:44:24Z","links":{"resolver":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6","bundle":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/bundle.json","state":"https://pith.science/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ST3SHRGLRJTTEW6BDC6EYQHO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7ST3SHRGLRJTTEW6BDC6EYQHO6","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":"f68172a8a36f2aa123827d3b21c6bd7d317cc24fa19bae9f434b393675770bd8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-20T20:05:49Z","title_canon_sha256":"d94146fb06d742b9d0469287ee04c94b9c63624b2b674fedd7d73486d48941c9"},"schema_version":"1.0","source":{"id":"1301.4682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4682","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4682v1","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4682","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"7ST3SHRGLRJT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7ST3SHRGLRJTTEW6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7ST3SHRG","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:12f95d381edfaaa71f460abc4f1adc6c7d3583df6f3b590e14496021fd24537a","target":"graph","created_at":"2026-05-17T23:53:35Z","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":"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.","authors_text":"Alexei V. Samsonov, Arseny M. Shur, Pascal Ochem, Robert Mercas","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-20T20:05:49Z","title":"Binary Patterns in Binary Cube-Free Words: Avoidability and Growth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4682","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:99b9af080255413aae4031bb4b2e39e9fb488c1c7df1370b55426905131acc47","target":"record","created_at":"2026-05-17T23:53:35Z","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":"f68172a8a36f2aa123827d3b21c6bd7d317cc24fa19bae9f434b393675770bd8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-20T20:05:49Z","title_canon_sha256":"d94146fb06d742b9d0469287ee04c94b9c63624b2b674fedd7d73486d48941c9"},"schema_version":"1.0","source":{"id":"1301.4682","kind":"arxiv","version":1}},"canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fca7b91e265c533992de08c5e2620777a38ffa8425806764135fc8b959102fe3","first_computed_at":"2026-05-17T23:53:35.848789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:35.848789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENf3IExxpw5nBZMql5AlQlZKBHe2OJ14qKH7Cmn3lyMrBXBVWZNAS0JHtx/E33CZ5EsbEATkt3YYqT1MxevqCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:35.849483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99b9af080255413aae4031bb4b2e39e9fb488c1c7df1370b55426905131acc47","sha256:12f95d381edfaaa71f460abc4f1adc6c7d3583df6f3b590e14496021fd24537a"],"state_sha256":"797eda295821d2cf139a3e0f20c3021795c60a60485fe7b86a83a18bdb32bacb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+o+VJPWzv5uvmB2HGOW3vgH5ezeVcsvctP/PVK5MieQ3VoezCwvoKbR59H6WAMfhXKzGldlkwiakNJCKO7D/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:44:24.053173Z","bundle_sha256":"a64a5a239aec18927c46acbaee6da6752f61cca82cbf58ed09cc6211f5576be1"}}