{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LEQEE6LWVFKC6KX7L63KAAR5MX","short_pith_number":"pith:LEQEE6LW","schema_version":"1.0","canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","source":{"kind":"arxiv","id":"1804.00221","version":5},"attestation_state":"computed","paper":{"title":"Complexity of Leading Digit Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A.J. Hildebrand, Xinwei He, Yuchen Li, Yunyi Zhang","submitted_at":"2018-03-31T22:27:58Z","abstract_excerpt":"Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with frequency $\\log_{b}(1+1/d)$, for $d=1,2,\\dots,b-1$.\n  In this paper, we investigate the \\emph{complexity} of such sequences. We focus mainly on the \\emph{block complexity}, $p_{a,b}(n)$, defined as the number of distinct blocks of length $n$ appearing in $S_{a,b}$. In our main result we determine $p_{a,b}(n)$ for all squarefree bases $b\\ge 5$ and all rational number"},"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":"1804.00221","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-31T22:27:58Z","cross_cats_sorted":[],"title_canon_sha256":"dc7cf671df02ba3dce98d60c732b34e6ec6c1846a814c066de617be0a2be4ca5","abstract_canon_sha256":"714ec74e029b557576b8ad12e06bcf097ce16b07741c582f5b26a8b1b89ffa5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:23.880394Z","signature_b64":"5q2tqOn4/opE80cOcS+b0mXS9rq4FyryVlmG/bOndQp+xkTWL1poKLOS6P+qRmgL7yyAU011brc6q/FGWTcpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","last_reissued_at":"2026-07-05T06:23:23.880037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:23.880037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Leading Digit Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A.J. Hildebrand, Xinwei He, Yuchen Li, Yunyi Zhang","submitted_at":"2018-03-31T22:27:58Z","abstract_excerpt":"Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with frequency $\\log_{b}(1+1/d)$, for $d=1,2,\\dots,b-1$.\n  In this paper, we investigate the \\emph{complexity} of such sequences. We focus mainly on the \\emph{block complexity}, $p_{a,b}(n)$, defined as the number of distinct blocks of length $n$ appearing in $S_{a,b}$. In our main result we determine $p_{a,b}(n)$ for all squarefree bases $b\\ge 5$ and all rational number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00221","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1804.00221/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1804.00221","created_at":"2026-07-05T06:23:23.880092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00221v5","created_at":"2026-07-05T06:23:23.880092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00221","created_at":"2026-07-05T06:23:23.880092+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEQEE6LWVFKC","created_at":"2026-07-05T06:23:23.880092+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEQEE6LWVFKC6KX7","created_at":"2026-07-05T06:23:23.880092+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEQEE6LW","created_at":"2026-07-05T06:23:23.880092+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/LEQEE6LWVFKC6KX7L63KAAR5MX","json":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX.json","graph_json":"https://pith.science/api/pith-number/LEQEE6LWVFKC6KX7L63KAAR5MX/graph.json","events_json":"https://pith.science/api/pith-number/LEQEE6LWVFKC6KX7L63KAAR5MX/events.json","paper":"https://pith.science/paper/LEQEE6LW"},"agent_actions":{"view_html":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX","download_json":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX.json","view_paper":"https://pith.science/paper/LEQEE6LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00221&json=true","fetch_graph":"https://pith.science/api/pith-number/LEQEE6LWVFKC6KX7L63KAAR5MX/graph.json","fetch_events":"https://pith.science/api/pith-number/LEQEE6LWVFKC6KX7L63KAAR5MX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/action/storage_attestation","attest_author":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/action/author_attestation","sign_citation":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/action/citation_signature","submit_replication":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/action/replication_record"}},"created_at":"2026-07-05T06:23:23.880092+00:00","updated_at":"2026-07-05T06:23:23.880092+00:00"}