{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L6Q7VBLLRGDG7J2THLN72WBHYA","short_pith_number":"pith:L6Q7VBLL","schema_version":"1.0","canonical_sha256":"5fa1fa856b89866fa7533adbfd5827c000ab94d4bf41529fdbe56030c6e42b6a","source":{"kind":"arxiv","id":"1510.03833","version":2},"attestation_state":"computed","paper":{"title":"Computable F{\\o}lner monotilings and a theorem of Brudno II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Nikita Moriakov","submitted_at":"2015-10-13T19:34:31Z","abstract_excerpt":"A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\\mathbb{N}$ with respect to an ergodic measure $\\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\\omega$ in X. The purpose of this article is to extend this result to subshifts over computable groups that admit computable regular symmetric F{\\o}lner monotilings, which we introduce in this work. These monotilings are a special type of computable F{\\o}lner monotilings, which we defined earlier in order to extend the initial results of Brudno. For every $d \\in \\mathbb{N}$, the groups $\\math"},"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":"1510.03833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-10-13T19:34:31Z","cross_cats_sorted":[],"title_canon_sha256":"38a33aeee7b332f0a40484694320e62772a7b650dbceb14e06ef77fc9dd4df91","abstract_canon_sha256":"6b29474e4eed32ac0b86a4065de07be4ee7207d20e28fe32d202cbc06e39bb47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:24.236384Z","signature_b64":"UqL7aVCK13hpHy+rdYGoaUg+a20yjDPUdcioW3uCHuWOhUPvE2FspxAbQE6pxuLNTIy7BHpunXD3snkIzy9cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fa1fa856b89866fa7533adbfd5827c000ab94d4bf41529fdbe56030c6e42b6a","last_reissued_at":"2026-05-18T01:24:24.235783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:24.235783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable F{\\o}lner monotilings and a theorem of Brudno II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Nikita Moriakov","submitted_at":"2015-10-13T19:34:31Z","abstract_excerpt":"A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\\mathbb{N}$ with respect to an ergodic measure $\\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\\omega$ in X. The purpose of this article is to extend this result to subshifts over computable groups that admit computable regular symmetric F{\\o}lner monotilings, which we introduce in this work. These monotilings are a special type of computable F{\\o}lner monotilings, which we defined earlier in order to extend the initial results of Brudno. For every $d \\in \\mathbb{N}$, the groups $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03833","kind":"arxiv","version":2},"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":"1510.03833","created_at":"2026-05-18T01:24:24.235866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03833v2","created_at":"2026-05-18T01:24:24.235866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03833","created_at":"2026-05-18T01:24:24.235866+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6Q7VBLLRGDG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6Q7VBLLRGDG7J2T","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6Q7VBLL","created_at":"2026-05-18T12:29:29.992203+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/L6Q7VBLLRGDG7J2THLN72WBHYA","json":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA.json","graph_json":"https://pith.science/api/pith-number/L6Q7VBLLRGDG7J2THLN72WBHYA/graph.json","events_json":"https://pith.science/api/pith-number/L6Q7VBLLRGDG7J2THLN72WBHYA/events.json","paper":"https://pith.science/paper/L6Q7VBLL"},"agent_actions":{"view_html":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA","download_json":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA.json","view_paper":"https://pith.science/paper/L6Q7VBLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03833&json=true","fetch_graph":"https://pith.science/api/pith-number/L6Q7VBLLRGDG7J2THLN72WBHYA/graph.json","fetch_events":"https://pith.science/api/pith-number/L6Q7VBLLRGDG7J2THLN72WBHYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA/action/storage_attestation","attest_author":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA/action/author_attestation","sign_citation":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA/action/citation_signature","submit_replication":"https://pith.science/pith/L6Q7VBLLRGDG7J2THLN72WBHYA/action/replication_record"}},"created_at":"2026-05-18T01:24:24.235866+00:00","updated_at":"2026-05-18T01:24:24.235866+00:00"}