{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OVJD7W2322E2X772J7IXMDWMHJ","short_pith_number":"pith:OVJD7W23","schema_version":"1.0","canonical_sha256":"75523fdb5bd689abfffa4fd1760ecc3a7058ad4825941345c7a0d49073f37d78","source":{"kind":"arxiv","id":"1302.4251","version":1},"attestation_state":"computed","paper":{"title":"A metrical lower bound on the star discrepancy of digital sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Friedrich Pillichshammer, Gerhard Larcher","submitted_at":"2013-02-18T12:54:20Z","abstract_excerpt":"In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\\ast$ satisfies an upper bound of the form $D_N^\\ast=O((\\log N)^s (\\log \\log N)^{2+\\varepsilon})$ for any $\\varepsilon>0$. Generally speaking it is much more difficult to obtain good lower bounds for specific sequences than upper bounds. Here we show that Larchers result is best possible up to some $\\log \\log N$ term. More detailed, we prove that for almost all $s$-dimensio"},"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":"1302.4251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-02-18T12:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"f1f8070c1b8733fa0024eab0f351da5a1e145f8c757482ce8c6c3d32fa99fc7f","abstract_canon_sha256":"53351b6b22550d3b3d3f2ff2545d7a7b8a80ac187b11fdf132d9c77123c6124f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.561102Z","signature_b64":"XB4SBU+F6Uf6oG1bXXvyyoXrdgYjtsVTVUTU6vZfu7HqlloKnbFKhe6EjmwNT6nJQ/QFFk65MztMYyRutryHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75523fdb5bd689abfffa4fd1760ecc3a7058ad4825941345c7a0d49073f37d78","last_reissued_at":"2026-05-18T03:33:23.560308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.560308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A metrical lower bound on the star discrepancy of digital sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Friedrich Pillichshammer, Gerhard Larcher","submitted_at":"2013-02-18T12:54:20Z","abstract_excerpt":"In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\\ast$ satisfies an upper bound of the form $D_N^\\ast=O((\\log N)^s (\\log \\log N)^{2+\\varepsilon})$ for any $\\varepsilon>0$. Generally speaking it is much more difficult to obtain good lower bounds for specific sequences than upper bounds. Here we show that Larchers result is best possible up to some $\\log \\log N$ term. More detailed, we prove that for almost all $s$-dimensio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4251","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":"1302.4251","created_at":"2026-05-18T03:33:23.560453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4251v1","created_at":"2026-05-18T03:33:23.560453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4251","created_at":"2026-05-18T03:33:23.560453+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVJD7W2322E2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVJD7W2322E2X772","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVJD7W23","created_at":"2026-05-18T12:27:54.935989+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/OVJD7W2322E2X772J7IXMDWMHJ","json":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ.json","graph_json":"https://pith.science/api/pith-number/OVJD7W2322E2X772J7IXMDWMHJ/graph.json","events_json":"https://pith.science/api/pith-number/OVJD7W2322E2X772J7IXMDWMHJ/events.json","paper":"https://pith.science/paper/OVJD7W23"},"agent_actions":{"view_html":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ","download_json":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ.json","view_paper":"https://pith.science/paper/OVJD7W23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4251&json=true","fetch_graph":"https://pith.science/api/pith-number/OVJD7W2322E2X772J7IXMDWMHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OVJD7W2322E2X772J7IXMDWMHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ/action/storage_attestation","attest_author":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ/action/author_attestation","sign_citation":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ/action/citation_signature","submit_replication":"https://pith.science/pith/OVJD7W2322E2X772J7IXMDWMHJ/action/replication_record"}},"created_at":"2026-05-18T03:33:23.560453+00:00","updated_at":"2026-05-18T03:33:23.560453+00:00"}