{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZYUIG52Z2DRISCEW7IKM7RSCLB","short_pith_number":"pith:ZYUIG52Z","schema_version":"1.0","canonical_sha256":"ce28837759d0e2890896fa14cfc6425859c8c4a105082e8f08b6b74fc04b908b","source":{"kind":"arxiv","id":"2606.06655","version":1},"attestation_state":"computed","paper":{"title":"Letter frequency in shifts of finite type with one forbidden word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Maga, Jacob Richey, Mikl\\'os B\\'ona","submitted_at":"2026-06-04T19:02:27Z","abstract_excerpt":"This work considers combinatorial and statistical aspects of {\\em{shifts of finite type}}, which are families of words over a finite alphabet which avoid a fixed class of {\\emph{forbidden}} sub-words. The overarching question we are interested in is: how do local statistics of a uniformly random element of the shift space depend on combinatorial features of the forbidden set? We focus on the binary alphabet $\\{0,1\\}$, the class of shift spaces where a single pattern is forbidden, and the average frequency of $1$s (equivalently, the probability of observing $1$ at a given position). In this cas"},"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":"2606.06655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-04T19:02:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"00caa49d77c7e093a5f385214434510b08054ec89af4a33f010cb1b27f1e8f26","abstract_canon_sha256":"71fdab5922872239de8bad58e2b5b38a13370379eb7de87f94cb1514759b32d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:21.143018Z","signature_b64":"xbZuRmAbukxoV66eQc9Ya2b2Nnl4AbLPXFgbnCKNFS8IzJFC/EUM+lJi9gJ6dntieRwiPzVHGzvjZ0Sy17wiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce28837759d0e2890896fa14cfc6425859c8c4a105082e8f08b6b74fc04b908b","last_reissued_at":"2026-06-08T01:04:21.142289Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:21.142289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Letter frequency in shifts of finite type with one forbidden word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Maga, Jacob Richey, Mikl\\'os B\\'ona","submitted_at":"2026-06-04T19:02:27Z","abstract_excerpt":"This work considers combinatorial and statistical aspects of {\\em{shifts of finite type}}, which are families of words over a finite alphabet which avoid a fixed class of {\\emph{forbidden}} sub-words. The overarching question we are interested in is: how do local statistics of a uniformly random element of the shift space depend on combinatorial features of the forbidden set? We focus on the binary alphabet $\\{0,1\\}$, the class of shift spaces where a single pattern is forbidden, and the average frequency of $1$s (equivalently, the probability of observing $1$ at a given position). In this cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06655","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.06655/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.06655","created_at":"2026-06-08T01:04:21.142415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06655v1","created_at":"2026-06-08T01:04:21.142415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06655","created_at":"2026-06-08T01:04:21.142415+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYUIG52Z2DRI","created_at":"2026-06-08T01:04:21.142415+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYUIG52Z2DRISCEW","created_at":"2026-06-08T01:04:21.142415+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYUIG52Z","created_at":"2026-06-08T01:04:21.142415+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/ZYUIG52Z2DRISCEW7IKM7RSCLB","json":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB.json","graph_json":"https://pith.science/api/pith-number/ZYUIG52Z2DRISCEW7IKM7RSCLB/graph.json","events_json":"https://pith.science/api/pith-number/ZYUIG52Z2DRISCEW7IKM7RSCLB/events.json","paper":"https://pith.science/paper/ZYUIG52Z"},"agent_actions":{"view_html":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB","download_json":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB.json","view_paper":"https://pith.science/paper/ZYUIG52Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06655&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYUIG52Z2DRISCEW7IKM7RSCLB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYUIG52Z2DRISCEW7IKM7RSCLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB/action/storage_attestation","attest_author":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB/action/author_attestation","sign_citation":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB/action/citation_signature","submit_replication":"https://pith.science/pith/ZYUIG52Z2DRISCEW7IKM7RSCLB/action/replication_record"}},"created_at":"2026-06-08T01:04:21.142415+00:00","updated_at":"2026-06-08T01:04:21.142415+00:00"}