{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WBZLRLWMOMYPVTCHBBPBOQXBFI","short_pith_number":"pith:WBZLRLWM","schema_version":"1.0","canonical_sha256":"b072b8aecc7330facc47085e1742e12a15ecd1bb2cc8d0d372aabfe93423404b","source":{"kind":"arxiv","id":"1307.5551","version":1},"attestation_state":"computed","paper":{"title":"Regularized Discrete Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.CV","authors_text":"Gabriel Peyr\\'e, Jean-Fran\\c{c}ois Aujol, Nicolas Papadakis, Sira Ferradans","submitted_at":"2013-07-21T17:55:10Z","abstract_excerpt":"This article introduces a generalization of the discrete optimal transport, with applications to color image manipulations. This new formulation includes a relaxation of the mass conservation constraint and a regularization term. These two features are crucial for image processing tasks, which necessitate to take into account families of multimodal histograms, with large mass variation across modes. \n  The corresponding relaxed and regularized transportation problem is the solution of a convex optimization problem. Depending on the regularization used, this minimization can be solved using sta"},"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.5551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-07-21T17:55:10Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"ae100f9489aa5dd67e276222f24a69253f26af1244685099d7c22a217c659054","abstract_canon_sha256":"90cdd4c37d38015ed4116a091d0e6ba5618e36fc70cba845234f3f8dd4749ac8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.354674Z","signature_b64":"q95Gd4FNtavs8C6mJKtPh/hX7BQ9wkfd+8AwthZh01Y5FcMosoDCc7r1IhJQJKWNpv9mKgjDw5w4hTu4EDiOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b072b8aecc7330facc47085e1742e12a15ecd1bb2cc8d0d372aabfe93423404b","last_reissued_at":"2026-05-18T03:17:55.353982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.353982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Discrete Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.CV","authors_text":"Gabriel Peyr\\'e, Jean-Fran\\c{c}ois Aujol, Nicolas Papadakis, Sira Ferradans","submitted_at":"2013-07-21T17:55:10Z","abstract_excerpt":"This article introduces a generalization of the discrete optimal transport, with applications to color image manipulations. This new formulation includes a relaxation of the mass conservation constraint and a regularization term. These two features are crucial for image processing tasks, which necessitate to take into account families of multimodal histograms, with large mass variation across modes. \n  The corresponding relaxed and regularized transportation problem is the solution of a convex optimization problem. Depending on the regularization used, this minimization can be solved using sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5551","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":"1307.5551","created_at":"2026-05-18T03:17:55.354086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5551v1","created_at":"2026-05-18T03:17:55.354086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5551","created_at":"2026-05-18T03:17:55.354086+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBZLRLWMOMYP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBZLRLWMOMYPVTCH","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBZLRLWM","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/WBZLRLWMOMYPVTCHBBPBOQXBFI","json":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI.json","graph_json":"https://pith.science/api/pith-number/WBZLRLWMOMYPVTCHBBPBOQXBFI/graph.json","events_json":"https://pith.science/api/pith-number/WBZLRLWMOMYPVTCHBBPBOQXBFI/events.json","paper":"https://pith.science/paper/WBZLRLWM"},"agent_actions":{"view_html":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI","download_json":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI.json","view_paper":"https://pith.science/paper/WBZLRLWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5551&json=true","fetch_graph":"https://pith.science/api/pith-number/WBZLRLWMOMYPVTCHBBPBOQXBFI/graph.json","fetch_events":"https://pith.science/api/pith-number/WBZLRLWMOMYPVTCHBBPBOQXBFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI/action/storage_attestation","attest_author":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI/action/author_attestation","sign_citation":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI/action/citation_signature","submit_replication":"https://pith.science/pith/WBZLRLWMOMYPVTCHBBPBOQXBFI/action/replication_record"}},"created_at":"2026-05-18T03:17:55.354086+00:00","updated_at":"2026-05-18T03:17:55.354086+00:00"}