{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:37YHGT3235QQM3OHBABFK3ZEPO","short_pith_number":"pith:37YHGT32","canonical_record":{"source":{"id":"1207.4255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-18T02:53:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c2b31375d02a0a5b604656192bb8cd36b38767672354bc5ec0c34ee414edd06","abstract_canon_sha256":"98212f81b5f3b9e74b3e92919bb4d3bd6dd99b9414082987fae1bfe421884081"},"schema_version":"1.0"},"canonical_sha256":"dff0734f7adf61066dc70802556f247b90f11e5acc97bc007dd51a1a39056d7d","source":{"kind":"arxiv","id":"1207.4255","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4255","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4255v2","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4255","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"37YHGT3235QQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37YHGT3235QQM3OH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37YHGT32","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:37YHGT3235QQM3OHBABFK3ZEPO","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4255","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-18T02:53:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c2b31375d02a0a5b604656192bb8cd36b38767672354bc5ec0c34ee414edd06","abstract_canon_sha256":"98212f81b5f3b9e74b3e92919bb4d3bd6dd99b9414082987fae1bfe421884081"},"schema_version":"1.0"},"canonical_sha256":"dff0734f7adf61066dc70802556f247b90f11e5acc97bc007dd51a1a39056d7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:22.160506Z","signature_b64":"QUynr3oO/zIwAGRm8/vJV3CWqWK2lU+vhGvgmwQdWptQhC+zGvMCUoyHg0h6V/YZJ+6sBHd3HInIMVFaOxG/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff0734f7adf61066dc70802556f247b90f11e5acc97bc007dd51a1a39056d7d","last_reissued_at":"2026-05-18T01:29:22.159796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:22.159796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4255","source_version":2,"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-18T01:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHvyTkFzXxntDC4e5QT9aO9DlqSkdvOzLVSX/+sI/zdG9ixNqlvvG5U0p8TbdLvHoFe+RLULoAHr6HDgtr1kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:47:00.005294Z"},"content_sha256":"a3a264db1c988054400f3d96018939ff4beaf055674c682d439082c659c058f0","schema_version":"1.0","event_id":"sha256:a3a264db1c988054400f3d96018939ff4beaf055674c682d439082c659c058f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:37YHGT3235QQM3OHBABFK3ZEPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Statistical Efficiency of $\\ell_{1,p}$ Multi-Task Learning of Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Samaras, Jean Honorio, Tommi Jaakkola","submitted_at":"2012-07-18T02:53:02Z","abstract_excerpt":"In this paper, we present $\\ell_{1,p}$ multi-task structure learning for Gaussian graphical models. We analyze the sufficient number of samples for the correct recovery of the support union and edge signs. We also analyze the necessary number of samples for any conceivable method by providing information-theoretic lower bounds. We compare the statistical efficiency of multi-task learning versus that of single-task learning. For experiments, we use a block coordinate descent method that is provably convergent and generates a sequence of positive definite solutions. We provide experimental valid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4255","kind":"arxiv","version":2},"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-18T01:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt+DJUCw2kZfQoD0P5b0NYE3zX0OLMQ+DIZ8CELO7Jw32bSMqQi88SI537fj8WEIEjs2TzGNquXcsWdL+09jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:47:00.005673Z"},"content_sha256":"76e12d63923660ad8e46977d514b0c2db1569a22ff643f8a1587bf2749a426e3","schema_version":"1.0","event_id":"sha256:76e12d63923660ad8e46977d514b0c2db1569a22ff643f8a1587bf2749a426e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37YHGT3235QQM3OHBABFK3ZEPO/bundle.json","state_url":"https://pith.science/pith/37YHGT3235QQM3OHBABFK3ZEPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37YHGT3235QQM3OHBABFK3ZEPO/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-03T18:47:00Z","links":{"resolver":"https://pith.science/pith/37YHGT3235QQM3OHBABFK3ZEPO","bundle":"https://pith.science/pith/37YHGT3235QQM3OHBABFK3ZEPO/bundle.json","state":"https://pith.science/pith/37YHGT3235QQM3OHBABFK3ZEPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37YHGT3235QQM3OHBABFK3ZEPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:37YHGT3235QQM3OHBABFK3ZEPO","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":"98212f81b5f3b9e74b3e92919bb4d3bd6dd99b9414082987fae1bfe421884081","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-18T02:53:02Z","title_canon_sha256":"6c2b31375d02a0a5b604656192bb8cd36b38767672354bc5ec0c34ee414edd06"},"schema_version":"1.0","source":{"id":"1207.4255","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4255","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4255v2","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4255","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"37YHGT3235QQ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"37YHGT3235QQM3OH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"37YHGT32","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:76e12d63923660ad8e46977d514b0c2db1569a22ff643f8a1587bf2749a426e3","target":"graph","created_at":"2026-05-18T01:29:22Z","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":"In this paper, we present $\\ell_{1,p}$ multi-task structure learning for Gaussian graphical models. We analyze the sufficient number of samples for the correct recovery of the support union and edge signs. We also analyze the necessary number of samples for any conceivable method by providing information-theoretic lower bounds. We compare the statistical efficiency of multi-task learning versus that of single-task learning. For experiments, we use a block coordinate descent method that is provably convergent and generates a sequence of positive definite solutions. We provide experimental valid","authors_text":"Dimitris Samaras, Jean Honorio, Tommi Jaakkola","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-18T02:53:02Z","title":"On the Statistical Efficiency of $\\ell_{1,p}$ Multi-Task Learning of Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4255","kind":"arxiv","version":2},"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:a3a264db1c988054400f3d96018939ff4beaf055674c682d439082c659c058f0","target":"record","created_at":"2026-05-18T01:29:22Z","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":"98212f81b5f3b9e74b3e92919bb4d3bd6dd99b9414082987fae1bfe421884081","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-18T02:53:02Z","title_canon_sha256":"6c2b31375d02a0a5b604656192bb8cd36b38767672354bc5ec0c34ee414edd06"},"schema_version":"1.0","source":{"id":"1207.4255","kind":"arxiv","version":2}},"canonical_sha256":"dff0734f7adf61066dc70802556f247b90f11e5acc97bc007dd51a1a39056d7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dff0734f7adf61066dc70802556f247b90f11e5acc97bc007dd51a1a39056d7d","first_computed_at":"2026-05-18T01:29:22.159796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:22.159796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUynr3oO/zIwAGRm8/vJV3CWqWK2lU+vhGvgmwQdWptQhC+zGvMCUoyHg0h6V/YZJ+6sBHd3HInIMVFaOxG/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:22.160506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4255","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a264db1c988054400f3d96018939ff4beaf055674c682d439082c659c058f0","sha256:76e12d63923660ad8e46977d514b0c2db1569a22ff643f8a1587bf2749a426e3"],"state_sha256":"4b281728b5065572204eba33ffcc10e18a8f5f99614cddc57b8682fcd7d72fa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4vf4QB5B+GMe9S4qcDkvz1UHjWAqM7R2/qSDxCR2jN6dwadB2LlngMc3YoGTL/O7UZATIgmumgL1CP9GUJ6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:47:00.007573Z","bundle_sha256":"6b42a2c44e39b5edcb68e2dbd22c11a00620102ce61efb3ef0d87209588018eb"}}