{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KUEHBYD4AZQWTID5NMVA6RQ7WH","short_pith_number":"pith:KUEHBYD4","canonical_record":{"source":{"id":"1009.6039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-30T05:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"bc4ce6b04f7cd7c2e4d9ed42ddc00740baa974c116efdcb5d5c4daa91b90b42d","abstract_canon_sha256":"d13dfc7e7ae98edd13d91b744db82c40af24c9456d592577d82b8bd3e35c7f00"},"schema_version":"1.0"},"canonical_sha256":"550870e07c066169a07d6b2a0f461fb1fb53367129295bf17a85c00f13c4237a","source":{"kind":"arxiv","id":"1009.6039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6039","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6039v2","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6039","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"pith_short_12","alias_value":"KUEHBYD4AZQW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KUEHBYD4AZQWTID5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KUEHBYD4","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KUEHBYD4AZQWTID5NMVA6RQ7WH","target":"record","payload":{"canonical_record":{"source":{"id":"1009.6039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-30T05:17:16Z","cross_cats_sorted":[],"title_canon_sha256":"bc4ce6b04f7cd7c2e4d9ed42ddc00740baa974c116efdcb5d5c4daa91b90b42d","abstract_canon_sha256":"d13dfc7e7ae98edd13d91b744db82c40af24c9456d592577d82b8bd3e35c7f00"},"schema_version":"1.0"},"canonical_sha256":"550870e07c066169a07d6b2a0f461fb1fb53367129295bf17a85c00f13c4237a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:38.032554Z","signature_b64":"k8wzUk/vHgZcLaVODSxFzpZnn1Q7plhBadek8iBbSxHzSKT6D5R1BHiXHoAO4OtKKYJunUXEFiHEA3n/sSP+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"550870e07c066169a07d6b2a0f461fb1fb53367129295bf17a85c00f13c4237a","last_reissued_at":"2026-05-18T04:27:38.032051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:38.032051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.6039","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-18T04:27:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+M6UXfs144VpM5q91b/uge0IE5bQYbq3ptW98dJtJ1+GW0pZId+uBoy9aKZN10jA/Fzk+fLY4WT2ztuYrhvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:36:01.206737Z"},"content_sha256":"385a211920e01cb660df588229580e7d462daf5c99a6124d0d2e1697e9304dc0","schema_version":"1.0","event_id":"sha256:385a211920e01cb660df588229580e7d462daf5c99a6124d0d2e1697e9304dc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KUEHBYD4AZQWTID5NMVA6RQ7WH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient numerical algorithm for the L2 optimal transport problem with applications to image processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Boualem Khouider, Louis-Philippe Saumier, Martial Agueh","submitted_at":"2010-09-30T05:17:16Z","abstract_excerpt":"We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding Monge-Amp\\`ere equation. We extend the damped Newton algorithm of Loeper and Rapetti \\cite{LR} to the more general case of a non uniform density which is relevant to the optimal transport problem, and we show that our algorithm converges for sufficiently large damping coefficients. The main idea consists of designing an iterative scheme where the fully nonlinear equa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6039","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-18T04:27:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSafA3ETL8XfDqApjrybTEQWfFymSLVStQp7AfQ5zyZ1tbPwsUMHDTdRJjSG+Xgerp0WalxVrE6xWcm4pGMbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:36:01.207269Z"},"content_sha256":"28e27d8c7da4bc0bf902ceaac007b4db38738dec2d37320b45cbdc809023b39b","schema_version":"1.0","event_id":"sha256:28e27d8c7da4bc0bf902ceaac007b4db38738dec2d37320b45cbdc809023b39b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/bundle.json","state_url":"https://pith.science/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/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-07T07:36:01Z","links":{"resolver":"https://pith.science/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH","bundle":"https://pith.science/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/bundle.json","state":"https://pith.science/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUEHBYD4AZQWTID5NMVA6RQ7WH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KUEHBYD4AZQWTID5NMVA6RQ7WH","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":"d13dfc7e7ae98edd13d91b744db82c40af24c9456d592577d82b8bd3e35c7f00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-30T05:17:16Z","title_canon_sha256":"bc4ce6b04f7cd7c2e4d9ed42ddc00740baa974c116efdcb5d5c4daa91b90b42d"},"schema_version":"1.0","source":{"id":"1009.6039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.6039","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"arxiv_version","alias_value":"1009.6039v2","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6039","created_at":"2026-05-18T04:27:38Z"},{"alias_kind":"pith_short_12","alias_value":"KUEHBYD4AZQW","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KUEHBYD4AZQWTID5","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KUEHBYD4","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:28e27d8c7da4bc0bf902ceaac007b4db38738dec2d37320b45cbdc809023b39b","target":"graph","created_at":"2026-05-18T04:27:38Z","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":"We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding Monge-Amp\\`ere equation. We extend the damped Newton algorithm of Loeper and Rapetti \\cite{LR} to the more general case of a non uniform density which is relevant to the optimal transport problem, and we show that our algorithm converges for sufficiently large damping coefficients. The main idea consists of designing an iterative scheme where the fully nonlinear equa","authors_text":"Boualem Khouider, Louis-Philippe Saumier, Martial Agueh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-30T05:17:16Z","title":"An efficient numerical algorithm for the L2 optimal transport problem with applications to image processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6039","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:385a211920e01cb660df588229580e7d462daf5c99a6124d0d2e1697e9304dc0","target":"record","created_at":"2026-05-18T04:27:38Z","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":"d13dfc7e7ae98edd13d91b744db82c40af24c9456d592577d82b8bd3e35c7f00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-30T05:17:16Z","title_canon_sha256":"bc4ce6b04f7cd7c2e4d9ed42ddc00740baa974c116efdcb5d5c4daa91b90b42d"},"schema_version":"1.0","source":{"id":"1009.6039","kind":"arxiv","version":2}},"canonical_sha256":"550870e07c066169a07d6b2a0f461fb1fb53367129295bf17a85c00f13c4237a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550870e07c066169a07d6b2a0f461fb1fb53367129295bf17a85c00f13c4237a","first_computed_at":"2026-05-18T04:27:38.032051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:38.032051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k8wzUk/vHgZcLaVODSxFzpZnn1Q7plhBadek8iBbSxHzSKT6D5R1BHiXHoAO4OtKKYJunUXEFiHEA3n/sSP+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:38.032554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.6039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:385a211920e01cb660df588229580e7d462daf5c99a6124d0d2e1697e9304dc0","sha256:28e27d8c7da4bc0bf902ceaac007b4db38738dec2d37320b45cbdc809023b39b"],"state_sha256":"5b5ea662fa90cf61b972b1365ee454509464544a2a5edf5cfd9bf73754ca7843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHc8dinEpij/Jkgbf5H0nj8prlzOuV/jPzT22GXuWIrfyh16DxXW0Cuxe0KH7zyJcx0aBbqr0oz/+eDPctcFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:36:01.210068Z","bundle_sha256":"342ab6b28fb418aa9be35255aae73588b5b1fedb1d979003122e29568995ef91"}}