{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XAO5XBP3PS4RDNMTVZ664VYLLS","short_pith_number":"pith:XAO5XBP3","schema_version":"1.0","canonical_sha256":"b81ddb85fb7cb911b593ae7dee570b5c90731fab4a308dcffeb36f2da24a9ac6","source":{"kind":"arxiv","id":"2205.12365","version":2},"attestation_state":"computed","paper":{"title":"Low-rank Optimal Transport: Approximation, Statistics and Debiasing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Marco Cuturi, Meyer Scetbon","submitted_at":"2022-05-24T20:51:37Z","abstract_excerpt":"The matching principles behind optimal transport (OT) play an increasingly important role in machine learning, a trend which can be observed when OT is used to disambiguate datasets in applications (e.g. single-cell genomics) or used to improve more complex methods (e.g. balanced attention in transformers or self-supervised learning). To scale to more challenging problems, there is a growing consensus that OT requires solvers that can operate on millions, not thousands, of points. The low-rank optimal transport (LOT) approach advocated in \\cite{scetbon2021lowrank} holds several promises in tha"},"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":"2205.12365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-05-24T20:51:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a8385d222a1b66fff02d6e5ba27417eba8769283010c02987ec9b4ad392f058","abstract_canon_sha256":"4dbad88c481f0b017472fe0f1c6f8780eae5a1bba055def7f1d9808c4caad56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:46.608713Z","signature_b64":"0HsjT4Eg98M/YYVcbkumyBEJlT0QzKAJ8paJNdjhRf+YQABVKd6+DiTsuXHg2J5HMj7d3Wnnuh/pZIVDQRAPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b81ddb85fb7cb911b593ae7dee570b5c90731fab4a308dcffeb36f2da24a9ac6","last_reissued_at":"2026-07-05T04:57:46.608218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:46.608218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Optimal Transport: Approximation, Statistics and Debiasing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Marco Cuturi, Meyer Scetbon","submitted_at":"2022-05-24T20:51:37Z","abstract_excerpt":"The matching principles behind optimal transport (OT) play an increasingly important role in machine learning, a trend which can be observed when OT is used to disambiguate datasets in applications (e.g. single-cell genomics) or used to improve more complex methods (e.g. balanced attention in transformers or self-supervised learning). To scale to more challenging problems, there is a growing consensus that OT requires solvers that can operate on millions, not thousands, of points. The low-rank optimal transport (LOT) approach advocated in \\cite{scetbon2021lowrank} holds several promises in tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12365","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/2205.12365/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":"2205.12365","created_at":"2026-07-05T04:57:46.608289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12365v2","created_at":"2026-07-05T04:57:46.608289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12365","created_at":"2026-07-05T04:57:46.608289+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAO5XBP3PS4R","created_at":"2026-07-05T04:57:46.608289+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAO5XBP3PS4RDNMT","created_at":"2026-07-05T04:57:46.608289+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAO5XBP3","created_at":"2026-07-05T04:57:46.608289+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/XAO5XBP3PS4RDNMTVZ664VYLLS","json":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS.json","graph_json":"https://pith.science/api/pith-number/XAO5XBP3PS4RDNMTVZ664VYLLS/graph.json","events_json":"https://pith.science/api/pith-number/XAO5XBP3PS4RDNMTVZ664VYLLS/events.json","paper":"https://pith.science/paper/XAO5XBP3"},"agent_actions":{"view_html":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS","download_json":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS.json","view_paper":"https://pith.science/paper/XAO5XBP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12365&json=true","fetch_graph":"https://pith.science/api/pith-number/XAO5XBP3PS4RDNMTVZ664VYLLS/graph.json","fetch_events":"https://pith.science/api/pith-number/XAO5XBP3PS4RDNMTVZ664VYLLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS/action/storage_attestation","attest_author":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS/action/author_attestation","sign_citation":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS/action/citation_signature","submit_replication":"https://pith.science/pith/XAO5XBP3PS4RDNMTVZ664VYLLS/action/replication_record"}},"created_at":"2026-07-05T04:57:46.608289+00:00","updated_at":"2026-07-05T04:57:46.608289+00:00"}