{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4E65TPWQGBCEUT2XQKWGZQVC4M","short_pith_number":"pith:4E65TPWQ","schema_version":"1.0","canonical_sha256":"e13dd9bed030444a4f5782ac6cc2a2e30068ce35bd37a5b52fd7044a199203a6","source":{"kind":"arxiv","id":"1011.3402","version":1},"attestation_state":"computed","paper":{"title":"Entropy for symbolic dynamics with overlapping alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"David Richeson, Fabio Drucker, Jim Wiseman","submitted_at":"2010-11-15T14:32:56Z","abstract_excerpt":"We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of entropies of (standard) full shifts. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborhoods, the entropy gives a lower bound for the topological entropy of the dynamical system."},"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":"1011.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2010-11-15T14:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"49a4a08205f286749e67ede8a44112dd636b376b854a2f06a0872ad3f64bbdcb","abstract_canon_sha256":"ef025818e276b9d4de26b30707470bfb0d5b97fa60fcb436dedcbe8a2fb3b062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:55.930355Z","signature_b64":"jtfTCU/C6ebpVuEMABtS/DIrvt7SOyONJYTwBVCJoDxcuRo4gGaTTMypwl8Fkz4853iM/65KDO0gKTb/h960Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13dd9bed030444a4f5782ac6cc2a2e30068ce35bd37a5b52fd7044a199203a6","last_reissued_at":"2026-05-18T04:35:55.929636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:55.929636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy for symbolic dynamics with overlapping alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"David Richeson, Fabio Drucker, Jim Wiseman","submitted_at":"2010-11-15T14:32:56Z","abstract_excerpt":"We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of entropies of (standard) full shifts. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborhoods, the entropy gives a lower bound for the topological entropy of the dynamical system."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3402","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":"1011.3402","created_at":"2026-05-18T04:35:55.929740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3402v1","created_at":"2026-05-18T04:35:55.929740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3402","created_at":"2026-05-18T04:35:55.929740+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E65TPWQGBCE","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E65TPWQGBCEUT2X","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E65TPWQ","created_at":"2026-05-18T12:26:03.138858+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/4E65TPWQGBCEUT2XQKWGZQVC4M","json":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M.json","graph_json":"https://pith.science/api/pith-number/4E65TPWQGBCEUT2XQKWGZQVC4M/graph.json","events_json":"https://pith.science/api/pith-number/4E65TPWQGBCEUT2XQKWGZQVC4M/events.json","paper":"https://pith.science/paper/4E65TPWQ"},"agent_actions":{"view_html":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M","download_json":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M.json","view_paper":"https://pith.science/paper/4E65TPWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3402&json=true","fetch_graph":"https://pith.science/api/pith-number/4E65TPWQGBCEUT2XQKWGZQVC4M/graph.json","fetch_events":"https://pith.science/api/pith-number/4E65TPWQGBCEUT2XQKWGZQVC4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M/action/storage_attestation","attest_author":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M/action/author_attestation","sign_citation":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M/action/citation_signature","submit_replication":"https://pith.science/pith/4E65TPWQGBCEUT2XQKWGZQVC4M/action/replication_record"}},"created_at":"2026-05-18T04:35:55.929740+00:00","updated_at":"2026-05-18T04:35:55.929740+00:00"}