{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DLYQZPBGNJBTO7ZPSBXCJIMYNE","short_pith_number":"pith:DLYQZPBG","schema_version":"1.0","canonical_sha256":"1af10cbc266a43377f2f906e24a198693ac389cfdb6c83a8a988b7215a23dec1","source":{"kind":"arxiv","id":"2508.01243","version":2},"attestation_state":"computed","paper":{"title":"Sliced Transport Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eloi Tanguy, Julie Delon, Laetitia Chapel","submitted_at":"2025-08-02T07:38:28Z","abstract_excerpt":"Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However, its inability to produce transport plans limits its practical use to applications where only a distance is necessary. Several heuristics have been proposed in the recent years to address this limitation when the probability measures are discrete. In this paper, we propose to study these different propositions by redefining and analysing them rigorously for gen"},"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":"2508.01243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-02T07:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"97c6095d29ad1eab849a3454a64a6d26d7e70ab5331aca8eca902c42560372b8","abstract_canon_sha256":"d68e7f0ddda32f30964cff6bf4834f52c83528c487f25fecba9763bc43a956f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:25.162246Z","signature_b64":"v/GnMZ0E6DPhPvUrTq/v5mFgHJAUXL6sZ/C4Dd59GRLyKNrvxrEu89xkVy6LD21FhnFYJkXfSZDQNDZUzVmwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af10cbc266a43377f2f906e24a198693ac389cfdb6c83a8a988b7215a23dec1","last_reissued_at":"2026-06-01T02:03:25.161133Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:25.161133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sliced Transport Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eloi Tanguy, Julie Delon, Laetitia Chapel","submitted_at":"2025-08-02T07:38:28Z","abstract_excerpt":"Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However, its inability to produce transport plans limits its practical use to applications where only a distance is necessary. Several heuristics have been proposed in the recent years to address this limitation when the probability measures are discrete. In this paper, we propose to study these different propositions by redefining and analysing them rigorously for gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01243","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/2508.01243/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":"2508.01243","created_at":"2026-06-01T02:03:25.161267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01243v2","created_at":"2026-06-01T02:03:25.161267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01243","created_at":"2026-06-01T02:03:25.161267+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLYQZPBGNJBT","created_at":"2026-06-01T02:03:25.161267+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLYQZPBGNJBTO7ZP","created_at":"2026-06-01T02:03:25.161267+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLYQZPBG","created_at":"2026-06-01T02:03:25.161267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2511.19741","citing_title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23944","citing_title":"Sliced-Regularized Optimal Transport","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12879","citing_title":"ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23944","citing_title":"Sliced-Regularized Optimal Transport","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15114","citing_title":"Amortized Optimal Transport from Sliced Potentials","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE","json":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE.json","graph_json":"https://pith.science/api/pith-number/DLYQZPBGNJBTO7ZPSBXCJIMYNE/graph.json","events_json":"https://pith.science/api/pith-number/DLYQZPBGNJBTO7ZPSBXCJIMYNE/events.json","paper":"https://pith.science/paper/DLYQZPBG"},"agent_actions":{"view_html":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE","download_json":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE.json","view_paper":"https://pith.science/paper/DLYQZPBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01243&json=true","fetch_graph":"https://pith.science/api/pith-number/DLYQZPBGNJBTO7ZPSBXCJIMYNE/graph.json","fetch_events":"https://pith.science/api/pith-number/DLYQZPBGNJBTO7ZPSBXCJIMYNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE/action/storage_attestation","attest_author":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE/action/author_attestation","sign_citation":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE/action/citation_signature","submit_replication":"https://pith.science/pith/DLYQZPBGNJBTO7ZPSBXCJIMYNE/action/replication_record"}},"created_at":"2026-06-01T02:03:25.161267+00:00","updated_at":"2026-06-01T02:03:25.161267+00:00"}