{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LEQEE6LWVFKC6KX7L63KAAR5MX","short_pith_number":"pith:LEQEE6LW","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"},"canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","source":{"kind":"arxiv","id":"1804.00221","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00221","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00221v5","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00221","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"LEQEE6LWVFKC","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"LEQEE6LWVFKC6KX7","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"LEQEE6LW","created_at":"2026-07-05T06:23:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LEQEE6LWVFKC6KX7L63KAAR5MX","target":"record","payload":{"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"},"canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","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"},"source_kind":"arxiv","source_id":"1804.00221","source_version":5,"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-07-05T06:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6FBIKih01+e/cYOh/Ee4vlNYZFbZciJVpvWT6TAgIB62JakhmbmIFO0WuB3dwMiyiAvKJmkSLHLaRxOIu2HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:22:41.761467Z"},"content_sha256":"9bc9455195b3c635b2a83711e0fd37db8ab4444a92d74aced12524975650239b","schema_version":"1.0","event_id":"sha256:9bc9455195b3c635b2a83711e0fd37db8ab4444a92d74aced12524975650239b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LEQEE6LWVFKC6KX7L63KAAR5MX","target":"graph","payload":{"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"},"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-07-05T06:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Ts9MeLY62hORmw7aEaH9Yv50GHHcxuiGRvNMT9wDo7VWeyhdo16gKbUmY9i0bhsq1DgUQxkK5dHrWyogYumDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:22:41.761999Z"},"content_sha256":"20e4a6d6bd27f59e15bbdcd7c37c11d4b965784ec8e83072b220c57856166350","schema_version":"1.0","event_id":"sha256:20e4a6d6bd27f59e15bbdcd7c37c11d4b965784ec8e83072b220c57856166350"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/bundle.json","state_url":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/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-08-09T14:22:41Z","links":{"resolver":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX","bundle":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/bundle.json","state":"https://pith.science/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEQEE6LWVFKC6KX7L63KAAR5MX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LEQEE6LWVFKC6KX7L63KAAR5MX","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":"714ec74e029b557576b8ad12e06bcf097ce16b07741c582f5b26a8b1b89ffa5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-31T22:27:58Z","title_canon_sha256":"dc7cf671df02ba3dce98d60c732b34e6ec6c1846a814c066de617be0a2be4ca5"},"schema_version":"1.0","source":{"id":"1804.00221","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00221","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00221v5","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00221","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"LEQEE6LWVFKC","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"LEQEE6LWVFKC6KX7","created_at":"2026-07-05T06:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"LEQEE6LW","created_at":"2026-07-05T06:23:23Z"}],"graph_snapshots":[{"event_id":"sha256:20e4a6d6bd27f59e15bbdcd7c37c11d4b965784ec8e83072b220c57856166350","target":"graph","created_at":"2026-07-05T06:23:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1804.00221/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"A.J. Hildebrand, Xinwei He, Yuchen Li, Yunyi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-31T22:27:58Z","title":"Complexity of Leading Digit Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00221","kind":"arxiv","version":5},"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:9bc9455195b3c635b2a83711e0fd37db8ab4444a92d74aced12524975650239b","target":"record","created_at":"2026-07-05T06:23:23Z","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":"714ec74e029b557576b8ad12e06bcf097ce16b07741c582f5b26a8b1b89ffa5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-03-31T22:27:58Z","title_canon_sha256":"dc7cf671df02ba3dce98d60c732b34e6ec6c1846a814c066de617be0a2be4ca5"},"schema_version":"1.0","source":{"id":"1804.00221","kind":"arxiv","version":5}},"canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5920427976a9542f2aff5fb6a0023d65cf7fda9519f59cf3e185457df085c9bc","first_computed_at":"2026-07-05T06:23:23.880037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:23.880037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5q2tqOn4/opE80cOcS+b0mXS9rq4FyryVlmG/bOndQp+xkTWL1poKLOS6P+qRmgL7yyAU011brc6q/FGWTcpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:23.880394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00221","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bc9455195b3c635b2a83711e0fd37db8ab4444a92d74aced12524975650239b","sha256:20e4a6d6bd27f59e15bbdcd7c37c11d4b965784ec8e83072b220c57856166350"],"state_sha256":"564ae47a0a195cfe0d4c9170dbd387cc93459d730ad9b3989443de0b7a8f3ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9/a4LqUf+Yiw/XEd0BFDh+AGLH1FCTIHRtpz3bjiWiJPEcozGaaiu59SmwVFIgZ1GEdEFSHXeDSRRNPe9mGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T14:22:41.766811Z","bundle_sha256":"33f74f504ecb5965f814d70423bbc46497fd859a2a596c4c7cabf47caf743dac"}}