{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WCINXVSOED2TP4MULFG7JH67P3","short_pith_number":"pith:WCINXVSO","schema_version":"1.0","canonical_sha256":"b090dbd64e20f537f194594df49fdf7ef710bee485d0e5778784de02fc0424d1","source":{"kind":"arxiv","id":"2205.07584","version":1},"attestation_state":"computed","paper":{"title":"GraphSPME: Markov Precision Matrix Estimation and Asymptotic Stein-Type Shrinkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Berent {\\AA}nund Str{\\o}mnes Lunde, Feda Curic, Sondre Sortland","submitted_at":"2022-05-16T11:42:01Z","abstract_excerpt":"GraphSPME is an open source Python, R and C++ header-only package implement-ing non-parametric sparse precision matrix estimation along with asymptotic Stein-type shrinkage estimation of the covariance matrix. The user defines a potential neighbourhood structure and provides data that potentially are p >> n. This paper introduces a novel approach for finding the optimal order (that data allows to estimate) of a potential Markov property. The algorithm is implemented in the package, alleviating the problem of users making Markov assumptions and implementing corresponding complex higher-order ne"},"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":"2205.07584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2022-05-16T11:42:01Z","cross_cats_sorted":[],"title_canon_sha256":"5c10569a59c7a9de7459af8ae2c70ca6624f9e5d6c8a14b35f175aebb6c5d009","abstract_canon_sha256":"45fb3e90775d7235e59e7c3f2ab1a172ac75682eee9a4365e4ec6f2c2ccb5f7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:30.372532Z","signature_b64":"amQqlMgoV3Y56rW1t+oP8WqNds0ymKCSJSANxKhYyqMYocv9Dz4aC9FmhkAgpcAEkUJKPNSvQJAtMrf1RxH1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b090dbd64e20f537f194594df49fdf7ef710bee485d0e5778784de02fc0424d1","last_reissued_at":"2026-07-05T04:23:30.372087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:30.372087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphSPME: Markov Precision Matrix Estimation and Asymptotic Stein-Type Shrinkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Berent {\\AA}nund Str{\\o}mnes Lunde, Feda Curic, Sondre Sortland","submitted_at":"2022-05-16T11:42:01Z","abstract_excerpt":"GraphSPME is an open source Python, R and C++ header-only package implement-ing non-parametric sparse precision matrix estimation along with asymptotic Stein-type shrinkage estimation of the covariance matrix. The user defines a potential neighbourhood structure and provides data that potentially are p >> n. This paper introduces a novel approach for finding the optimal order (that data allows to estimate) of a potential Markov property. The algorithm is implemented in the package, alleviating the problem of users making Markov assumptions and implementing corresponding complex higher-order ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07584","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.07584/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.07584","created_at":"2026-07-05T04:23:30.372146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.07584v1","created_at":"2026-07-05T04:23:30.372146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07584","created_at":"2026-07-05T04:23:30.372146+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCINXVSOED2T","created_at":"2026-07-05T04:23:30.372146+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCINXVSOED2TP4MU","created_at":"2026-07-05T04:23:30.372146+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCINXVSO","created_at":"2026-07-05T04:23:30.372146+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09016","citing_title":"An Ensemble Information Filter: Retrieving Markov-information from the SPDE discretisation","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3","json":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3.json","graph_json":"https://pith.science/api/pith-number/WCINXVSOED2TP4MULFG7JH67P3/graph.json","events_json":"https://pith.science/api/pith-number/WCINXVSOED2TP4MULFG7JH67P3/events.json","paper":"https://pith.science/paper/WCINXVSO"},"agent_actions":{"view_html":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3","download_json":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3.json","view_paper":"https://pith.science/paper/WCINXVSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.07584&json=true","fetch_graph":"https://pith.science/api/pith-number/WCINXVSOED2TP4MULFG7JH67P3/graph.json","fetch_events":"https://pith.science/api/pith-number/WCINXVSOED2TP4MULFG7JH67P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3/action/storage_attestation","attest_author":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3/action/author_attestation","sign_citation":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3/action/citation_signature","submit_replication":"https://pith.science/pith/WCINXVSOED2TP4MULFG7JH67P3/action/replication_record"}},"created_at":"2026-07-05T04:23:30.372146+00:00","updated_at":"2026-07-05T04:23:30.372146+00:00"}