{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WM7N7TSFUIBHFWANMPPW6266SO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ad8ba88fe2345c1f4239f9469db52e9f373f4bd92a4cc22b3ec6626bbe07d5dd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-04T05:34:26Z","title_canon_sha256":"ca1277dc242b47e5bcec0f69dc9f49addcc602b96fc7c0567ce215835e6ecfc1"},"schema_version":"1.0","source":{"id":"1812.01226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01226","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01226v1","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01226","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"WM7N7TSFUIBH","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WM7N7TSFUIBHFWAN","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WM7N7TSF","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:5af5ddab10dab15d44b7f817a6488abb1a4da14a023fb951e788faec240885d1","target":"graph","created_at":"2026-05-17T23:59:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A vine copula model is a flexible high-dimensional dependence model which uses only bivariate building blocks. However, the number of possible configurations of a vine copula grows exponentially as the number of variables increases, making model selection a major challenge in development. In this work, we formulate a vine structure learning problem with both vector and reinforcement learning representation. We use neural network to find the embeddings for the best possible vine model and generate a structure. Throughout experiments on synthetic and real-world datasets, we show that our propose","authors_text":"Alfredo Cuesta-Infante, Kalyan Veeramachaneni, Yi Sun","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-04T05:34:26Z","title":"Learning Vine Copula Models For Synthetic Data Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01226","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d8cc84e8fe9fdf0b98b4ec853cb12fa640481f12412d47c7d1d7c24c71706923","target":"record","created_at":"2026-05-17T23:59:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ad8ba88fe2345c1f4239f9469db52e9f373f4bd92a4cc22b3ec6626bbe07d5dd","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-04T05:34:26Z","title_canon_sha256":"ca1277dc242b47e5bcec0f69dc9f49addcc602b96fc7c0567ce215835e6ecfc1"},"schema_version":"1.0","source":{"id":"1812.01226","kind":"arxiv","version":1}},"canonical_sha256":"b33edfce45a20272d80d63df6f6bde93b148d530d86b75c6d564f2d178a0511c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b33edfce45a20272d80d63df6f6bde93b148d530d86b75c6d564f2d178a0511c","first_computed_at":"2026-05-17T23:59:13.052011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:13.052011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T1aliNBhhvu9qD45286MMkLtVtQgXt8HPh1qcO5CsGvEmMD1oBNZSQ7D+lclRD8+yxxX0AifIDmI2iGNsYRmDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:13.052514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8cc84e8fe9fdf0b98b4ec853cb12fa640481f12412d47c7d1d7c24c71706923","sha256:5af5ddab10dab15d44b7f817a6488abb1a4da14a023fb951e788faec240885d1"],"state_sha256":"c233502879f83e5f60adaaabe47e4b01ff8a60fbb7bc228b69a197ecbf1d89e9"}