{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WS3GTKDM5ZX2LGE3NMCNBCBGVI","short_pith_number":"pith:WS3GTKDM","schema_version":"1.0","canonical_sha256":"b4b669a86cee6fa5989b6b04d08826aa2dfb2ecc48ab8200037a804229e6443d","source":{"kind":"arxiv","id":"1309.3022","version":1},"attestation_state":"computed","paper":{"title":"A penalization approach to linear programming duality with application to capacity constrained transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Christian Seis, Jonathan Korman, Robert J. McCann","submitted_at":"2013-09-12T03:11:12Z","abstract_excerpt":"A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality theorem for capacity-constrained optimal transport as an infinite-dimensional application."},"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":"1309.3022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-12T03:11:12Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"dad9ac5458c70ce299bdd44ae09d3d573a2b63665667edb49264a29d33560888","abstract_canon_sha256":"b0f8fef7721212f2603e2e18cfca5d35882d4e2f9bbcbce502180302664313ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:33.087490Z","signature_b64":"EdoS16loBrc8A7HgHGds7xAszyCrv4oQ2hSVjwZf7ZsrR4U1tKWflIytSD0Cm5AyEAs/9shkCwvTloi3a3TaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4b669a86cee6fa5989b6b04d08826aa2dfb2ecc48ab8200037a804229e6443d","last_reissued_at":"2026-05-18T03:13:33.086690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:33.086690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A penalization approach to linear programming duality with application to capacity constrained transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Christian Seis, Jonathan Korman, Robert J. McCann","submitted_at":"2013-09-12T03:11:12Z","abstract_excerpt":"A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality theorem for capacity-constrained optimal transport as an infinite-dimensional application."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3022","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":"1309.3022","created_at":"2026-05-18T03:13:33.086813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3022v1","created_at":"2026-05-18T03:13:33.086813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3022","created_at":"2026-05-18T03:13:33.086813+00:00"},{"alias_kind":"pith_short_12","alias_value":"WS3GTKDM5ZX2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WS3GTKDM5ZX2LGE3","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WS3GTKDM","created_at":"2026-05-18T12:28:04.890932+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/WS3GTKDM5ZX2LGE3NMCNBCBGVI","json":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI.json","graph_json":"https://pith.science/api/pith-number/WS3GTKDM5ZX2LGE3NMCNBCBGVI/graph.json","events_json":"https://pith.science/api/pith-number/WS3GTKDM5ZX2LGE3NMCNBCBGVI/events.json","paper":"https://pith.science/paper/WS3GTKDM"},"agent_actions":{"view_html":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI","download_json":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI.json","view_paper":"https://pith.science/paper/WS3GTKDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3022&json=true","fetch_graph":"https://pith.science/api/pith-number/WS3GTKDM5ZX2LGE3NMCNBCBGVI/graph.json","fetch_events":"https://pith.science/api/pith-number/WS3GTKDM5ZX2LGE3NMCNBCBGVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI/action/storage_attestation","attest_author":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI/action/author_attestation","sign_citation":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI/action/citation_signature","submit_replication":"https://pith.science/pith/WS3GTKDM5ZX2LGE3NMCNBCBGVI/action/replication_record"}},"created_at":"2026-05-18T03:13:33.086813+00:00","updated_at":"2026-05-18T03:13:33.086813+00:00"}