{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FT7XOG6MY6SNGPPEOJHENLOMRH","short_pith_number":"pith:FT7XOG6M","canonical_record":{"source":{"id":"2005.00945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-02T23:49:31Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"dbab661403ebde6d59f5a04b47b73bf108098992d3a6eaf14002cd3a5754a52a","abstract_canon_sha256":"8cf6b25193c1df4c4f29ccc4e2dda7005984bb0f4b3ded1b8b0cd7f086bbdc3c"},"schema_version":"1.0"},"canonical_sha256":"2cff771bccc7a4d33de4724e46adcc89c0fbf0ec311d78cebaf9bdf2495b0025","source":{"kind":"arxiv","id":"2005.00945","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.00945","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"2005.00945v2","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00945","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"FT7XOG6MY6SN","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_16","alias_value":"FT7XOG6MY6SNGPPE","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_8","alias_value":"FT7XOG6M","created_at":"2026-07-05T03:00:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FT7XOG6MY6SNGPPEOJHENLOMRH","target":"record","payload":{"canonical_record":{"source":{"id":"2005.00945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-02T23:49:31Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"dbab661403ebde6d59f5a04b47b73bf108098992d3a6eaf14002cd3a5754a52a","abstract_canon_sha256":"8cf6b25193c1df4c4f29ccc4e2dda7005984bb0f4b3ded1b8b0cd7f086bbdc3c"},"schema_version":"1.0"},"canonical_sha256":"2cff771bccc7a4d33de4724e46adcc89c0fbf0ec311d78cebaf9bdf2495b0025","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:27.407857Z","signature_b64":"AJSwlcsfj7MUitkjZaSWjZ5v0aTxQuhLfC3ATtQCfCmIahkwrxEQt1HQV90/toVBlmUZrXDnxK8n1Q4u/y5rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cff771bccc7a4d33de4724e46adcc89c0fbf0ec311d78cebaf9bdf2495b0025","last_reissued_at":"2026-07-05T03:00:27.407449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:27.407449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.00945","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-07-05T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0thOp/zDHL5JF6uFmKQByTEM8sX5v++Y6u9PlqCA9L58I2VsqjHLrdPVFjZqen7XNd2ysP2mz4+xmNT7Cl9kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:40:12.383892Z"},"content_sha256":"3795833b6eb04cc65e46aefadcafd3b16417cd86eede311f7cf785d20fa9e340","schema_version":"1.0","event_id":"sha256:3795833b6eb04cc65e46aefadcafd3b16417cd86eede311f7cf785d20fa9e340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FT7XOG6MY6SNGPPEOJHENLOMRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor optimal transport, distance between sets of measures and tensor scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Shmuel Friedland","submitted_at":"2020-05-02T23:49:31Z","abstract_excerpt":"We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a \"distance\" between two sets of discrete measures. We introduce an entropic regularization term, which gives rise to a scaling of tensors. We give a variation of the celebrated Sinkhorn scaling algorithm. We show that this algorithm can be viewed as a partial minimization algorithm of a strictly convex function. Under appropriate conditions the rate of convergence is geometric and we estimate the rate. Our results are generalizations of known resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00945","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.00945/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rTSbaTpjHNGGh11XorbhGaBK+Hi+HYTrQqBB9ybS9XsTJBH8HXMcDtESIOKlOmd4IJkBmZLgl7WZ8M4rbw/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:40:12.384270Z"},"content_sha256":"6696c97a8dc271393849671effdc41c2cc81295273e17f1979b2eca6ab1d4aa7","schema_version":"1.0","event_id":"sha256:6696c97a8dc271393849671effdc41c2cc81295273e17f1979b2eca6ab1d4aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/bundle.json","state_url":"https://pith.science/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/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-07-05T14:40:12Z","links":{"resolver":"https://pith.science/pith/FT7XOG6MY6SNGPPEOJHENLOMRH","bundle":"https://pith.science/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/bundle.json","state":"https://pith.science/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FT7XOG6MY6SNGPPEOJHENLOMRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FT7XOG6MY6SNGPPEOJHENLOMRH","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":"8cf6b25193c1df4c4f29ccc4e2dda7005984bb0f4b3ded1b8b0cd7f086bbdc3c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-02T23:49:31Z","title_canon_sha256":"dbab661403ebde6d59f5a04b47b73bf108098992d3a6eaf14002cd3a5754a52a"},"schema_version":"1.0","source":{"id":"2005.00945","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.00945","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"2005.00945v2","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00945","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"FT7XOG6MY6SN","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_16","alias_value":"FT7XOG6MY6SNGPPE","created_at":"2026-07-05T03:00:27Z"},{"alias_kind":"pith_short_8","alias_value":"FT7XOG6M","created_at":"2026-07-05T03:00:27Z"}],"graph_snapshots":[{"event_id":"sha256:6696c97a8dc271393849671effdc41c2cc81295273e17f1979b2eca6ab1d4aa7","target":"graph","created_at":"2026-07-05T03:00:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.00945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a \"distance\" between two sets of discrete measures. We introduce an entropic regularization term, which gives rise to a scaling of tensors. We give a variation of the celebrated Sinkhorn scaling algorithm. We show that this algorithm can be viewed as a partial minimization algorithm of a strictly convex function. Under appropriate conditions the rate of convergence is geometric and we estimate the rate. Our results are generalizations of known resul","authors_text":"Shmuel Friedland","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-02T23:49:31Z","title":"Tensor optimal transport, distance between sets of measures and tensor scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00945","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:3795833b6eb04cc65e46aefadcafd3b16417cd86eede311f7cf785d20fa9e340","target":"record","created_at":"2026-07-05T03:00:27Z","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":"8cf6b25193c1df4c4f29ccc4e2dda7005984bb0f4b3ded1b8b0cd7f086bbdc3c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-02T23:49:31Z","title_canon_sha256":"dbab661403ebde6d59f5a04b47b73bf108098992d3a6eaf14002cd3a5754a52a"},"schema_version":"1.0","source":{"id":"2005.00945","kind":"arxiv","version":2}},"canonical_sha256":"2cff771bccc7a4d33de4724e46adcc89c0fbf0ec311d78cebaf9bdf2495b0025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cff771bccc7a4d33de4724e46adcc89c0fbf0ec311d78cebaf9bdf2495b0025","first_computed_at":"2026-07-05T03:00:27.407449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:00:27.407449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJSwlcsfj7MUitkjZaSWjZ5v0aTxQuhLfC3ATtQCfCmIahkwrxEQt1HQV90/toVBlmUZrXDnxK8n1Q4u/y5rCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:00:27.407857Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.00945","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3795833b6eb04cc65e46aefadcafd3b16417cd86eede311f7cf785d20fa9e340","sha256:6696c97a8dc271393849671effdc41c2cc81295273e17f1979b2eca6ab1d4aa7"],"state_sha256":"bcb9e68e2b1dae66a2146d228f0c38de6865932715bf6e61e40e1a22b2eb5d7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4V1qQcv4X4+vwpAlbxOXHEp2jRPxD7zuX80vDQE9lBRmGiNvdrwWM4DBY0j1U8NX78ql5Xm3/1SRaKTExh+tBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:40:12.386417Z","bundle_sha256":"2141fa60899fabe7f65716bbecd265db73625415187bfff936da5131a4ef251c"}}