{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EDNDO6S3SUSN43AZIF2Z7CJYZP","short_pith_number":"pith:EDNDO6S3","schema_version":"1.0","canonical_sha256":"20da377a5b9524de6c1941759f8938cbfc78310937010fefe54f4966f58fa448","source":{"kind":"arxiv","id":"2510.20035","version":3},"attestation_state":"computed","paper":{"title":"Throwing Vines at the Wall: Structure Learning via Random Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Thibault Vatter, Thomas Nagler","submitted_at":"2025-10-22T21:26:18Z","abstract_excerpt":"Vine copulas offer flexible multivariate dependence modeling and have become widely used in machine learning. Yet, structure learning remains a key challenge. Early heuristics, such as Dissmann's greedy algorithm, are still considered the gold standard but are often suboptimal. We propose random search algorithms and a statistical framework based on model confidence sets, to improve structure selection, provide theoretical guarantees on selection probabilities and excess risk, as well as serve as a foundation for ensembling. Empirical results on real-world data sets show that our methods consi"},"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":"2510.20035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-10-22T21:26:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"722d9d145226b9affe78da8a885cc3e9d640ce5908c3beb8a07855c6d00d0a3f","abstract_canon_sha256":"4c6160182e8d547cc26c0c210fd6e8b2c171ea0c18734bda5107ba771523ac2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:00.592656Z","signature_b64":"6ZyV4W9jOSFX/0e6sDNTCzsR+/tqmnwF6LbfVfTjHGIFb4a4FS5H1OYS+Ht+LKV05LoOK6cYi+5BHccWQoIZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20da377a5b9524de6c1941759f8938cbfc78310937010fefe54f4966f58fa448","last_reissued_at":"2026-05-20T01:05:00.591768Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:00.591768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throwing Vines at the Wall: Structure Learning via Random Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Thibault Vatter, Thomas Nagler","submitted_at":"2025-10-22T21:26:18Z","abstract_excerpt":"Vine copulas offer flexible multivariate dependence modeling and have become widely used in machine learning. Yet, structure learning remains a key challenge. Early heuristics, such as Dissmann's greedy algorithm, are still considered the gold standard but are often suboptimal. We propose random search algorithms and a statistical framework based on model confidence sets, to improve structure selection, provide theoretical guarantees on selection probabilities and excess risk, as well as serve as a foundation for ensembling. Empirical results on real-world data sets show that our methods consi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.20035","kind":"arxiv","version":3},"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/2510.20035/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":"2510.20035","created_at":"2026-05-20T01:05:00.591895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.20035v3","created_at":"2026-05-20T01:05:00.591895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.20035","created_at":"2026-05-20T01:05:00.591895+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDNDO6S3SUSN","created_at":"2026-05-20T01:05:00.591895+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDNDO6S3SUSN43AZ","created_at":"2026-05-20T01:05:00.591895+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDNDO6S3","created_at":"2026-05-20T01:05:00.591895+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/EDNDO6S3SUSN43AZIF2Z7CJYZP","json":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP.json","graph_json":"https://pith.science/api/pith-number/EDNDO6S3SUSN43AZIF2Z7CJYZP/graph.json","events_json":"https://pith.science/api/pith-number/EDNDO6S3SUSN43AZIF2Z7CJYZP/events.json","paper":"https://pith.science/paper/EDNDO6S3"},"agent_actions":{"view_html":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP","download_json":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP.json","view_paper":"https://pith.science/paper/EDNDO6S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.20035&json=true","fetch_graph":"https://pith.science/api/pith-number/EDNDO6S3SUSN43AZIF2Z7CJYZP/graph.json","fetch_events":"https://pith.science/api/pith-number/EDNDO6S3SUSN43AZIF2Z7CJYZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP/action/storage_attestation","attest_author":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP/action/author_attestation","sign_citation":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP/action/citation_signature","submit_replication":"https://pith.science/pith/EDNDO6S3SUSN43AZIF2Z7CJYZP/action/replication_record"}},"created_at":"2026-05-20T01:05:00.591895+00:00","updated_at":"2026-05-20T01:05:00.591895+00:00"}