{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AFK5VQQ6J3SS3OFJCCPL6PLFYQ","short_pith_number":"pith:AFK5VQQ6","schema_version":"1.0","canonical_sha256":"0155dac21e4ee52db8a9109ebf3d65c41cc44d40139fd1e6da65faefdf310bff","source":{"kind":"arxiv","id":"1708.09479","version":3},"attestation_state":"computed","paper":{"title":"Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Salar Fattahi, Somayeh Sojoudi","submitted_at":"2017-08-30T21:25:21Z","abstract_excerpt":"Graphical Lasso (GL) is a popular method for learning the structure of an undirected graphical model, which is based on an $l_1$ regularization technique. The objective of this paper is to compare the computationally-heavy GL technique with a numerically-cheap heuristic method that is based on simply thresholding the sample covariance matrix. To this end, two notions of sign-consistent and inverse-consistent matrices are developed, and then it is shown that the thresholding and GL methods are equivalent if: (i) the thresholded sample covariance matrix is both sign-consistent and inverse-consis"},"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":"1708.09479","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-30T21:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"95fd13f816db66a094ba7390fc75be001b3b5fd8d7618ec6cb13a516e28ad0da","abstract_canon_sha256":"3337cc4d50e087155ae48556f6220614f2b760f9bec21de6cdb94da9dc8dfb82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:58.418699Z","signature_b64":"e9E7nCjepK8hRmJGW6Hi/0bHRyqUJ6CPUARmeWzlruo1yYJTDo92horRy6EbiKBtK0zb2L5zG9hzeJA++dkGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0155dac21e4ee52db8a9109ebf3d65c41cc44d40139fd1e6da65faefdf310bff","last_reissued_at":"2026-05-17T23:41:58.417950Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:58.417950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Salar Fattahi, Somayeh Sojoudi","submitted_at":"2017-08-30T21:25:21Z","abstract_excerpt":"Graphical Lasso (GL) is a popular method for learning the structure of an undirected graphical model, which is based on an $l_1$ regularization technique. The objective of this paper is to compare the computationally-heavy GL technique with a numerically-cheap heuristic method that is based on simply thresholding the sample covariance matrix. To this end, two notions of sign-consistent and inverse-consistent matrices are developed, and then it is shown that the thresholding and GL methods are equivalent if: (i) the thresholded sample covariance matrix is both sign-consistent and inverse-consis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09479","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":"1708.09479","created_at":"2026-05-17T23:41:58.418051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09479v3","created_at":"2026-05-17T23:41:58.418051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09479","created_at":"2026-05-17T23:41:58.418051+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFK5VQQ6J3SS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFK5VQQ6J3SS3OFJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFK5VQQ6","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09393","citing_title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ","json":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ.json","graph_json":"https://pith.science/api/pith-number/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/graph.json","events_json":"https://pith.science/api/pith-number/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/events.json","paper":"https://pith.science/paper/AFK5VQQ6"},"agent_actions":{"view_html":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ","download_json":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ.json","view_paper":"https://pith.science/paper/AFK5VQQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09479&json=true","fetch_graph":"https://pith.science/api/pith-number/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/action/storage_attestation","attest_author":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/action/author_attestation","sign_citation":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/action/citation_signature","submit_replication":"https://pith.science/pith/AFK5VQQ6J3SS3OFJCCPL6PLFYQ/action/replication_record"}},"created_at":"2026-05-17T23:41:58.418051+00:00","updated_at":"2026-05-17T23:41:58.418051+00:00"}