{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KCJM4TRTDXU6OIEYMHTUJKYFIK","short_pith_number":"pith:KCJM4TRT","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"},"canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","source":{"kind":"arxiv","id":"1406.1812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1812","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1812v1","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1812","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"KCJM4TRTDXU6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KCJM4TRTDXU6OIEY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KCJM4TRT","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KCJM4TRTDXU6OIEYMHTUJKYFIK","target":"record","payload":{"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"},"canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","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"},"source_kind":"arxiv","source_id":"1406.1812","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-18T02:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBXpbVZctIMCjTrR5q1yCBpX9ZyWBc49cYkEXqPHZbjXKNOWQLBnEZm5pRMwWyZwOX90x+IbFofwlt+7SqJ3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:19:58.117440Z"},"content_sha256":"da8f8e6b9ac3c218e4474175e0a2a2a0657aa4c7620a242d537c36278560bba5","schema_version":"1.0","event_id":"sha256:da8f8e6b9ac3c218e4474175e0a2a2a0657aa4c7620a242d537c36278560bba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KCJM4TRTDXU6OIEYMHTUJKYFIK","target":"graph","payload":{"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"},"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-18T02:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0Gn28wiQYY2mhw6WNFaYx5g2zjqKhsOT6scklY/oIT4GwoxrKnNUfDtjbSsMMGhIVTJoL/rcznClqMl6oUJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:19:58.117782Z"},"content_sha256":"aa471b40d35851c65c11910149c6aaecce931e02d8620e85d83e24e24c98b451","schema_version":"1.0","event_id":"sha256:aa471b40d35851c65c11910149c6aaecce931e02d8620e85d83e24e24c98b451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/bundle.json","state_url":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/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-10T21:19:58Z","links":{"resolver":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK","bundle":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/bundle.json","state":"https://pith.science/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCJM4TRTDXU6OIEYMHTUJKYFIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KCJM4TRTDXU6OIEYMHTUJKYFIK","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":"d45251e4f5790fa57eb71978868f75e20a96e1d1f41fadea29a986e552f4d6e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-06T20:43:17Z","title_canon_sha256":"8e97474393a2b7ba8602db35e0f6d38ff44686ba2c8b9faccd2e41f6166e743c"},"schema_version":"1.0","source":{"id":"1406.1812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1812","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1812v1","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1812","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"KCJM4TRTDXU6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KCJM4TRTDXU6OIEY","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KCJM4TRT","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:aa471b40d35851c65c11910149c6aaecce931e02d8620e85d83e24e24c98b451","target":"graph","created_at":"2026-05-18T02:50:12Z","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":"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","authors_text":"Rina Foygel Barber, Yuancheng Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-06T20:43:17Z","title":"The log-shift penalty for adaptive estimation of multiple Gaussian graphical models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1812","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:da8f8e6b9ac3c218e4474175e0a2a2a0657aa4c7620a242d537c36278560bba5","target":"record","created_at":"2026-05-18T02:50:12Z","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":"d45251e4f5790fa57eb71978868f75e20a96e1d1f41fadea29a986e552f4d6e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-06-06T20:43:17Z","title_canon_sha256":"8e97474393a2b7ba8602db35e0f6d38ff44686ba2c8b9faccd2e41f6166e743c"},"schema_version":"1.0","source":{"id":"1406.1812","kind":"arxiv","version":1}},"canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5092ce4e331de9e7209861e744ab054289f9daeb8b105967a8bbdc9c98e97739","first_computed_at":"2026-05-18T02:50:12.481146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:12.481146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eb3edCyZBWgzp9MTVv6BwD7Bca2Awym2Zxd5rPAbNGX3JJwXZ0fwziEQvXOxexGdBgLGZdtyUWGOML9v0bA9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:12.481788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8f8e6b9ac3c218e4474175e0a2a2a0657aa4c7620a242d537c36278560bba5","sha256:aa471b40d35851c65c11910149c6aaecce931e02d8620e85d83e24e24c98b451"],"state_sha256":"7f6e58f37a8877c22424b9ec7708114e5660bf8118ba91d80f128d1a9614eb21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqD/aMGYSS8FfVsCLy3Av1wNn8JohdehB86OJdWJnVDemEmQzj/Gjq8x5pTNa93eZb8c61eJjp5MaEBy++oOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:19:58.119758Z","bundle_sha256":"f57bc3cb96c0e9d8cacf425b2ad7f0684e10e5a14cf347f045fffc05a4c52d8d"}}