{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YR44SNKYQDT3JZEOBR4X5RI4LW","short_pith_number":"pith:YR44SNKY","canonical_record":{"source":{"id":"1703.06127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-17T17:43:59Z","cross_cats_sorted":["cs.CC","math.NA","math.PR"],"title_canon_sha256":"04f4b47bbb1ace8ed57942c5cb4ce5fec342ac43265604d30f5bd9350e6e93da","abstract_canon_sha256":"0dbc7374a7b938ab5c94b7cd02095bc747b331d00ca9c783ad1e7b806a330317"},"schema_version":"1.0"},"canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","source":{"kind":"arxiv","id":"1703.06127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06127","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06127v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06127","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"YR44SNKYQDT3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YR44SNKYQDT3JZEO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YR44SNKY","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YR44SNKYQDT3JZEOBR4X5RI4LW","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-17T17:43:59Z","cross_cats_sorted":["cs.CC","math.NA","math.PR"],"title_canon_sha256":"04f4b47bbb1ace8ed57942c5cb4ce5fec342ac43265604d30f5bd9350e6e93da","abstract_canon_sha256":"0dbc7374a7b938ab5c94b7cd02095bc747b331d00ca9c783ad1e7b806a330317"},"schema_version":"1.0"},"canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.414121Z","signature_b64":"BXrlwp9ZR9hFzJEX4MYTFQwG7Q+nZNaYVoE/gSJTLuNCBM/7QwY2rHlabdMEce2eTJ0qPiiM4zR0NaQYGUj7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","last_reissued_at":"2026-05-18T00:48:29.413450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.413450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06127","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-18T00:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HjDuiQhiq9l/L7fM2QmDyXHUPuTQ4o6Mt8qAX+N+zSqFcYUywr2lY1HsnRBEDn5BGRd7mDlCPiDnwFD5MnEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:20:59.685994Z"},"content_sha256":"b4c2c0c2c9e11cdefc7355b87179c714999a5bbf7d0a6884bf86e3fee5945897","schema_version":"1.0","event_id":"sha256:b4c2c0c2c9e11cdefc7355b87179c714999a5bbf7d0a6884bf86e3fee5945897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YR44SNKYQDT3JZEOBR4X5RI4LW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tusn\\'ady's problem, the transference principle, and non-uniform QMC sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA","math.PR"],"primary_cat":"math.CO","authors_text":"Aleksandar Nikolov, Christoph Aistleitner, Dmitriy Bilyk","submitted_at":"2017-03-17T17:43:59Z","abstract_excerpt":"It is well-known that for every $N \\geq 1$ and $d \\geq 1$ there exist point sets $x_1, \\dots, x_N \\in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\\log N)^{d-1} N^{-1}$. In a more general setting, the first author proved together with Josef Dick that for any normalized measure $\\mu$ on $[0,1]^d$ there exist points $x_1, \\dots, x_N$ whose discrepancy with respect to $\\mu$ is of order at most $(\\log N)^{(3d+1)/2} N^{-1}$. The proof used methods from combinatorial mathematics, and in particular a result of Banaszczyk on balancings of vectors. In the presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06127","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-18T00:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSSg/pV9P5XlYbRDrL/64dBT0AlWAd9Xc1+v3AQLZtQBbBY5qZ8lAobJkHg/guWVOR7POomySgjHAJ2+jrlRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:20:59.686672Z"},"content_sha256":"3989e24a73ee555bd45d343a0ed0a51a217f8da0f4402f04ab56cfecde963634","schema_version":"1.0","event_id":"sha256:3989e24a73ee555bd45d343a0ed0a51a217f8da0f4402f04ab56cfecde963634"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/bundle.json","state_url":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/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-08T16:20:59Z","links":{"resolver":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW","bundle":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/bundle.json","state":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YR44SNKYQDT3JZEOBR4X5RI4LW","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":"0dbc7374a7b938ab5c94b7cd02095bc747b331d00ca9c783ad1e7b806a330317","cross_cats_sorted":["cs.CC","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-17T17:43:59Z","title_canon_sha256":"04f4b47bbb1ace8ed57942c5cb4ce5fec342ac43265604d30f5bd9350e6e93da"},"schema_version":"1.0","source":{"id":"1703.06127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06127","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06127v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06127","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"YR44SNKYQDT3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YR44SNKYQDT3JZEO","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YR44SNKY","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:3989e24a73ee555bd45d343a0ed0a51a217f8da0f4402f04ab56cfecde963634","target":"graph","created_at":"2026-05-18T00:48:29Z","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":"It is well-known that for every $N \\geq 1$ and $d \\geq 1$ there exist point sets $x_1, \\dots, x_N \\in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\\log N)^{d-1} N^{-1}$. In a more general setting, the first author proved together with Josef Dick that for any normalized measure $\\mu$ on $[0,1]^d$ there exist points $x_1, \\dots, x_N$ whose discrepancy with respect to $\\mu$ is of order at most $(\\log N)^{(3d+1)/2} N^{-1}$. The proof used methods from combinatorial mathematics, and in particular a result of Banaszczyk on balancings of vectors. In the presen","authors_text":"Aleksandar Nikolov, Christoph Aistleitner, Dmitriy Bilyk","cross_cats":["cs.CC","math.NA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-17T17:43:59Z","title":"Tusn\\'ady's problem, the transference principle, and non-uniform QMC sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06127","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:b4c2c0c2c9e11cdefc7355b87179c714999a5bbf7d0a6884bf86e3fee5945897","target":"record","created_at":"2026-05-18T00:48:29Z","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":"0dbc7374a7b938ab5c94b7cd02095bc747b331d00ca9c783ad1e7b806a330317","cross_cats_sorted":["cs.CC","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-17T17:43:59Z","title_canon_sha256":"04f4b47bbb1ace8ed57942c5cb4ce5fec342ac43265604d30f5bd9350e6e93da"},"schema_version":"1.0","source":{"id":"1703.06127","kind":"arxiv","version":1}},"canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","first_computed_at":"2026-05-18T00:48:29.413450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:29.413450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXrlwp9ZR9hFzJEX4MYTFQwG7Q+nZNaYVoE/gSJTLuNCBM/7QwY2rHlabdMEce2eTJ0qPiiM4zR0NaQYGUj7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:29.414121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4c2c0c2c9e11cdefc7355b87179c714999a5bbf7d0a6884bf86e3fee5945897","sha256:3989e24a73ee555bd45d343a0ed0a51a217f8da0f4402f04ab56cfecde963634"],"state_sha256":"e8f36ced1790ec949618c88b94b2d5b8887303674d09d0ca594d8aea9f984033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHemfFd7oRcQ3+oRr/gpxwH2+CbMXwcwVG/o+oBNpbyoc/OZNPuhL6ETcsKzzfc5KV5bVuV8ZcMXCOMDfrqmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:20:59.690674Z","bundle_sha256":"4e21dd300f51de1a149f3cedb31ffbc9aa9b5336db2b46c625b7ac3f9a291a7f"}}