{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MQ4IQ7X4C3JOCSDLBF2DVFHPCM","short_pith_number":"pith:MQ4IQ7X4","schema_version":"1.0","canonical_sha256":"6438887efc16d2e1486b09743a94ef1321d35ce08785585f2e1cfb5d26e24771","source":{"kind":"arxiv","id":"1704.06472","version":2},"attestation_state":"computed","paper":{"title":"The Rudin-Shapiro sequence and similar sequences are normal along squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Clemens M\\\"ullner","submitted_at":"2017-04-21T10:32:55Z","abstract_excerpt":"We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations.\n  This gives, for any base, a class of explicit normal numbers that can be efficiently generated."},"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":"1704.06472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-04-21T10:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"721ce416f6065f5b5acd66049981e3f41048ced5ba039e3d07f3eb1dc4e4f23a","abstract_canon_sha256":"e73e4b786c69fa5997a53dd8ece7c41638ba08e1382bd06b4e175248423f2512"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:45.118702Z","signature_b64":"DAkuAtSpMMFwDcN1PXx+rG9ibHOm599YKhRA65TJzFrxTVLRYnUwWebUxqEUnlQohZJhWKuDBEP+Gq7DdODCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6438887efc16d2e1486b09743a94ef1321d35ce08785585f2e1cfb5d26e24771","last_reissued_at":"2026-05-18T00:30:45.118160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:45.118160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Rudin-Shapiro sequence and similar sequences are normal along squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Clemens M\\\"ullner","submitted_at":"2017-04-21T10:32:55Z","abstract_excerpt":"We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations.\n  This gives, for any base, a class of explicit normal numbers that can be efficiently generated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06472","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.06472","created_at":"2026-05-18T00:30:45.118244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06472v2","created_at":"2026-05-18T00:30:45.118244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06472","created_at":"2026-05-18T00:30:45.118244+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQ4IQ7X4C3JO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQ4IQ7X4C3JOCSDL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQ4IQ7X4","created_at":"2026-05-18T12:31:31.346846+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/MQ4IQ7X4C3JOCSDLBF2DVFHPCM","json":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM.json","graph_json":"https://pith.science/api/pith-number/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/graph.json","events_json":"https://pith.science/api/pith-number/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/events.json","paper":"https://pith.science/paper/MQ4IQ7X4"},"agent_actions":{"view_html":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM","download_json":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM.json","view_paper":"https://pith.science/paper/MQ4IQ7X4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06472&json=true","fetch_graph":"https://pith.science/api/pith-number/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/graph.json","fetch_events":"https://pith.science/api/pith-number/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/action/storage_attestation","attest_author":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/action/author_attestation","sign_citation":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/action/citation_signature","submit_replication":"https://pith.science/pith/MQ4IQ7X4C3JOCSDLBF2DVFHPCM/action/replication_record"}},"created_at":"2026-05-18T00:30:45.118244+00:00","updated_at":"2026-05-18T00:30:45.118244+00:00"}