{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PB72RKPBJU72V5DICCMKIO236V","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":"bbcb2e94b42812c7f7a4ee92b1fc0ff70d6462618fbf46498a1c8f010e8a62de","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-25T14:07:16Z","title_canon_sha256":"4be7f164869acdd920bd03026673dfbbfeeb7dc1bf082d6c3c933ef474b7cbc2"},"schema_version":"1.0","source":{"id":"2005.12123","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.12123","created_at":"2026-07-05T01:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"2005.12123v4","created_at":"2026-07-05T01:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.12123","created_at":"2026-07-05T01:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"PB72RKPBJU72","created_at":"2026-07-05T01:38:37Z"},{"alias_kind":"pith_short_16","alias_value":"PB72RKPBJU72V5DI","created_at":"2026-07-05T01:38:37Z"},{"alias_kind":"pith_short_8","alias_value":"PB72RKPB","created_at":"2026-07-05T01:38:37Z"}],"graph_snapshots":[{"event_id":"sha256:abec8420f4c90539cc37d946ca60bf605871120f9fa8e2119b5d954a2edf4e44","target":"graph","created_at":"2026-07-05T01:38:37Z","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/2005.12123/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal transport is a machine learning problem with applications including distribution comparison, feature selection, and generative adversarial networks. In this paper, we propose feature-robust optimal transport (FROT) for high-dimensional data, which solves high-dimensional OT problems using feature selection to avoid the curse of dimensionality. Specifically, we find a transport plan with discriminative features. To this end, we formulate the FROT problem as a min--max optimization problem. We then propose a convex formulation of the FROT problem and solve it using a Frank--Wolfe-based o","authors_text":"Chao Liang, Linchao Zhu, Makoto Yamada, Mathis Petrovich, Ruslan Salakhutdinov, Ryoma Sato, Yanbin Liu, Yao-Hung Hubert Tsai, Yi Yang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-25T14:07:16Z","title":"Feature Robust Optimal Transport for High-dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.12123","kind":"arxiv","version":4},"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:b5dcdd447511b72fd22521bde57b1209d7caec885103326c96cf170344621f47","target":"record","created_at":"2026-07-05T01:38:37Z","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":"bbcb2e94b42812c7f7a4ee92b1fc0ff70d6462618fbf46498a1c8f010e8a62de","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-25T14:07:16Z","title_canon_sha256":"4be7f164869acdd920bd03026673dfbbfeeb7dc1bf082d6c3c933ef474b7cbc2"},"schema_version":"1.0","source":{"id":"2005.12123","kind":"arxiv","version":4}},"canonical_sha256":"787fa8a9e14d3faaf4681098a43b5bf5714f6cf795788281ddb875f74362f9ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"787fa8a9e14d3faaf4681098a43b5bf5714f6cf795788281ddb875f74362f9ea","first_computed_at":"2026-07-05T01:38:37.393444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:38:37.393444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZ98ib8qwQT1l6555qOD5DmtS9m9/7jGwyLTbRrEHBe/GJIZMR2Eh5lpOiv1Tfr3VP5pLafKIDkRRHp/z789BA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:38:37.393927Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.12123","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5dcdd447511b72fd22521bde57b1209d7caec885103326c96cf170344621f47","sha256:abec8420f4c90539cc37d946ca60bf605871120f9fa8e2119b5d954a2edf4e44"],"state_sha256":"ea8c73365fbd5ba104a7bc3a88a1d1de12d1ce0630ebb96c532039e2c5979590"}