{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KGBEP45JED7QGQR722PL263T4","short_pith_number":"pith:6KGBEP45","canonical_record":{"source":{"id":"1703.04886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:25:31Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"6ba5ce73b12f96eceea647a14a6e9228c12dbdf1816602393fc2a1300d9845dd","abstract_canon_sha256":"53554b3102e8b74af77a8a8b1396a2f6186d0ad1dc4340ed43d8faa2565db0ea"},"schema_version":"1.0"},"canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","source":{"kind":"arxiv","id":"1703.04886","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04886","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04886v3","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04886","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"pith_short_12","alias_value":"6KGBEP45JED7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KGBEP45JED7QGQR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KGBEP45","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KGBEP45JED7QGQR722PL263T4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04886","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:25:31Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"6ba5ce73b12f96eceea647a14a6e9228c12dbdf1816602393fc2a1300d9845dd","abstract_canon_sha256":"53554b3102e8b74af77a8a8b1396a2f6186d0ad1dc4340ed43d8faa2565db0ea"},"schema_version":"1.0"},"canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:31.144813Z","signature_b64":"7pgtMXKYRx+aQTsmw4iE936SgOTjIwSkh0OeVa7pc9umQvIFm7h39IOchgvqiuFCirfN5MIeQa7LmulzlXvGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","last_reissued_at":"2026-05-18T00:00:31.144347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:31.144347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04886","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:00:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fIrFlwz/c+WvfthI8AVRDjNPVs6vH0tBrFlcQyPv5QLnhBlK1S2hhHPX4VfdC0ngYISh5YchPr3V0pWPzo5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:20:39.506507Z"},"content_sha256":"1b98323868659ab73591155aa2a5738c72cf886affcf4459f4c5d3df94b83c2a","schema_version":"1.0","event_id":"sha256:1b98323868659ab73591155aa2a5738c72cf886affcf4459f4c5d3df94b83c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KGBEP45JED7QGQR722PL263T4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Theoretic Optimal Learning of Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra","submitted_at":"2017-03-15T02:25:31Z","abstract_excerpt":"What is the optimal number of independent observations from which a sparse Gaussian Graphical Model can be correctly recovered? Information-theoretic arguments provide a lower bound on the minimum number of samples necessary to perfectly identify the support of any multivariate normal distribution as a function of model parameters. For a model defined on a sparse graph with $p$ nodes, a maximum degree $d$ and minimum normalized edge strength $\\kappa$, this necessary number of samples scales at least as $d \\log p/\\kappa^2$. The sample complexity requirements of existing methods for perfect grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04886","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:00:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8UgZGVbOQA85ZiLBvCy35RXIYz9h5V6EdRp4KnGpUT6cZQ6aceevVsOkOGNYr7MNNVrm5BkhjrV+eTrxasnFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:20:39.507234Z"},"content_sha256":"a7b871c6c115ee9a9d38107511792362e915c5a71b6f2779509805edb3838f27","schema_version":"1.0","event_id":"sha256:a7b871c6c115ee9a9d38107511792362e915c5a71b6f2779509805edb3838f27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/bundle.json","state_url":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KGBEP45JED7QGQR722PL263T4/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-08T17:20:39Z","links":{"resolver":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4","bundle":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/bundle.json","state":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KGBEP45JED7QGQR722PL263T4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KGBEP45JED7QGQR722PL263T4","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":"53554b3102e8b74af77a8a8b1396a2f6186d0ad1dc4340ed43d8faa2565db0ea","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:25:31Z","title_canon_sha256":"6ba5ce73b12f96eceea647a14a6e9228c12dbdf1816602393fc2a1300d9845dd"},"schema_version":"1.0","source":{"id":"1703.04886","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04886","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04886v3","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04886","created_at":"2026-05-18T00:00:31Z"},{"alias_kind":"pith_short_12","alias_value":"6KGBEP45JED7","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KGBEP45JED7QGQR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KGBEP45","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a7b871c6c115ee9a9d38107511792362e915c5a71b6f2779509805edb3838f27","target":"graph","created_at":"2026-05-18T00:00:31Z","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":"What is the optimal number of independent observations from which a sparse Gaussian Graphical Model can be correctly recovered? Information-theoretic arguments provide a lower bound on the minimum number of samples necessary to perfectly identify the support of any multivariate normal distribution as a function of model parameters. For a model defined on a sparse graph with $p$ nodes, a maximum degree $d$ and minimum normalized edge strength $\\kappa$, this necessary number of samples scales at least as $d \\log p/\\kappa^2$. The sample complexity requirements of existing methods for perfect grap","authors_text":"Andrey Y. Lokhov, Marc Vuffray, Sidhant Misra","cross_cats":["cs.IT","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:25:31Z","title":"Information Theoretic Optimal Learning of Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04886","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:1b98323868659ab73591155aa2a5738c72cf886affcf4459f4c5d3df94b83c2a","target":"record","created_at":"2026-05-18T00:00:31Z","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":"53554b3102e8b74af77a8a8b1396a2f6186d0ad1dc4340ed43d8faa2565db0ea","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:25:31Z","title_canon_sha256":"6ba5ce73b12f96eceea647a14a6e9228c12dbdf1816602393fc2a1300d9845dd"},"schema_version":"1.0","source":{"id":"1703.04886","kind":"arxiv","version":3}},"canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","first_computed_at":"2026-05-18T00:00:31.144347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:31.144347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7pgtMXKYRx+aQTsmw4iE936SgOTjIwSkh0OeVa7pc9umQvIFm7h39IOchgvqiuFCirfN5MIeQa7LmulzlXvGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:31.144813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04886","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b98323868659ab73591155aa2a5738c72cf886affcf4459f4c5d3df94b83c2a","sha256:a7b871c6c115ee9a9d38107511792362e915c5a71b6f2779509805edb3838f27"],"state_sha256":"e5a580a877132aa4957cc1d8e6bf925ad907d3d8bed1e1ba4d16c81cb1d109ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KS+SyeLkOv+0lwSZeHQavDw7nexg56nwgXRxubCoE4PhuFRzB1mNCAwiZf7mWGJnI+qUHpA1spNTFNDsyAqXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:20:39.511846Z","bundle_sha256":"dd1f071867efa76693e1d755b6e31fa94be869eaf2fa54c04514309e496b5d29"}}