{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FDN7OREZGSPZX745OKHNRNSVEL","short_pith_number":"pith:FDN7OREZ","schema_version":"1.0","canonical_sha256":"28dbf74499349f9bff9d728ed8b65522d8174383a83ebc9cddddf8ef5850ff33","source":{"kind":"arxiv","id":"2605.13753","version":1},"attestation_state":"computed","paper":{"title":"Min Generalized Sliced Gromov Wasserstein: A Scalable Path to Gromov Wasserstein","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Min-GSGW learns coupled nonlinear slicers so that monotone 1D matching induces low-cost Gromov-Wasserstein transport plans in the original spaces.","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ashkan Shahbazi, Ping He, Soheil Kolouri, Xinran Liu","submitted_at":"2026-05-13T16:33:10Z","abstract_excerpt":"We propose min Generalized Sliced Gromov--Wasserstein (min-GSGW), a sliced formulation for the Gromov--Wasserstein (GW) problem using expressive generalized slicers. The key idea is to learn coupled nonlinear slicers that assign compatible push-forward values to both input measures, so that monotone coupling in the projected domain lifts to a transport plan evaluated against the GW objective in the original spaces. The resulting plan induces a GW objective value, and min-GSGW minimizes this cost directly in the original spaces. We further show that min-GSGW is rigid-motion invariant, a crucial"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13753","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T16:33:10Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"6cff6035d274f7a6362d72aafa62934a8a650a42aebc420d224e3b5bc122047f","abstract_canon_sha256":"11e6114eaf33b48100f1bef876dcedbfd253623d73af4a3e1b16d84c317cced5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.361227Z","signature_b64":"gpEwoPG0nWTe2Dr1tumS5WLc1I1BHG5GqMow9wfQFW5Ffeh8KUmaIa4VZnBmxDdf2H3DOh0l+QqDZY/u6gxECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28dbf74499349f9bff9d728ed8b65522d8174383a83ebc9cddddf8ef5850ff33","last_reissued_at":"2026-05-18T02:44:16.360799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.360799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min Generalized Sliced Gromov Wasserstein: A Scalable Path to Gromov Wasserstein","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Min-GSGW learns coupled nonlinear slicers so that monotone 1D matching induces low-cost Gromov-Wasserstein transport plans in the original spaces.","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ashkan Shahbazi, Ping He, Soheil Kolouri, Xinran Liu","submitted_at":"2026-05-13T16:33:10Z","abstract_excerpt":"We propose min Generalized Sliced Gromov--Wasserstein (min-GSGW), a sliced formulation for the Gromov--Wasserstein (GW) problem using expressive generalized slicers. The key idea is to learn coupled nonlinear slicers that assign compatible push-forward values to both input measures, so that monotone coupling in the projected domain lifts to a transport plan evaluated against the GW objective in the original spaces. The resulting plan induces a GW objective value, and min-GSGW minimizes this cost directly in the original spaces. We further show that min-GSGW is rigid-motion invariant, a crucial"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"min-GSGW produces meaningful geometric correspondences and GW objective values at substantially lower computational cost than existing GW solvers while remaining rigid-motion invariant.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the learned coupled nonlinear slicers produce push-forward values whose monotone coupling in the projected domain lifts to a transport plan whose GW cost in the original spaces is close to the true optimum.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"min-GSGW learns coupled nonlinear slicers to produce a rigid-motion-invariant, scalable approximation to the Gromov-Wasserstein distance and its transport plans.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Min-GSGW learns coupled nonlinear slicers so that monotone 1D matching induces low-cost Gromov-Wasserstein transport plans in the original spaces.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0732fa5d3f275fadf856b703fcbd90339e90bd8dc2fa269d948834e84c4b984e"},"source":{"id":"2605.13753","kind":"arxiv","version":1},"verdict":{"id":"5dbb16ab-c6c2-4df9-9d43-e1515c31f1ff","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:40:22.115458Z","strongest_claim":"min-GSGW produces meaningful geometric correspondences and GW objective values at substantially lower computational cost than existing GW solvers while remaining rigid-motion invariant.","one_line_summary":"min-GSGW learns coupled nonlinear slicers to produce a rigid-motion-invariant, scalable approximation to the Gromov-Wasserstein distance and its transport plans.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the learned coupled nonlinear slicers produce push-forward values whose monotone coupling in the projected domain lifts to a transport plan whose GW cost in the original spaces is close to the true optimum.","pith_extraction_headline":"Min-GSGW learns coupled nonlinear slicers so that monotone 1D matching induces low-cost Gromov-Wasserstein transport plans in the original spaces."},"references":{"count":26,"sample":[{"doi":"","year":2023,"title":"On assignment problems related to gromov–wasserstein distances on the real line.SIAM Journal on Imaging Sciences, 16(2):1028–1032, 2023","work_id":"d0706d48-5b3b-40b0-bafb-318296ceef88","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"ShapeNet: An Information-Rich 3D Model Repository","work_id":"b2ac5b60-daa9-435b-9369-12271e126edd","ref_index":2,"cited_arxiv_id":"1512.03012","is_internal_anchor":true},{"doi":"","year":2026,"title":"Differentiable generalized sliced wasserstein plans","work_id":"a3097df0-22ab-4853-97c9-6cb87ef1aca9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Semidefinite relaxations of the gromov- wasserstein distance","work_id":"494b95e8-bf24-46e8-a14e-046452fe7caa","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Samir Chowdhury, David Miller, and Tom Needham. Quantized gromov-wasserstein, 2021","work_id":"3e37c2c1-f88d-424b-9714-ac7d01ceb31e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"2993a3893fddb7589339a3cced3fe34dc9fa6f9fccc36ff0b5b5634bf286d498","internal_anchors":1},"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":"2605.13753","created_at":"2026-05-18T02:44:16.360865+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13753v1","created_at":"2026-05-18T02:44:16.360865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13753","created_at":"2026-05-18T02:44:16.360865+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDN7OREZGSPZ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDN7OREZGSPZX745","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDN7OREZ","created_at":"2026-05-18T12:33:37.589309+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/FDN7OREZGSPZX745OKHNRNSVEL","json":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL.json","graph_json":"https://pith.science/api/pith-number/FDN7OREZGSPZX745OKHNRNSVEL/graph.json","events_json":"https://pith.science/api/pith-number/FDN7OREZGSPZX745OKHNRNSVEL/events.json","paper":"https://pith.science/paper/FDN7OREZ"},"agent_actions":{"view_html":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL","download_json":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL.json","view_paper":"https://pith.science/paper/FDN7OREZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13753&json=true","fetch_graph":"https://pith.science/api/pith-number/FDN7OREZGSPZX745OKHNRNSVEL/graph.json","fetch_events":"https://pith.science/api/pith-number/FDN7OREZGSPZX745OKHNRNSVEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL/action/storage_attestation","attest_author":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL/action/author_attestation","sign_citation":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL/action/citation_signature","submit_replication":"https://pith.science/pith/FDN7OREZGSPZX745OKHNRNSVEL/action/replication_record"}},"created_at":"2026-05-18T02:44:16.360865+00:00","updated_at":"2026-05-18T02:44:16.360865+00:00"}