{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3EPEPLAOLDQY6ZGLRFNAYC3T7R","short_pith_number":"pith:3EPEPLAO","schema_version":"1.0","canonical_sha256":"d91e47ac0e58e18f64cb895a0c0b73fc641f28e1c6ed513ca09949a1f9b26314","source":{"kind":"arxiv","id":"2301.08518","version":1},"attestation_state":"computed","paper":{"title":"Regular Time-series Generation using SGM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haksoo Lim, Minjung Kim, Noseong Park, Sewon Park","submitted_at":"2023-01-20T11:34:12Z","abstract_excerpt":"Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and classification are popular research topics in the field of machine learning. SGMs are also known for outperforming other generative models. As a result, we apply SGMs to synthesize time-series data by learning conditional score functions. We propose a conditional score network for the time-series generation domain. Furthermore, we also derive the loss function between "},"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":"2301.08518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-20T11:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"80d61b1cebdd34da9775603b754ce27bce23cac125739072cf122c1064de57fc","abstract_canon_sha256":"8fa890e40c8f61db384495070082c610ee2126437732d5bc0dcf469265d30f40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:36.940235Z","signature_b64":"GyvguJxLtC6Iw/vXhwto6Xj3AmPLsZreWwLCFcSauiIqxq6PPrvEPVoLXbQBAe3iEHZ0rg4xqEyJZ0v+AZUeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d91e47ac0e58e18f64cb895a0c0b73fc641f28e1c6ed513ca09949a1f9b26314","last_reissued_at":"2026-07-05T05:34:36.939704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:36.939704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Time-series Generation using SGM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haksoo Lim, Minjung Kim, Noseong Park, Sewon Park","submitted_at":"2023-01-20T11:34:12Z","abstract_excerpt":"Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and classification are popular research topics in the field of machine learning. SGMs are also known for outperforming other generative models. As a result, we apply SGMs to synthesize time-series data by learning conditional score functions. We propose a conditional score network for the time-series generation domain. Furthermore, we also derive the loss function between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08518","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/2301.08518/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":"2301.08518","created_at":"2026-07-05T05:34:36.939761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08518v1","created_at":"2026-07-05T05:34:36.939761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08518","created_at":"2026-07-05T05:34:36.939761+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EPEPLAOLDQY","created_at":"2026-07-05T05:34:36.939761+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EPEPLAOLDQY6ZGL","created_at":"2026-07-05T05:34:36.939761+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EPEPLAO","created_at":"2026-07-05T05:34:36.939761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06007","citing_title":"Diffusion Models for Adaptive Sequential Data Generation","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27113","citing_title":"High-Quality Synthetic Financial Time-Series using a GAN-Diffusion Framework","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R","json":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R.json","graph_json":"https://pith.science/api/pith-number/3EPEPLAOLDQY6ZGLRFNAYC3T7R/graph.json","events_json":"https://pith.science/api/pith-number/3EPEPLAOLDQY6ZGLRFNAYC3T7R/events.json","paper":"https://pith.science/paper/3EPEPLAO"},"agent_actions":{"view_html":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R","download_json":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R.json","view_paper":"https://pith.science/paper/3EPEPLAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08518&json=true","fetch_graph":"https://pith.science/api/pith-number/3EPEPLAOLDQY6ZGLRFNAYC3T7R/graph.json","fetch_events":"https://pith.science/api/pith-number/3EPEPLAOLDQY6ZGLRFNAYC3T7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R/action/storage_attestation","attest_author":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R/action/author_attestation","sign_citation":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R/action/citation_signature","submit_replication":"https://pith.science/pith/3EPEPLAOLDQY6ZGLRFNAYC3T7R/action/replication_record"}},"created_at":"2026-07-05T05:34:36.939761+00:00","updated_at":"2026-07-05T05:34:36.939761+00:00"}