{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WQSSGNYSI6U527HVQUR2OFQM54","short_pith_number":"pith:WQSSGNYS","schema_version":"1.0","canonical_sha256":"b42523371247a9dd7cf58523a7160cef05eb27507ebabb39c5566cab4ea6a811","source":{"kind":"arxiv","id":"2604.23944","version":3},"attestation_state":"computed","paper":{"title":"Sliced-Regularized Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Sliced-regularized optimal transport approximates exact OT plans more accurately than entropic OT by pulling the plan toward a smoothened sliced OT reference instead of an independent coupling.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Khai Nguyen","submitted_at":"2026-04-27T01:36:29Z","abstract_excerpt":"We propose a new regularized optimal transport (OT) formulation, termed sliced-regularized optimal transport (SROT). Unlike entropic OT (EOT), which regularizes the transport plan toward an independent coupling, SROT regularizes it toward a smoothened sliced OT (SOT) plan. To the best of our knowledge, SROT is the first approach to leverage a version of SOT plan as a reference to improve classical OT. We provide a formal definition of SROT, derive its dual formulation, and provide a post-Bayesian interpretation of SROT. We then develop a Sinkhorn-style algorithm for efficient computation, reta"},"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":"2604.23944","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-04-27T01:36:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c9e44d87064a904d36ad0f8b2f9aed516a6cf2ac957806c80aa8383ce4afe4c2","abstract_canon_sha256":"224c2131e0b315f59b2459d49be6fedcf5c12e3604ffe73c31d8beac2f4a0312"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:03.413026Z","signature_b64":"k5xcN6RZF0T5snzQ6Q4ZAC+evDiEauIMRmjAhUjxJJdDh4UUBdDkozQ4KaW6Kccx3zw6yjl3pUIeGDbwV6VlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42523371247a9dd7cf58523a7160cef05eb27507ebabb39c5566cab4ea6a811","last_reissued_at":"2026-05-21T02:05:03.412485Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:03.412485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sliced-Regularized Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Sliced-regularized optimal transport approximates exact OT plans more accurately than entropic OT by pulling the plan toward a smoothened sliced OT reference instead of an independent coupling.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Khai Nguyen","submitted_at":"2026-04-27T01:36:29Z","abstract_excerpt":"We propose a new regularized optimal transport (OT) formulation, termed sliced-regularized optimal transport (SROT). Unlike entropic OT (EOT), which regularizes the transport plan toward an independent coupling, SROT regularizes it toward a smoothened sliced OT (SOT) plan. To the best of our knowledge, SROT is the first approach to leverage a version of SOT plan as a reference to improve classical OT. We provide a formal definition of SROT, derive its dual formulation, and provide a post-Bayesian interpretation of SROT. We then develop a Sinkhorn-style algorithm for efficient computation, reta"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By incorporating a scalable SOT plan as a prior, SROT yields more accurate approximations of the exact OT plan than EOT under the same level of regularization. Moreover, the resulting transport plan improves upon the reference SOT plan itself.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That regularizing toward a smoothened sliced OT plan produces a better approximation to exact OT than regularizing toward an independent coupling, and that the Sinkhorn-style algorithm reliably computes the desired plan.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SROT regularizes the OT plan toward a smoothened sliced OT plan, producing more accurate approximations to exact OT than entropic OT while also improving on the sliced OT reference.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Sliced-regularized optimal transport approximates exact OT plans more accurately than entropic OT by pulling the plan toward a smoothened sliced OT reference instead of an independent coupling.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"254136388a9f1992c980095632e260d2c486c622002b37f635e3f9d79339cb57"},"source":{"id":"2604.23944","kind":"arxiv","version":3},"verdict":{"id":"4a01b2c7-5f67-4400-a0f1-1c5963a838ca","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T01:16:47.116697Z","strongest_claim":"By incorporating a scalable SOT plan as a prior, SROT yields more accurate approximations of the exact OT plan than EOT under the same level of regularization. Moreover, the resulting transport plan improves upon the reference SOT plan itself.","one_line_summary":"SROT regularizes the OT plan toward a smoothened sliced OT plan, producing more accurate approximations to exact OT than entropic OT while also improving on the sliced OT reference.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That regularizing toward a smoothened sliced OT plan produces a better approximation to exact OT than regularizing toward an independent coupling, and that the Sinkhorn-style algorithm reliably computes the desired plan.","pith_extraction_headline":"Sliced-regularized optimal transport approximates exact OT plans more accurately than entropic OT by pulling the plan toward a smoothened sliced OT reference instead of an independent coupling."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.23944/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T22:33:48.545858Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4a3762cb6f56d094570ad465adad252d0d2a60f0925664eafaeacf6a2f9229ea"},"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":"2604.23944","created_at":"2026-05-21T02:05:03.412561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.23944v3","created_at":"2026-05-21T02:05:03.412561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23944","created_at":"2026-05-21T02:05:03.412561+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQSSGNYSI6U5","created_at":"2026-05-21T02:05:03.412561+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQSSGNYSI6U527HV","created_at":"2026-05-21T02:05:03.412561+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQSSGNYS","created_at":"2026-05-21T02:05:03.412561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12879","citing_title":"ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54","json":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54.json","graph_json":"https://pith.science/api/pith-number/WQSSGNYSI6U527HVQUR2OFQM54/graph.json","events_json":"https://pith.science/api/pith-number/WQSSGNYSI6U527HVQUR2OFQM54/events.json","paper":"https://pith.science/paper/WQSSGNYS"},"agent_actions":{"view_html":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54","download_json":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54.json","view_paper":"https://pith.science/paper/WQSSGNYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.23944&json=true","fetch_graph":"https://pith.science/api/pith-number/WQSSGNYSI6U527HVQUR2OFQM54/graph.json","fetch_events":"https://pith.science/api/pith-number/WQSSGNYSI6U527HVQUR2OFQM54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54/action/storage_attestation","attest_author":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54/action/author_attestation","sign_citation":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54/action/citation_signature","submit_replication":"https://pith.science/pith/WQSSGNYSI6U527HVQUR2OFQM54/action/replication_record"}},"created_at":"2026-05-21T02:05:03.412561+00:00","updated_at":"2026-05-21T02:05:03.412561+00:00"}