{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZRSFKXISH2Y6WQE3TCCBZK3WBX","short_pith_number":"pith:ZRSFKXIS","schema_version":"1.0","canonical_sha256":"cc64555d123eb1eb409b98841cab760dc7fcf5692878b6a6b0f9469a691f1584","source":{"kind":"arxiv","id":"1307.7774","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.7774","created_at":"2026-05-18T02:57:23.665357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7774v2","created_at":"2026-05-18T02:57:23.665357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7774","created_at":"2026-05-18T02:57:23.665357+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRSFKXISH2Y6","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRSFKXISH2Y6WQE3","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRSFKXIS","created_at":"2026-05-18T12:28:09.283467+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/ZRSFKXISH2Y6WQE3TCCBZK3WBX","json":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX.json","graph_json":"https://pith.science/api/pith-number/ZRSFKXISH2Y6WQE3TCCBZK3WBX/graph.json","events_json":"https://pith.science/api/pith-number/ZRSFKXISH2Y6WQE3TCCBZK3WBX/events.json","paper":"https://pith.science/paper/ZRSFKXIS"},"agent_actions":{"view_html":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX","download_json":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX.json","view_paper":"https://pith.science/paper/ZRSFKXIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7774&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRSFKXISH2Y6WQE3TCCBZK3WBX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRSFKXISH2Y6WQE3TCCBZK3WBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/action/storage_attestation","attest_author":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/action/author_attestation","sign_citation":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/action/citation_signature","submit_replication":"https://pith.science/pith/ZRSFKXISH2Y6WQE3TCCBZK3WBX/action/replication_record"}},"created_at":"2026-05-18T02:57:23.665357+00:00","updated_at":"2026-05-18T02:57:23.665357+00:00"}