{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:25VQ6CD2FGBYWDWWMSVSV2SGAX","short_pith_number":"pith:25VQ6CD2","schema_version":"1.0","canonical_sha256":"d76b0f087a29838b0ed664ab2aea4605c72db330f4b5fd9fb63707feedfc8920","source":{"kind":"arxiv","id":"1509.08325","version":3},"attestation_state":"computed","paper":{"title":"Tree-Shifts: The entropy of tree-shifts of finite type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Chih-Hung Chang, Jung-Chao Ban","submitted_at":"2015-09-28T14:11:18Z","abstract_excerpt":"This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations. Furthermore, the entropy of the binary Markov tree-shifts over two symbols is either $0$ or $\\ln 2$. Meanwhile, the realization of a class of reals including multinacci numbers is elaborated, which indicates that tree-shifts are capable of rich phenomena. By considering the influence of three different types of boundary conditions, say, the periodic, Dirich"},"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":"1509.08325","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-28T14:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"e72fbb9821771c39da07dbbeba6167fd5bb978675829ba89fb2da1e3e19f5fd1","abstract_canon_sha256":"bc49b0fb4cf09674cfb5b8cec1e3d487ebde881dd35197d92f0529a72deff863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:34.885419Z","signature_b64":"LJV3c0SN1tACNs0X5dmt1IpMsJLOVyWqHAucZiSvDseZ3Dk+Ized7wfzif9JtDn2+zsSN/8s5i1OCxogMuF6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76b0f087a29838b0ed664ab2aea4605c72db330f4b5fd9fb63707feedfc8920","last_reissued_at":"2026-05-18T00:49:34.884718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:34.884718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-Shifts: The entropy of tree-shifts of finite type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Chih-Hung Chang, Jung-Chao Ban","submitted_at":"2015-09-28T14:11:18Z","abstract_excerpt":"This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations. Furthermore, the entropy of the binary Markov tree-shifts over two symbols is either $0$ or $\\ln 2$. Meanwhile, the realization of a class of reals including multinacci numbers is elaborated, which indicates that tree-shifts are capable of rich phenomena. By considering the influence of three different types of boundary conditions, say, the periodic, Dirich"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08325","kind":"arxiv","version":3},"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":"1509.08325","created_at":"2026-05-18T00:49:34.884824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08325v3","created_at":"2026-05-18T00:49:34.884824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08325","created_at":"2026-05-18T00:49:34.884824+00:00"},{"alias_kind":"pith_short_12","alias_value":"25VQ6CD2FGBY","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"25VQ6CD2FGBYWDWW","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"25VQ6CD2","created_at":"2026-05-18T12:28:59.999130+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/25VQ6CD2FGBYWDWWMSVSV2SGAX","json":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX.json","graph_json":"https://pith.science/api/pith-number/25VQ6CD2FGBYWDWWMSVSV2SGAX/graph.json","events_json":"https://pith.science/api/pith-number/25VQ6CD2FGBYWDWWMSVSV2SGAX/events.json","paper":"https://pith.science/paper/25VQ6CD2"},"agent_actions":{"view_html":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX","download_json":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX.json","view_paper":"https://pith.science/paper/25VQ6CD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08325&json=true","fetch_graph":"https://pith.science/api/pith-number/25VQ6CD2FGBYWDWWMSVSV2SGAX/graph.json","fetch_events":"https://pith.science/api/pith-number/25VQ6CD2FGBYWDWWMSVSV2SGAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX/action/storage_attestation","attest_author":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX/action/author_attestation","sign_citation":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX/action/citation_signature","submit_replication":"https://pith.science/pith/25VQ6CD2FGBYWDWWMSVSV2SGAX/action/replication_record"}},"created_at":"2026-05-18T00:49:34.884824+00:00","updated_at":"2026-05-18T00:49:34.884824+00:00"}