{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HDTG3FGY2AIQLBIB4TG6NTHUN5","short_pith_number":"pith:HDTG3FGY","schema_version":"1.0","canonical_sha256":"38e66d94d8d011058501e4cde6ccf46f400579769055ff8566779ee604aa853e","source":{"kind":"arxiv","id":"1811.06284","version":1},"attestation_state":"computed","paper":{"title":"Guiding the One-to-one Mapping in CycleGAN via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Guansong Lu, Kan Ren, Yong Yu, Yuxuan Song, Zhiming Zhou","submitted_at":"2018-11-15T10:34:33Z","abstract_excerpt":"CycleGAN is capable of learning a one-to-one mapping between two data distributions without paired examples, achieving the task of unsupervised data translation. However, there is no theoretical guarantee on the property of the learned one-to-one mapping in CycleGAN. In this paper, we experimentally find that, under some circumstances, the one-to-one mapping learned by CycleGAN is just a random one within the large feasible solution space. Based on this observation, we explore to add extra constraints such that the one-to-one mapping is controllable and satisfies more properties related to spe"},"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":"1811.06284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-15T10:34:33Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4a5f701abd2807ab695899e20b7cff6f0d2837df319d7c99984742b06d04e02b","abstract_canon_sha256":"defd9d026e1fb12a67c8c3ecdf5a35f1cedf635b606b47cb94ddc79dfc44a44f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.111749Z","signature_b64":"iXt24wXrQSwOqoXVA4CopZAsI6/TK7Z53DVhN/1w9zJAJxXNL/gJqWNJ6Rg/r8/+i+E4TmRUm48AI62ZmSR3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e66d94d8d011058501e4cde6ccf46f400579769055ff8566779ee604aa853e","last_reissued_at":"2026-05-18T00:00:38.111176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.111176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guiding the One-to-one Mapping in CycleGAN via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Guansong Lu, Kan Ren, Yong Yu, Yuxuan Song, Zhiming Zhou","submitted_at":"2018-11-15T10:34:33Z","abstract_excerpt":"CycleGAN is capable of learning a one-to-one mapping between two data distributions without paired examples, achieving the task of unsupervised data translation. However, there is no theoretical guarantee on the property of the learned one-to-one mapping in CycleGAN. In this paper, we experimentally find that, under some circumstances, the one-to-one mapping learned by CycleGAN is just a random one within the large feasible solution space. Based on this observation, we explore to add extra constraints such that the one-to-one mapping is controllable and satisfies more properties related to spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06284","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":""},"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":"1811.06284","created_at":"2026-05-18T00:00:38.111257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06284v1","created_at":"2026-05-18T00:00:38.111257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06284","created_at":"2026-05-18T00:00:38.111257+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDTG3FGY2AIQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDTG3FGY2AIQLBIB","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDTG3FGY","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5","json":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5.json","graph_json":"https://pith.science/api/pith-number/HDTG3FGY2AIQLBIB4TG6NTHUN5/graph.json","events_json":"https://pith.science/api/pith-number/HDTG3FGY2AIQLBIB4TG6NTHUN5/events.json","paper":"https://pith.science/paper/HDTG3FGY"},"agent_actions":{"view_html":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5","download_json":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5.json","view_paper":"https://pith.science/paper/HDTG3FGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06284&json=true","fetch_graph":"https://pith.science/api/pith-number/HDTG3FGY2AIQLBIB4TG6NTHUN5/graph.json","fetch_events":"https://pith.science/api/pith-number/HDTG3FGY2AIQLBIB4TG6NTHUN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5/action/storage_attestation","attest_author":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5/action/author_attestation","sign_citation":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5/action/citation_signature","submit_replication":"https://pith.science/pith/HDTG3FGY2AIQLBIB4TG6NTHUN5/action/replication_record"}},"created_at":"2026-05-18T00:00:38.111257+00:00","updated_at":"2026-05-18T00:00:38.111257+00:00"}