{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JXQLBY7F44ER6ZMAXID2XG7ZDS","short_pith_number":"pith:JXQLBY7F","canonical_record":{"source":{"id":"1211.1058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-05T22:25:04Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d83a7890759feb55586820c5cf8516336a4a2a4166ec0b6b8509d4dc5cc9cdee","abstract_canon_sha256":"a59c74ffecf5d723bfb9eac136bcb975d6c9e13714d22c34cb727e35fe736b7d"},"schema_version":"1.0"},"canonical_sha256":"4de0b0e3e5e7091f6580ba07ab9bf91ca28003f87c59946db3d7f258e41720cf","source":{"kind":"arxiv","id":"1211.1058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1058","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1058v1","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1058","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"JXQLBY7F44ER","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXQLBY7F44ER6ZMA","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXQLBY7F","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JXQLBY7F44ER6ZMAXID2XG7ZDS","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-05T22:25:04Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"d83a7890759feb55586820c5cf8516336a4a2a4166ec0b6b8509d4dc5cc9cdee","abstract_canon_sha256":"a59c74ffecf5d723bfb9eac136bcb975d6c9e13714d22c34cb727e35fe736b7d"},"schema_version":"1.0"},"canonical_sha256":"4de0b0e3e5e7091f6580ba07ab9bf91ca28003f87c59946db3d7f258e41720cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:28.654955Z","signature_b64":"XEkxorVw4zNAM5z9e2MqEHJ79QbGZYKwcCVO9L3XvPK0S+E70V5juKKm43JrRi0Y/ZL3lMke1NQy3zeVN1ygDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4de0b0e3e5e7091f6580ba07ab9bf91ca28003f87c59946db3d7f258e41720cf","last_reissued_at":"2026-05-18T03:41:28.654407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:28.654407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1058","source_version":1,"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-18T03:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxvxw/FEsZ4O/2UpzwMyeBVkOeMEoi8f2KCbAu8KDwVYOaJ3FICckM9CgzMXzYOwqFaPasr+wLT71VE5O5ieAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:47:58.270284Z"},"content_sha256":"d1f18c6e933152b99eb1d6db2a40ecef798b322334b489787602917c257d101c","schema_version":"1.0","event_id":"sha256:d1f18c6e933152b99eb1d6db2a40ecef798b322334b489787602917c257d101c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JXQLBY7F44ER6ZMAXID2XG7ZDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic discrepancy bound for Monte Carlo point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Christoph Aistleitner, Markus Hofer","submitted_at":"2012-11-05T22:25:04Z","abstract_excerpt":"By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\\'z}niakowski the inverse of the star-discrepancy $n^*(s,\\ve)$ satisfies the upper bound $n^*(s,\\ve) \\leq c_{\\mathrm{abs}} s \\ve^{-2}$. This is equivalent to the fact that for any $N$ and $s$ there exists a set of $N$ points in $[0,1]^s$ whose star-discrepancy is bounded by $c_{\\mathrm{abs}} s^{1/2} N^{-1/2}$. The proof is based on the observation that a random point set satisfies the desired discrepancy bound with positive probability. In the present paper we prove an applied version of this result, making it applicable for computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1058","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"},"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-18T03:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66oB2ihACB4OCoB/qEZKC4LfdB/2cMShVsor8CjKWKHLvMIvhiAuwpVwrWATkxXWtH0XC7Uzpjhb3B5D4S1qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:47:58.270649Z"},"content_sha256":"aedfe8bac127117bb64425caab33331d05f217890517e93cf3154d52dd01e6fe","schema_version":"1.0","event_id":"sha256:aedfe8bac127117bb64425caab33331d05f217890517e93cf3154d52dd01e6fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/bundle.json","state_url":"https://pith.science/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/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-07-02T21:47:58Z","links":{"resolver":"https://pith.science/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS","bundle":"https://pith.science/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/bundle.json","state":"https://pith.science/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXQLBY7F44ER6ZMAXID2XG7ZDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JXQLBY7F44ER6ZMAXID2XG7ZDS","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":"a59c74ffecf5d723bfb9eac136bcb975d6c9e13714d22c34cb727e35fe736b7d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-05T22:25:04Z","title_canon_sha256":"d83a7890759feb55586820c5cf8516336a4a2a4166ec0b6b8509d4dc5cc9cdee"},"schema_version":"1.0","source":{"id":"1211.1058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1058","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1058v1","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1058","created_at":"2026-05-18T03:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"JXQLBY7F44ER","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXQLBY7F44ER6ZMA","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXQLBY7F","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:aedfe8bac127117bb64425caab33331d05f217890517e93cf3154d52dd01e6fe","target":"graph","created_at":"2026-05-18T03:41:28Z","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":"By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\\'z}niakowski the inverse of the star-discrepancy $n^*(s,\\ve)$ satisfies the upper bound $n^*(s,\\ve) \\leq c_{\\mathrm{abs}} s \\ve^{-2}$. This is equivalent to the fact that for any $N$ and $s$ there exists a set of $N$ points in $[0,1]^s$ whose star-discrepancy is bounded by $c_{\\mathrm{abs}} s^{1/2} N^{-1/2}$. The proof is based on the observation that a random point set satisfies the desired discrepancy bound with positive probability. In the present paper we prove an applied version of this result, making it applicable for computat","authors_text":"Christoph Aistleitner, Markus Hofer","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-05T22:25:04Z","title":"Probabilistic discrepancy bound for Monte Carlo point sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1058","kind":"arxiv","version":1},"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:d1f18c6e933152b99eb1d6db2a40ecef798b322334b489787602917c257d101c","target":"record","created_at":"2026-05-18T03:41:28Z","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":"a59c74ffecf5d723bfb9eac136bcb975d6c9e13714d22c34cb727e35fe736b7d","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-05T22:25:04Z","title_canon_sha256":"d83a7890759feb55586820c5cf8516336a4a2a4166ec0b6b8509d4dc5cc9cdee"},"schema_version":"1.0","source":{"id":"1211.1058","kind":"arxiv","version":1}},"canonical_sha256":"4de0b0e3e5e7091f6580ba07ab9bf91ca28003f87c59946db3d7f258e41720cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4de0b0e3e5e7091f6580ba07ab9bf91ca28003f87c59946db3d7f258e41720cf","first_computed_at":"2026-05-18T03:41:28.654407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:28.654407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XEkxorVw4zNAM5z9e2MqEHJ79QbGZYKwcCVO9L3XvPK0S+E70V5juKKm43JrRi0Y/ZL3lMke1NQy3zeVN1ygDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:28.654955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f18c6e933152b99eb1d6db2a40ecef798b322334b489787602917c257d101c","sha256:aedfe8bac127117bb64425caab33331d05f217890517e93cf3154d52dd01e6fe"],"state_sha256":"0b4f716d8b81aaa99e014070f29ae770b05aab393361235aef890d831edaf43b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ontL01vgPW405w1dlBnnd790Ajqz2sClcXqiLL2Z6ahgUduJYzq6G21xptcP+3W8++5i/dq/TD8TiRNGJiSrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:47:58.272496Z","bundle_sha256":"0d4be41ead2d629a4a3eeab2e6a5691cea56d1ade9bac7e938727cc4b1241448"}}