{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:D3RVSEMDGB2QC7FWAEUOSPVPBB","short_pith_number":"pith:D3RVSEMD","schema_version":"1.0","canonical_sha256":"1ee35911833075017cb60128e93eaf0863a196cfa9a02e7b0dc8eba4d14f7079","source":{"kind":"arxiv","id":"2605.18164","version":1},"attestation_state":"computed","paper":{"title":"Explicit entropy bounds for symmetric nearest-neighbor subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Vuong Bui","submitted_at":"2026-05-18T10:08:43Z","abstract_excerpt":"We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only counts of locally admissible patterns $C_n$ of a cube $[1,n]^d$ in $\\mathbb Z^d$. The main idea is a reflection-gluing construction: we flip admissible patterns and merge them along their boundaries. In addition to a short and elementary proof, another advantage is that our approach yields an explicit convergence rate in arbitrary dimensions, whereas obtainin"},"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":"2605.18164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-18T10:08:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b53e664fb68d511c834909507e86824337cc15a905d239e2f3eaa878884d669","abstract_canon_sha256":"b1b6951ab1810b328e33a1c950ae83a1cb7c2dfdb2e540268b442d8f98e35a89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:48.973912Z","signature_b64":"pk0b6lAvuhJB+pcybxiYYvhOuEG7ai4j8O7IB6xApPl3PjWKHBXjj6Kx4X3lzFMSY1xzW5Z1Z9mjgwy6iv3zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee35911833075017cb60128e93eaf0863a196cfa9a02e7b0dc8eba4d14f7079","last_reissued_at":"2026-05-20T00:05:48.973334Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:48.973334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit entropy bounds for symmetric nearest-neighbor subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Vuong Bui","submitted_at":"2026-05-18T10:08:43Z","abstract_excerpt":"We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only counts of locally admissible patterns $C_n$ of a cube $[1,n]^d$ in $\\mathbb Z^d$. The main idea is a reflection-gluing construction: we flip admissible patterns and merge them along their boundaries. In addition to a short and elementary proof, another advantage is that our approach yields an explicit convergence rate in arbitrary dimensions, whereas obtainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18164","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/2605.18164/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.059478Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.358348Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d1c9315e12c0f05cb1cef4b87f5fd4465075ce80c85aa744f454d61ae89cb3f5"},"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":"2605.18164","created_at":"2026-05-20T00:05:48.973452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18164v1","created_at":"2026-05-20T00:05:48.973452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18164","created_at":"2026-05-20T00:05:48.973452+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3RVSEMDGB2Q","created_at":"2026-05-20T00:05:48.973452+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3RVSEMDGB2QC7FW","created_at":"2026-05-20T00:05:48.973452+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3RVSEMD","created_at":"2026-05-20T00:05:48.973452+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/D3RVSEMDGB2QC7FWAEUOSPVPBB","json":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB.json","graph_json":"https://pith.science/api/pith-number/D3RVSEMDGB2QC7FWAEUOSPVPBB/graph.json","events_json":"https://pith.science/api/pith-number/D3RVSEMDGB2QC7FWAEUOSPVPBB/events.json","paper":"https://pith.science/paper/D3RVSEMD"},"agent_actions":{"view_html":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB","download_json":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB.json","view_paper":"https://pith.science/paper/D3RVSEMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18164&json=true","fetch_graph":"https://pith.science/api/pith-number/D3RVSEMDGB2QC7FWAEUOSPVPBB/graph.json","fetch_events":"https://pith.science/api/pith-number/D3RVSEMDGB2QC7FWAEUOSPVPBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB/action/storage_attestation","attest_author":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB/action/author_attestation","sign_citation":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB/action/citation_signature","submit_replication":"https://pith.science/pith/D3RVSEMDGB2QC7FWAEUOSPVPBB/action/replication_record"}},"created_at":"2026-05-20T00:05:48.973452+00:00","updated_at":"2026-05-20T00:05:48.973452+00:00"}