{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZRSFKXISH2Y6WQE3TCCBZK3WBX","short_pith_number":"pith:ZRSFKXIS","canonical_record":{"source":{"id":"1307.7774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-30T01:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"c027cbb84ea147b71c5c63c85c3ef8c6afb3d51e19d16b8a04153c02b5a0d4c6","abstract_canon_sha256":"c1036657e635fa6a91ee88f5d3d28dcae97e3ec9d114a770afc3518ff88e5ad3"},"schema_version":"1.0"},"canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","source":{"kind":"arxiv","id":"1307.7774","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7774","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7774v2","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7774","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRSFKXISH2Y6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZRSFKXISH2Y6WQE3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZRSFKXIS","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZRSFKXISH2Y6WQE3TCCBZK3WBX","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-30T01:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"c027cbb84ea147b71c5c63c85c3ef8c6afb3d51e19d16b8a04153c02b5a0d4c6","abstract_canon_sha256":"c1036657e635fa6a91ee88f5d3d28dcae97e3ec9d114a770afc3518ff88e5ad3"},"schema_version":"1.0"},"canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:23.665850Z","signature_b64":"+R3ZvLD494RwrgX5cniuYZuBiCtsx/EWKknUA3p/WjQMLVJm5RUTzcTGjW47BmQ87bX5+f6/UM8sOP+rcX55Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","last_reissued_at":"2026-05-18T02:57:23.665221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:23.665221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7774","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-18T02:57:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYkH2YqlBGmcgED2IMf5SfpdNtGMzmb+0k+BFMrMMtp7k67axNgPseOBGz3qH/yGk8D1vCRK/mmbyTviChGnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:40:10.082129Z"},"content_sha256":"3001d7929842a9a99aa531ac35ab9a20da739045e6fcb8d310551d66ff8dcbca","schema_version":"1.0","event_id":"sha256:3001d7929842a9a99aa531ac35ab9a20da739045e6fcb8d310551d66ff8dcbca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZRSFKXISH2Y6WQE3TCCBZK3WBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual potentials for capacity constrained optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Seis, Jonathan Korman, Robert J. McCann","submitted_at":"2013-07-30T01:39:01Z","abstract_excerpt":"Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density $f \\in L^1(\\mathbb{R}^m)$ onto another one $g \\in L^1(\\mathbb{R}^n)$ so as to optimize a cost function $c \\in L^1(\\mathbb{R}^{m+n})$ while respecting the capacity constraints $0\\le h \\le \\bar h\\in L^\\infty(\\mathbb{R}^{m+n})$.\n  A linear programming duality theorem for this problem was first established by Levin. In this note, we prove under mild assumptions on the given data, the existence of a pair of $L^1$-functions optimizing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7774","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-18T02:57:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNuBujsJ4tw49mtcatxJGyOYVhdMa+VnpezwfcSXu1hddsMtlstZd2Xx6FtD6RcDucYljdlp3PozhUPVfszxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:40:10.082487Z"},"content_sha256":"afe2d7d6f805cf4df728f329233e92765278c4b9e9b8076e0697d554f7e9f8fb","schema_version":"1.0","event_id":"sha256:afe2d7d6f805cf4df728f329233e92765278c4b9e9b8076e0697d554f7e9f8fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/bundle.json","state_url":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/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-06-30T06:40:10Z","links":{"resolver":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX","bundle":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/bundle.json","state":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZRSFKXISH2Y6WQE3TCCBZK3WBX","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":"c1036657e635fa6a91ee88f5d3d28dcae97e3ec9d114a770afc3518ff88e5ad3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-30T01:39:01Z","title_canon_sha256":"c027cbb84ea147b71c5c63c85c3ef8c6afb3d51e19d16b8a04153c02b5a0d4c6"},"schema_version":"1.0","source":{"id":"1307.7774","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7774","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7774v2","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7774","created_at":"2026-05-18T02:57:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRSFKXISH2Y6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZRSFKXISH2Y6WQE3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZRSFKXIS","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:afe2d7d6f805cf4df728f329233e92765278c4b9e9b8076e0697d554f7e9f8fb","target":"graph","created_at":"2026-05-18T02:57:23Z","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":"Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density $f \\in L^1(\\mathbb{R}^m)$ onto another one $g \\in L^1(\\mathbb{R}^n)$ so as to optimize a cost function $c \\in L^1(\\mathbb{R}^{m+n})$ while respecting the capacity constraints $0\\le h \\le \\bar h\\in L^\\infty(\\mathbb{R}^{m+n})$.\n  A linear programming duality theorem for this problem was first established by Levin. In this note, we prove under mild assumptions on the given data, the existence of a pair of $L^1$-functions optimizing th","authors_text":"Christian Seis, Jonathan Korman, Robert J. McCann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-30T01:39:01Z","title":"Dual potentials for capacity constrained optimal transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7774","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:3001d7929842a9a99aa531ac35ab9a20da739045e6fcb8d310551d66ff8dcbca","target":"record","created_at":"2026-05-18T02:57:23Z","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":"c1036657e635fa6a91ee88f5d3d28dcae97e3ec9d114a770afc3518ff88e5ad3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-30T01:39:01Z","title_canon_sha256":"c027cbb84ea147b71c5c63c85c3ef8c6afb3d51e19d16b8a04153c02b5a0d4c6"},"schema_version":"1.0","source":{"id":"1307.7774","kind":"arxiv","version":2}},"canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","first_computed_at":"2026-05-18T02:57:23.665221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:23.665221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+R3ZvLD494RwrgX5cniuYZuBiCtsx/EWKknUA3p/WjQMLVJm5RUTzcTGjW47BmQ87bX5+f6/UM8sOP+rcX55Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:23.665850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7774","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3001d7929842a9a99aa531ac35ab9a20da739045e6fcb8d310551d66ff8dcbca","sha256:afe2d7d6f805cf4df728f329233e92765278c4b9e9b8076e0697d554f7e9f8fb"],"state_sha256":"34d00485c92fb74761d90aa012bb8d24460ae373a5c2855532cb380800dc7c7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxd8c1/C1uVyjkR/Dn0mSCt77iIe2qnwnIM80CrVXy8peQmcI6axXJxO+Kff+JtrUJ28lpwzkdz+mNvj/BRbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T06:40:10.084460Z","bundle_sha256":"e635b09abd4581153935dd756cabd8b841776c41093995ba310fe4a3e43eedd5"}}