{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WW4HPVKE6GTYH2HOJNFCDGTVH3","short_pith_number":"pith:WW4HPVKE","schema_version":"1.0","canonical_sha256":"b5b877d544f1a783e8ee4b4a219a753eea2a1493f8a02b3dad96d8f64b34c4c7","source":{"kind":"arxiv","id":"1704.05535","version":1},"attestation_state":"computed","paper":{"title":"Optimal Jittered Sampling for two Points in the Unit Square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Florian Pausinger, Manas Rachh, Stefan Steinerberger","submitted_at":"2017-04-18T21:23:28Z","abstract_excerpt":"Jittered Sampling is a refinement of the classical Monte Carlo sampling method. Instead of picking $n$ points randomly from $[0,1]^2$, one partitions the unit square into $n$ regions of equal measure and then chooses a point randomly from each partition. Currently, no good rules for how to partition the space are available. In this paper, we present a solution for the special case of subdividing the unit square by a decreasing function into two regions so as to minimize the expected squared $\\mathcal{L}_2-$discrepancy. The optimal partitions are given by a \\textit{highly} nonlinear integral eq"},"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":"1704.05535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-18T21:23:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"25213dd4bba0c4816ebbb9fbcf9b359148d4b691209171156af168e2fd2533bb","abstract_canon_sha256":"b963c7391a84828e07f415145c013c9949e10c2093b5ca939701622b61cdd069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.183481Z","signature_b64":"kJZM4Ed250XRmxfFoHKrthdvpH+9zPAfh3Ar8BKpOLc37Yeq7TIBmnmlsOpzrSkkn5FW9OrYgLdUkuROTM9RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5b877d544f1a783e8ee4b4a219a753eea2a1493f8a02b3dad96d8f64b34c4c7","last_reissued_at":"2026-05-18T00:46:07.183087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.183087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Jittered Sampling for two Points in the Unit Square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Florian Pausinger, Manas Rachh, Stefan Steinerberger","submitted_at":"2017-04-18T21:23:28Z","abstract_excerpt":"Jittered Sampling is a refinement of the classical Monte Carlo sampling method. Instead of picking $n$ points randomly from $[0,1]^2$, one partitions the unit square into $n$ regions of equal measure and then chooses a point randomly from each partition. Currently, no good rules for how to partition the space are available. In this paper, we present a solution for the special case of subdividing the unit square by a decreasing function into two regions so as to minimize the expected squared $\\mathcal{L}_2-$discrepancy. The optimal partitions are given by a \\textit{highly} nonlinear integral eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05535","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":"1704.05535","created_at":"2026-05-18T00:46:07.183154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05535v1","created_at":"2026-05-18T00:46:07.183154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05535","created_at":"2026-05-18T00:46:07.183154+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW4HPVKE6GTY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW4HPVKE6GTYH2HO","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW4HPVKE","created_at":"2026-05-18T12:31:53.515858+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/WW4HPVKE6GTYH2HOJNFCDGTVH3","json":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3.json","graph_json":"https://pith.science/api/pith-number/WW4HPVKE6GTYH2HOJNFCDGTVH3/graph.json","events_json":"https://pith.science/api/pith-number/WW4HPVKE6GTYH2HOJNFCDGTVH3/events.json","paper":"https://pith.science/paper/WW4HPVKE"},"agent_actions":{"view_html":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3","download_json":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3.json","view_paper":"https://pith.science/paper/WW4HPVKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05535&json=true","fetch_graph":"https://pith.science/api/pith-number/WW4HPVKE6GTYH2HOJNFCDGTVH3/graph.json","fetch_events":"https://pith.science/api/pith-number/WW4HPVKE6GTYH2HOJNFCDGTVH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3/action/storage_attestation","attest_author":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3/action/author_attestation","sign_citation":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3/action/citation_signature","submit_replication":"https://pith.science/pith/WW4HPVKE6GTYH2HOJNFCDGTVH3/action/replication_record"}},"created_at":"2026-05-18T00:46:07.183154+00:00","updated_at":"2026-05-18T00:46:07.183154+00:00"}