{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GKOO6HQ3HJ2F4BC6NAUKOS3UKU","short_pith_number":"pith:GKOO6HQ3","schema_version":"1.0","canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","source":{"kind":"arxiv","id":"2302.06434","version":3},"attestation_state":"computed","paper":{"title":"Efficient Graph Laplacian Estimation by Proximal Newton","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Eran Treister, Tirza Routtenberg, Yakov Medvedovsky","submitted_at":"2023-02-13T15:13:22Z","abstract_excerpt":"The Laplacian-constrained Gaussian Markov Random Field (LGMRF) is a common multivariate statistical model for learning a weighted sparse dependency graph from given data. This graph learning problem can be formulated as a maximum likelihood estimation (MLE) of the precision matrix, subject to Laplacian structural constraints, with a sparsity-inducing penalty term. This paper aims to solve this learning problem accurately and efficiently. First, since the commonly used $\\ell_1$-norm penalty is inappropriate in this setting and may lead to a complete graph, we employ the nonconvex minimax concav"},"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":"2302.06434","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-13T15:13:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f5bc45d4f411e873a29bdc7f363b3e72e4121539b3b167ac282f0aafbb2a2248","abstract_canon_sha256":"9a5fc20b684ac5efebe4f643efb26a25360f39d6b46b765592a8a8c86edcd30c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:08.701900Z","signature_b64":"2Fy06UzvJemFK/vYC4kwLNPFRx0LOBqAMg9v/HdHx9TDY6XFOmcLdj5U5Jmm8y/Z9UYAhTbzq/BPrx3ZI9j4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","last_reissued_at":"2026-07-05T08:07:08.701375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:08.701375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph Laplacian Estimation by Proximal Newton","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Eran Treister, Tirza Routtenberg, Yakov Medvedovsky","submitted_at":"2023-02-13T15:13:22Z","abstract_excerpt":"The Laplacian-constrained Gaussian Markov Random Field (LGMRF) is a common multivariate statistical model for learning a weighted sparse dependency graph from given data. This graph learning problem can be formulated as a maximum likelihood estimation (MLE) of the precision matrix, subject to Laplacian structural constraints, with a sparsity-inducing penalty term. This paper aims to solve this learning problem accurately and efficiently. First, since the commonly used $\\ell_1$-norm penalty is inappropriate in this setting and may lead to a complete graph, we employ the nonconvex minimax concav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06434","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06434/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":"2302.06434","created_at":"2026-07-05T08:07:08.701437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06434v3","created_at":"2026-07-05T08:07:08.701437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06434","created_at":"2026-07-05T08:07:08.701437+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKOO6HQ3HJ2F","created_at":"2026-07-05T08:07:08.701437+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKOO6HQ3HJ2F4BC6","created_at":"2026-07-05T08:07:08.701437+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKOO6HQ3","created_at":"2026-07-05T08:07:08.701437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU","json":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU.json","graph_json":"https://pith.science/api/pith-number/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/graph.json","events_json":"https://pith.science/api/pith-number/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/events.json","paper":"https://pith.science/paper/GKOO6HQ3"},"agent_actions":{"view_html":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU","download_json":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU.json","view_paper":"https://pith.science/paper/GKOO6HQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06434&json=true","fetch_graph":"https://pith.science/api/pith-number/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/graph.json","fetch_events":"https://pith.science/api/pith-number/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/action/storage_attestation","attest_author":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/action/author_attestation","sign_citation":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/action/citation_signature","submit_replication":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/action/replication_record"}},"created_at":"2026-07-05T08:07:08.701437+00:00","updated_at":"2026-07-05T08:07:08.701437+00:00"}