{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6EFSUCPUWMFZEXUKBNSEB66IR3","short_pith_number":"pith:6EFSUCPU","canonical_record":{"source":{"id":"0902.4304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"ab31e73b2f41c4449facfda489f1bbdc2a3a89809895eebfa16078d1fc461693","abstract_canon_sha256":"2cc1fbb67053e5ecfaadfe207cb089de40009828a9f56c670e2e4b82e60d54f9"},"schema_version":"1.0"},"canonical_sha256":"f10b2a09f4b30b925e8a0b6440fbc88efa36cd1232bb8e78d100376d84e05ce3","source":{"kind":"arxiv","id":"0902.4304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4304","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4304v2","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4304","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"6EFSUCPUWMFZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6EFSUCPUWMFZEXUK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6EFSUCPU","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6EFSUCPUWMFZEXUKBNSEB66IR3","target":"record","payload":{"canonical_record":{"source":{"id":"0902.4304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"ab31e73b2f41c4449facfda489f1bbdc2a3a89809895eebfa16078d1fc461693","abstract_canon_sha256":"2cc1fbb67053e5ecfaadfe207cb089de40009828a9f56c670e2e4b82e60d54f9"},"schema_version":"1.0"},"canonical_sha256":"f10b2a09f4b30b925e8a0b6440fbc88efa36cd1232bb8e78d100376d84e05ce3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:54.639709Z","signature_b64":"jAfjiYDnnhYb+1BkV+2JhxQ3RLifKeYMq8+KXn0Ql97EPpvHh2cMZgaU1JwIBLxbw7rimlFOu2UeFEjlnH2ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f10b2a09f4b30b925e8a0b6440fbc88efa36cd1232bb8e78d100376d84e05ce3","last_reissued_at":"2026-05-18T04:32:54.639085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:54.639085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.4304","source_version":2,"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-18T04:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAriXJsl+2mKePTaR8QwNgFycjHGlyhusTrpxTfUkhg/02yGDqcAB5vfM93yo5Hkk6rQVcSNUYsKwEss/eX0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:29:41.943251Z"},"content_sha256":"d94d95c765f1b0b2cd21821cb346fdb06c0e72f0b409f61e487eeedc4d08bd44","schema_version":"1.0","event_id":"sha256:d94d95c765f1b0b2cd21821cb346fdb06c0e72f0b409f61e487eeedc4d08bd44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6EFSUCPUWMFZEXUKBNSEB66IR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Load optimization in a planar network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles Bordenave (IMT), Giovanni Luca Torrisi (IAC)","submitted_at":"2009-02-25T08:04:00Z","abstract_excerpt":"We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost depending on its position. Two allocations are considered: the allocation minimizing the bin loads and the allocation allocating each object to its less costly bin. We analyze the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we derive a law of large numbers, a central limit theorem and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4304","kind":"arxiv","version":2},"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-18T04:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PotBtCSLFZzCxcIvsDzOJSg/NVZoqdH9bD49JcYTdfBAajhBchFxEkWH9+6+mLNKkJrv7MTxyUdEV+APJrppDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:29:41.943924Z"},"content_sha256":"bfb3ceb91d0d578f5009bc5eda2827c942a4ddb0fd43dd25cd913163aa939439","schema_version":"1.0","event_id":"sha256:bfb3ceb91d0d578f5009bc5eda2827c942a4ddb0fd43dd25cd913163aa939439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/bundle.json","state_url":"https://pith.science/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/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-05-21T13:29:41Z","links":{"resolver":"https://pith.science/pith/6EFSUCPUWMFZEXUKBNSEB66IR3","bundle":"https://pith.science/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/bundle.json","state":"https://pith.science/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EFSUCPUWMFZEXUKBNSEB66IR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6EFSUCPUWMFZEXUKBNSEB66IR3","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":"2cc1fbb67053e5ecfaadfe207cb089de40009828a9f56c670e2e4b82e60d54f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:04:00Z","title_canon_sha256":"ab31e73b2f41c4449facfda489f1bbdc2a3a89809895eebfa16078d1fc461693"},"schema_version":"1.0","source":{"id":"0902.4304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4304","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4304v2","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4304","created_at":"2026-05-18T04:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"6EFSUCPUWMFZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6EFSUCPUWMFZEXUK","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6EFSUCPU","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:bfb3ceb91d0d578f5009bc5eda2827c942a4ddb0fd43dd25cd913163aa939439","target":"graph","created_at":"2026-05-18T04:32:54Z","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":"We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost depending on its position. Two allocations are considered: the allocation minimizing the bin loads and the allocation allocating each object to its less costly bin. We analyze the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we derive a law of large numbers, a central limit theorem and","authors_text":"Charles Bordenave (IMT), Giovanni Luca Torrisi (IAC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:04:00Z","title":"Load optimization in a planar network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4304","kind":"arxiv","version":2},"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:d94d95c765f1b0b2cd21821cb346fdb06c0e72f0b409f61e487eeedc4d08bd44","target":"record","created_at":"2026-05-18T04:32:54Z","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":"2cc1fbb67053e5ecfaadfe207cb089de40009828a9f56c670e2e4b82e60d54f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:04:00Z","title_canon_sha256":"ab31e73b2f41c4449facfda489f1bbdc2a3a89809895eebfa16078d1fc461693"},"schema_version":"1.0","source":{"id":"0902.4304","kind":"arxiv","version":2}},"canonical_sha256":"f10b2a09f4b30b925e8a0b6440fbc88efa36cd1232bb8e78d100376d84e05ce3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f10b2a09f4b30b925e8a0b6440fbc88efa36cd1232bb8e78d100376d84e05ce3","first_computed_at":"2026-05-18T04:32:54.639085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:54.639085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jAfjiYDnnhYb+1BkV+2JhxQ3RLifKeYMq8+KXn0Ql97EPpvHh2cMZgaU1JwIBLxbw7rimlFOu2UeFEjlnH2ACg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:54.639709Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.4304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d94d95c765f1b0b2cd21821cb346fdb06c0e72f0b409f61e487eeedc4d08bd44","sha256:bfb3ceb91d0d578f5009bc5eda2827c942a4ddb0fd43dd25cd913163aa939439"],"state_sha256":"e3bd950cf2b9223c2fef862e4e5536af747529cee730ae44e25c8c3915497183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxFgJgMmBZcBBm4F0h96Ajb+LqjjMr6xw1lMQmPwpufAt9WWkLwQ5IuLRHF3m8uNUZ9LEgZnqLpLrfVwnEiqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:29:41.946915Z","bundle_sha256":"e1f70372d2cee46d4dc61fc5029558fd5eb11a613b1fd1fe45ed55543b1b978b"}}