{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BIX4BMH3CZBXASGE3E4VSHZ4SP","short_pith_number":"pith:BIX4BMH3","canonical_record":{"source":{"id":"1702.07698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-02-24T18:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"b97f5e3b943d707d2696c8c1357f737a9b05d4e79acdc5ca42abc0ccc187b18e","abstract_canon_sha256":"2ee5a252acea09efd1ea8ee931595911aa4b8a25d683ec2edeaaac6aed7192ae"},"schema_version":"1.0"},"canonical_sha256":"0a2fc0b0fb16437048c4d939591f3c93c75e658b23d0e2eadb6fdea8f4d06b68","source":{"kind":"arxiv","id":"1702.07698","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07698","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07698v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07698","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"BIX4BMH3CZBX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BIX4BMH3CZBXASGE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BIX4BMH3","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BIX4BMH3CZBXASGE3E4VSHZ4SP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-02-24T18:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"b97f5e3b943d707d2696c8c1357f737a9b05d4e79acdc5ca42abc0ccc187b18e","abstract_canon_sha256":"2ee5a252acea09efd1ea8ee931595911aa4b8a25d683ec2edeaaac6aed7192ae"},"schema_version":"1.0"},"canonical_sha256":"0a2fc0b0fb16437048c4d939591f3c93c75e658b23d0e2eadb6fdea8f4d06b68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:44.813124Z","signature_b64":"IuWa8MQSUeiYZlhKxwsxC8fHtHBpPeU52lo4yG+41jAbnNdiYMi3Anotm+NZ08ud7gCkymOEx1FO43L4QpK2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2fc0b0fb16437048c4d939591f3c93c75e658b23d0e2eadb6fdea8f4d06b68","last_reissued_at":"2026-05-18T00:22:44.812586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:44.812586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07698","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afQ8zbDvorrnuBSduqtaqQmdTEmSxHYleiAFfAjXFkunDuy5vuOXDJ8yoyWVb9QbphuQS2JwXBH/GGHYpF7GCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:47:48.816084Z"},"content_sha256":"6f418e80362b87f7dd4847d5aad387d08398f944337c6d2c60b47c6d509e745b","schema_version":"1.0","event_id":"sha256:6f418e80362b87f7dd4847d5aad387d08398f944337c6d2c60b47c6d509e745b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BIX4BMH3CZBXASGE3E4VSHZ4SP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and fractal dimensions for infinite sequences with positive entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Carlos Gustavo Moreira, Christian Mauduit","submitted_at":"2017-02-24T18:33:50Z","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$. The goal of this work is to estimate the number of words of length $n$ on the alphabet $A$ that are factors of an infinite word $w$ with a complexity function bounded by a given function $f$ with exponential growth and to describe the combinatorial structure of such sets of infinite words. We introduce a real parameter, the {\\it word entropy} $E_W(f)$ associated to a given f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07698","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPxKEDOY8SyrPYCkntfMrVJ3tzy/QsLtATOqLnuoC6RFPF0oHuCKsnWnABAl/HKzOLV2NJtbxXslcRKyNZFGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:47:48.816561Z"},"content_sha256":"ccd7efb8cece8ebbd9d0262ee6f1d46c4302d27c6086c33f07dbf82e50cc4a2e","schema_version":"1.0","event_id":"sha256:ccd7efb8cece8ebbd9d0262ee6f1d46c4302d27c6086c33f07dbf82e50cc4a2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/bundle.json","state_url":"https://pith.science/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T14:47:48Z","links":{"resolver":"https://pith.science/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP","bundle":"https://pith.science/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/bundle.json","state":"https://pith.science/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIX4BMH3CZBXASGE3E4VSHZ4SP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BIX4BMH3CZBXASGE3E4VSHZ4SP","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":"2ee5a252acea09efd1ea8ee931595911aa4b8a25d683ec2edeaaac6aed7192ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-02-24T18:33:50Z","title_canon_sha256":"b97f5e3b943d707d2696c8c1357f737a9b05d4e79acdc5ca42abc0ccc187b18e"},"schema_version":"1.0","source":{"id":"1702.07698","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07698","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07698v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07698","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"BIX4BMH3CZBX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BIX4BMH3CZBXASGE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BIX4BMH3","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:ccd7efb8cece8ebbd9d0262ee6f1d46c4302d27c6086c33f07dbf82e50cc4a2e","target":"graph","created_at":"2026-05-18T00:22:44Z","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"},"paper":{"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$. The goal of this work is to estimate the number of words of length $n$ on the alphabet $A$ that are factors of an infinite word $w$ with a complexity function bounded by a given function $f$ with exponential growth and to describe the combinatorial structure of such sets of infinite words. We introduce a real parameter, the {\\it word entropy} $E_W(f)$ associated to a given f","authors_text":"Carlos Gustavo Moreira, Christian Mauduit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-02-24T18:33:50Z","title":"Complexity and fractal dimensions for infinite sequences with positive entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07698","kind":"arxiv","version":2},"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:6f418e80362b87f7dd4847d5aad387d08398f944337c6d2c60b47c6d509e745b","target":"record","created_at":"2026-05-18T00:22:44Z","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":"2ee5a252acea09efd1ea8ee931595911aa4b8a25d683ec2edeaaac6aed7192ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-02-24T18:33:50Z","title_canon_sha256":"b97f5e3b943d707d2696c8c1357f737a9b05d4e79acdc5ca42abc0ccc187b18e"},"schema_version":"1.0","source":{"id":"1702.07698","kind":"arxiv","version":2}},"canonical_sha256":"0a2fc0b0fb16437048c4d939591f3c93c75e658b23d0e2eadb6fdea8f4d06b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a2fc0b0fb16437048c4d939591f3c93c75e658b23d0e2eadb6fdea8f4d06b68","first_computed_at":"2026-05-18T00:22:44.812586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:44.812586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IuWa8MQSUeiYZlhKxwsxC8fHtHBpPeU52lo4yG+41jAbnNdiYMi3Anotm+NZ08ud7gCkymOEx1FO43L4QpK2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:44.813124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07698","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f418e80362b87f7dd4847d5aad387d08398f944337c6d2c60b47c6d509e745b","sha256:ccd7efb8cece8ebbd9d0262ee6f1d46c4302d27c6086c33f07dbf82e50cc4a2e"],"state_sha256":"0c0467f6179bdf3872f609d3187c5bedd2280825e4250efcf7015619cb2c1b65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jPsrUVq+waV855CX+Rrkc+O3YD9Y7dGzkEQ6Cqnl0RdcslQlG3SUm//REoAiWpU+Dfqek/qsAoCydCwv9ZyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:47:48.819197Z","bundle_sha256":"862733e2635b8eae23b1e7af1aeaeede8140deb2cd181c44b5f35558618e90d7"}}