{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KCJM4TRTDXU6OIEYMHTUJKYFIK","short_pith_number":"pith:KCJM4TRT","schema_version":"1.0","canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","source":{"kind":"arxiv","id":"1406.1812","version":1},"attestation_state":"computed","paper":{"title":"The log-shift penalty for adaptive estimation of multiple Gaussian graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Rina Foygel Barber, Yuancheng Zhu","submitted_at":"2014-06-06T20:43:17Z","abstract_excerpt":"Sparse Gaussian graphical models characterize sparse dependence relationships between random variables in a network. To estimate multiple related Gaussian graphical models on the same set of variables, we formulate a hierarchical model, which leads to an optimization problem with a nonconvex log-shift penalty function. We show that under mild conditions the optimization problem is convex despite the inclusion of a nonconvex penalty, and derive an efficient optimization algorithm. Experiments on both synthetic and real data show that the proposed method is able to achieve good selection and est"},"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":"1406.1812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-06T20:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"8e97474393a2b7ba8602db35e0f6d38ff44686ba2c8b9faccd2e41f6166e743c","abstract_canon_sha256":"d45251e4f5790fa57eb71978868f75e20a96e1d1f41fadea29a986e552f4d6e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:12.481788Z","signature_b64":"eb3edCyZBWgzp9MTVv6BwD7Bca2Awym2Zxd5rPAbNGX3JJwXZ0fwziEQvXOxexGdBgLGZdtyUWGOML9v0bA9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","last_reissued_at":"2026-05-18T02:50:12.481146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:12.481146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The log-shift penalty for adaptive estimation of multiple Gaussian graphical models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Rina Foygel Barber, Yuancheng Zhu","submitted_at":"2014-06-06T20:43:17Z","abstract_excerpt":"Sparse Gaussian graphical models characterize sparse dependence relationships between random variables in a network. To estimate multiple related Gaussian graphical models on the same set of variables, we formulate a hierarchical model, which leads to an optimization problem with a nonconvex log-shift penalty function. We show that under mild conditions the optimization problem is convex despite the inclusion of a nonconvex penalty, and derive an efficient optimization algorithm. Experiments on both synthetic and real data show that the proposed method is able to achieve good selection and est"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1812","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":"1406.1812","created_at":"2026-05-18T02:50:12.481271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1812v1","created_at":"2026-05-18T02:50:12.481271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1812","created_at":"2026-05-18T02:50:12.481271+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCJM4TRTDXU6","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCJM4TRTDXU6OIEY","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCJM4TRT","created_at":"2026-05-18T12:28:35.611951+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/KCJM4TRTDXU6OIEYMHTUJKYFIK","json":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK.json","graph_json":"https://pith.science/api/pith-number/KCJM4TRTDXU6OIEYMHTUJKYFIK/graph.json","events_json":"https://pith.science/api/pith-number/KCJM4TRTDXU6OIEYMHTUJKYFIK/events.json","paper":"https://pith.science/paper/KCJM4TRT"},"agent_actions":{"view_html":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK","download_json":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK.json","view_paper":"https://pith.science/paper/KCJM4TRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1812&json=true","fetch_graph":"https://pith.science/api/pith-number/KCJM4TRTDXU6OIEYMHTUJKYFIK/graph.json","fetch_events":"https://pith.science/api/pith-number/KCJM4TRTDXU6OIEYMHTUJKYFIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/action/storage_attestation","attest_author":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/action/author_attestation","sign_citation":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/action/citation_signature","submit_replication":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/action/replication_record"}},"created_at":"2026-05-18T02:50:12.481271+00:00","updated_at":"2026-05-18T02:50:12.481271+00:00"}