{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4YNJDRNSWRL7NX5F2TCRC7RYGB","short_pith_number":"pith:4YNJDRNS","schema_version":"1.0","canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","source":{"kind":"arxiv","id":"1612.00617","version":2},"attestation_state":"computed","paper":{"title":"Irregularities of distributions and extremal sets in combinatorial complexity theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NA","authors_text":"Aicke Hinrichs, Christoph Aistleitner","submitted_at":"2016-12-02T10:21:41Z","abstract_excerpt":"In 2004 the second author of the present paper proved that a point set in $[0,1]^d$ which has star-discrepancy at most $\\varepsilon$ must necessarily consist of at least $c_{abs} d \\varepsilon^{-1}$ points. Equivalently, every set of $n$ points in $[0,1]^d$ must have star-discrepancy at least $c_{abs} d n^{-1}$. The original proof of this result uses methods from Vapnik--Chervonenkis theory and from metric entropy theory. In the present paper we give an elementary combinatorial proof for the same result, which is based on identifying a sub-box of $[0,1]^d$ which has approximately $d$ elements "},"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":"1612.00617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-02T10:21:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b21e606fa4eea0da0a122ba47e7eb2f52c0673d53ec3a421edc18bd299d62cdd","abstract_canon_sha256":"0c57bad5f89f915fbd2707c8e1e8bee9914ec389ca2eed749b45330a17594a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:06.900159Z","signature_b64":"hIJcBiJOoNE4cL3/8vRxaVSAnPWpK7LY55qIxoFjjjU66XZ2vkAWwXmUi6JiyF1WIaA85ua/FTCmKuVA+IqvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","last_reissued_at":"2026-05-18T00:39:06.899668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:06.899668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irregularities of distributions and extremal sets in combinatorial complexity theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NA","authors_text":"Aicke Hinrichs, Christoph Aistleitner","submitted_at":"2016-12-02T10:21:41Z","abstract_excerpt":"In 2004 the second author of the present paper proved that a point set in $[0,1]^d$ which has star-discrepancy at most $\\varepsilon$ must necessarily consist of at least $c_{abs} d \\varepsilon^{-1}$ points. Equivalently, every set of $n$ points in $[0,1]^d$ must have star-discrepancy at least $c_{abs} d n^{-1}$. The original proof of this result uses methods from Vapnik--Chervonenkis theory and from metric entropy theory. In the present paper we give an elementary combinatorial proof for the same result, which is based on identifying a sub-box of $[0,1]^d$ which has approximately $d$ elements "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00617","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":"1612.00617","created_at":"2026-05-18T00:39:06.899744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00617v2","created_at":"2026-05-18T00:39:06.899744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00617","created_at":"2026-05-18T00:39:06.899744+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YNJDRNSWRL7","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YNJDRNSWRL7NX5F","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YNJDRNS","created_at":"2026-05-18T12:29:58.707656+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/4YNJDRNSWRL7NX5F2TCRC7RYGB","json":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB.json","graph_json":"https://pith.science/api/pith-number/4YNJDRNSWRL7NX5F2TCRC7RYGB/graph.json","events_json":"https://pith.science/api/pith-number/4YNJDRNSWRL7NX5F2TCRC7RYGB/events.json","paper":"https://pith.science/paper/4YNJDRNS"},"agent_actions":{"view_html":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB","download_json":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB.json","view_paper":"https://pith.science/paper/4YNJDRNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00617&json=true","fetch_graph":"https://pith.science/api/pith-number/4YNJDRNSWRL7NX5F2TCRC7RYGB/graph.json","fetch_events":"https://pith.science/api/pith-number/4YNJDRNSWRL7NX5F2TCRC7RYGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/action/storage_attestation","attest_author":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/action/author_attestation","sign_citation":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/action/citation_signature","submit_replication":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/action/replication_record"}},"created_at":"2026-05-18T00:39:06.899744+00:00","updated_at":"2026-05-18T00:39:06.899744+00:00"}