{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZDRENGO3EW6QDBHJB3Z4MEWR2P","short_pith_number":"pith:ZDRENGO3","schema_version":"1.0","canonical_sha256":"c8e24699db25bd0184e90ef3c612d1d3fece511d170507d831a4d3574899b23a","source":{"kind":"arxiv","id":"2411.10555","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.10555","created_at":"2026-07-05T09:36:18.428412+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10555v1","created_at":"2026-07-05T09:36:18.428412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10555","created_at":"2026-07-05T09:36:18.428412+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDRENGO3EW6Q","created_at":"2026-07-05T09:36:18.428412+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDRENGO3EW6QDBHJ","created_at":"2026-07-05T09:36:18.428412+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDRENGO3","created_at":"2026-07-05T09:36:18.428412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P","json":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P.json","graph_json":"https://pith.science/api/pith-number/ZDRENGO3EW6QDBHJB3Z4MEWR2P/graph.json","events_json":"https://pith.science/api/pith-number/ZDRENGO3EW6QDBHJB3Z4MEWR2P/events.json","paper":"https://pith.science/paper/ZDRENGO3"},"agent_actions":{"view_html":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P","download_json":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P.json","view_paper":"https://pith.science/paper/ZDRENGO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10555&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDRENGO3EW6QDBHJB3Z4MEWR2P/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDRENGO3EW6QDBHJB3Z4MEWR2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/action/storage_attestation","attest_author":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/action/author_attestation","sign_citation":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/action/citation_signature","submit_replication":"https://pith.science/pith/ZDRENGO3EW6QDBHJB3Z4MEWR2P/action/replication_record"}},"created_at":"2026-07-05T09:36:18.428412+00:00","updated_at":"2026-07-05T09:36:18.428412+00:00"}