{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SKQXCOKTFYPKZ7YPKL4UKFV5AT","short_pith_number":"pith:SKQXCOKT","schema_version":"1.0","canonical_sha256":"92a17139532e1eacff0f52f94516bd04ce2f82c0839f586990da8fe127eb6fb3","source":{"kind":"arxiv","id":"1802.10561","version":1},"attestation_state":"computed","paper":{"title":"Entropy ratio for infinite sequences with positive entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"C.-G. Moreira, C. Mauduit","submitted_at":"2018-02-28T22:27:27Z","abstract_excerpt":"The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given function $f$ with exponential growth, we introduced in [MM17] the notion of {\\it word entropy} $E_W(f)$ associated to $f$ and we described the combinatorial structure of sets of infinite words with a complexity function bounded by $f$. The goal of this work is to give estimates on the word entropy $E_W(f)$ in terms of the limiting lower exponential growth rate "},"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":"1802.10561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-02-28T22:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"cf00041b8613b21769868fb3e3f7a490e3aa0b95a7ea2d83e8bac0c1533e7dd6","abstract_canon_sha256":"55d46926a32c00c4a3ef34f1618d1d51848c4a9cc7c12d2bc02cc4ca6ac1ed7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.797439Z","signature_b64":"vVKqyOMp0Y8YP+DtETdAGPVAc2snS2I4SB3udQE3Kwxo2BvsSPOpViO6XBGb6rmsPI5l4iFBUAO0YIW/h2ndDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a17139532e1eacff0f52f94516bd04ce2f82c0839f586990da8fe127eb6fb3","last_reissued_at":"2026-05-18T00:22:16.796987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.796987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy ratio for infinite sequences with positive entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"C.-G. Moreira, C. Mauduit","submitted_at":"2018-02-28T22:27:27Z","abstract_excerpt":"The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given function $f$ with exponential growth, we introduced in [MM17] the notion of {\\it word entropy} $E_W(f)$ associated to $f$ and we described the combinatorial structure of sets of infinite words with a complexity function bounded by $f$. The goal of this work is to give estimates on the word entropy $E_W(f)$ in terms of the limiting lower exponential growth rate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10561","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":"1802.10561","created_at":"2026-05-18T00:22:16.797052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10561v1","created_at":"2026-05-18T00:22:16.797052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10561","created_at":"2026-05-18T00:22:16.797052+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKQXCOKTFYPK","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKQXCOKTFYPKZ7YP","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKQXCOKT","created_at":"2026-05-18T12:32:53.628368+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/SKQXCOKTFYPKZ7YPKL4UKFV5AT","json":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT.json","graph_json":"https://pith.science/api/pith-number/SKQXCOKTFYPKZ7YPKL4UKFV5AT/graph.json","events_json":"https://pith.science/api/pith-number/SKQXCOKTFYPKZ7YPKL4UKFV5AT/events.json","paper":"https://pith.science/paper/SKQXCOKT"},"agent_actions":{"view_html":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT","download_json":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT.json","view_paper":"https://pith.science/paper/SKQXCOKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10561&json=true","fetch_graph":"https://pith.science/api/pith-number/SKQXCOKTFYPKZ7YPKL4UKFV5AT/graph.json","fetch_events":"https://pith.science/api/pith-number/SKQXCOKTFYPKZ7YPKL4UKFV5AT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT/action/storage_attestation","attest_author":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT/action/author_attestation","sign_citation":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT/action/citation_signature","submit_replication":"https://pith.science/pith/SKQXCOKTFYPKZ7YPKL4UKFV5AT/action/replication_record"}},"created_at":"2026-05-18T00:22:16.797052+00:00","updated_at":"2026-05-18T00:22:16.797052+00:00"}