{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:KZKEFIMSTX2AUE6LYKNGVUDIYB","short_pith_number":"pith:KZKEFIMS","schema_version":"1.0","canonical_sha256":"565442a1929df40a13cbc29a6ad068c06ebf68223f98e46ec8cd7d5eb0fd9d51","source":{"kind":"arxiv","id":"math/0612718","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0612718","created_at":"2026-05-18T00:30:29.133263+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612718v1","created_at":"2026-05-18T00:30:29.133263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612718","created_at":"2026-05-18T00:30:29.133263+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZKEFIMSTX2A","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZKEFIMSTX2AUE6L","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZKEFIMS","created_at":"2026-05-18T12:25:54.717736+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/KZKEFIMSTX2AUE6LYKNGVUDIYB","json":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB.json","graph_json":"https://pith.science/api/pith-number/KZKEFIMSTX2AUE6LYKNGVUDIYB/graph.json","events_json":"https://pith.science/api/pith-number/KZKEFIMSTX2AUE6LYKNGVUDIYB/events.json","paper":"https://pith.science/paper/KZKEFIMS"},"agent_actions":{"view_html":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB","download_json":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB.json","view_paper":"https://pith.science/paper/KZKEFIMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612718&json=true","fetch_graph":"https://pith.science/api/pith-number/KZKEFIMSTX2AUE6LYKNGVUDIYB/graph.json","fetch_events":"https://pith.science/api/pith-number/KZKEFIMSTX2AUE6LYKNGVUDIYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/action/storage_attestation","attest_author":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/action/author_attestation","sign_citation":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/action/citation_signature","submit_replication":"https://pith.science/pith/KZKEFIMSTX2AUE6LYKNGVUDIYB/action/replication_record"}},"created_at":"2026-05-18T00:30:29.133263+00:00","updated_at":"2026-05-18T00:30:29.133263+00:00"}