{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LLLJQA7UWER4FGSXWJDG4ZQ6J5","short_pith_number":"pith:LLLJQA7U","schema_version":"1.0","canonical_sha256":"5ad69803f4b123c29a57b2466e661e4f70964941f5b62e793885eb61eb52a60a","source":{"kind":"arxiv","id":"2106.01128","version":2},"attestation_state":"computed","paper":{"title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel Peyr\\'e, Marco Cuturi, Meyer Scetbon","submitted_at":"2021-06-02T12:50:56Z","abstract_excerpt":"The ability to align points across two related yet incomparable point clouds (e.g. living in different spaces) plays an important role in machine learning. The Gromov-Wasserstein (GW) framework provides an increasingly popular answer to such problems, by seeking a low-distortion, geometry-preserving assignment between these points. As a non-convex, quadratic generalization of optimal transport (OT), GW is NP-hard. While practitioners often resort to solving GW approximately as a nested sequence of entropy-regularized OT problems, the cubic complexity (in the number $n$ of samples) of that appr"},"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":"2106.01128","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-02T12:50:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a859efcf221222693f2f07e48e5d0c17ab5d42ed5770dca0bee17c91ec459cb4","abstract_canon_sha256":"01637d8bd9080a23b4f33c03fdddfdfd23e9e3488f53e37462d1c9ade12dbd5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:00.148798Z","signature_b64":"eM+UpMdJuRp0lDcQSZdBAzPdcAR4MwfiLP8LTL1EUQTxC1lPCpqhrftQAh2Q0B9PBnMI+PlUgfTWhl6LaxeGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad69803f4b123c29a57b2466e661e4f70964941f5b62e793885eb61eb52a60a","last_reissued_at":"2026-07-05T05:39:00.148268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:00.148268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gabriel Peyr\\'e, Marco Cuturi, Meyer Scetbon","submitted_at":"2021-06-02T12:50:56Z","abstract_excerpt":"The ability to align points across two related yet incomparable point clouds (e.g. living in different spaces) plays an important role in machine learning. The Gromov-Wasserstein (GW) framework provides an increasingly popular answer to such problems, by seeking a low-distortion, geometry-preserving assignment between these points. As a non-convex, quadratic generalization of optimal transport (OT), GW is NP-hard. While practitioners often resort to solving GW approximately as a nested sequence of entropy-regularized OT problems, the cubic complexity (in the number $n$ of samples) of that appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01128","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/2106.01128/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":"2106.01128","created_at":"2026-07-05T05:39:00.148342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01128v2","created_at":"2026-07-05T05:39:00.148342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01128","created_at":"2026-07-05T05:39:00.148342+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLLJQA7UWER4","created_at":"2026-07-05T05:39:00.148342+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLLJQA7UWER4FGSX","created_at":"2026-07-05T05:39:00.148342+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLLJQA7U","created_at":"2026-07-05T05:39:00.148342+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/LLLJQA7UWER4FGSXWJDG4ZQ6J5","json":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5.json","graph_json":"https://pith.science/api/pith-number/LLLJQA7UWER4FGSXWJDG4ZQ6J5/graph.json","events_json":"https://pith.science/api/pith-number/LLLJQA7UWER4FGSXWJDG4ZQ6J5/events.json","paper":"https://pith.science/paper/LLLJQA7U"},"agent_actions":{"view_html":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5","download_json":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5.json","view_paper":"https://pith.science/paper/LLLJQA7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01128&json=true","fetch_graph":"https://pith.science/api/pith-number/LLLJQA7UWER4FGSXWJDG4ZQ6J5/graph.json","fetch_events":"https://pith.science/api/pith-number/LLLJQA7UWER4FGSXWJDG4ZQ6J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5/action/storage_attestation","attest_author":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5/action/author_attestation","sign_citation":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5/action/citation_signature","submit_replication":"https://pith.science/pith/LLLJQA7UWER4FGSXWJDG4ZQ6J5/action/replication_record"}},"created_at":"2026-07-05T05:39:00.148342+00:00","updated_at":"2026-07-05T05:39:00.148342+00:00"}