{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:D3RVSEMDGB2QC7FWAEUOSPVPBB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b1b6951ab1810b328e33a1c950ae83a1cb7c2dfdb2e540268b442d8f98e35a89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-18T10:08:43Z","title_canon_sha256":"0b53e664fb68d511c834909507e86824337cc15a905d239e2f3eaa878884d669"},"schema_version":"1.0","source":{"id":"2605.18164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18164","created_at":"2026-05-20T00:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18164v1","created_at":"2026-05-20T00:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18164","created_at":"2026-05-20T00:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"D3RVSEMDGB2Q","created_at":"2026-05-20T00:05:48Z"},{"alias_kind":"pith_short_16","alias_value":"D3RVSEMDGB2QC7FW","created_at":"2026-05-20T00:05:48Z"},{"alias_kind":"pith_short_8","alias_value":"D3RVSEMD","created_at":"2026-05-20T00:05:48Z"}],"graph_snapshots":[{"event_id":"sha256:464754414a6fde2ca7b9e90afbe2c08ea81d1c0386dbd7454f8eb885e7b28f57","target":"graph","created_at":"2026-05-20T00:05:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.18164/integrity.json","findings":[],"snapshot_sha256":"d1c9315e12c0f05cb1cef4b87f5fd4465075ce80c85aa744f454d61ae89cb3f5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Vuong Bui","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-18T10:08:43Z","title":"Explicit entropy bounds for symmetric nearest-neighbor subshifts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18164","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59595a77c4ef409878af47f9e23c13f22d0fe8fa5a57179c1e66723933f1aeb1","target":"record","created_at":"2026-05-20T00:05:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b1b6951ab1810b328e33a1c950ae83a1cb7c2dfdb2e540268b442d8f98e35a89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-18T10:08:43Z","title_canon_sha256":"0b53e664fb68d511c834909507e86824337cc15a905d239e2f3eaa878884d669"},"schema_version":"1.0","source":{"id":"2605.18164","kind":"arxiv","version":1}},"canonical_sha256":"1ee35911833075017cb60128e93eaf0863a196cfa9a02e7b0dc8eba4d14f7079","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ee35911833075017cb60128e93eaf0863a196cfa9a02e7b0dc8eba4d14f7079","first_computed_at":"2026-05-20T00:05:48.973334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:48.973334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pk0b6lAvuhJB+pcybxiYYvhOuEG7ai4j8O7IB6xApPl3PjWKHBXjj6Kx4X3lzFMSY1xzW5Z1Z9mjgwy6iv3zCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:48.973912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59595a77c4ef409878af47f9e23c13f22d0fe8fa5a57179c1e66723933f1aeb1","sha256:464754414a6fde2ca7b9e90afbe2c08ea81d1c0386dbd7454f8eb885e7b28f57"],"state_sha256":"eea70e635e16c7b8649cf1f4380151a57c2e7a44c53f3818cec12a2d137dd88f"}