{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7U2FAKCKNGKISLATJT7IDS4EWU","short_pith_number":"pith:7U2FAKCK","schema_version":"1.0","canonical_sha256":"fd3450284a6994892c134cfe81cb84b53c009e7818398f44b5b4f2264c3e40fc","source":{"kind":"arxiv","id":"1507.02061","version":2},"attestation_state":"computed","paper":{"title":"Honest confidence regions and optimality in high-dimensional precision matrix estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jana Jankov\\'a, Sara van de Geer","submitted_at":"2015-07-08T08:23:12Z","abstract_excerpt":"We propose methodology for estimation of sparse precision matrices and statistical inference for their low-dimensional parameters in a high-dimensional setting where the number of parameters $p$ can be much larger than the sample size. We show that the novel estimator achieves minimax rates in supremum norm and the low-dimensional components of the estimator have a Gaussian limiting distribution. These results hold uniformly over the class of precision matrices with row sparsity of small order $\\sqrt{n}/\\log p$ and spectrum uniformly bounded, under a sub-Gaussian tail assumption on the margins"},"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":"1507.02061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-08T08:23:12Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0a9fc96aeafaba8c1e51ecfdaa829458c9d8906026f26aac32d9b254b760048f","abstract_canon_sha256":"c1dd6252c19ce8e8ad7b8f6a2c26bb453fcaebb0a438468acf090ba92c58788e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:45.961126Z","signature_b64":"/EDko8bHC621UJGp00fiEZSC/MjHiKsI2BLjysUWU85aXfX10uw43nZy9kGvupZfK8qPwDyFfR38lApszXozBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd3450284a6994892c134cfe81cb84b53c009e7818398f44b5b4f2264c3e40fc","last_reissued_at":"2026-05-18T01:10:45.960755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:45.960755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Honest confidence regions and optimality in high-dimensional precision matrix estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jana Jankov\\'a, Sara van de Geer","submitted_at":"2015-07-08T08:23:12Z","abstract_excerpt":"We propose methodology for estimation of sparse precision matrices and statistical inference for their low-dimensional parameters in a high-dimensional setting where the number of parameters $p$ can be much larger than the sample size. We show that the novel estimator achieves minimax rates in supremum norm and the low-dimensional components of the estimator have a Gaussian limiting distribution. These results hold uniformly over the class of precision matrices with row sparsity of small order $\\sqrt{n}/\\log p$ and spectrum uniformly bounded, under a sub-Gaussian tail assumption on the margins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02061","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.02061","created_at":"2026-05-18T01:10:45.960817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02061v2","created_at":"2026-05-18T01:10:45.960817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02061","created_at":"2026-05-18T01:10:45.960817+00:00"},{"alias_kind":"pith_short_12","alias_value":"7U2FAKCKNGKI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7U2FAKCKNGKISLAT","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7U2FAKCK","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12706","citing_title":"A Resampling-Based Framework for Network Structure Learning in High-Dimensional Data","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU","json":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU.json","graph_json":"https://pith.science/api/pith-number/7U2FAKCKNGKISLATJT7IDS4EWU/graph.json","events_json":"https://pith.science/api/pith-number/7U2FAKCKNGKISLATJT7IDS4EWU/events.json","paper":"https://pith.science/paper/7U2FAKCK"},"agent_actions":{"view_html":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU","download_json":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU.json","view_paper":"https://pith.science/paper/7U2FAKCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02061&json=true","fetch_graph":"https://pith.science/api/pith-number/7U2FAKCKNGKISLATJT7IDS4EWU/graph.json","fetch_events":"https://pith.science/api/pith-number/7U2FAKCKNGKISLATJT7IDS4EWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU/action/storage_attestation","attest_author":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU/action/author_attestation","sign_citation":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU/action/citation_signature","submit_replication":"https://pith.science/pith/7U2FAKCKNGKISLATJT7IDS4EWU/action/replication_record"}},"created_at":"2026-05-18T01:10:45.960817+00:00","updated_at":"2026-05-18T01:10:45.960817+00:00"}