{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:B3XK22GFJZIFDDNN2SUMF34B3H","short_pith_number":"pith:B3XK22GF","schema_version":"1.0","canonical_sha256":"0eeead68c54e50518dadd4a8c2ef81d9c5428cc09be97d560693c5a289df872b","source":{"kind":"arxiv","id":"2303.16280","version":3},"attestation_state":"computed","paper":{"title":"UVCGAN v2: An Improved Cycle-Consistent GAN for Unpaired Image-to-Image Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Brett Viren, Dmitrii Torbunov, Haiwang Yu, Huan-Hsin Tseng, Jin Huang, Meifeng Lin, Shinjae Yoo, Yi Huang, Yihui Ren","submitted_at":"2023-03-28T19:46:34Z","abstract_excerpt":"An unpaired image-to-image (I2I) translation technique seeks to find a mapping between two domains of data in a fully unsupervised manner. While initial solutions to the I2I problem were provided by generative adversarial neural networks (GANs), diffusion models (DMs) currently hold the state-of-the-art status on the I2I translation benchmarks in terms of Frechet inception distance (FID). Yet, DMs suffer from limitations, such as not using data from the source domain during the training or maintaining consistency of the source and translated images only via simple pixel-wise errors. This work "},"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":"2303.16280","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-03-28T19:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"d438294ad921d2664560492c100f4af90f523e02dc4e31f5bf6288cd2c54cf09","abstract_canon_sha256":"17fa3f0aedcadf55434b6c8074d8d89bb12969f4b98ac57b092c57f8d5dfc4a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:35.974236Z","signature_b64":"+1CLXfN3w4Vnoh8mgvWlIGSHUj9z8OupeuEehRD2awF3lMBFC0tiywg/vTkGkm2mdGSZ9xQ3Y+TdqN3z2lZPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eeead68c54e50518dadd4a8c2ef81d9c5428cc09be97d560693c5a289df872b","last_reissued_at":"2026-07-05T06:53:35.973735Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:35.973735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UVCGAN v2: An Improved Cycle-Consistent GAN for Unpaired Image-to-Image Translation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Brett Viren, Dmitrii Torbunov, Haiwang Yu, Huan-Hsin Tseng, Jin Huang, Meifeng Lin, Shinjae Yoo, Yi Huang, Yihui Ren","submitted_at":"2023-03-28T19:46:34Z","abstract_excerpt":"An unpaired image-to-image (I2I) translation technique seeks to find a mapping between two domains of data in a fully unsupervised manner. While initial solutions to the I2I problem were provided by generative adversarial neural networks (GANs), diffusion models (DMs) currently hold the state-of-the-art status on the I2I translation benchmarks in terms of Frechet inception distance (FID). Yet, DMs suffer from limitations, such as not using data from the source domain during the training or maintaining consistency of the source and translated images only via simple pixel-wise errors. This work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16280","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/2303.16280/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":"2303.16280","created_at":"2026-07-05T06:53:35.973798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16280v3","created_at":"2026-07-05T06:53:35.973798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16280","created_at":"2026-07-05T06:53:35.973798+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3XK22GFJZIF","created_at":"2026-07-05T06:53:35.973798+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3XK22GFJZIFDDNN","created_at":"2026-07-05T06:53:35.973798+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3XK22GF","created_at":"2026-07-05T06:53:35.973798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15802","citing_title":"A Deep Learning Framework for Two-Dimensional, Multi-Frequency Propagation Factor Estimation","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H","json":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H.json","graph_json":"https://pith.science/api/pith-number/B3XK22GFJZIFDDNN2SUMF34B3H/graph.json","events_json":"https://pith.science/api/pith-number/B3XK22GFJZIFDDNN2SUMF34B3H/events.json","paper":"https://pith.science/paper/B3XK22GF"},"agent_actions":{"view_html":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H","download_json":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H.json","view_paper":"https://pith.science/paper/B3XK22GF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16280&json=true","fetch_graph":"https://pith.science/api/pith-number/B3XK22GFJZIFDDNN2SUMF34B3H/graph.json","fetch_events":"https://pith.science/api/pith-number/B3XK22GFJZIFDDNN2SUMF34B3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H/action/storage_attestation","attest_author":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H/action/author_attestation","sign_citation":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H/action/citation_signature","submit_replication":"https://pith.science/pith/B3XK22GFJZIFDDNN2SUMF34B3H/action/replication_record"}},"created_at":"2026-07-05T06:53:35.973798+00:00","updated_at":"2026-07-05T06:53:35.973798+00:00"}