{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WQARG5ES76WM22CVVJPAMSITJ4","short_pith_number":"pith:WQARG5ES","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"},"canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","source":{"kind":"arxiv","id":"1103.5259","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5259","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5259v3","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5259","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"WQARG5ES76WM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WQARG5ES76WM22CV","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WQARG5ES","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WQARG5ES76WM22CVVJPAMSITJ4","target":"record","payload":{"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"},"canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","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"},"source_kind":"arxiv","source_id":"1103.5259","source_version":3,"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-18T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iolfMRMLLeRPA48g1jw292S+sOSFFhuiD8JN/0etT07uMVHS2rr1flFIjGpfboSne07o9vCyti14MV8DD4ZDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:40:11.811586Z"},"content_sha256":"2390a8857f2f5e6b7177e9c3cac0bbb0906d04cb712c71f8156d112befb824d8","schema_version":"1.0","event_id":"sha256:2390a8857f2f5e6b7177e9c3cac0bbb0906d04cb712c71f8156d112befb824d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WQARG5ES76WM22CVVJPAMSITJ4","target":"graph","payload":{"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"},"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-18T01:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FkPckUSAzaNFTZ2gTLBFG0GjYxFLsjGOC6cSgLSYjhQZ90q1DQ6ZyHUze87Cp57dkPlGFLNzotzH00Y0RujDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:40:11.812177Z"},"content_sha256":"80e70e1510166bd21ae9d155d85f27a2f11cf06bdeaf065c9cebd1c19b81bc84","schema_version":"1.0","event_id":"sha256:80e70e1510166bd21ae9d155d85f27a2f11cf06bdeaf065c9cebd1c19b81bc84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/bundle.json","state_url":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQARG5ES76WM22CVVJPAMSITJ4/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-07T12:40:11Z","links":{"resolver":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4","bundle":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/bundle.json","state":"https://pith.science/pith/WQARG5ES76WM22CVVJPAMSITJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQARG5ES76WM22CVVJPAMSITJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WQARG5ES76WM22CVVJPAMSITJ4","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":"1f23068b85e25b73dffc8c7afc41d82403de4146956838e4de001ea3c78a6fd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-27T23:58:45Z","title_canon_sha256":"eefc67fd751d9844769eb0dd70294f5a0568c259a91d3c9f51629c471bef5bff"},"schema_version":"1.0","source":{"id":"1103.5259","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5259","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5259v3","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5259","created_at":"2026-05-18T01:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"WQARG5ES76WM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WQARG5ES76WM22CV","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WQARG5ES","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:80e70e1510166bd21ae9d155d85f27a2f11cf06bdeaf065c9cebd1c19b81bc84","target":"graph","created_at":"2026-05-18T01:18:04Z","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":"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 ","authors_text":"\\'Ad\\'am Tim\\'ar, Roland Mark\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-27T23:58:45Z","title":"A Poisson allocation of optimal tail"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5259","kind":"arxiv","version":3},"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:2390a8857f2f5e6b7177e9c3cac0bbb0906d04cb712c71f8156d112befb824d8","target":"record","created_at":"2026-05-18T01:18:04Z","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":"1f23068b85e25b73dffc8c7afc41d82403de4146956838e4de001ea3c78a6fd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-27T23:58:45Z","title_canon_sha256":"eefc67fd751d9844769eb0dd70294f5a0568c259a91d3c9f51629c471bef5bff"},"schema_version":"1.0","source":{"id":"1103.5259","kind":"arxiv","version":3}},"canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b401137492ffaccd6855aa5e0649134f1f506838b2cf78007983ffc9c1a655af","first_computed_at":"2026-05-18T01:18:04.887442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:04.887442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TBoqkQLzDnwmBR4RTd4YmpJZsg3DOM144xpWiZ8QZp6td1usl3NfDezTLd754WIKIMQ4YH6ul2P2V2uEkEsHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:04.888133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5259","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2390a8857f2f5e6b7177e9c3cac0bbb0906d04cb712c71f8156d112befb824d8","sha256:80e70e1510166bd21ae9d155d85f27a2f11cf06bdeaf065c9cebd1c19b81bc84"],"state_sha256":"5241f714fc071090d0503cd9f5b6d274d5d839f45b09d1fd055a4ac51a4e2ec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvsarHfgK6X0LdVwWTgVeusjxuy09Ok95eI1K702Ld/xvgH3FVETq/RPPuduByS/GUWnG2QHeBgCLJXQNWnNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:40:11.814989Z","bundle_sha256":"c1fddcaaf02b4bcbe8aea16033523535c824126aa43ebb2bb8b62e3476f031ad"}}