{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WNIHNKTQ2AAQDXKC6YB25FS25K","short_pith_number":"pith:WNIHNKTQ","canonical_record":{"source":{"id":"1512.02783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-09T08:24:54Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4f22eeea910773d204cc6262f5fe2bdd041e04a67a25fb4d3c382f4f6aa59b74","abstract_canon_sha256":"45b56c9c9147cabb4006781274e75b1eaeb94207ac5b71b6fe98ee948326678f"},"schema_version":"1.0"},"canonical_sha256":"b35076aa70d00101dd42f603ae965aeaae9c25500163957c2bef3e26dac7d30c","source":{"kind":"arxiv","id":"1512.02783","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02783","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02783v2","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02783","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"WNIHNKTQ2AAQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WNIHNKTQ2AAQDXKC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WNIHNKTQ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WNIHNKTQ2AAQDXKC6YB25FS25K","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-09T08:24:54Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"4f22eeea910773d204cc6262f5fe2bdd041e04a67a25fb4d3c382f4f6aa59b74","abstract_canon_sha256":"45b56c9c9147cabb4006781274e75b1eaeb94207ac5b71b6fe98ee948326678f"},"schema_version":"1.0"},"canonical_sha256":"b35076aa70d00101dd42f603ae965aeaae9c25500163957c2bef3e26dac7d30c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:15.833747Z","signature_b64":"a+vEujmrJbWHTKQtovoDwZadrvyWMrMVJGc/uWPoLTK5kztzDoulLTHzzjVdOgOuxjgDgunAHuRfcZdcsMh7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b35076aa70d00101dd42f603ae965aeaae9c25500163957c2bef3e26dac7d30c","last_reissued_at":"2026-05-18T00:53:15.833247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:15.833247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02783","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-18T00:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RnKO6DnpdJhS3aSgit2lKj0Z4d8ox2nDSQjjMnLLlgzlZJQls6nwLImeRGSLdPAVVjS2larVuE4I8YZTcdNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:09:21.724416Z"},"content_sha256":"6f5767a473bfaa10f03dd762b6ec65e3fc295bd73b2e6a5355cef73513071440","schema_version":"1.0","event_id":"sha256:6f5767a473bfaa10f03dd762b6ec65e3fc295bd73b2e6a5355cef73513071440"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WNIHNKTQ2AAQDXKC6YB25FS25K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of Entropic Schemes for Optimal Transport and Gradient Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.AP","authors_text":"Bernhard Schmitzer, Gabriel Peyr\\'e, Guillaume Carlier, Vincent Duval","submitted_at":"2015-12-09T08:24:54Z","abstract_excerpt":"Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\\\"odinger. This approach has recently been used successfully to solve optimal transport related problems in several applied fields such as imaging sciences, machine learning and social sciences. The main reason for this success is that, in contrast to linear programming solvers, the resulting algorithms are highly parallelizable and take advantage of the geometry of the computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02783","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-18T00:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DAH0C6kcJfdPzFRPaP+g1rjZtoKVaxABIxI8LHgiLFWzVOmrdnvi2Owgd4QSMmXDjX9Rxdw5SrmaPza4Sy4YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:09:21.724876Z"},"content_sha256":"f441cb32a1fc6944fc3362ac9d7f95a88233db8625361f581cea9d1f5cfb98f8","schema_version":"1.0","event_id":"sha256:f441cb32a1fc6944fc3362ac9d7f95a88233db8625361f581cea9d1f5cfb98f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/bundle.json","state_url":"https://pith.science/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/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-24T08:09:21Z","links":{"resolver":"https://pith.science/pith/WNIHNKTQ2AAQDXKC6YB25FS25K","bundle":"https://pith.science/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/bundle.json","state":"https://pith.science/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNIHNKTQ2AAQDXKC6YB25FS25K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WNIHNKTQ2AAQDXKC6YB25FS25K","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":"45b56c9c9147cabb4006781274e75b1eaeb94207ac5b71b6fe98ee948326678f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-09T08:24:54Z","title_canon_sha256":"4f22eeea910773d204cc6262f5fe2bdd041e04a67a25fb4d3c382f4f6aa59b74"},"schema_version":"1.0","source":{"id":"1512.02783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02783","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02783v2","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02783","created_at":"2026-05-18T00:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"WNIHNKTQ2AAQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WNIHNKTQ2AAQDXKC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WNIHNKTQ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:f441cb32a1fc6944fc3362ac9d7f95a88233db8625361f581cea9d1f5cfb98f8","target":"graph","created_at":"2026-05-18T00:53:15Z","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":"Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\\\"odinger. This approach has recently been used successfully to solve optimal transport related problems in several applied fields such as imaging sciences, machine learning and social sciences. The main reason for this success is that, in contrast to linear programming solvers, the resulting algorithms are highly parallelizable and take advantage of the geometry of the computation","authors_text":"Bernhard Schmitzer, Gabriel Peyr\\'e, Guillaume Carlier, Vincent Duval","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-09T08:24:54Z","title":"Convergence of Entropic Schemes for Optimal Transport and Gradient Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02783","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:6f5767a473bfaa10f03dd762b6ec65e3fc295bd73b2e6a5355cef73513071440","target":"record","created_at":"2026-05-18T00:53:15Z","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":"45b56c9c9147cabb4006781274e75b1eaeb94207ac5b71b6fe98ee948326678f","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-09T08:24:54Z","title_canon_sha256":"4f22eeea910773d204cc6262f5fe2bdd041e04a67a25fb4d3c382f4f6aa59b74"},"schema_version":"1.0","source":{"id":"1512.02783","kind":"arxiv","version":2}},"canonical_sha256":"b35076aa70d00101dd42f603ae965aeaae9c25500163957c2bef3e26dac7d30c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b35076aa70d00101dd42f603ae965aeaae9c25500163957c2bef3e26dac7d30c","first_computed_at":"2026-05-18T00:53:15.833247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:15.833247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+vEujmrJbWHTKQtovoDwZadrvyWMrMVJGc/uWPoLTK5kztzDoulLTHzzjVdOgOuxjgDgunAHuRfcZdcsMh7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:15.833747Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f5767a473bfaa10f03dd762b6ec65e3fc295bd73b2e6a5355cef73513071440","sha256:f441cb32a1fc6944fc3362ac9d7f95a88233db8625361f581cea9d1f5cfb98f8"],"state_sha256":"1ea1770ec73a0b58415a5f1a0bc96631798315ecd08a53dd83f62b7d7b963341"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APaUaYrVQ/FdwFSM9mrlyGJumOS8akvN2JbdXe6BDwQasXMEMjThTwU0ciYPlansI7wLaYYKVsEMEsjHcyjBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:09:21.727305Z","bundle_sha256":"494498172c839628e2f2ea2a18fb84683d3b401a344033a1bdb98ea0ff3f0635"}}