{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JNFDZFF322L6WCVHRTTHDUHUBO","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":"14b7673bd8c505214aa88758e264114dfa4034421ca9f10e1aa03faba806a20f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:47:31Z","title_canon_sha256":"936dab494a4c020bc7ccb1dcc0d16cd2b2d53177b2a1c3fd65456477405ae42a"},"schema_version":"1.0","source":{"id":"2605.14453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14453","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14453v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14453","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"JNFDZFF322L6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JNFDZFF322L6WCVH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JNFDZFF3","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9dbd099c9a1d4a0ca6fc3f720662609892d87479745e523d45bd877f8565d860","target":"graph","created_at":"2026-05-17T23:39:06Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We assume that the upper and lower bounds of the intervals share the same conditional dependency structure, and then formulate the interval graphical lasso optimization objective to estimate the precision matrix. ... prove the sparsity and consistency of the estimator."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the upper and lower bounds of the intervals share the same conditional dependency structure."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces interval graphical lasso to estimate a shared precision matrix for interval-valued data and proves its sparsity and consistency."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Assuming upper and lower interval bounds share the same dependency structure allows consistent estimation of precision matrices via a specialized graphical lasso."}],"snapshot_sha256":"97665accb7837c2825f4259920da6aad9105d9df888ca89e0f7d73c724b00440"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the field of statistical learning and data analysis, estimating precision matrices (i.e., the inverse of covariance matrices) is a critical task, particularly for understanding dependency structures among variables. However, traditional methods often fall short when dealing with high-dimensional interval-valued data, where each observation is represented as an interval rather than a single point. This paper proposes a novel framework for estimating precision matrices in such contexts, addressing the unique challenges posed by the interval nature of the data. Specifically, we assume that the","authors_text":"Hao Xu, Wan Tian, Wenhao Cui, Zhongfeng Qin","cross_cats":[],"headline":"Assuming upper and lower interval bounds share the same dependency structure allows consistent estimation of precision matrices via a specialized graphical lasso.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:47:31Z","title":"Estimating Precision Matrices for High-Dimensional Interval-Valued Data"},"references":{"count":129,"internal_anchors":0,"resolved_work":129,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Essays in honor of Aman Ullah , volume=","work_id":"2f2ae1b3-bdf1-4c1d-821e-820c1c90befe","year":2016},{"cited_arxiv_id":"","doi":"10.1016/s0047-259x(03)00096-4","is_internal_anchor":false,"ref_index":2,"title":"A well-conditioned estimator for large-dimensional covariance matrices , volume =","work_id":"22bbe490-8f1d-4be8-984f-a7ae73cb490e","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Journal of the American Statistical Association , volume=","work_id":"2abde437-9563-4515-875d-c9ba0fc3f786","year":2003},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Econometric Reviews , year=","work_id":"c4e0dce7-8f01-464c-b49b-f58edd7464c2","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Journal of Business & Economic Statistics , volume=","work_id":"230921f1-e264-46cc-a5a4-23e338d54caa","year":2013}],"snapshot_sha256":"5a3ac7bd275070ca59ce9b1dabb16b1fb0f5803eeb9280bc2f32bd23c7cfc85b"},"source":{"id":"2605.14453","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:57:17.072395Z","id":"14ea142c-51a4-4aa0-b0c7-9ac69a821210","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces interval graphical lasso to estimate a shared precision matrix for interval-valued data and proves its sparsity and consistency.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Assuming upper and lower interval bounds share the same dependency structure allows consistent estimation of precision matrices via a specialized graphical lasso.","strongest_claim":"We assume that the upper and lower bounds of the intervals share the same conditional dependency structure, and then formulate the interval graphical lasso optimization objective to estimate the precision matrix. ... prove the sparsity and consistency of the estimator.","weakest_assumption":"The assumption that the upper and lower bounds of the intervals share the same conditional dependency structure."}},"verdict_id":"14ea142c-51a4-4aa0-b0c7-9ac69a821210"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b571007c7afb6e2748a029d182dfddc7e961d3c2a30dc2fbd8efaaf9007a422","target":"record","created_at":"2026-05-17T23:39:06Z","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":"14b7673bd8c505214aa88758e264114dfa4034421ca9f10e1aa03faba806a20f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-05-14T06:47:31Z","title_canon_sha256":"936dab494a4c020bc7ccb1dcc0d16cd2b2d53177b2a1c3fd65456477405ae42a"},"schema_version":"1.0","source":{"id":"2605.14453","kind":"arxiv","version":1}},"canonical_sha256":"4b4a3c94bbd697eb0aa78ce671d0f40b8a739303083c1cfe8f9e3b1b9cdd337f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b4a3c94bbd697eb0aa78ce671d0f40b8a739303083c1cfe8f9e3b1b9cdd337f","first_computed_at":"2026-05-17T23:39:06.871019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.871019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NDkTyumLmrPJdmSRN1ucSpbUy2IWK13hJi/VpyaJZJx++DkN0wZgQnEoV7NfrwZymaKHEa5zgzFltu17XrBHBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.871652Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b571007c7afb6e2748a029d182dfddc7e961d3c2a30dc2fbd8efaaf9007a422","sha256:9dbd099c9a1d4a0ca6fc3f720662609892d87479745e523d45bd877f8565d860"],"state_sha256":"a6433b0a5d45258977eadb22b718438840f739a9614731bcceff011ed0a032f6"}