{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZMWFJ2YRU27KEHVYSOS2X5E5QK","short_pith_number":"pith:ZMWFJ2YR","schema_version":"1.0","canonical_sha256":"cb2c54eb11a6bea21eb893a5abf49d82bd217fb1f5d125f9449c7f1097018271","source":{"kind":"arxiv","id":"1806.02169","version":2},"attestation_state":"computed","paper":{"title":"StarGAN-VC: Non-parallel many-to-many voice conversion with star generative adversarial networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.AS","stat.ML"],"primary_cat":"cs.SD","authors_text":"Hirokazu Kameoka, Kou Tanaka, Nobukatsu Hojo, Takuhiro Kaneko","submitted_at":"2018-06-06T13:24:23Z","abstract_excerpt":"This paper proposes a method that allows non-parallel many-to-many voice conversion (VC) by using a variant of a generative adversarial network (GAN) called StarGAN. Our method, which we call StarGAN-VC, is noteworthy in that it (1) requires no parallel utterances, transcriptions, or time alignment procedures for speech generator training, (2) simultaneously learns many-to-many mappings across different attribute domains using a single generator network, (3) is able to generate converted speech signals quickly enough to allow real-time implementations and (4) requires only several minutes of t"},"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":"1806.02169","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2018-06-06T13:24:23Z","cross_cats_sorted":["cs.LG","eess.AS","stat.ML"],"title_canon_sha256":"076e7b0c6de42be43b4849c40078d2fc19fd58b6fddf64f8dc125f0e0cbf1dae","abstract_canon_sha256":"8fc1a851a6edd9f6963521c6d4583181eb841e153bab502545ec82f9c0a38101"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:03.617897Z","signature_b64":"FHDrrh8xn6Z8wNRRjY6oD9AJz6hCf1/dXL6P7wCrjnEoSmSEVsTcg4uXO8tovH3iRXUKYGm1hXxcmkauq+p6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2c54eb11a6bea21eb893a5abf49d82bd217fb1f5d125f9449c7f1097018271","last_reissued_at":"2026-05-18T00:12:03.617381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:03.617381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StarGAN-VC: Non-parallel many-to-many voice conversion with star generative adversarial networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.AS","stat.ML"],"primary_cat":"cs.SD","authors_text":"Hirokazu Kameoka, Kou Tanaka, Nobukatsu Hojo, Takuhiro Kaneko","submitted_at":"2018-06-06T13:24:23Z","abstract_excerpt":"This paper proposes a method that allows non-parallel many-to-many voice conversion (VC) by using a variant of a generative adversarial network (GAN) called StarGAN. Our method, which we call StarGAN-VC, is noteworthy in that it (1) requires no parallel utterances, transcriptions, or time alignment procedures for speech generator training, (2) simultaneously learns many-to-many mappings across different attribute domains using a single generator network, (3) is able to generate converted speech signals quickly enough to allow real-time implementations and (4) requires only several minutes of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02169","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":"1806.02169","created_at":"2026-05-18T00:12:03.617459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02169v2","created_at":"2026-05-18T00:12:03.617459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02169","created_at":"2026-05-18T00:12:03.617459+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMWFJ2YRU27K","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMWFJ2YRU27KEHVY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMWFJ2YR","created_at":"2026-05-18T12:33:07.085635+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":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK","json":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK.json","graph_json":"https://pith.science/api/pith-number/ZMWFJ2YRU27KEHVYSOS2X5E5QK/graph.json","events_json":"https://pith.science/api/pith-number/ZMWFJ2YRU27KEHVYSOS2X5E5QK/events.json","paper":"https://pith.science/paper/ZMWFJ2YR"},"agent_actions":{"view_html":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK","download_json":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK.json","view_paper":"https://pith.science/paper/ZMWFJ2YR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02169&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMWFJ2YRU27KEHVYSOS2X5E5QK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMWFJ2YRU27KEHVYSOS2X5E5QK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK/action/storage_attestation","attest_author":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK/action/author_attestation","sign_citation":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK/action/citation_signature","submit_replication":"https://pith.science/pith/ZMWFJ2YRU27KEHVYSOS2X5E5QK/action/replication_record"}},"created_at":"2026-05-18T00:12:03.617459+00:00","updated_at":"2026-05-18T00:12:03.617459+00:00"}