{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YR44SNKYQDT3JZEOBR4X5RI4LW","short_pith_number":"pith:YR44SNKY","schema_version":"1.0","canonical_sha256":"c479c9355880e7b4e48e0c797ec51c5d8b90c11e51b61b8a6bdd2fe4f1434da1","source":{"kind":"arxiv","id":"1703.06127","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06127","created_at":"2026-05-18T00:48:29.413558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06127v1","created_at":"2026-05-18T00:48:29.413558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06127","created_at":"2026-05-18T00:48:29.413558+00:00"},{"alias_kind":"pith_short_12","alias_value":"YR44SNKYQDT3","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YR44SNKYQDT3JZEO","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YR44SNKY","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23020","citing_title":"Polylogarithmic Full-Chord Buffon Discrepancy","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW","json":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW.json","graph_json":"https://pith.science/api/pith-number/YR44SNKYQDT3JZEOBR4X5RI4LW/graph.json","events_json":"https://pith.science/api/pith-number/YR44SNKYQDT3JZEOBR4X5RI4LW/events.json","paper":"https://pith.science/paper/YR44SNKY"},"agent_actions":{"view_html":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW","download_json":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW.json","view_paper":"https://pith.science/paper/YR44SNKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06127&json=true","fetch_graph":"https://pith.science/api/pith-number/YR44SNKYQDT3JZEOBR4X5RI4LW/graph.json","fetch_events":"https://pith.science/api/pith-number/YR44SNKYQDT3JZEOBR4X5RI4LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/action/storage_attestation","attest_author":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/action/author_attestation","sign_citation":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/action/citation_signature","submit_replication":"https://pith.science/pith/YR44SNKYQDT3JZEOBR4X5RI4LW/action/replication_record"}},"created_at":"2026-05-18T00:48:29.413558+00:00","updated_at":"2026-05-18T00:48:29.413558+00:00"}