{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZDRENGO3EW6QDBHJB3Z4MEWR2P","short_pith_number":"pith:ZDRENGO3","canonical_record":{"source":{"id":"2411.10555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-15T20:07:15Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d92d81a94845a22917520811c57798a410b0c11dc28d6db3f230b73454778c5d","abstract_canon_sha256":"9a6dd3f5c437d0ed6c6bf3fc39678904062ed10f902a22ece1a54a4022cb29cb"},"schema_version":"1.0"},"canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","source":{"kind":"arxiv","id":"2411.10555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10555","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10555v1","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10555","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZDRENGO3EW6Q","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZDRENGO3EW6QDBHJ","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZDRENGO3","created_at":"2026-07-05T09:36:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZDRENGO3EW6QDBHJB3Z4MEWR2P","target":"record","payload":{"canonical_record":{"source":{"id":"2411.10555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-15T20:07:15Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d92d81a94845a22917520811c57798a410b0c11dc28d6db3f230b73454778c5d","abstract_canon_sha256":"9a6dd3f5c437d0ed6c6bf3fc39678904062ed10f902a22ece1a54a4022cb29cb"},"schema_version":"1.0"},"canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:18.428780Z","signature_b64":"jedTPxdqp5pLWpLdOjfaEaU+pYFVj5Qw3ciK/HOQpujp2v5+aDjyu+YFvs7W8NrWXZ2rEf2jQoFssZsai2BSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","last_reissued_at":"2026-07-05T09:36:18.428356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:18.428356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.10555","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-07-05T09:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2ar59gxmA+qxZnCfWUxG/Nf3q2z1i9bMsFfO3DAw4RMQUFTfhHWShXHtPExS+PYc6BzUsxS62klR2SVTNI8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:26:53.089927Z"},"content_sha256":"f3c72ca9efc801434dafd33b961c93f01a03ddb96ce41dbc00e109a6a5a3ab1b","schema_version":"1.0","event_id":"sha256:f3c72ca9efc801434dafd33b961c93f01a03ddb96ce41dbc00e109a6a5a3ab1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZDRENGO3EW6QDBHJB3Z4MEWR2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Optimal Transport through Factor Relaxation with Latent Coupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin J Raphael, Julian Gold, Peter Halmos, Xinhao Liu","submitted_at":"2024-11-15T20:07:15Z","abstract_excerpt":"Optimal transport (OT) is a general framework for finding a minimum-cost transport plan, or coupling, between probability distributions, and has many applications in machine learning. A key challenge in applying OT to massive datasets is the quadratic scaling of the coupling matrix with the size of the dataset. [Forrow et al. 2019] introduced a factored coupling for the k-Wasserstein barycenter problem, which [Scetbon et al. 2021] adapted to solve the primal low-rank OT problem. We derive an alternative parameterization of the low-rank problem based on the $\\textit{latent coupling}$ (LC) facto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10555","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.10555/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-05T09:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVaGkozh03ZanBsBp1GO8cY9NvoWdNfrF0U54g1sLb3Kzt8SucZ1wdVX8jaGxE7f5pjWFPPWpyiOo9plVzV/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:26:53.090694Z"},"content_sha256":"aab4c5b85779d9cfbc04f4bc0f0c185d33e148353e917bb9cdfa7525c97e4f17","schema_version":"1.0","event_id":"sha256:aab4c5b85779d9cfbc04f4bc0f0c185d33e148353e917bb9cdfa7525c97e4f17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/bundle.json","state_url":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/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-07T06:26:53Z","links":{"resolver":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P","bundle":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/bundle.json","state":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZDRENGO3EW6QDBHJB3Z4MEWR2P","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":"9a6dd3f5c437d0ed6c6bf3fc39678904062ed10f902a22ece1a54a4022cb29cb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-15T20:07:15Z","title_canon_sha256":"d92d81a94845a22917520811c57798a410b0c11dc28d6db3f230b73454778c5d"},"schema_version":"1.0","source":{"id":"2411.10555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.10555","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"2411.10555v1","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10555","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZDRENGO3EW6Q","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZDRENGO3EW6QDBHJ","created_at":"2026-07-05T09:36:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZDRENGO3","created_at":"2026-07-05T09:36:18Z"}],"graph_snapshots":[{"event_id":"sha256:aab4c5b85779d9cfbc04f4bc0f0c185d33e148353e917bb9cdfa7525c97e4f17","target":"graph","created_at":"2026-07-05T09:36:18Z","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/2411.10555/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal transport (OT) is a general framework for finding a minimum-cost transport plan, or coupling, between probability distributions, and has many applications in machine learning. A key challenge in applying OT to massive datasets is the quadratic scaling of the coupling matrix with the size of the dataset. [Forrow et al. 2019] introduced a factored coupling for the k-Wasserstein barycenter problem, which [Scetbon et al. 2021] adapted to solve the primal low-rank OT problem. We derive an alternative parameterization of the low-rank problem based on the $\\textit{latent coupling}$ (LC) facto","authors_text":"Benjamin J Raphael, Julian Gold, Peter Halmos, Xinhao Liu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-15T20:07:15Z","title":"Low-Rank Optimal Transport through Factor Relaxation with Latent Coupling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10555","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:f3c72ca9efc801434dafd33b961c93f01a03ddb96ce41dbc00e109a6a5a3ab1b","target":"record","created_at":"2026-07-05T09:36:18Z","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":"9a6dd3f5c437d0ed6c6bf3fc39678904062ed10f902a22ece1a54a4022cb29cb","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-15T20:07:15Z","title_canon_sha256":"d92d81a94845a22917520811c57798a410b0c11dc28d6db3f230b73454778c5d"},"schema_version":"1.0","source":{"id":"2411.10555","kind":"arxiv","version":1}},"canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","first_computed_at":"2026-07-05T09:36:18.428356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:18.428356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jedTPxdqp5pLWpLdOjfaEaU+pYFVj5Qw3ciK/HOQpujp2v5+aDjyu+YFvs7W8NrWXZ2rEf2jQoFssZsai2BSDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:18.428780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.10555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3c72ca9efc801434dafd33b961c93f01a03ddb96ce41dbc00e109a6a5a3ab1b","sha256:aab4c5b85779d9cfbc04f4bc0f0c185d33e148353e917bb9cdfa7525c97e4f17"],"state_sha256":"c3ea455d5c0f5fe973871c70bc93e8dc59965e2bf6e36f641f665aa19c944c05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibLzGtuin6mjuJY+2mzhdp5koi5xB8I6/wN8O0L2tM6rXmH0HQx/xRvsfj3/NfT3KcAIXw849elnFtL5hDNODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:26:53.093860Z","bundle_sha256":"75957a6a91c1034dcbe78cd4e55d01b47bd35d06da4740152b4275a51fe6ae88"}}