{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2QSJPPR3VLIOHUDFX264I7E45Y","short_pith_number":"pith:2QSJPPR3","canonical_record":{"source":{"id":"1412.5154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-16T20:27:36Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"36e7998b20b1b7c2b44189ec7a3ac61f031260b88ddad980e4553e7ca274f4cd","abstract_canon_sha256":"f02f48b58b911d35b07aece192a7e8914f00c452bf506da176a894b0a55a8244"},"schema_version":"1.0"},"canonical_sha256":"d42497be3baad0e3d065bebdc47c9cee19c3f9bdc2458531cc41dbc8d3717407","source":{"kind":"arxiv","id":"1412.5154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5154","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5154v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5154","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"2QSJPPR3VLIO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2QSJPPR3VLIOHUDF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2QSJPPR3","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2QSJPPR3VLIOHUDFX264I7E45Y","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-16T20:27:36Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"36e7998b20b1b7c2b44189ec7a3ac61f031260b88ddad980e4553e7ca274f4cd","abstract_canon_sha256":"f02f48b58b911d35b07aece192a7e8914f00c452bf506da176a894b0a55a8244"},"schema_version":"1.0"},"canonical_sha256":"d42497be3baad0e3d065bebdc47c9cee19c3f9bdc2458531cc41dbc8d3717407","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.542758Z","signature_b64":"13tLlu9p3063MpwgPVS9VAGQds6XqILN1eBKKcx9fM3Oum6+sqTHKHwd5AQYTScphs4seXMjLO3XEYgc8vObBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42497be3baad0e3d065bebdc47c9cee19c3f9bdc2458531cc41dbc8d3717407","last_reissued_at":"2026-05-18T02:31:09.542088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.542088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5154","source_version":1,"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:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VSpG8SWyX8iVUdRSu+bonONM2m0+vaLKHkAnXiJKP+gdq+2i4MM5cINnfXsINk5p3STs37qQne5zj3kuisMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:11.374885Z"},"content_sha256":"4a2e612eea3bd833b1fcf2673e0fcb9177e35a7f85d8c3b0f970cfe7ab9f1b50","schema_version":"1.0","event_id":"sha256:4a2e612eea3bd833b1fcf2673e0fcb9177e35a7f85d8c3b0f970cfe7ab9f1b50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2QSJPPR3VLIOHUDFX264I7E45Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Bregman Projections for Regularized Transportation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.NA","authors_text":"Gabriel Peyr\\'e (CEREMADE), Guillaume Carlier (CEREMADE), Jean-David Benamou (INRIA Paris-Rocquencourt), Luca Nenna (INRIA Paris-Rocquencourt), Marco Cuturi","submitted_at":"2014-12-16T20:27:36Z","abstract_excerpt":"This article details a general numerical framework to approximate so-lutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman di-vergence projection of a vector (representing some initial joint distribu-tion) on the polytope of constraints. We show that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in clos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5154","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"},"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:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDGRgWOd+J7VNzte2U11BI3XtTNaxmyNesqVHzSqCepAo7fsn+298EWH66GY04KiHHiM6csJtApodHF425buAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:11.375271Z"},"content_sha256":"7f66fca3fce5a0f8f5ede0b62acfc25d762ff261e69b57e19152b61b5ae9cd45","schema_version":"1.0","event_id":"sha256:7f66fca3fce5a0f8f5ede0b62acfc25d762ff261e69b57e19152b61b5ae9cd45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QSJPPR3VLIOHUDFX264I7E45Y/bundle.json","state_url":"https://pith.science/pith/2QSJPPR3VLIOHUDFX264I7E45Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QSJPPR3VLIOHUDFX264I7E45Y/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-25T12:00:11Z","links":{"resolver":"https://pith.science/pith/2QSJPPR3VLIOHUDFX264I7E45Y","bundle":"https://pith.science/pith/2QSJPPR3VLIOHUDFX264I7E45Y/bundle.json","state":"https://pith.science/pith/2QSJPPR3VLIOHUDFX264I7E45Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QSJPPR3VLIOHUDFX264I7E45Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2QSJPPR3VLIOHUDFX264I7E45Y","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":"f02f48b58b911d35b07aece192a7e8914f00c452bf506da176a894b0a55a8244","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-16T20:27:36Z","title_canon_sha256":"36e7998b20b1b7c2b44189ec7a3ac61f031260b88ddad980e4553e7ca274f4cd"},"schema_version":"1.0","source":{"id":"1412.5154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5154","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5154v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5154","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"2QSJPPR3VLIO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2QSJPPR3VLIOHUDF","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2QSJPPR3","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:7f66fca3fce5a0f8f5ede0b62acfc25d762ff261e69b57e19152b61b5ae9cd45","target":"graph","created_at":"2026-05-18T02:31:09Z","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":"This article details a general numerical framework to approximate so-lutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman di-vergence projection of a vector (representing some initial joint distribu-tion) on the polytope of constraints. We show that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in clos","authors_text":"Gabriel Peyr\\'e (CEREMADE), Guillaume Carlier (CEREMADE), Jean-David Benamou (INRIA Paris-Rocquencourt), Luca Nenna (INRIA Paris-Rocquencourt), Marco Cuturi","cross_cats":["math.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-16T20:27:36Z","title":"Iterative Bregman Projections for Regularized Transportation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5154","kind":"arxiv","version":1},"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:4a2e612eea3bd833b1fcf2673e0fcb9177e35a7f85d8c3b0f970cfe7ab9f1b50","target":"record","created_at":"2026-05-18T02:31:09Z","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":"f02f48b58b911d35b07aece192a7e8914f00c452bf506da176a894b0a55a8244","cross_cats_sorted":["math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-12-16T20:27:36Z","title_canon_sha256":"36e7998b20b1b7c2b44189ec7a3ac61f031260b88ddad980e4553e7ca274f4cd"},"schema_version":"1.0","source":{"id":"1412.5154","kind":"arxiv","version":1}},"canonical_sha256":"d42497be3baad0e3d065bebdc47c9cee19c3f9bdc2458531cc41dbc8d3717407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42497be3baad0e3d065bebdc47c9cee19c3f9bdc2458531cc41dbc8d3717407","first_computed_at":"2026-05-18T02:31:09.542088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:09.542088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13tLlu9p3063MpwgPVS9VAGQds6XqILN1eBKKcx9fM3Oum6+sqTHKHwd5AQYTScphs4seXMjLO3XEYgc8vObBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:09.542758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a2e612eea3bd833b1fcf2673e0fcb9177e35a7f85d8c3b0f970cfe7ab9f1b50","sha256:7f66fca3fce5a0f8f5ede0b62acfc25d762ff261e69b57e19152b61b5ae9cd45"],"state_sha256":"1d41fee8084325944d2329dadcedefbc40610c20ace1e3a32f3ce0cc5e487007"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wdzqAwhns7x93SpJsK9kPw2yDnN7t3egEMSOVM7wmEoGKqZfdtGm8cYwEDhz+1g4GxNP5J4tWzyVkf84bAlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:00:11.378034Z","bundle_sha256":"cbc58d85d0dcd42e97d4b9234e94455205bdf7318fe00022962abfa196ec51d5"}}