{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:KZKEFIMSTX2AUE6LYKNGVUDIYB","short_pith_number":"pith:KZKEFIMS","canonical_record":{"source":{"id":"math/0612718","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-12-22T18:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"42b94648828740a623702175d7867d4530f3ae06f9b8e67db4a76cf8bfe1a3ea","abstract_canon_sha256":"13608bf490e1ffdc38e716f1a78bf851ac6327c9452b8c6847ab8f73b60a2445"},"schema_version":"1.0"},"canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","source":{"kind":"arxiv","id":"math/0612718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612718","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612718v1","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612718","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"KZKEFIMSTX2A","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"KZKEFIMSTX2AUE6L","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"KZKEFIMS","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:KZKEFIMSTX2AUE6LYKNGVUDIYB","target":"record","payload":{"canonical_record":{"source":{"id":"math/0612718","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-12-22T18:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"42b94648828740a623702175d7867d4530f3ae06f9b8e67db4a76cf8bfe1a3ea","abstract_canon_sha256":"13608bf490e1ffdc38e716f1a78bf851ac6327c9452b8c6847ab8f73b60a2445"},"schema_version":"1.0"},"canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:29.133661Z","signature_b64":"VrpKx6AT5TuwQ7f+IBF/noczmFEVMT7L6i3emXrSStwTJJIgjl7RV3VhlFNz0qLN85IScQeT80wmfeA2nEmgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","last_reissued_at":"2026-05-18T00:30:29.133188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:29.133188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0612718","source_version":1,"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-18T00:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/iNiGdvh8hH0F1K4A3PAi3BrFEjTumwMgtP2xIvTJAh0xxy5OxiyA4jWSh2gxsWqpc+qROoXEQJickpp3vbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:18:54.895204Z"},"content_sha256":"af87d1aa989b6ea874b148857f214ffd16199cf25e012345afce4211eba642b4","schema_version":"1.0","event_id":"sha256:af87d1aa989b6ea874b148857f214ffd16199cf25e012345afce4211eba642b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:KZKEFIMSTX2AUE6LYKNGVUDIYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long-term planning versus short-term planning in the asymptotical location problem","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. Brancolini, E. Stepanov, F. Santambrogio, G. Buttazzo","submitted_at":"2006-12-22T18:36:52Z","abstract_excerpt":"Given the probability measure $\\nu$ over the given region $\\Omega\\subset \\R^n$, we consider the optimal location of a set $\\Sigma$ composed by $n$ points $\\Om$ in order to minimize the average distance $\\Sigma\\mapsto \\int_\\Om \\dist(x,\\Sigma) d\\nu$ (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all $n$ points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving the configuration bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612718","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"},"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-18T00:30:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9QYcaEIBrOpUBDBj93Pf+c/yzgZxlyG+ZTH7qiWO+/1ZbheLxqGMlbqFzpGFLop+MW37lb2TVr294rlrr0tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:18:54.895612Z"},"content_sha256":"f988420a70421df6aed7063d27c7e7054a630f2f8dfa9863dd47306609a9e8cb","schema_version":"1.0","event_id":"sha256:f988420a70421df6aed7063d27c7e7054a630f2f8dfa9863dd47306609a9e8cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/bundle.json","state_url":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/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-30T12:18:54Z","links":{"resolver":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB","bundle":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/bundle.json","state":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:KZKEFIMSTX2AUE6LYKNGVUDIYB","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":"13608bf490e1ffdc38e716f1a78bf851ac6327c9452b8c6847ab8f73b60a2445","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2006-12-22T18:36:52Z","title_canon_sha256":"42b94648828740a623702175d7867d4530f3ae06f9b8e67db4a76cf8bfe1a3ea"},"schema_version":"1.0","source":{"id":"math/0612718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0612718","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"arxiv_version","alias_value":"math/0612718v1","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612718","created_at":"2026-05-18T00:30:29Z"},{"alias_kind":"pith_short_12","alias_value":"KZKEFIMSTX2A","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"KZKEFIMSTX2AUE6L","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"KZKEFIMS","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:f988420a70421df6aed7063d27c7e7054a630f2f8dfa9863dd47306609a9e8cb","target":"graph","created_at":"2026-05-18T00:30:29Z","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":"Given the probability measure $\\nu$ over the given region $\\Omega\\subset \\R^n$, we consider the optimal location of a set $\\Sigma$ composed by $n$ points $\\Om$ in order to minimize the average distance $\\Sigma\\mapsto \\int_\\Om \\dist(x,\\Sigma) d\\nu$ (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists in placing all $n$ points at once in an optimal position, and the short-term one which consists in placing the points one by one adding at each step at most one point and preserving the configuration bu","authors_text":"A. Brancolini, E. Stepanov, F. Santambrogio, G. Buttazzo","cross_cats":[],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2006-12-22T18:36:52Z","title":"Long-term planning versus short-term planning in the asymptotical location problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612718","kind":"arxiv","version":1},"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:af87d1aa989b6ea874b148857f214ffd16199cf25e012345afce4211eba642b4","target":"record","created_at":"2026-05-18T00:30:29Z","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":"13608bf490e1ffdc38e716f1a78bf851ac6327c9452b8c6847ab8f73b60a2445","cross_cats_sorted":[],"license":"","primary_cat":"math.OC","submitted_at":"2006-12-22T18:36:52Z","title_canon_sha256":"42b94648828740a623702175d7867d4530f3ae06f9b8e67db4a76cf8bfe1a3ea"},"schema_version":"1.0","source":{"id":"math/0612718","kind":"arxiv","version":1}},"canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","first_computed_at":"2026-05-18T00:30:29.133188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:29.133188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VrpKx6AT5TuwQ7f+IBF/noczmFEVMT7L6i3emXrSStwTJJIgjl7RV3VhlFNz0qLN85IScQeT80wmfeA2nEmgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:29.133661Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0612718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af87d1aa989b6ea874b148857f214ffd16199cf25e012345afce4211eba642b4","sha256:f988420a70421df6aed7063d27c7e7054a630f2f8dfa9863dd47306609a9e8cb"],"state_sha256":"2d6bdc192cf36d16dbb5d31784a07cf5bd6daed59518e7a8e288807c16844476"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Acaex6vs+8q4K1vBEWyZEu6L2OjBLJFDLj7y6Lk0ScOdZq2ZxQgK6RvuVhKlVlZmIam0JQ4M91AAJWEoBdu3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:18:54.899674Z","bundle_sha256":"a3fe7fbab72dcd4cc445f0834e4440ac43a1af636c4e64f55a0982e8ddb874dc"}}