{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UYL6K5KE25MH55BX3YA5HGI4ER","short_pith_number":"pith:UYL6K5KE","canonical_record":{"source":{"id":"1702.02715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-09T06:09:48Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"5c1ca773ed42d4d7960ea18e21eee0f0b93aa004794bd0791f0d9049cb963ef0","abstract_canon_sha256":"f7be3d09e91f3ae5eef8e316a2ef03b44a687a53395d6ee202018644dc20d678"},"schema_version":"1.0"},"canonical_sha256":"a617e57544d7587ef437de01d3991c246941eac0623295ce446860fb069041de","source":{"kind":"arxiv","id":"1702.02715","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02715","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02715v3","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02715","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"UYL6K5KE25MH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UYL6K5KE25MH55BX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UYL6K5KE","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UYL6K5KE25MH55BX3YA5HGI4ER","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-09T06:09:48Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"5c1ca773ed42d4d7960ea18e21eee0f0b93aa004794bd0791f0d9049cb963ef0","abstract_canon_sha256":"f7be3d09e91f3ae5eef8e316a2ef03b44a687a53395d6ee202018644dc20d678"},"schema_version":"1.0"},"canonical_sha256":"a617e57544d7587ef437de01d3991c246941eac0623295ce446860fb069041de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:39.973890Z","signature_b64":"UVxsgQWPivHiCtpTRYGB4ofwHx2WVa2TkuWGD6HpPQvbyb2QYxwxkIua8oztQDCKAOw2dmn6ukye7FJgTU8CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a617e57544d7587ef437de01d3991c246941eac0623295ce446860fb069041de","last_reissued_at":"2026-05-18T00:20:39.973336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:39.973336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02715","source_version":3,"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-18T00:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYgJnst3RtDGJEgdE6ASB9Bl1SGceNzVKNouVWvGEFK9pWSfwT7w0VB6X1r1FwtetksQCoLR5GR865hamSo6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:53:37.286712Z"},"content_sha256":"837eb4e52fd6881e013c1c3b71a8c375b79f13d3d6d6f705f3b31b86d55bc0ef","schema_version":"1.0","event_id":"sha256:837eb4e52fd6881e013c1c3b71a8c375b79f13d3d6d6f705f3b31b86d55bc0ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UYL6K5KE25MH55BX3YA5HGI4ER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast and Scalable Joint Estimator for Learning Multiple Related Sparse Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"stat.ML","authors_text":"Beilun Wang, Ji Gao, Yanjun Qi","submitted_at":"2017-02-09T06:09:48Z","abstract_excerpt":"Estimating multiple sparse Gaussian Graphical Models (sGGMs) jointly for many related tasks (large $K$) under a high-dimensional (large $p$) situation is an important task. Most previous studies for the joint estimation of multiple sGGMs rely on penalized log-likelihood estimators that involve expensive and difficult non-smooth optimizations. We propose a novel approach, FASJEM for \\underline{fa}st and \\underline{s}calable \\underline{j}oint structure-\\underline{e}stimation of \\underline{m}ultiple sGGMs at a large scale. As the first study of joint sGGM using the Elementary Estimator framework,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02715","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"},"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-18T00:20:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PTYhuzzUlPZxbLM92n1nJUsvUBbOUrl2UasM9uxs9V6o5Ycfdqc6qyrETB++HhmOCljYptTDUPEQaPJ/ZL2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:53:37.287065Z"},"content_sha256":"bb19bbf0be37c896f75ef675230e3661c7feb2e5f2454ba6fb88aa86633be3e2","schema_version":"1.0","event_id":"sha256:bb19bbf0be37c896f75ef675230e3661c7feb2e5f2454ba6fb88aa86633be3e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYL6K5KE25MH55BX3YA5HGI4ER/bundle.json","state_url":"https://pith.science/pith/UYL6K5KE25MH55BX3YA5HGI4ER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYL6K5KE25MH55BX3YA5HGI4ER/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-01T19:53:37Z","links":{"resolver":"https://pith.science/pith/UYL6K5KE25MH55BX3YA5HGI4ER","bundle":"https://pith.science/pith/UYL6K5KE25MH55BX3YA5HGI4ER/bundle.json","state":"https://pith.science/pith/UYL6K5KE25MH55BX3YA5HGI4ER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYL6K5KE25MH55BX3YA5HGI4ER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UYL6K5KE25MH55BX3YA5HGI4ER","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":"f7be3d09e91f3ae5eef8e316a2ef03b44a687a53395d6ee202018644dc20d678","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-09T06:09:48Z","title_canon_sha256":"5c1ca773ed42d4d7960ea18e21eee0f0b93aa004794bd0791f0d9049cb963ef0"},"schema_version":"1.0","source":{"id":"1702.02715","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02715","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02715v3","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02715","created_at":"2026-05-18T00:20:39Z"},{"alias_kind":"pith_short_12","alias_value":"UYL6K5KE25MH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UYL6K5KE25MH55BX","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UYL6K5KE","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:bb19bbf0be37c896f75ef675230e3661c7feb2e5f2454ba6fb88aa86633be3e2","target":"graph","created_at":"2026-05-18T00:20:39Z","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":"Estimating multiple sparse Gaussian Graphical Models (sGGMs) jointly for many related tasks (large $K$) under a high-dimensional (large $p$) situation is an important task. Most previous studies for the joint estimation of multiple sGGMs rely on penalized log-likelihood estimators that involve expensive and difficult non-smooth optimizations. We propose a novel approach, FASJEM for \\underline{fa}st and \\underline{s}calable \\underline{j}oint structure-\\underline{e}stimation of \\underline{m}ultiple sGGMs at a large scale. As the first study of joint sGGM using the Elementary Estimator framework,","authors_text":"Beilun Wang, Ji Gao, Yanjun Qi","cross_cats":["cs.LG","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-09T06:09:48Z","title":"A Fast and Scalable Joint Estimator for Learning Multiple Related Sparse Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02715","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:837eb4e52fd6881e013c1c3b71a8c375b79f13d3d6d6f705f3b31b86d55bc0ef","target":"record","created_at":"2026-05-18T00:20:39Z","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":"f7be3d09e91f3ae5eef8e316a2ef03b44a687a53395d6ee202018644dc20d678","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-09T06:09:48Z","title_canon_sha256":"5c1ca773ed42d4d7960ea18e21eee0f0b93aa004794bd0791f0d9049cb963ef0"},"schema_version":"1.0","source":{"id":"1702.02715","kind":"arxiv","version":3}},"canonical_sha256":"a617e57544d7587ef437de01d3991c246941eac0623295ce446860fb069041de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a617e57544d7587ef437de01d3991c246941eac0623295ce446860fb069041de","first_computed_at":"2026-05-18T00:20:39.973336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:39.973336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UVxsgQWPivHiCtpTRYGB4ofwHx2WVa2TkuWGD6HpPQvbyb2QYxwxkIua8oztQDCKAOw2dmn6ukye7FJgTU8CAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:39.973890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02715","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:837eb4e52fd6881e013c1c3b71a8c375b79f13d3d6d6f705f3b31b86d55bc0ef","sha256:bb19bbf0be37c896f75ef675230e3661c7feb2e5f2454ba6fb88aa86633be3e2"],"state_sha256":"7f7ee241e150a30cf933d0cd8b330e0a4a2d652d08b628b2711db290eb9432ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBcZUbHr1L+6N5XHruribGxKaZ20VymLqE7VRSbfyviV2WkD3bkqE8o+T5yIlD9MnKguI0lGPiF3jmJEhSpABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:53:37.288982Z","bundle_sha256":"9e3a886790cd2f726f61b751de4ed8cdcf8f70383adabe978cbbcd431d3498fe"}}