{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P6X2AZVC7OBBVQ2HDFH3SV5LRJ","short_pith_number":"pith:P6X2AZVC","canonical_record":{"source":{"id":"1401.5264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-01-21T11:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"6be2c9d7c6402155124d9f6b5c81fc25f96e09fb6b2fd174186607ad00e9eae5","abstract_canon_sha256":"98e3b001e87da0b8a5abe59514458c46941a5f5ddb028c6ab1d82e4f781b6ada"},"schema_version":"1.0"},"canonical_sha256":"7fafa066a2fb821ac347194fb957ab8a4fb031066f0068ea43cec046c2e7d025","source":{"kind":"arxiv","id":"1401.5264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5264","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5264v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5264","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"P6X2AZVC7OBB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6X2AZVC7OBBVQ2H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6X2AZVC","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P6X2AZVC7OBBVQ2HDFH3SV5LRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-01-21T11:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"6be2c9d7c6402155124d9f6b5c81fc25f96e09fb6b2fd174186607ad00e9eae5","abstract_canon_sha256":"98e3b001e87da0b8a5abe59514458c46941a5f5ddb028c6ab1d82e4f781b6ada"},"schema_version":"1.0"},"canonical_sha256":"7fafa066a2fb821ac347194fb957ab8a4fb031066f0068ea43cec046c2e7d025","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.339480Z","signature_b64":"Pa96GhS/m4/ZdPBmnA5hSGPNxhk+l9aues1nefyJ5H2gxOmu5MJUSJZPeXgH72SC/AEYX/6vtH7mrH0zy/rXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fafa066a2fb821ac347194fb957ab8a4fb031066f0068ea43cec046c2e7d025","last_reissued_at":"2026-05-18T03:01:34.338955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.338955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5264","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwIl/n3UorIrIxqxr8bV+RjcZMWUjmV5Sy99oBjvM1YA06xv0R1SwXsGq7NEdow6atQgi9a8z4KQRnfLxb5SCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:45:41.109976Z"},"content_sha256":"1f014cd8ea9f510907fd1768a33f89dd63fa77241a3af441589f432e803a72d7","schema_version":"1.0","event_id":"sha256:1f014cd8ea9f510907fd1768a33f89dd63fa77241a3af441589f432e803a72d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P6X2AZVC7OBBVQ2HDFH3SV5LRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Penalized EM algorithm and copula skeptic graphical models for inferring networks for mixed variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ernst Wit, Fentaw Abegaz","submitted_at":"2014-01-21T11:05:51Z","abstract_excerpt":"In this article, we consider the problem of reconstructing networks for continuous, binary, count and discrete ordinal variables by estimating sparse precision matrix in Gaussian copula graphical models. We propose two approaches: $\\ell_1$ penalized extended rank likelihood with Monte Carlo Expectation-Maximization algorithm (copula EM glasso) and copula skeptic with pair-wise copula estimation for copula Gaussian graphical models. The proposed approaches help to infer networks arising from nonnormal and mixed variables. We demonstrate the performance of our methods through simulation studies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5264","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDZwMkGLNFDoC+TOFUt8kN5KJx9LmRY9oAJE3nDKKd5L/opywn3JArO2sUB8Btd8wgCd26z5bv+JjmStKUQoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:45:41.110658Z"},"content_sha256":"7fba8d62b805017c77ada5f95eb6add7c731b6d4d454e0a1e51ecb7f72bc765e","schema_version":"1.0","event_id":"sha256:7fba8d62b805017c77ada5f95eb6add7c731b6d4d454e0a1e51ecb7f72bc765e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/bundle.json","state_url":"https://pith.science/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T09:45:41Z","links":{"resolver":"https://pith.science/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ","bundle":"https://pith.science/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/bundle.json","state":"https://pith.science/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6X2AZVC7OBBVQ2HDFH3SV5LRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P6X2AZVC7OBBVQ2HDFH3SV5LRJ","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":"98e3b001e87da0b8a5abe59514458c46941a5f5ddb028c6ab1d82e4f781b6ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-01-21T11:05:51Z","title_canon_sha256":"6be2c9d7c6402155124d9f6b5c81fc25f96e09fb6b2fd174186607ad00e9eae5"},"schema_version":"1.0","source":{"id":"1401.5264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5264","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5264v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5264","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"P6X2AZVC7OBB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P6X2AZVC7OBBVQ2H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P6X2AZVC","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:7fba8d62b805017c77ada5f95eb6add7c731b6d4d454e0a1e51ecb7f72bc765e","target":"graph","created_at":"2026-05-18T03:01:34Z","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":"In this article, we consider the problem of reconstructing networks for continuous, binary, count and discrete ordinal variables by estimating sparse precision matrix in Gaussian copula graphical models. We propose two approaches: $\\ell_1$ penalized extended rank likelihood with Monte Carlo Expectation-Maximization algorithm (copula EM glasso) and copula skeptic with pair-wise copula estimation for copula Gaussian graphical models. The proposed approaches help to infer networks arising from nonnormal and mixed variables. We demonstrate the performance of our methods through simulation studies ","authors_text":"Ernst Wit, Fentaw Abegaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-01-21T11:05:51Z","title":"Penalized EM algorithm and copula skeptic graphical models for inferring networks for mixed variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5264","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:1f014cd8ea9f510907fd1768a33f89dd63fa77241a3af441589f432e803a72d7","target":"record","created_at":"2026-05-18T03:01:34Z","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":"98e3b001e87da0b8a5abe59514458c46941a5f5ddb028c6ab1d82e4f781b6ada","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-01-21T11:05:51Z","title_canon_sha256":"6be2c9d7c6402155124d9f6b5c81fc25f96e09fb6b2fd174186607ad00e9eae5"},"schema_version":"1.0","source":{"id":"1401.5264","kind":"arxiv","version":1}},"canonical_sha256":"7fafa066a2fb821ac347194fb957ab8a4fb031066f0068ea43cec046c2e7d025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fafa066a2fb821ac347194fb957ab8a4fb031066f0068ea43cec046c2e7d025","first_computed_at":"2026-05-18T03:01:34.338955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.338955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pa96GhS/m4/ZdPBmnA5hSGPNxhk+l9aues1nefyJ5H2gxOmu5MJUSJZPeXgH72SC/AEYX/6vtH7mrH0zy/rXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.339480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f014cd8ea9f510907fd1768a33f89dd63fa77241a3af441589f432e803a72d7","sha256:7fba8d62b805017c77ada5f95eb6add7c731b6d4d454e0a1e51ecb7f72bc765e"],"state_sha256":"cce11e4f978f544547296c103a0e3b616e7de6b794d920861e77d1f8ffd21e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UueRndWtMKKNXLzveBBPgoL6hj9WDTzim5vIH7s5cO+q6PyKoyo6NZoDy/K7lm+zqIRqMQMUABE1Zrmjw0GBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:45:41.114376Z","bundle_sha256":"d528b8b42367a845bcb619d494e977c0a6395c00d02970b4e815d40230cd042b"}}