{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Z3WL6HXBINKSEN6DWRXHJNDGMI","short_pith_number":"pith:Z3WL6HXB","schema_version":"1.0","canonical_sha256":"ceecbf1ee143552237c3b46e74b4666228bc4fd49c243c84941b76a26b1680ba","source":{"kind":"arxiv","id":"1711.11293","version":2},"attestation_state":"computed","paper":{"title":"Parallel-Data-Free Voice Conversion Using Cycle-Consistent Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD","eess.AS"],"primary_cat":"stat.ML","authors_text":"Hirokazu Kameoka, Takuhiro Kaneko","submitted_at":"2017-11-30T09:57:19Z","abstract_excerpt":"We propose a parallel-data-free voice-conversion (VC) method that can learn a mapping from source to target speech without relying on parallel data. The proposed method is general purpose, high quality, and parallel-data free and works without any extra data, modules, or alignment procedure. It also avoids over-smoothing, which occurs in many conventional statistical model-based VC methods. Our method, called CycleGAN-VC, uses a cycle-consistent adversarial network (CycleGAN) with gated convolutional neural networks (CNNs) and an identity-mapping loss. A CycleGAN learns forward and inverse map"},"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":"1711.11293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-30T09:57:19Z","cross_cats_sorted":["cs.SD","eess.AS"],"title_canon_sha256":"4974ec8158aa5c9c07721202f9ba656e326aa17927caf1b33ff4c52842c42495","abstract_canon_sha256":"12dcb00412d41e8c8b0e32977923f03a27222a1fd700cae14a96b4f35b301e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.648815Z","signature_b64":"kc6p2RBVx412z+0WoVjJtt4lspfQ9kE7CWvHNoxUgzOD9JJV9ogtf6reAQLbmaa/BxQHqVha4pzsxsl5++a5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceecbf1ee143552237c3b46e74b4666228bc4fd49c243c84941b76a26b1680ba","last_reissued_at":"2026-05-18T00:27:35.648281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.648281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel-Data-Free Voice Conversion Using Cycle-Consistent Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SD","eess.AS"],"primary_cat":"stat.ML","authors_text":"Hirokazu Kameoka, Takuhiro Kaneko","submitted_at":"2017-11-30T09:57:19Z","abstract_excerpt":"We propose a parallel-data-free voice-conversion (VC) method that can learn a mapping from source to target speech without relying on parallel data. The proposed method is general purpose, high quality, and parallel-data free and works without any extra data, modules, or alignment procedure. It also avoids over-smoothing, which occurs in many conventional statistical model-based VC methods. Our method, called CycleGAN-VC, uses a cycle-consistent adversarial network (CycleGAN) with gated convolutional neural networks (CNNs) and an identity-mapping loss. A CycleGAN learns forward and inverse map"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11293","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":""},"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":"1711.11293","created_at":"2026-05-18T00:27:35.648381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11293v2","created_at":"2026-05-18T00:27:35.648381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11293","created_at":"2026-05-18T00:27:35.648381+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3WL6HXBINKS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3WL6HXBINKSEN6D","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3WL6HXB","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07769","citing_title":"Hierarchical Sequence to Sequence Voice Conversion with Limited Data","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI","json":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI.json","graph_json":"https://pith.science/api/pith-number/Z3WL6HXBINKSEN6DWRXHJNDGMI/graph.json","events_json":"https://pith.science/api/pith-number/Z3WL6HXBINKSEN6DWRXHJNDGMI/events.json","paper":"https://pith.science/paper/Z3WL6HXB"},"agent_actions":{"view_html":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI","download_json":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI.json","view_paper":"https://pith.science/paper/Z3WL6HXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11293&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3WL6HXBINKSEN6DWRXHJNDGMI/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3WL6HXBINKSEN6DWRXHJNDGMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI/action/storage_attestation","attest_author":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI/action/author_attestation","sign_citation":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI/action/citation_signature","submit_replication":"https://pith.science/pith/Z3WL6HXBINKSEN6DWRXHJNDGMI/action/replication_record"}},"created_at":"2026-05-18T00:27:35.648381+00:00","updated_at":"2026-05-18T00:27:35.648381+00:00"}