{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPYUM2A65EMEZNIL55LZX3ZOXO","short_pith_number":"pith:DPYUM2A6","schema_version":"1.0","canonical_sha256":"1bf146681ee9184cb50bef579bef2ebbb33c77c8c20f22b493c95e6f57921250","source":{"kind":"arxiv","id":"1805.03713","version":1},"attestation_state":"computed","paper":{"title":"Normal numbers and nested perfect necklaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Olivier Carton, Ver\\'onica Becher","submitted_at":"2018-05-09T20:00:19Z","abstract_excerpt":"M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x \\mod 1)_{n\\geq 1}$ have discrepancy $O((\\log N)^2/N)$. This is the lowest discrepancy known for this kind of sequences. In this note we characterize Levin's construction in terms of nested perfect necklaces, which are a variant of the classical de Bruijn necklaces. Moreover, we show that every real number $x$ whose base $b$ expansion is the concatenation of nested perfect necklaces of exponentially inc"},"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":"1805.03713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-09T20:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"bc54d489e352e42ddb573a6b95bc9f55ddda0314f1caf908b7da0af590aac975","abstract_canon_sha256":"c1401134cfbf0526556da94198f223f0bddaa7f0fc04e0eb5a5a4e4387552ac1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:18.957073Z","signature_b64":"QYq/ZRQKJV0n086xCfuEUNNxgHqnS6dq0R+0sesOiHyjuHPRih9+uOJBAJkPqZYdS3h3REoIYkEYxsybAaVlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf146681ee9184cb50bef579bef2ebbb33c77c8c20f22b493c95e6f57921250","last_reissued_at":"2026-05-18T00:16:18.956549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:18.956549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Normal numbers and nested perfect necklaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Olivier Carton, Ver\\'onica Becher","submitted_at":"2018-05-09T20:00:19Z","abstract_excerpt":"M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x \\mod 1)_{n\\geq 1}$ have discrepancy $O((\\log N)^2/N)$. This is the lowest discrepancy known for this kind of sequences. In this note we characterize Levin's construction in terms of nested perfect necklaces, which are a variant of the classical de Bruijn necklaces. Moreover, we show that every real number $x$ whose base $b$ expansion is the concatenation of nested perfect necklaces of exponentially inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03713","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":"1805.03713","created_at":"2026-05-18T00:16:18.956608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03713v1","created_at":"2026-05-18T00:16:18.956608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03713","created_at":"2026-05-18T00:16:18.956608+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPYUM2A65EME","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPYUM2A65EMEZNIL","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPYUM2A6","created_at":"2026-05-18T12:32:19.392346+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/DPYUM2A65EMEZNIL55LZX3ZOXO","json":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO.json","graph_json":"https://pith.science/api/pith-number/DPYUM2A65EMEZNIL55LZX3ZOXO/graph.json","events_json":"https://pith.science/api/pith-number/DPYUM2A65EMEZNIL55LZX3ZOXO/events.json","paper":"https://pith.science/paper/DPYUM2A6"},"agent_actions":{"view_html":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO","download_json":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO.json","view_paper":"https://pith.science/paper/DPYUM2A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03713&json=true","fetch_graph":"https://pith.science/api/pith-number/DPYUM2A65EMEZNIL55LZX3ZOXO/graph.json","fetch_events":"https://pith.science/api/pith-number/DPYUM2A65EMEZNIL55LZX3ZOXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO/action/storage_attestation","attest_author":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO/action/author_attestation","sign_citation":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO/action/citation_signature","submit_replication":"https://pith.science/pith/DPYUM2A65EMEZNIL55LZX3ZOXO/action/replication_record"}},"created_at":"2026-05-18T00:16:18.956608+00:00","updated_at":"2026-05-18T00:16:18.956608+00:00"}