{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OQ6DWYU3R3C6MGNBJQ6LCE4FID","short_pith_number":"pith:OQ6DWYU3","canonical_record":{"source":{"id":"1706.07650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-23T11:57:37Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"b7c1471dca03a28549f863dffd38303715846f73195ae2e6ce31b41ca7c6ed38","abstract_canon_sha256":"46017efc4578f3db82b9132d51b484a693218f6e7f33c117ac08d59b3752a429"},"schema_version":"1.0"},"canonical_sha256":"743c3b629b8ec5e619a14c3cb1138540de1f27c4b00ca167fe8146181cd1bf14","source":{"kind":"arxiv","id":"1706.07650","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07650","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07650v2","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07650","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"OQ6DWYU3R3C6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQ6DWYU3R3C6MGNB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQ6DWYU3","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OQ6DWYU3R3C6MGNBJQ6LCE4FID","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-23T11:57:37Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"b7c1471dca03a28549f863dffd38303715846f73195ae2e6ce31b41ca7c6ed38","abstract_canon_sha256":"46017efc4578f3db82b9132d51b484a693218f6e7f33c117ac08d59b3752a429"},"schema_version":"1.0"},"canonical_sha256":"743c3b629b8ec5e619a14c3cb1138540de1f27c4b00ca167fe8146181cd1bf14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.205164Z","signature_b64":"/3ffrvBv9Xr7n2evnu/3zI2RWtK4rce72Df2qcwgBW4mCtJ0KtWwm2gQpMU1tCj45queVPOmjTJaP+98rJlyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743c3b629b8ec5e619a14c3cb1138540de1f27c4b00ca167fe8146181cd1bf14","last_reissued_at":"2026-05-18T00:04:05.204455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.204455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07650","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-18T00:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3SGc13Vvs/72iNkhkdPU5OpyGBJSOe/jZKATo/RAWb6Z7bS1mPFW1t0pms+9aotY5aQEeFx+kZrqBTQgyBJGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:49.672645Z"},"content_sha256":"9a3ef179c99fb9c44d9bc6785587d1f74405a1b955734284622530fd91f8fded","schema_version":"1.0","event_id":"sha256:9a3ef179c99fb9c44d9bc6785587d1f74405a1b955734284622530fd91f8fded"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OQ6DWYU3R3C6MGNBJQ6LCE4FID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-discrete optimal transport - the case p=1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.NA","authors_text":"Dominic Schuhmacher, Valentin Hartmann","submitted_at":"2017-06-23T11:57:37Z","abstract_excerpt":"We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\\mu$ on $\\mathcal{X} \\subset \\mathbb{R}^d$ and a finitely supported measure $\\nu$ on $\\mathbb{R}^d$ when the transport cost is the Euclidean distance. We may think of this problem as closest distance allocation of some ressource continuously distributed over space to a finite number of processing sites with capacity constraints.\n  This article gives a detailed discussion of the problem, including a comparison with the much better studied case of squared Euclidean cost (\"the case $p=2$\"). We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07650","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-18T00:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgVIIUhyIw7cg+ol7uxVHK+zXqYI/jdjrELgZCiqPTzT7Vkpk3anD7Zi6scUP7T3xVc3YXRq+qba4zPbcnHiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:00:49.673012Z"},"content_sha256":"e32a7b0cb1ce026748b5809e4c2085f1704a0a2ae260b8733d4a750bf60f8002","schema_version":"1.0","event_id":"sha256:e32a7b0cb1ce026748b5809e4c2085f1704a0a2ae260b8733d4a750bf60f8002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/bundle.json","state_url":"https://pith.science/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/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-29T15:00:49Z","links":{"resolver":"https://pith.science/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID","bundle":"https://pith.science/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/bundle.json","state":"https://pith.science/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQ6DWYU3R3C6MGNBJQ6LCE4FID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OQ6DWYU3R3C6MGNBJQ6LCE4FID","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":"46017efc4578f3db82b9132d51b484a693218f6e7f33c117ac08d59b3752a429","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-23T11:57:37Z","title_canon_sha256":"b7c1471dca03a28549f863dffd38303715846f73195ae2e6ce31b41ca7c6ed38"},"schema_version":"1.0","source":{"id":"1706.07650","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07650","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07650v2","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07650","created_at":"2026-05-18T00:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"OQ6DWYU3R3C6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OQ6DWYU3R3C6MGNB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OQ6DWYU3","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:e32a7b0cb1ce026748b5809e4c2085f1704a0a2ae260b8733d4a750bf60f8002","target":"graph","created_at":"2026-05-18T00:04:05Z","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 consider the problem of finding an optimal transport plan between an absolutely continuous measure $\\mu$ on $\\mathcal{X} \\subset \\mathbb{R}^d$ and a finitely supported measure $\\nu$ on $\\mathbb{R}^d$ when the transport cost is the Euclidean distance. We may think of this problem as closest distance allocation of some ressource continuously distributed over space to a finite number of processing sites with capacity constraints.\n  This article gives a detailed discussion of the problem, including a comparison with the much better studied case of squared Euclidean cost (\"the case $p=2$\"). We p","authors_text":"Dominic Schuhmacher, Valentin Hartmann","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-23T11:57:37Z","title":"Semi-discrete optimal transport - the case p=1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07650","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:9a3ef179c99fb9c44d9bc6785587d1f74405a1b955734284622530fd91f8fded","target":"record","created_at":"2026-05-18T00:04:05Z","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":"46017efc4578f3db82b9132d51b484a693218f6e7f33c117ac08d59b3752a429","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-23T11:57:37Z","title_canon_sha256":"b7c1471dca03a28549f863dffd38303715846f73195ae2e6ce31b41ca7c6ed38"},"schema_version":"1.0","source":{"id":"1706.07650","kind":"arxiv","version":2}},"canonical_sha256":"743c3b629b8ec5e619a14c3cb1138540de1f27c4b00ca167fe8146181cd1bf14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"743c3b629b8ec5e619a14c3cb1138540de1f27c4b00ca167fe8146181cd1bf14","first_computed_at":"2026-05-18T00:04:05.204455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:05.204455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3ffrvBv9Xr7n2evnu/3zI2RWtK4rce72Df2qcwgBW4mCtJ0KtWwm2gQpMU1tCj45queVPOmjTJaP+98rJlyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:05.205164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07650","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a3ef179c99fb9c44d9bc6785587d1f74405a1b955734284622530fd91f8fded","sha256:e32a7b0cb1ce026748b5809e4c2085f1704a0a2ae260b8733d4a750bf60f8002"],"state_sha256":"e9219abf72a80994046c1ccb00f87e916c0129089c24bb9fb3abbaa84b183843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2M57yuzb4o9ZhtXJhjE8ExsMbUbT3iGpj7aikYIpldbTO1N0c1VS9Ns2x0P8Yt/EYKSq1uLRkBprwbf4XdZSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:00:49.675612Z","bundle_sha256":"a55f024e4e7b4f6f6084ef6c4bb1690ced6368d9551158bcdcc015ff52101bad"}}