{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BKV4AVP6RD2Q7FLGTHKLL5GRCY","short_pith_number":"pith:BKV4AVP6","canonical_record":{"source":{"id":"1706.08841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-06-26T17:00:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"03a6a4a85ffdeb213e142ff165ef6b70ad471f8dfefbcac4a3bf1af33465029c","abstract_canon_sha256":"aeefe27953a80435c479a61a34f7c208372ead5ba3440d65a19029b9ae454501"},"schema_version":"1.0"},"canonical_sha256":"0aabc055fe88f50f956699d4b5f4d1163a523db5278bbe10d21b62f970c78361","source":{"kind":"arxiv","id":"1706.08841","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08841","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08841v1","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08841","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"BKV4AVP6RD2Q","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKV4AVP6RD2Q7FLG","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKV4AVP6","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BKV4AVP6RD2Q7FLGTHKLL5GRCY","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08841","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-06-26T17:00:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"03a6a4a85ffdeb213e142ff165ef6b70ad471f8dfefbcac4a3bf1af33465029c","abstract_canon_sha256":"aeefe27953a80435c479a61a34f7c208372ead5ba3440d65a19029b9ae454501"},"schema_version":"1.0"},"canonical_sha256":"0aabc055fe88f50f956699d4b5f4d1163a523db5278bbe10d21b62f970c78361","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:30.863281Z","signature_b64":"BvEKQXf3eymvZsG6H9o/nF8mBiSiEZ0sJqQYX4JLdmBmDXyltgIFQVWTUC6en/6WyhZ0G16yHr9OPV7zSuwxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aabc055fe88f50f956699d4b5f4d1163a523db5278bbe10d21b62f970c78361","last_reissued_at":"2026-05-18T00:41:30.862701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:30.862701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08841","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-18T00:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbSt9GCNP/4wtn9AnXP2yxhY06z8V3SyQn5t9NvaaKRcykMmvUmXkPh3irUMIyJ3qrVCw6VKLs+PV2Id8WSXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:31:54.869146Z"},"content_sha256":"16935e19937b1afaa279b31dafb47ca5ee3edbd3a02bef6d964225cfbe16fe3b","schema_version":"1.0","event_id":"sha256:16935e19937b1afaa279b31dafb47ca5ee3edbd3a02bef6d964225cfbe16fe3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BKV4AVP6RD2Q7FLGTHKLL5GRCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Matrix-Valued and Vector-Valued Optimal Mass Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.NA","authors_text":"Allen Tannenbaum, Eldad Haber, Kaoru Yamamoto, Tryphon T. Georgiou, Yongxin Chen","submitted_at":"2017-06-26T17:00:36Z","abstract_excerpt":"We present an efficient algorithm for recent generalizations of optimal mass transport theory to matrix-valued and vector-valued densities. These generalizations lead to several applications including diffusion tensor imaging, color images processing, and multi-modality imaging. The algorithm is based on sequential quadratic programming (SQP). By approximating the Hessian of the cost and solving each iteration in an inexact manner, we are able to solve each iteration with relatively low cost while still maintaining a fast convergent rate. The core of the algorithm is solving a weighted Poisson"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08841","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-18T00:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq7Ccph0RkqbnNfdYzsNmaRYXeZw/07XSvNFPPteAHJnvNwSg5TUFeRMiG7NKSe4Y67Yzc12GUNsgJL/MSr8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:31:54.869836Z"},"content_sha256":"c68f405b7f9cb1f84f6c3616cdc0a96b98c7d3cff80925d7fde922182e2272cb","schema_version":"1.0","event_id":"sha256:c68f405b7f9cb1f84f6c3616cdc0a96b98c7d3cff80925d7fde922182e2272cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/bundle.json","state_url":"https://pith.science/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/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-09T04:31:54Z","links":{"resolver":"https://pith.science/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY","bundle":"https://pith.science/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/bundle.json","state":"https://pith.science/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKV4AVP6RD2Q7FLGTHKLL5GRCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BKV4AVP6RD2Q7FLGTHKLL5GRCY","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":"aeefe27953a80435c479a61a34f7c208372ead5ba3440d65a19029b9ae454501","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-06-26T17:00:36Z","title_canon_sha256":"03a6a4a85ffdeb213e142ff165ef6b70ad471f8dfefbcac4a3bf1af33465029c"},"schema_version":"1.0","source":{"id":"1706.08841","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08841","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08841v1","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08841","created_at":"2026-05-18T00:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"BKV4AVP6RD2Q","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKV4AVP6RD2Q7FLG","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKV4AVP6","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c68f405b7f9cb1f84f6c3616cdc0a96b98c7d3cff80925d7fde922182e2272cb","target":"graph","created_at":"2026-05-18T00:41:30Z","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 an efficient algorithm for recent generalizations of optimal mass transport theory to matrix-valued and vector-valued densities. These generalizations lead to several applications including diffusion tensor imaging, color images processing, and multi-modality imaging. The algorithm is based on sequential quadratic programming (SQP). By approximating the Hessian of the cost and solving each iteration in an inexact manner, we are able to solve each iteration with relatively low cost while still maintaining a fast convergent rate. The core of the algorithm is solving a weighted Poisson","authors_text":"Allen Tannenbaum, Eldad Haber, Kaoru Yamamoto, Tryphon T. Georgiou, Yongxin Chen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-06-26T17:00:36Z","title":"An Efficient Algorithm for Matrix-Valued and Vector-Valued Optimal Mass Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08841","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:16935e19937b1afaa279b31dafb47ca5ee3edbd3a02bef6d964225cfbe16fe3b","target":"record","created_at":"2026-05-18T00:41:30Z","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":"aeefe27953a80435c479a61a34f7c208372ead5ba3440d65a19029b9ae454501","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-06-26T17:00:36Z","title_canon_sha256":"03a6a4a85ffdeb213e142ff165ef6b70ad471f8dfefbcac4a3bf1af33465029c"},"schema_version":"1.0","source":{"id":"1706.08841","kind":"arxiv","version":1}},"canonical_sha256":"0aabc055fe88f50f956699d4b5f4d1163a523db5278bbe10d21b62f970c78361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aabc055fe88f50f956699d4b5f4d1163a523db5278bbe10d21b62f970c78361","first_computed_at":"2026-05-18T00:41:30.862701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:30.862701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvEKQXf3eymvZsG6H9o/nF8mBiSiEZ0sJqQYX4JLdmBmDXyltgIFQVWTUC6en/6WyhZ0G16yHr9OPV7zSuwxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:30.863281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08841","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16935e19937b1afaa279b31dafb47ca5ee3edbd3a02bef6d964225cfbe16fe3b","sha256:c68f405b7f9cb1f84f6c3616cdc0a96b98c7d3cff80925d7fde922182e2272cb"],"state_sha256":"9785b328aa3297561880ed2002a5fffc078df8d9fb129a4de706875f7c304f68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDte21CaNO8kcSKmFdbmImvHlQHU8kRdS+fiRJ5COW4aXmP3oq0v6DYIrxNrWmHgMjlz2r/uv75FKvVUGpr6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:31:54.873689Z","bundle_sha256":"d44c6e54c802c2eaf4b630ee66d7fc139b25ec09b2067c2f330e70cecf6b52fb"}}