{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KGBEP45JED7QGQR722PL263T4","short_pith_number":"pith:6KGBEP45","schema_version":"1.0","canonical_sha256":"f28c123f9d4907f81a11feb4f5ebdb9f3f390ec9673ef535e2ee2c43bab399d9","source":{"kind":"arxiv","id":"1703.04886","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.04886","created_at":"2026-05-18T00:00:31.144420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04886v3","created_at":"2026-05-18T00:00:31.144420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04886","created_at":"2026-05-18T00:00:31.144420+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KGBEP45JED7","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KGBEP45JED7QGQR","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KGBEP45","created_at":"2026-05-18T12:31:03.183658+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/6KGBEP45JED7QGQR722PL263T4","json":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4.json","graph_json":"https://pith.science/api/pith-number/6KGBEP45JED7QGQR722PL263T4/graph.json","events_json":"https://pith.science/api/pith-number/6KGBEP45JED7QGQR722PL263T4/events.json","paper":"https://pith.science/paper/6KGBEP45"},"agent_actions":{"view_html":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4","download_json":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4.json","view_paper":"https://pith.science/paper/6KGBEP45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04886&json=true","fetch_graph":"https://pith.science/api/pith-number/6KGBEP45JED7QGQR722PL263T4/graph.json","fetch_events":"https://pith.science/api/pith-number/6KGBEP45JED7QGQR722PL263T4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/action/storage_attestation","attest_author":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/action/author_attestation","sign_citation":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/action/citation_signature","submit_replication":"https://pith.science/pith/6KGBEP45JED7QGQR722PL263T4/action/replication_record"}},"created_at":"2026-05-18T00:00:31.144420+00:00","updated_at":"2026-05-18T00:00:31.144420+00:00"}