{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IFERO73EQMJNLQLVMO76SQW5OW","short_pith_number":"pith:IFERO73E","schema_version":"1.0","canonical_sha256":"4149177f648312d5c17563bfe942dd75b3fb94766076f2f4bb310bdba2d39fc9","source":{"kind":"arxiv","id":"1206.3057","version":1},"attestation_state":"computed","paper":{"title":"Optimally solving a transportation problem using Voronoi diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Darius Gei\\ss, G\\\"unter Rote, Rainer Penninger, Rolf Klein","submitted_at":"2012-06-14T09:51:04Z","abstract_excerpt":"We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p receives a subset C_p of prescribed volume, and (ii) the average distance of all points of C from their respective sites p is minimized. In our model, volume is quantified by some measure, and the distance between a site p and a point z is given by a function d_p(z). Under quite liberal technical assumptions on C and on the functions d_p we show that a solu"},"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":"1206.3057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2012-06-14T09:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"fba52d357d61004a21fdd1f7903766b6d5179f9753ca4553a9d98974a7e36613","abstract_canon_sha256":"0d7b785ff296df69e4ef000e9dafd057bb94e0da10a35046aa5c4979b179287c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.159243Z","signature_b64":"DFVAAAuyg6yWY8HraG93QOnzVHeRZj1uYeG/E+uJSQ1G50JDZV0PXSCaDGgDf1q6moSqJ0wL+vqC96jDL4c9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4149177f648312d5c17563bfe942dd75b3fb94766076f2f4bb310bdba2d39fc9","last_reissued_at":"2026-05-18T02:26:59.158895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.158895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally solving a transportation problem using Voronoi diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Darius Gei\\ss, G\\\"unter Rote, Rainer Penninger, Rolf Klein","submitted_at":"2012-06-14T09:51:04Z","abstract_excerpt":"We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p receives a subset C_p of prescribed volume, and (ii) the average distance of all points of C from their respective sites p is minimized. In our model, volume is quantified by some measure, and the distance between a site p and a point z is given by a function d_p(z). Under quite liberal technical assumptions on C and on the functions d_p we show that a solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3057","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":"1206.3057","created_at":"2026-05-18T02:26:59.158949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3057v1","created_at":"2026-05-18T02:26:59.158949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3057","created_at":"2026-05-18T02:26:59.158949+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFERO73EQMJN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFERO73EQMJNLQLV","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFERO73E","created_at":"2026-05-18T12:27:09.501522+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/IFERO73EQMJNLQLVMO76SQW5OW","json":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW.json","graph_json":"https://pith.science/api/pith-number/IFERO73EQMJNLQLVMO76SQW5OW/graph.json","events_json":"https://pith.science/api/pith-number/IFERO73EQMJNLQLVMO76SQW5OW/events.json","paper":"https://pith.science/paper/IFERO73E"},"agent_actions":{"view_html":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW","download_json":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW.json","view_paper":"https://pith.science/paper/IFERO73E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3057&json=true","fetch_graph":"https://pith.science/api/pith-number/IFERO73EQMJNLQLVMO76SQW5OW/graph.json","fetch_events":"https://pith.science/api/pith-number/IFERO73EQMJNLQLVMO76SQW5OW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW/action/storage_attestation","attest_author":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW/action/author_attestation","sign_citation":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW/action/citation_signature","submit_replication":"https://pith.science/pith/IFERO73EQMJNLQLVMO76SQW5OW/action/replication_record"}},"created_at":"2026-05-18T02:26:59.158949+00:00","updated_at":"2026-05-18T02:26:59.158949+00:00"}