{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MB646F4D2B6QCPGCJI7KWSFHWF","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":"72c7ffeed97f89ad24a6449ac285e9ab33177a9d9bd15c8356fb87ed70f44cd5","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-12-20T17:44:49Z","title_canon_sha256":"5ca3d8d0307051ee7548b8d439e26a0e488276df09e5047190a4e02bfef919eb"},"schema_version":"1.0","source":{"id":"1512.06412","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06412","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06412v3","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06412","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"MB646F4D2B6Q","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB646F4D2B6QCPGC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB646F4D","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:e4db053d199a759b660b0fc87cdb85ae0acf91014c6f6a1f38b7fba7b6fcbb03","target":"graph","created_at":"2026-05-18T00:49: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":"We consider the problem of learning a conditional Gaussian graphical model in the presence of latent variables. Building on recent advances in this field, we suggest a method that decomposes the parameters of a conditional Markov random field into the sum of a sparse and a low-rank matrix. We derive convergence bounds for this estimator and show that it is well-behaved in the high-dimensional regime as well as \"sparsistent\" (i.e. capable of recovering the graph structure). We then show how proximal gradient algorithms and semi-definite programming techniques can be employed to fit the model to","authors_text":"Benjamin Frot, Gil McVean, Luke Jostins","cross_cats":["math.ST","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-12-20T17:44:49Z","title":"Latent variable model selection for Gaussian conditional random fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06412","kind":"arxiv","version":3},"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:0fe36cd6bf7eb23b3c921c02a94eb7a1e5c69f294e07be1c8738ed09bcdc612d","target":"record","created_at":"2026-05-18T00:49: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":"72c7ffeed97f89ad24a6449ac285e9ab33177a9d9bd15c8356fb87ed70f44cd5","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-12-20T17:44:49Z","title_canon_sha256":"5ca3d8d0307051ee7548b8d439e26a0e488276df09e5047190a4e02bfef919eb"},"schema_version":"1.0","source":{"id":"1512.06412","kind":"arxiv","version":3}},"canonical_sha256":"607dcf1783d07d013cc24a3eab48a7b17a217ec1b1a7aec7a1cf01832cada96b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"607dcf1783d07d013cc24a3eab48a7b17a217ec1b1a7aec7a1cf01832cada96b","first_computed_at":"2026-05-18T00:49:34.779856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:34.779856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1Hm6v9ARqHfQCkE0UcgJdlQ5rtrebI5LDAF+DO8FVw68/pZmCS5/dwqiobfmOLXgPkcUX/gOg/FpLV7jN3+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:34.780294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06412","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fe36cd6bf7eb23b3c921c02a94eb7a1e5c69f294e07be1c8738ed09bcdc612d","sha256:e4db053d199a759b660b0fc87cdb85ae0acf91014c6f6a1f38b7fba7b6fcbb03"],"state_sha256":"c2ff3ac28a8b4bae80100176d0dcf3ef536a02de5c9b47e2557acfee5bf087cc"}