{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5RUJNDQAYN3CCU3R6ZQRAG4MWK","short_pith_number":"pith:5RUJNDQA","canonical_record":{"source":{"id":"1907.00723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-01T12:37:46Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f58caa9173aebc475eb182c062159718ee187d4d14a2659416d61c4163e15aec","abstract_canon_sha256":"52df51397e89937554561b5f6a008cc3f44977217ea4631888249c0fe671f803"},"schema_version":"1.0"},"canonical_sha256":"ec68968e00c376215371f661101b8cb2bf754b2113ce1157ca42f007f25fd63d","source":{"kind":"arxiv","id":"1907.00723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00723","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00723v1","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00723","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"5RUJNDQAYN3C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5RUJNDQAYN3CCU3R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5RUJNDQA","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5RUJNDQAYN3CCU3R6ZQRAG4MWK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.00723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-01T12:37:46Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f58caa9173aebc475eb182c062159718ee187d4d14a2659416d61c4163e15aec","abstract_canon_sha256":"52df51397e89937554561b5f6a008cc3f44977217ea4631888249c0fe671f803"},"schema_version":"1.0"},"canonical_sha256":"ec68968e00c376215371f661101b8cb2bf754b2113ce1157ca42f007f25fd63d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:48.326108Z","signature_b64":"MnThXyfHWSOexVqzPN7pBRT7Fdf2wbPENWfVMgWF029dRcHKh1myD9JVgegcJNZpgysVs2q7w5lCQiqQwK8RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec68968e00c376215371f661101b8cb2bf754b2113ce1157ca42f007f25fd63d","last_reissued_at":"2026-05-17T23:41:48.325398Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:48.325398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.00723","source_version":1,"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-17T23:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qho0V4DwheREEFvG12X7h1EQqG+qtUJlXbxBfAtmiy+c+BkiYpuJgvGXYSDC/Ls24REPVS8GY4IL6DEBYUl0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:21.581109Z"},"content_sha256":"cb4c1b77a7aa385028f2d8a5806d16ebe709ce349ac064adcdc23fff7c9b3a75","schema_version":"1.0","event_id":"sha256:cb4c1b77a7aa385028f2d8a5806d16ebe709ce349ac064adcdc23fff7c9b3a75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5RUJNDQAYN3CCU3R6ZQRAG4MWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A greedy algorithm for sparse precision matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Didi Lv, Xiaoqun Zhang","submitted_at":"2019-07-01T12:37:46Z","abstract_excerpt":"Precision matrix estimation is an important problem in statistical data analysis. This paper introduces a fast sparse precision matrix estimation algorithm, namely GISS$^{{\\rho}}$, which is originally introduced for compressive sensing. The algorithm GISS$^{{\\rho}}$ is derived based on $l_1$ minimization while with the computation advantage of greedy algorithms. We analyze the asymptotic convergence rate of the proposed GISS$^{{\\rho}}$ for sparse precision matrix estimation and sparsity recovery properties with respect to the stopping criteria. Finally, we numerically compare GISS$^{\\rho}$ to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00723","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":""},"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-17T23:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sToUakRXlwudnB6iQmKUtOxpJiT3FpFmyUj+gWKchTnevToWHogdcKq/aLQ1g8RrsspA/+XEChRMShFcYzdTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:21.581496Z"},"content_sha256":"96d177aab93741107022f475c79598406b5e086194a1d783c1c836f177566034","schema_version":"1.0","event_id":"sha256:96d177aab93741107022f475c79598406b5e086194a1d783c1c836f177566034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/bundle.json","state_url":"https://pith.science/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/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-09T07:50:21Z","links":{"resolver":"https://pith.science/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK","bundle":"https://pith.science/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/bundle.json","state":"https://pith.science/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RUJNDQAYN3CCU3R6ZQRAG4MWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5RUJNDQAYN3CCU3R6ZQRAG4MWK","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":"52df51397e89937554561b5f6a008cc3f44977217ea4631888249c0fe671f803","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-01T12:37:46Z","title_canon_sha256":"f58caa9173aebc475eb182c062159718ee187d4d14a2659416d61c4163e15aec"},"schema_version":"1.0","source":{"id":"1907.00723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00723","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00723v1","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00723","created_at":"2026-05-17T23:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"5RUJNDQAYN3C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5RUJNDQAYN3CCU3R","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5RUJNDQA","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:96d177aab93741107022f475c79598406b5e086194a1d783c1c836f177566034","target":"graph","created_at":"2026-05-17T23:41:48Z","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":"Precision matrix estimation is an important problem in statistical data analysis. This paper introduces a fast sparse precision matrix estimation algorithm, namely GISS$^{{\\rho}}$, which is originally introduced for compressive sensing. The algorithm GISS$^{{\\rho}}$ is derived based on $l_1$ minimization while with the computation advantage of greedy algorithms. We analyze the asymptotic convergence rate of the proposed GISS$^{{\\rho}}$ for sparse precision matrix estimation and sparsity recovery properties with respect to the stopping criteria. Finally, we numerically compare GISS$^{\\rho}$ to ","authors_text":"Didi Lv, Xiaoqun Zhang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-01T12:37:46Z","title":"A greedy algorithm for sparse precision matrix approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00723","kind":"arxiv","version":1},"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:cb4c1b77a7aa385028f2d8a5806d16ebe709ce349ac064adcdc23fff7c9b3a75","target":"record","created_at":"2026-05-17T23:41:48Z","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":"52df51397e89937554561b5f6a008cc3f44977217ea4631888249c0fe671f803","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-01T12:37:46Z","title_canon_sha256":"f58caa9173aebc475eb182c062159718ee187d4d14a2659416d61c4163e15aec"},"schema_version":"1.0","source":{"id":"1907.00723","kind":"arxiv","version":1}},"canonical_sha256":"ec68968e00c376215371f661101b8cb2bf754b2113ce1157ca42f007f25fd63d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec68968e00c376215371f661101b8cb2bf754b2113ce1157ca42f007f25fd63d","first_computed_at":"2026-05-17T23:41:48.325398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:48.325398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnThXyfHWSOexVqzPN7pBRT7Fdf2wbPENWfVMgWF029dRcHKh1myD9JVgegcJNZpgysVs2q7w5lCQiqQwK8RCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:48.326108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4c1b77a7aa385028f2d8a5806d16ebe709ce349ac064adcdc23fff7c9b3a75","sha256:96d177aab93741107022f475c79598406b5e086194a1d783c1c836f177566034"],"state_sha256":"493efe8900a5bc086b0dd299763ab1d34383f6189e997e2cf665f29cafedd86c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsTSCxPpKU1+lQXjhd6FvoHxvapDhiymDby1hzSMwYdXH4eVTT2euvLDAgRAoYW6Z5Tp+AsCRjY1SJ9TYiwjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:50:21.584490Z","bundle_sha256":"ab35b5441dd40531a6372b8c8eef6b8fa262f6355c6cd43eadab0990e1060a55"}}