{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3Y6PW6BU2UCB4FU6Y2NGDCVOUW","short_pith_number":"pith:3Y6PW6BU","schema_version":"1.0","canonical_sha256":"de3cfb7834d5041e169ec69a618aaea58f2670b8b6b775beabd4783c1a1748f0","source":{"kind":"arxiv","id":"2511.19741","version":3},"attestation_state":"computed","paper":{"title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Elaheh Akbari, Navid Naderializadeh, Rocio Diaz Martin, Soheil Kolouri, Xinran Liu","submitted_at":"2025-11-24T21:59:12Z","abstract_excerpt":"Optimal Transport (OT) offers a powerful framework for finding correspondences between distributions and addressing matching and alignment problems in various areas of computer vision, including shape analysis, image generation, and multimodal tasks. The computation cost of OT, however, hinders its scalability. Slice-based transport plans have recently shown promise for reducing the computational cost by leveraging the closed-form solutions of 1D OT problems. These methods optimize a one-dimensional projection (slice) to obtain a conditional transport plan that minimizes the transport cost in "},"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":"2511.19741","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-11-24T21:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"105668897884df535b0025f5af9e10c6a76a0ebdf13bfe742de7625d6123f93b","abstract_canon_sha256":"cca4710419efecf07b5b2bcd8718a78836be6ebee7d545636e1a7b2ada105ca2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:02.741893Z","signature_b64":"F2SADZ5wmCiymJaRWRlywGYN25HDBhpFpGQnopTpdp0t/ZaGkQYhEOV/BqNJUijcFXkJAMqblrIZvGxyqP+CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de3cfb7834d5041e169ec69a618aaea58f2670b8b6b775beabd4783c1a1748f0","last_reissued_at":"2026-05-20T01:05:02.741026Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:02.741026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Elaheh Akbari, Navid Naderializadeh, Rocio Diaz Martin, Soheil Kolouri, Xinran Liu","submitted_at":"2025-11-24T21:59:12Z","abstract_excerpt":"Optimal Transport (OT) offers a powerful framework for finding correspondences between distributions and addressing matching and alignment problems in various areas of computer vision, including shape analysis, image generation, and multimodal tasks. The computation cost of OT, however, hinders its scalability. Slice-based transport plans have recently shown promise for reducing the computational cost by leveraging the closed-form solutions of 1D OT problems. These methods optimize a one-dimensional projection (slice) to obtain a conditional transport plan that minimizes the transport cost in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.19741","kind":"arxiv","version":3},"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/2511.19741/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":"2511.19741","created_at":"2026-05-20T01:05:02.741152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.19741v3","created_at":"2026-05-20T01:05:02.741152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19741","created_at":"2026-05-20T01:05:02.741152+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Y6PW6BU2UCB","created_at":"2026-05-20T01:05:02.741152+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Y6PW6BU2UCB4FU6","created_at":"2026-05-20T01:05:02.741152+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Y6PW6BU","created_at":"2026-05-20T01:05:02.741152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.12879","citing_title":"ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11944","citing_title":"Generative Transfer for Entropic Optimal Transport with Unknown Costs","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08546","citing_title":"Sliced Inner Product Gromov-Wasserstein Distances","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW","json":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW.json","graph_json":"https://pith.science/api/pith-number/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/graph.json","events_json":"https://pith.science/api/pith-number/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/events.json","paper":"https://pith.science/paper/3Y6PW6BU"},"agent_actions":{"view_html":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW","download_json":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW.json","view_paper":"https://pith.science/paper/3Y6PW6BU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.19741&json=true","fetch_graph":"https://pith.science/api/pith-number/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/graph.json","fetch_events":"https://pith.science/api/pith-number/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/action/storage_attestation","attest_author":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/action/author_attestation","sign_citation":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/action/citation_signature","submit_replication":"https://pith.science/pith/3Y6PW6BU2UCB4FU6Y2NGDCVOUW/action/replication_record"}},"created_at":"2026-05-20T01:05:02.741152+00:00","updated_at":"2026-05-20T01:05:02.741152+00:00"}