{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GMEXT3I5MRSFMMKX2DKUSY75GN","short_pith_number":"pith:GMEXT3I5","schema_version":"1.0","canonical_sha256":"330979ed1d6464563157d0d54963fd33522a7582c22fd2fa276278bbb3e96705","source":{"kind":"arxiv","id":"2508.21340","version":1},"attestation_state":"computed","paper":{"title":"DLGAN : Time Series Synthesis Based on Dual-Layer Generative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Shuhan Liu, Xuan Hou, Yaohui Chu, Yining Wang, Yue Zhang, Zhaohui Peng","submitted_at":"2025-08-29T05:58:36Z","abstract_excerpt":"Time series synthesis is an effective approach to ensuring the secure circulation of time series data. Existing time series synthesis methods typically perform temporal modeling based on random sequences to generate target sequences, which often struggle to ensure the temporal dependencies in the generated time series. Additionally, directly modeling temporal features on random sequences makes it challenging to accurately capture the feature information of the original time series. To address the above issues, we propose a simple but effective generative model \\textbf{D}ual-\\textbf{L}ayer \\tex"},"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":"2508.21340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-29T05:58:36Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bf58d2aa4f881927e2ede3d3fa42eaa19cd1cd49958853936dbb94307f2d3f87","abstract_canon_sha256":"b92e9f90306e251c8a1827c091e500f4dd51b67bd7c9259e42081ae91a837c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:32.993438Z","signature_b64":"cXWpaIFw05vzsqnlc2E2vEyANjcI5cuNxzfWp53S7ABMOybEpR7tHfhlD2d1vkMaK+wcEqJI21wpTjmlmrQpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330979ed1d6464563157d0d54963fd33522a7582c22fd2fa276278bbb3e96705","last_reissued_at":"2026-07-05T12:01:32.992924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:32.992924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DLGAN : Time Series Synthesis Based on Dual-Layer Generative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Shuhan Liu, Xuan Hou, Yaohui Chu, Yining Wang, Yue Zhang, Zhaohui Peng","submitted_at":"2025-08-29T05:58:36Z","abstract_excerpt":"Time series synthesis is an effective approach to ensuring the secure circulation of time series data. Existing time series synthesis methods typically perform temporal modeling based on random sequences to generate target sequences, which often struggle to ensure the temporal dependencies in the generated time series. Additionally, directly modeling temporal features on random sequences makes it challenging to accurately capture the feature information of the original time series. To address the above issues, we propose a simple but effective generative model \\textbf{D}ual-\\textbf{L}ayer \\tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21340","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/2508.21340/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":"2508.21340","created_at":"2026-07-05T12:01:32.992983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21340v1","created_at":"2026-07-05T12:01:32.992983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21340","created_at":"2026-07-05T12:01:32.992983+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMEXT3I5MRSF","created_at":"2026-07-05T12:01:32.992983+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMEXT3I5MRSFMMKX","created_at":"2026-07-05T12:01:32.992983+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMEXT3I5","created_at":"2026-07-05T12:01:32.992983+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07569","citing_title":"TriHead-GAN: A Generative Adversarial Network with Triple-Head Discriminator for Carbon Emission Time Series Generation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN","json":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN.json","graph_json":"https://pith.science/api/pith-number/GMEXT3I5MRSFMMKX2DKUSY75GN/graph.json","events_json":"https://pith.science/api/pith-number/GMEXT3I5MRSFMMKX2DKUSY75GN/events.json","paper":"https://pith.science/paper/GMEXT3I5"},"agent_actions":{"view_html":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN","download_json":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN.json","view_paper":"https://pith.science/paper/GMEXT3I5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21340&json=true","fetch_graph":"https://pith.science/api/pith-number/GMEXT3I5MRSFMMKX2DKUSY75GN/graph.json","fetch_events":"https://pith.science/api/pith-number/GMEXT3I5MRSFMMKX2DKUSY75GN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN/action/storage_attestation","attest_author":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN/action/author_attestation","sign_citation":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN/action/citation_signature","submit_replication":"https://pith.science/pith/GMEXT3I5MRSFMMKX2DKUSY75GN/action/replication_record"}},"created_at":"2026-07-05T12:01:32.992983+00:00","updated_at":"2026-07-05T12:01:32.992983+00:00"}