{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WQARG5ES76WM22CVVJPAMSITJ4","short_pith_number":"pith:WQARG5ES","schema_version":"1.0","canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","source":{"kind":"arxiv","id":"1103.5259","version":3},"attestation_state":"computed","paper":{"title":"A Poisson allocation of optimal tail","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Ad\\'am Tim\\'ar, Roland Mark\\'o","submitted_at":"2011-03-27T23:58:45Z","abstract_excerpt":"The allocation problem for a $d$-dimensional Poisson point process is to find a way to partition the space to parts of equal size, and to assign the parts to the configuration points in a measurable, \"deterministic\" (equivariant) way. The goal is to make the diameter $R$ of the part assigned to a configuration point have fast decay. We present an algorithm for $d\\geq3$ that achieves an $O(\\operatorname {exp}(-cR^d))$ tail, which is optimal up to $c$. This improves the best previously known allocation rule, the gravitational allocation, which has an $\\operatorname {exp}(-R^{1+o(1)})$ tail. The "},"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":"1103.5259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-27T23:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"eefc67fd751d9844769eb0dd70294f5a0568c259a91d3c9f51629c471bef5bff","abstract_canon_sha256":"1f23068b85e25b73dffc8c7afc41d82403de4146956838e4de001ea3c78a6fd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:04.888133Z","signature_b64":"TBoqkQLzDnwmBR4RTd4YmpJZsg3DOM144xpWiZ8QZp6td1usl3NfDezTLd754WIKIMQ4YH6ul2P2V2uEkEsHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","last_reissued_at":"2026-05-18T01:18:04.887442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:04.887442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Poisson allocation of optimal tail","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"\\'Ad\\'am Tim\\'ar, Roland Mark\\'o","submitted_at":"2011-03-27T23:58:45Z","abstract_excerpt":"The allocation problem for a $d$-dimensional Poisson point process is to find a way to partition the space to parts of equal size, and to assign the parts to the configuration points in a measurable, \"deterministic\" (equivariant) way. The goal is to make the diameter $R$ of the part assigned to a configuration point have fast decay. We present an algorithm for $d\\geq3$ that achieves an $O(\\operatorname {exp}(-cR^d))$ tail, which is optimal up to $c$. This improves the best previously known allocation rule, the gravitational allocation, which has an $\\operatorname {exp}(-R^{1+o(1)})$ tail. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5259","kind":"arxiv","version":3},"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":"1103.5259","created_at":"2026-05-18T01:18:04.887553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5259v3","created_at":"2026-05-18T01:18:04.887553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5259","created_at":"2026-05-18T01:18:04.887553+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQARG5ES76WM","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQARG5ES76WM22CV","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQARG5ES","created_at":"2026-05-18T12:26:44.992195+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/WQARG5ES76WM22CVVJPAMSITJ4","json":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4.json","graph_json":"https://pith.science/api/pith-number/WQARG5ES76WM22CVVJPAMSITJ4/graph.json","events_json":"https://pith.science/api/pith-number/WQARG5ES76WM22CVVJPAMSITJ4/events.json","paper":"https://pith.science/paper/WQARG5ES"},"agent_actions":{"view_html":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4","download_json":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4.json","view_paper":"https://pith.science/paper/WQARG5ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5259&json=true","fetch_graph":"https://pith.science/api/pith-number/WQARG5ES76WM22CVVJPAMSITJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/WQARG5ES76WM22CVVJPAMSITJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/action/storage_attestation","attest_author":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/action/author_attestation","sign_citation":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/action/citation_signature","submit_replication":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/action/replication_record"}},"created_at":"2026-05-18T01:18:04.887553+00:00","updated_at":"2026-05-18T01:18:04.887553+00:00"}