{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MB646F4D2B6QCPGCJI7KWSFHWF","short_pith_number":"pith:MB646F4D","schema_version":"1.0","canonical_sha256":"607dcf1783d07d013cc24a3eab48a7b17a217ec1b1a7aec7a1cf01832cada96b","source":{"kind":"arxiv","id":"1512.06412","version":3},"attestation_state":"computed","paper":{"title":"Latent variable model selection for Gaussian conditional random fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ME","authors_text":"Benjamin Frot, Gil McVean, Luke Jostins","submitted_at":"2015-12-20T17:44:49Z","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"},"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":"1512.06412","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-12-20T17:44:49Z","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"title_canon_sha256":"5ca3d8d0307051ee7548b8d439e26a0e488276df09e5047190a4e02bfef919eb","abstract_canon_sha256":"72c7ffeed97f89ad24a6449ac285e9ab33177a9d9bd15c8356fb87ed70f44cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:34.780294Z","signature_b64":"k1Hm6v9ARqHfQCkE0UcgJdlQ5rtrebI5LDAF+DO8FVw68/pZmCS5/dwqiobfmOLXgPkcUX/gOg/FpLV7jN3+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607dcf1783d07d013cc24a3eab48a7b17a217ec1b1a7aec7a1cf01832cada96b","last_reissued_at":"2026-05-18T00:49:34.779856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:34.779856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent variable model selection for Gaussian conditional random fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ME","authors_text":"Benjamin Frot, Gil McVean, Luke Jostins","submitted_at":"2015-12-20T17:44:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06412","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":""},"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":"1512.06412","created_at":"2026-05-18T00:49:34.779914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06412v3","created_at":"2026-05-18T00:49:34.779914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06412","created_at":"2026-05-18T00:49:34.779914+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB646F4D2B6Q","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB646F4D2B6QCPGC","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB646F4D","created_at":"2026-05-18T12:29:32.376354+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/MB646F4D2B6QCPGCJI7KWSFHWF","json":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF.json","graph_json":"https://pith.science/api/pith-number/MB646F4D2B6QCPGCJI7KWSFHWF/graph.json","events_json":"https://pith.science/api/pith-number/MB646F4D2B6QCPGCJI7KWSFHWF/events.json","paper":"https://pith.science/paper/MB646F4D"},"agent_actions":{"view_html":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF","download_json":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF.json","view_paper":"https://pith.science/paper/MB646F4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06412&json=true","fetch_graph":"https://pith.science/api/pith-number/MB646F4D2B6QCPGCJI7KWSFHWF/graph.json","fetch_events":"https://pith.science/api/pith-number/MB646F4D2B6QCPGCJI7KWSFHWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF/action/storage_attestation","attest_author":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF/action/author_attestation","sign_citation":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF/action/citation_signature","submit_replication":"https://pith.science/pith/MB646F4D2B6QCPGCJI7KWSFHWF/action/replication_record"}},"created_at":"2026-05-18T00:49:34.779914+00:00","updated_at":"2026-05-18T00:49:34.779914+00:00"}