{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QSQC7HV7ZJL2OHEQ53IB6BLEPT","short_pith_number":"pith:QSQC7HV7","schema_version":"1.0","canonical_sha256":"84a02f9ebfca57a71c90eed01f05647cf7fe815fb85c5d805c0f0b89bd070a6a","source":{"kind":"arxiv","id":"1301.0854","version":1},"attestation_state":"computed","paper":{"title":"Shifts of finite type with nearly full entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ronnie Pavlov","submitted_at":"2013-01-05T01:37:00Z","abstract_excerpt":"For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum, and show that they have many useful properties. Specifically, we prove that for any d, there exists beta_d such that for any nearest neighbor Z^d shift of finite type X with alphabet A for which log |A| - h(X) < beta_d, X has a unique measure of maximal entropy. Our values of beta_d decay polynomially (like O(d^(-17))), and we prove that the sequence must deca"},"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.0854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-01-05T01:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"d795ed4eab1e64f67040243048ebea5c30d87e2527907bad33efae90135d7561","abstract_canon_sha256":"c3d6ea70a09f855d431562b6fc8067ef8d477a342130f35521b3ec7734fe889b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:53.111591Z","signature_b64":"HkLIegp3gtF79Se5gXzejARXXbBOzzO0tRr7eniwYRv5sFfucRfI1J7HfeMplTh2aI4d6PWhc7qcZsQNGZhxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84a02f9ebfca57a71c90eed01f05647cf7fe815fb85c5d805c0f0b89bd070a6a","last_reissued_at":"2026-05-18T02:57:53.111079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:53.111079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shifts of finite type with nearly full entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ronnie Pavlov","submitted_at":"2013-01-05T01:37:00Z","abstract_excerpt":"For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum, and show that they have many useful properties. Specifically, we prove that for any d, there exists beta_d such that for any nearest neighbor Z^d shift of finite type X with alphabet A for which log |A| - h(X) < beta_d, X has a unique measure of maximal entropy. Our values of beta_d decay polynomially (like O(d^(-17))), and we prove that the sequence must deca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0854","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.0854","created_at":"2026-05-18T02:57:53.111161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0854v1","created_at":"2026-05-18T02:57:53.111161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0854","created_at":"2026-05-18T02:57:53.111161+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSQC7HV7ZJL2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSQC7HV7ZJL2OHEQ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSQC7HV7","created_at":"2026-05-18T12:27:57.521954+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/QSQC7HV7ZJL2OHEQ53IB6BLEPT","json":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT.json","graph_json":"https://pith.science/api/pith-number/QSQC7HV7ZJL2OHEQ53IB6BLEPT/graph.json","events_json":"https://pith.science/api/pith-number/QSQC7HV7ZJL2OHEQ53IB6BLEPT/events.json","paper":"https://pith.science/paper/QSQC7HV7"},"agent_actions":{"view_html":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT","download_json":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT.json","view_paper":"https://pith.science/paper/QSQC7HV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0854&json=true","fetch_graph":"https://pith.science/api/pith-number/QSQC7HV7ZJL2OHEQ53IB6BLEPT/graph.json","fetch_events":"https://pith.science/api/pith-number/QSQC7HV7ZJL2OHEQ53IB6BLEPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT/action/storage_attestation","attest_author":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT/action/author_attestation","sign_citation":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT/action/citation_signature","submit_replication":"https://pith.science/pith/QSQC7HV7ZJL2OHEQ53IB6BLEPT/action/replication_record"}},"created_at":"2026-05-18T02:57:53.111161+00:00","updated_at":"2026-05-18T02:57:53.111161+00:00"}