{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4YNJDRNSWRL7NX5F2TCRC7RYGB","short_pith_number":"pith:4YNJDRNS","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"},"canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","source":{"kind":"arxiv","id":"1612.00617","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00617","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00617v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00617","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YNJDRNSWRL7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4YNJDRNSWRL7NX5F","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4YNJDRNS","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4YNJDRNSWRL7NX5F2TCRC7RYGB","target":"record","payload":{"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"},"canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","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"},"source_kind":"arxiv","source_id":"1612.00617","source_version":2,"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-05-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkR27ZXgsAWOs7b8Oht2GkdmYYyWhyQ3+oZHJMOyIIqAATC+ljDB/+4Fm2CFcDeDzM3N/hdnW9gLE5IXG2/qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:41:16.117480Z"},"content_sha256":"b5bed203933553d148dd887594523d67f663deec5d090548f7d43359a2dd3ce4","schema_version":"1.0","event_id":"sha256:b5bed203933553d148dd887594523d67f663deec5d090548f7d43359a2dd3ce4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4YNJDRNSWRL7NX5F2TCRC7RYGB","target":"graph","payload":{"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"},"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-05-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVQ0MTxGuopkm/SCJOOW34Li4imlhIcnb/nTX3VIHi+uEKqVkdIKLXQGFygAsRpoYXYrQs3+ZbPiJ3fVpNdlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:41:16.118191Z"},"content_sha256":"ee79936db640ddd4eb5513d8910e6b559d7585359d7006399c5ff427dd363428","schema_version":"1.0","event_id":"sha256:ee79936db640ddd4eb5513d8910e6b559d7585359d7006399c5ff427dd363428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/bundle.json","state_url":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/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-06-09T03:41:16Z","links":{"resolver":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB","bundle":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/bundle.json","state":"https://pith.science/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YNJDRNSWRL7NX5F2TCRC7RYGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4YNJDRNSWRL7NX5F2TCRC7RYGB","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":"0c57bad5f89f915fbd2707c8e1e8bee9914ec389ca2eed749b45330a17594a44","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-02T10:21:41Z","title_canon_sha256":"b21e606fa4eea0da0a122ba47e7eb2f52c0673d53ec3a421edc18bd299d62cdd"},"schema_version":"1.0","source":{"id":"1612.00617","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00617","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00617v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00617","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YNJDRNSWRL7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4YNJDRNSWRL7NX5F","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4YNJDRNS","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:ee79936db640ddd4eb5513d8910e6b559d7585359d7006399c5ff427dd363428","target":"graph","created_at":"2026-05-18T00:39:06Z","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"},"paper":{"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 ","authors_text":"Aicke Hinrichs, Christoph Aistleitner","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-02T10:21:41Z","title":"Irregularities of distributions and extremal sets in combinatorial complexity theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00617","kind":"arxiv","version":2},"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:b5bed203933553d148dd887594523d67f663deec5d090548f7d43359a2dd3ce4","target":"record","created_at":"2026-05-18T00:39:06Z","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":"0c57bad5f89f915fbd2707c8e1e8bee9914ec389ca2eed749b45330a17594a44","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-12-02T10:21:41Z","title_canon_sha256":"b21e606fa4eea0da0a122ba47e7eb2f52c0673d53ec3a421edc18bd299d62cdd"},"schema_version":"1.0","source":{"id":"1612.00617","kind":"arxiv","version":2}},"canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e61a91c5b2b457f6dfa5d4c5117e38307f167810f5b065ec28c89a8efa4cdb76","first_computed_at":"2026-05-18T00:39:06.899668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:06.899668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hIJcBiJOoNE4cL3/8vRxaVSAnPWpK7LY55qIxoFjjjU66XZ2vkAWwXmUi6JiyF1WIaA85ua/FTCmKuVA+IqvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:06.900159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00617","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5bed203933553d148dd887594523d67f663deec5d090548f7d43359a2dd3ce4","sha256:ee79936db640ddd4eb5513d8910e6b559d7585359d7006399c5ff427dd363428"],"state_sha256":"db166fa2c217805ff92f74b7133b244ce74c365bc2564ee66e27607a6d051665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mKXatX7uIB1b49MQtuIKUXk5HNYMKPOUZFh3wWz6hf+0msCy4xfRHJIjMdW4/zIBTHlkp4sAXq2BEUblBMlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:41:16.121766Z","bundle_sha256":"1c4182204d7ed2de6e5e0f37a89de420c672dfe67895d0ceda3de61efd733620"}}