{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QBZBPBZVO4S36EDSOKDMFXVLUR","short_pith_number":"pith:QBZBPBZV","schema_version":"1.0","canonical_sha256":"80721787357725bf10727286c2deaba47dc810b9f4afb98e1090423f6deb62a6","source":{"kind":"arxiv","id":"2107.11098","version":1},"attestation_state":"computed","paper":{"title":"Generative adversarial networks in time series: A survey and taxonomy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Eoin Brophy, Qi She, Tomas Ward, Zhengwei Wang","submitted_at":"2021-07-23T09:38:51Z","abstract_excerpt":"Generative adversarial networks (GANs) studies have grown exponentially in the past few years. Their impact has been seen mainly in the computer vision field with realistic image and video manipulation, especially generation, making significant advancements. While these computer vision advances have garnered much attention, GAN applications have diversified across disciplines such as time series and sequence generation. As a relatively new niche for GANs, fieldwork is ongoing to develop high quality, diverse and private time series data. In this paper, we review GAN variants designed for time "},"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":"2107.11098","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-23T09:38:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"40a2e1c4d949aeb97734a609a6512b86c2000cb7a2a599cfebc7d527866492af","abstract_canon_sha256":"c01e914df60d6c15c2af5144015a11d869f567e6b1b5039ae38b875abbbfc733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:13.350363Z","signature_b64":"5AJl62KM5GT/UdX4NfNYHInIxcf76mbPSkDYk6Uq+WXmMGTWyFeOtqkTb7lSTh8FdO+eq8YtIpV3iXkgnvVVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80721787357725bf10727286c2deaba47dc810b9f4afb98e1090423f6deb62a6","last_reissued_at":"2026-07-05T03:00:13.349895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:13.349895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative adversarial networks in time series: A survey and taxonomy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Eoin Brophy, Qi She, Tomas Ward, Zhengwei Wang","submitted_at":"2021-07-23T09:38:51Z","abstract_excerpt":"Generative adversarial networks (GANs) studies have grown exponentially in the past few years. Their impact has been seen mainly in the computer vision field with realistic image and video manipulation, especially generation, making significant advancements. While these computer vision advances have garnered much attention, GAN applications have diversified across disciplines such as time series and sequence generation. As a relatively new niche for GANs, fieldwork is ongoing to develop high quality, diverse and private time series data. In this paper, we review GAN variants designed for time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11098","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.11098/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":"2107.11098","created_at":"2026-07-05T03:00:13.349956+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.11098v1","created_at":"2026-07-05T03:00:13.349956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11098","created_at":"2026-07-05T03:00:13.349956+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBZBPBZVO4S3","created_at":"2026-07-05T03:00:13.349956+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBZBPBZVO4S36EDS","created_at":"2026-07-05T03:00:13.349956+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBZBPBZV","created_at":"2026-07-05T03:00:13.349956+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29556","citing_title":"Persona-Trained Monte Carlo: Estimating Market-Outcome Distributions via Swarms of Persona-Conditioned Neural Policy Bots in a Limit Order Book","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2505.14202","citing_title":"MSDformer: Multi-scale Discrete Transformer For Time Series Generation","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR","json":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR.json","graph_json":"https://pith.science/api/pith-number/QBZBPBZVO4S36EDSOKDMFXVLUR/graph.json","events_json":"https://pith.science/api/pith-number/QBZBPBZVO4S36EDSOKDMFXVLUR/events.json","paper":"https://pith.science/paper/QBZBPBZV"},"agent_actions":{"view_html":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR","download_json":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR.json","view_paper":"https://pith.science/paper/QBZBPBZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.11098&json=true","fetch_graph":"https://pith.science/api/pith-number/QBZBPBZVO4S36EDSOKDMFXVLUR/graph.json","fetch_events":"https://pith.science/api/pith-number/QBZBPBZVO4S36EDSOKDMFXVLUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR/action/storage_attestation","attest_author":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR/action/author_attestation","sign_citation":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR/action/citation_signature","submit_replication":"https://pith.science/pith/QBZBPBZVO4S36EDSOKDMFXVLUR/action/replication_record"}},"created_at":"2026-07-05T03:00:13.349956+00:00","updated_at":"2026-07-05T03:00:13.349956+00:00"}