{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XT2LFZCTDNISEY66EFLQ5UWIKD","short_pith_number":"pith:XT2LFZCT","schema_version":"1.0","canonical_sha256":"bcf4b2e4531b512263de21570ed2c850f9a37cf461ee55433f1ed24a0ad76145","source":{"kind":"arxiv","id":"1112.1351","version":2},"attestation_state":"computed","paper":{"title":"On independence and entropy for high-dimensional isotropic subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ronnie Pavlov, Tom Meyerovitch","submitted_at":"2011-12-06T17:13:27Z","abstract_excerpt":"In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional \"forbidden\" words along all cardinal directions, as both $n$ and $d$ tend to infinity. Louidor, Marcus, and the second author called this quantity the \"limiting entropy\"; it is the limit of a sequence of topological entropies of a sequence of isotropic $\\mathbb{Z}^d$ subshifts with the dimension $d$ tending to infinity. We find an expression for this limiting entropy which involves only one-dimension"},"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":"1112.1351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-12-06T17:13:27Z","cross_cats_sorted":[],"title_canon_sha256":"be2739c784bd5515b3944b91ddf5663d24a6138c73b66976d27f46e0a02484e8","abstract_canon_sha256":"6cbb1cd3d649d93e05e196a1ebfe1a2a07428e619c8f1f6444b489bc24504562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:51.246407Z","signature_b64":"Xf78RvdTTBQjPpNgARPeSxHBMSLTeYjE6IIyrCnqq8nlxClklLmbRUvwWC7OgsL/tTUgZwWhOEesuDnqnWK3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf4b2e4531b512263de21570ed2c850f9a37cf461ee55433f1ed24a0ad76145","last_reissued_at":"2026-05-18T03:29:51.245721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:51.245721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On independence and entropy for high-dimensional isotropic subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ronnie Pavlov, Tom Meyerovitch","submitted_at":"2011-12-06T17:13:27Z","abstract_excerpt":"In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional \"forbidden\" words along all cardinal directions, as both $n$ and $d$ tend to infinity. Louidor, Marcus, and the second author called this quantity the \"limiting entropy\"; it is the limit of a sequence of topological entropies of a sequence of isotropic $\\mathbb{Z}^d$ subshifts with the dimension $d$ tending to infinity. We find an expression for this limiting entropy which involves only one-dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1351","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":"1112.1351","created_at":"2026-05-18T03:29:51.245841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1351v2","created_at":"2026-05-18T03:29:51.245841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1351","created_at":"2026-05-18T03:29:51.245841+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT2LFZCTDNIS","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT2LFZCTDNISEY66","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT2LFZCT","created_at":"2026-05-18T12:26:47.523578+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/XT2LFZCTDNISEY66EFLQ5UWIKD","json":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD.json","graph_json":"https://pith.science/api/pith-number/XT2LFZCTDNISEY66EFLQ5UWIKD/graph.json","events_json":"https://pith.science/api/pith-number/XT2LFZCTDNISEY66EFLQ5UWIKD/events.json","paper":"https://pith.science/paper/XT2LFZCT"},"agent_actions":{"view_html":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD","download_json":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD.json","view_paper":"https://pith.science/paper/XT2LFZCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1351&json=true","fetch_graph":"https://pith.science/api/pith-number/XT2LFZCTDNISEY66EFLQ5UWIKD/graph.json","fetch_events":"https://pith.science/api/pith-number/XT2LFZCTDNISEY66EFLQ5UWIKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD/action/storage_attestation","attest_author":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD/action/author_attestation","sign_citation":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD/action/citation_signature","submit_replication":"https://pith.science/pith/XT2LFZCTDNISEY66EFLQ5UWIKD/action/replication_record"}},"created_at":"2026-05-18T03:29:51.245841+00:00","updated_at":"2026-05-18T03:29:51.245841+00:00"}