{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q3BST46Y7D7VIECLGUNK4SKMCD","short_pith_number":"pith:Q3BST46Y","schema_version":"1.0","canonical_sha256":"86c329f3d8f8ff54104b351aae494c10f28bdd39f85760d82a29077a485317e7","source":{"kind":"arxiv","id":"2212.04532","version":2},"attestation_state":"computed","paper":{"title":"Framewise WaveGAN: High Speed Adversarial Vocoder in Time Domain with Very Low Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SD","eess.SP"],"primary_cat":"eess.AS","authors_text":"Ahmed Mustafa, Jan B\\\"uthe, Jean-Marc Valin, Mike Goodwin, Paris Smaragdis","submitted_at":"2022-12-08T19:38:34Z","abstract_excerpt":"GAN vocoders are currently one of the state-of-the-art methods for building high-quality neural waveform generative models. However, most of their architectures require dozens of billion floating-point operations per second (GFLOPS) to generate speech waveforms in samplewise manner. This makes GAN vocoders still challenging to run on normal CPUs without accelerators or parallel computers. In this work, we propose a new architecture for GAN vocoders that mainly depends on recurrent and fully-connected networks to directly generate the time domain signal in framewise manner. This results in cons"},"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":"2212.04532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.AS","submitted_at":"2022-12-08T19:38:34Z","cross_cats_sorted":["cs.LG","cs.SD","eess.SP"],"title_canon_sha256":"bf10c7a4fe1a7dbfdf90e2dbb6e0aa901ca28730f2117f9fdfeedd85f30b855a","abstract_canon_sha256":"7b70e3461dedb1c17d7fd8860652f4bcc6d278be27b997a7ab8183443fefc63b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:20.432784Z","signature_b64":"0/Os4rvc981pnSfnc/G0Rz5/IaIE0iFFia+/PbU0/6P5Y290q0VbclRoDYmxrDsLEzEt9iZNiQhHG3cmDA7IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c329f3d8f8ff54104b351aae494c10f28bdd39f85760d82a29077a485317e7","last_reissued_at":"2026-07-05T05:47:20.432232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:20.432232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Framewise WaveGAN: High Speed Adversarial Vocoder in Time Domain with Very Low Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SD","eess.SP"],"primary_cat":"eess.AS","authors_text":"Ahmed Mustafa, Jan B\\\"uthe, Jean-Marc Valin, Mike Goodwin, Paris Smaragdis","submitted_at":"2022-12-08T19:38:34Z","abstract_excerpt":"GAN vocoders are currently one of the state-of-the-art methods for building high-quality neural waveform generative models. However, most of their architectures require dozens of billion floating-point operations per second (GFLOPS) to generate speech waveforms in samplewise manner. This makes GAN vocoders still challenging to run on normal CPUs without accelerators or parallel computers. In this work, we propose a new architecture for GAN vocoders that mainly depends on recurrent and fully-connected networks to directly generate the time domain signal in framewise manner. This results in cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04532","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.04532/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":"2212.04532","created_at":"2026-07-05T05:47:20.432300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.04532v2","created_at":"2026-07-05T05:47:20.432300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04532","created_at":"2026-07-05T05:47:20.432300+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3BST46Y7D7V","created_at":"2026-07-05T05:47:20.432300+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3BST46Y7D7VIECL","created_at":"2026-07-05T05:47:20.432300+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3BST46Y","created_at":"2026-07-05T05:47:20.432300+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/Q3BST46Y7D7VIECLGUNK4SKMCD","json":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD.json","graph_json":"https://pith.science/api/pith-number/Q3BST46Y7D7VIECLGUNK4SKMCD/graph.json","events_json":"https://pith.science/api/pith-number/Q3BST46Y7D7VIECLGUNK4SKMCD/events.json","paper":"https://pith.science/paper/Q3BST46Y"},"agent_actions":{"view_html":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD","download_json":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD.json","view_paper":"https://pith.science/paper/Q3BST46Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.04532&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3BST46Y7D7VIECLGUNK4SKMCD/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3BST46Y7D7VIECLGUNK4SKMCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD/action/storage_attestation","attest_author":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD/action/author_attestation","sign_citation":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD/action/citation_signature","submit_replication":"https://pith.science/pith/Q3BST46Y7D7VIECLGUNK4SKMCD/action/replication_record"}},"created_at":"2026-07-05T05:47:20.432300+00:00","updated_at":"2026-07-05T05:47:20.432300+00:00"}