{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VO7GKVGHPTSPALNWJUXBMZGYYL","short_pith_number":"pith:VO7GKVGH","schema_version":"1.0","canonical_sha256":"abbe6554c77ce4f02db64d2e1664d8c2cd52a3f6b486d1a8b12c401fe4ff0453","source":{"kind":"arxiv","id":"2310.06002","version":1},"attestation_state":"computed","paper":{"title":"LCOT: Linear circular optimal transport","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gustavo K. Rohde, Ivan Medri, Kangbai Yan, Rocio Diaz Martin, Soheil Kolouri, Xinran Liu, Yikun Bai","submitted_at":"2023-10-09T14:37:56Z","abstract_excerpt":"The optimal transport problem for measures supported on non-Euclidean spaces has recently gained ample interest in diverse applications involving representation learning. In this paper, we focus on circular probability measures, i.e., probability measures supported on the unit circle, and introduce a new computationally efficient metric for these measures, denoted as Linear Circular Optimal Transport (LCOT). The proposed metric comes with an explicit linear embedding that allows one to apply Machine Learning (ML) algorithms to the embedded measures and seamlessly modify the underlying metric f"},"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":"2310.06002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-09T14:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"9cb6b2f272956672c03c31ea57a10b4bfad38e2ee7d37bfbe1106097e0d4e740","abstract_canon_sha256":"c6ff646f0a6d8be52e72f138d069a2b84efc09e151f8dbcb377c5d1ffce21a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:03.073951Z","signature_b64":"l4gzz7QLTVp/J5ZegqDVZIUBapcbhOwEapQV8GUyfb+T0Sonh30L0VQppKpMhs0CXmzRNnYudqhoCgnlydbmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abbe6554c77ce4f02db64d2e1664d8c2cd52a3f6b486d1a8b12c401fe4ff0453","last_reissued_at":"2026-07-05T06:59:03.073529Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:03.073529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LCOT: Linear circular optimal transport","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gustavo K. Rohde, Ivan Medri, Kangbai Yan, Rocio Diaz Martin, Soheil Kolouri, Xinran Liu, Yikun Bai","submitted_at":"2023-10-09T14:37:56Z","abstract_excerpt":"The optimal transport problem for measures supported on non-Euclidean spaces has recently gained ample interest in diverse applications involving representation learning. In this paper, we focus on circular probability measures, i.e., probability measures supported on the unit circle, and introduce a new computationally efficient metric for these measures, denoted as Linear Circular Optimal Transport (LCOT). The proposed metric comes with an explicit linear embedding that allows one to apply Machine Learning (ML) algorithms to the embedded measures and seamlessly modify the underlying metric f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06002","kind":"arxiv","version":1},"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/2310.06002/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":"2310.06002","created_at":"2026-07-05T06:59:03.073598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.06002v1","created_at":"2026-07-05T06:59:03.073598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06002","created_at":"2026-07-05T06:59:03.073598+00:00"},{"alias_kind":"pith_short_12","alias_value":"VO7GKVGHPTSP","created_at":"2026-07-05T06:59:03.073598+00:00"},{"alias_kind":"pith_short_16","alias_value":"VO7GKVGHPTSPALNW","created_at":"2026-07-05T06:59:03.073598+00:00"},{"alias_kind":"pith_short_8","alias_value":"VO7GKVGH","created_at":"2026-07-05T06:59:03.073598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10651","citing_title":"Understanding Learning with Sliced-Wasserstein Requires Rethinking Informative Slices","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL","json":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL.json","graph_json":"https://pith.science/api/pith-number/VO7GKVGHPTSPALNWJUXBMZGYYL/graph.json","events_json":"https://pith.science/api/pith-number/VO7GKVGHPTSPALNWJUXBMZGYYL/events.json","paper":"https://pith.science/paper/VO7GKVGH"},"agent_actions":{"view_html":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL","download_json":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL.json","view_paper":"https://pith.science/paper/VO7GKVGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.06002&json=true","fetch_graph":"https://pith.science/api/pith-number/VO7GKVGHPTSPALNWJUXBMZGYYL/graph.json","fetch_events":"https://pith.science/api/pith-number/VO7GKVGHPTSPALNWJUXBMZGYYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL/action/storage_attestation","attest_author":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL/action/author_attestation","sign_citation":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL/action/citation_signature","submit_replication":"https://pith.science/pith/VO7GKVGHPTSPALNWJUXBMZGYYL/action/replication_record"}},"created_at":"2026-07-05T06:59:03.073598+00:00","updated_at":"2026-07-05T06:59:03.073598+00:00"}