{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3J634ZTEXWQ2OHVFC5FWATGUZ","short_pith_number":"pith:E3J634ZT","canonical_record":{"source":{"id":"1612.02273","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T14:55:05Z","cross_cats_sorted":[],"title_canon_sha256":"24ba608ad1a2d4d08e9413cb774b8910bf6dbd6165b85d584fadce6ed79acaa1","abstract_canon_sha256":"73cf4706a46ebfd23e77624b3096e8352739741695a1e876eea234b681ace9c4"},"schema_version":"1.0"},"canonical_sha256":"26d3edf33325ed0d38f528ba5b0266a66a54ed8d9788fdef7deb2fab02372df8","source":{"kind":"arxiv","id":"1612.02273","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02273","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02273v4","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02273","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"E3J634ZTEXWQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3J634ZTEXWQ2OHV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3J634ZT","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3J634ZTEXWQ2OHVFC5FWATGUZ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02273","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T14:55:05Z","cross_cats_sorted":[],"title_canon_sha256":"24ba608ad1a2d4d08e9413cb774b8910bf6dbd6165b85d584fadce6ed79acaa1","abstract_canon_sha256":"73cf4706a46ebfd23e77624b3096e8352739741695a1e876eea234b681ace9c4"},"schema_version":"1.0"},"canonical_sha256":"26d3edf33325ed0d38f528ba5b0266a66a54ed8d9788fdef7deb2fab02372df8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:22.737717Z","signature_b64":"6YNi+MrYHeYmloJwgTzbbjesSKeWhpihAGKA7HGt09H51CGCmaEnRIvycdbvkdFGEE0MM5aLWeJ7aogg2rEyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d3edf33325ed0d38f528ba5b0266a66a54ed8d9788fdef7deb2fab02372df8","last_reissued_at":"2026-05-18T00:24:22.737272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:22.737272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02273","source_version":4,"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:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8vj40XCUDE+Wi9ptlJibnPj4xNPMWhdnG1NNv+hKaLXCTejnzyiVN0pAdEf/mgNFoOS5WDyDUgedkIk88FABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:16:47.945862Z"},"content_sha256":"ae6ce32137ad934b1b3c8ca8620d4f3f2d74eacc48917d9edffe13421a6be77e","schema_version":"1.0","event_id":"sha256:ae6ce32137ad934b1b3c8ca8620d4f3f2d74eacc48917d9edffe13421a6be77e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3J634ZTEXWQ2OHVFC5FWATGUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Ringh, Johan Karlsson","submitted_at":"2016-12-07T14:55:05Z","abstract_excerpt":"The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be formulated as a linear programming problem, it is in many cases intractable for large problems due to the vast number of variables. A recent development to address this builds on an approximation with an entropic barrier term and solves the resulting optimization problem using Sinkhorn iterations. In this work we extend this methodology to a class of invers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02273","kind":"arxiv","version":4},"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:24:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+15O4dfiRqxYsUoy+KEr0AQaHA7iTwhKx9KvIgeSD9Sd8wlRYpLRhm2nYL2fBPjWmpQ2se06j0flN1fc1jIQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:16:47.946546Z"},"content_sha256":"50aa5372679d3a1fe9effa66f7062ed6b4ed3e2146224864fdf7e9285981f55d","schema_version":"1.0","event_id":"sha256:50aa5372679d3a1fe9effa66f7062ed6b4ed3e2146224864fdf7e9285981f55d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/bundle.json","state_url":"https://pith.science/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/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-27T12:16:47Z","links":{"resolver":"https://pith.science/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ","bundle":"https://pith.science/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/bundle.json","state":"https://pith.science/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3J634ZTEXWQ2OHVFC5FWATGUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3J634ZTEXWQ2OHVFC5FWATGUZ","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":"73cf4706a46ebfd23e77624b3096e8352739741695a1e876eea234b681ace9c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T14:55:05Z","title_canon_sha256":"24ba608ad1a2d4d08e9413cb774b8910bf6dbd6165b85d584fadce6ed79acaa1"},"schema_version":"1.0","source":{"id":"1612.02273","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02273","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02273v4","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02273","created_at":"2026-05-18T00:24:22Z"},{"alias_kind":"pith_short_12","alias_value":"E3J634ZTEXWQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3J634ZTEXWQ2OHV","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3J634ZT","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:50aa5372679d3a1fe9effa66f7062ed6b4ed3e2146224864fdf7e9285981f55d","target":"graph","created_at":"2026-05-18T00:24:22Z","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":"The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be formulated as a linear programming problem, it is in many cases intractable for large problems due to the vast number of variables. A recent development to address this builds on an approximation with an entropic barrier term and solves the resulting optimization problem using Sinkhorn iterations. In this work we extend this methodology to a class of invers","authors_text":"Axel Ringh, Johan Karlsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T14:55:05Z","title":"Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02273","kind":"arxiv","version":4},"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:ae6ce32137ad934b1b3c8ca8620d4f3f2d74eacc48917d9edffe13421a6be77e","target":"record","created_at":"2026-05-18T00:24:22Z","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":"73cf4706a46ebfd23e77624b3096e8352739741695a1e876eea234b681ace9c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-07T14:55:05Z","title_canon_sha256":"24ba608ad1a2d4d08e9413cb774b8910bf6dbd6165b85d584fadce6ed79acaa1"},"schema_version":"1.0","source":{"id":"1612.02273","kind":"arxiv","version":4}},"canonical_sha256":"26d3edf33325ed0d38f528ba5b0266a66a54ed8d9788fdef7deb2fab02372df8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d3edf33325ed0d38f528ba5b0266a66a54ed8d9788fdef7deb2fab02372df8","first_computed_at":"2026-05-18T00:24:22.737272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:22.737272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6YNi+MrYHeYmloJwgTzbbjesSKeWhpihAGKA7HGt09H51CGCmaEnRIvycdbvkdFGEE0MM5aLWeJ7aogg2rEyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:22.737717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02273","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae6ce32137ad934b1b3c8ca8620d4f3f2d74eacc48917d9edffe13421a6be77e","sha256:50aa5372679d3a1fe9effa66f7062ed6b4ed3e2146224864fdf7e9285981f55d"],"state_sha256":"94ffcbf635ca7c16ddf2d15e25b24fdce8623141d21f18819d9a45e2b8738fe3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMWzBgdEDe+oijewg5NsaTojnUyonPkFyGNqnoZ/H+IgfkAnGVHeSTfPbYRd50k1Z9gNso/Ya1QnpEuifadfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:16:47.948734Z","bundle_sha256":"da5adf6d0bdbc07563918eaece3424b091abc25d202ea85276ec83c2a5a29769"}}