{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:56ER4NDDM6ZAZYX7U42J3OYCOV","short_pith_number":"pith:56ER4NDD","canonical_record":{"source":{"id":"2410.12176","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T02:44:36Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a2b8708c1befe6a2cf9dd99aaf446c75993f9f84d870e318e62cc9f0d016199e","abstract_canon_sha256":"48dc82e254623e3cbf4c22509f7aa2fd767a68588cf22ebbc7a2395f4c44d6c1"},"schema_version":"1.0"},"canonical_sha256":"ef891e346367b20ce2ffa7349dbb02757ce281321d90d0af8ba05e49a44deb93","source":{"kind":"arxiv","id":"2410.12176","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12176","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12176v2","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12176","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_12","alias_value":"56ER4NDDM6ZA","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_16","alias_value":"56ER4NDDM6ZAZYX7","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_8","alias_value":"56ER4NDD","created_at":"2026-07-05T09:21:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:56ER4NDDM6ZAZYX7U42J3OYCOV","target":"record","payload":{"canonical_record":{"source":{"id":"2410.12176","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T02:44:36Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a2b8708c1befe6a2cf9dd99aaf446c75993f9f84d870e318e62cc9f0d016199e","abstract_canon_sha256":"48dc82e254623e3cbf4c22509f7aa2fd767a68588cf22ebbc7a2395f4c44d6c1"},"schema_version":"1.0"},"canonical_sha256":"ef891e346367b20ce2ffa7349dbb02757ce281321d90d0af8ba05e49a44deb93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:50.444423Z","signature_b64":"fiqTROVllQ5Qd+8WVhehrTSPwhO3wvEer64s5ZHAvYnkO5i82RAgeoX0K8/u9EkUkuAtDheuUDgJde/+/DhABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef891e346367b20ce2ffa7349dbb02757ce281321d90d0af8ba05e49a44deb93","last_reissued_at":"2026-07-05T09:21:50.443908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:50.443908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.12176","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:21:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQ2qizJo1+PT9b931CA4BZdGPBG4DCdBWI3Lw2tBeeSv8JMI7p6IXnnDIKFauqWPkV0tDXRxS697bbdFZfZxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:47:37.986541Z"},"content_sha256":"02b5483436902dccf6b860d9f6cc96f0b8551e67ff10ca108ac3fd01e2119270","schema_version":"1.0","event_id":"sha256:02b5483436902dccf6b860d9f6cc96f0b8551e67ff10ca108ac3fd01e2119270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:56ER4NDDM6ZAZYX7U42J3OYCOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expected Sliced Transport Plans","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.LG","authors_text":"Akram Aldroubi, Ashkan Shahbazi, Matthew Thorpe, Roc\\'io D\\'iaz Mart\\'in, Soheil Kolouri, Xinran Liu, Yikun Bai","submitted_at":"2024-10-16T02:44:36Z","abstract_excerpt":"The optimal transport (OT) problem has gained significant traction in modern machine learning for its ability to: (1) provide versatile metrics, such as Wasserstein distances and their variants, and (2) determine optimal couplings between probability measures. To reduce the computational complexity of OT solvers, methods like entropic regularization and sliced optimal transport have been proposed. The sliced OT framework improves efficiency by comparing one-dimensional projections (slices) of high-dimensional distributions. However, despite their computational efficiency, sliced-Wasserstein ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12176","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/2410.12176/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:21:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTNM+/WoB4rRjc4I7HAlKhnM8Kv7r2Vn5Js5lIjmwWEdEyL9K2PMgkihb4fqzX2PYouDkOQ5YxpXgRVJJfhsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:47:37.987426Z"},"content_sha256":"259aaaeb72272e63582d00c24dea733615f797d1a5869356c3430f59be47a0f6","schema_version":"1.0","event_id":"sha256:259aaaeb72272e63582d00c24dea733615f797d1a5869356c3430f59be47a0f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/bundle.json","state_url":"https://pith.science/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T07:47:37Z","links":{"resolver":"https://pith.science/pith/56ER4NDDM6ZAZYX7U42J3OYCOV","bundle":"https://pith.science/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/bundle.json","state":"https://pith.science/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56ER4NDDM6ZAZYX7U42J3OYCOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:56ER4NDDM6ZAZYX7U42J3OYCOV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48dc82e254623e3cbf4c22509f7aa2fd767a68588cf22ebbc7a2395f4c44d6c1","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T02:44:36Z","title_canon_sha256":"a2b8708c1befe6a2cf9dd99aaf446c75993f9f84d870e318e62cc9f0d016199e"},"schema_version":"1.0","source":{"id":"2410.12176","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12176","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12176v2","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12176","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_12","alias_value":"56ER4NDDM6ZA","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_16","alias_value":"56ER4NDDM6ZAZYX7","created_at":"2026-07-05T09:21:50Z"},{"alias_kind":"pith_short_8","alias_value":"56ER4NDD","created_at":"2026-07-05T09:21:50Z"}],"graph_snapshots":[{"event_id":"sha256:259aaaeb72272e63582d00c24dea733615f797d1a5869356c3430f59be47a0f6","target":"graph","created_at":"2026-07-05T09:21:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.12176/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The optimal transport (OT) problem has gained significant traction in modern machine learning for its ability to: (1) provide versatile metrics, such as Wasserstein distances and their variants, and (2) determine optimal couplings between probability measures. To reduce the computational complexity of OT solvers, methods like entropic regularization and sliced optimal transport have been proposed. The sliced OT framework improves efficiency by comparing one-dimensional projections (slices) of high-dimensional distributions. However, despite their computational efficiency, sliced-Wasserstein ap","authors_text":"Akram Aldroubi, Ashkan Shahbazi, Matthew Thorpe, Roc\\'io D\\'iaz Mart\\'in, Soheil Kolouri, Xinran Liu, Yikun Bai","cross_cats":["math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T02:44:36Z","title":"Expected Sliced Transport Plans"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12176","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02b5483436902dccf6b860d9f6cc96f0b8551e67ff10ca108ac3fd01e2119270","target":"record","created_at":"2026-07-05T09:21:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48dc82e254623e3cbf4c22509f7aa2fd767a68588cf22ebbc7a2395f4c44d6c1","cross_cats_sorted":["math.MG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-16T02:44:36Z","title_canon_sha256":"a2b8708c1befe6a2cf9dd99aaf446c75993f9f84d870e318e62cc9f0d016199e"},"schema_version":"1.0","source":{"id":"2410.12176","kind":"arxiv","version":2}},"canonical_sha256":"ef891e346367b20ce2ffa7349dbb02757ce281321d90d0af8ba05e49a44deb93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef891e346367b20ce2ffa7349dbb02757ce281321d90d0af8ba05e49a44deb93","first_computed_at":"2026-07-05T09:21:50.443908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:50.443908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fiqTROVllQ5Qd+8WVhehrTSPwhO3wvEer64s5ZHAvYnkO5i82RAgeoX0K8/u9EkUkuAtDheuUDgJde/+/DhABA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:50.444423Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.12176","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02b5483436902dccf6b860d9f6cc96f0b8551e67ff10ca108ac3fd01e2119270","sha256:259aaaeb72272e63582d00c24dea733615f797d1a5869356c3430f59be47a0f6"],"state_sha256":"11c55358177e70c44171abcae95a1bf4b502a5a3b2596caea6f8d9e80dcabaa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsGD3x3DtPIA2C1XXr3NWfqfiFSmIdn7o91UKTKGjaiLObWnkQH2kEA5J/SWEDKg9B0fm5YNYQWKN9raX1hUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T07:47:37.993303Z","bundle_sha256":"82d41bff2c6d4eeaf5e9cf31e93e809362c6bcb1912ddd1f38cbbbb77265e490"}}