{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IA6P6P5TO6GFR2XAV5Q22CQS4G","short_pith_number":"pith:IA6P6P5T","schema_version":"1.0","canonical_sha256":"403cff3fb3778c58eae0af61ad0a12e19504ce611f00e45a9bc1974b9a4166c5","source":{"kind":"arxiv","id":"1703.05203","version":1},"attestation_state":"computed","paper":{"title":"Growing simplified vine copula trees: improving Di{\\ss}mann's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Claudia Czado, Daniel Kraus","submitted_at":"2017-03-15T15:19:14Z","abstract_excerpt":"Vine copulas are pair-copula constructions enabling multivariate dependence modeling in terms of bivariate building blocks. One of the main tasks of fitting a vine copula is the selection of a suitable tree structure. For this the prevalent method is a heuristic called Di{\\ss}mann's algorithm. It sequentially constructs the vine's trees by maximizing dependence at each tree level, where dependence is measured in terms of absolute Kendall's $\\tau$. However, the algorithm disregards any implications of the tree structure on the simplifying assumption that is usually made for vine copulas to keep"},"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":"1703.05203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-15T15:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"5dd28b1a1f8ef7ae6278000a2bd4568749058589518994f4d73e8dbdb6847c47","abstract_canon_sha256":"44301a20ced865c60374525759255f19db4d5f43a6a6603dd8b6952368310e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.066571Z","signature_b64":"UuCSA24eESfTFPGm3WN1uvIKGMTnbz7IWs+CoAD0I3Yn4CwY+aFG8qCoUyIOgnXFe70lfHPTQ7KsySikaEROAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403cff3fb3778c58eae0af61ad0a12e19504ce611f00e45a9bc1974b9a4166c5","last_reissued_at":"2026-05-18T00:48:38.065911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.065911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Growing simplified vine copula trees: improving Di{\\ss}mann's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Claudia Czado, Daniel Kraus","submitted_at":"2017-03-15T15:19:14Z","abstract_excerpt":"Vine copulas are pair-copula constructions enabling multivariate dependence modeling in terms of bivariate building blocks. One of the main tasks of fitting a vine copula is the selection of a suitable tree structure. For this the prevalent method is a heuristic called Di{\\ss}mann's algorithm. It sequentially constructs the vine's trees by maximizing dependence at each tree level, where dependence is measured in terms of absolute Kendall's $\\tau$. However, the algorithm disregards any implications of the tree structure on the simplifying assumption that is usually made for vine copulas to keep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05203","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":""},"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":"1703.05203","created_at":"2026-05-18T00:48:38.066020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05203v1","created_at":"2026-05-18T00:48:38.066020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05203","created_at":"2026-05-18T00:48:38.066020+00:00"},{"alias_kind":"pith_short_12","alias_value":"IA6P6P5TO6GF","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IA6P6P5TO6GFR2XA","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IA6P6P5T","created_at":"2026-05-18T12:31:21.493067+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/IA6P6P5TO6GFR2XAV5Q22CQS4G","json":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G.json","graph_json":"https://pith.science/api/pith-number/IA6P6P5TO6GFR2XAV5Q22CQS4G/graph.json","events_json":"https://pith.science/api/pith-number/IA6P6P5TO6GFR2XAV5Q22CQS4G/events.json","paper":"https://pith.science/paper/IA6P6P5T"},"agent_actions":{"view_html":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G","download_json":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G.json","view_paper":"https://pith.science/paper/IA6P6P5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05203&json=true","fetch_graph":"https://pith.science/api/pith-number/IA6P6P5TO6GFR2XAV5Q22CQS4G/graph.json","fetch_events":"https://pith.science/api/pith-number/IA6P6P5TO6GFR2XAV5Q22CQS4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G/action/storage_attestation","attest_author":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G/action/author_attestation","sign_citation":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G/action/citation_signature","submit_replication":"https://pith.science/pith/IA6P6P5TO6GFR2XAV5Q22CQS4G/action/replication_record"}},"created_at":"2026-05-18T00:48:38.066020+00:00","updated_at":"2026-05-18T00:48:38.066020+00:00"}