{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GKOO6HQ3HJ2F4BC6NAUKOS3UKU","short_pith_number":"pith:GKOO6HQ3","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"},"canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","source":{"kind":"arxiv","id":"2302.06434","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06434","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06434v3","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06434","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"GKOO6HQ3HJ2F","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_16","alias_value":"GKOO6HQ3HJ2F4BC6","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_8","alias_value":"GKOO6HQ3","created_at":"2026-07-05T08:07:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GKOO6HQ3HJ2F4BC6NAUKOS3UKU","target":"record","payload":{"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"},"canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","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"},"source_kind":"arxiv","source_id":"2302.06434","source_version":3,"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-07-05T08:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MY+yt/7D3xX38+Y/EGmIQN8CJdG5Qw7eQnYRVDzloiBqFZakBdJs2+xx1zu2OwdmfYzqMTT2zChIZ7Dsr92kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:37:11.265022Z"},"content_sha256":"cc7549fa9a7a19c5fe862ab73d7abaa20e84a8fd29fecbf103c3ec90b408ee53","schema_version":"1.0","event_id":"sha256:cc7549fa9a7a19c5fe862ab73d7abaa20e84a8fd29fecbf103c3ec90b408ee53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GKOO6HQ3HJ2F4BC6NAUKOS3UKU","target":"graph","payload":{"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"},"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-07-05T08:07:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wzi/PxSGqq8+Byz6euqLl60nubnnNjyxMBq/OAtTXhCzMLnR9qJ8hn1dPvckQfkbLb4KoVxTWMTKsfLiZXQkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:37:11.265422Z"},"content_sha256":"772ee0daaa4d0a1f29d82c0bb123b15a391122034c09930cb8e9d3d6b1876b4b","schema_version":"1.0","event_id":"sha256:772ee0daaa4d0a1f29d82c0bb123b15a391122034c09930cb8e9d3d6b1876b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/bundle.json","state_url":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/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-08-03T18:37:11Z","links":{"resolver":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU","bundle":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/bundle.json","state":"https://pith.science/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKOO6HQ3HJ2F4BC6NAUKOS3UKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GKOO6HQ3HJ2F4BC6NAUKOS3UKU","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":"9a5fc20b684ac5efebe4f643efb26a25360f39d6b46b765592a8a8c86edcd30c","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-13T15:13:22Z","title_canon_sha256":"f5bc45d4f411e873a29bdc7f363b3e72e4121539b3b167ac282f0aafbb2a2248"},"schema_version":"1.0","source":{"id":"2302.06434","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.06434","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"arxiv_version","alias_value":"2302.06434v3","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06434","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_12","alias_value":"GKOO6HQ3HJ2F","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_16","alias_value":"GKOO6HQ3HJ2F4BC6","created_at":"2026-07-05T08:07:08Z"},{"alias_kind":"pith_short_8","alias_value":"GKOO6HQ3","created_at":"2026-07-05T08:07:08Z"}],"graph_snapshots":[{"event_id":"sha256:772ee0daaa4d0a1f29d82c0bb123b15a391122034c09930cb8e9d3d6b1876b4b","target":"graph","created_at":"2026-07-05T08:07:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.06434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eran Treister, Tirza Routtenberg, Yakov Medvedovsky","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-13T15:13:22Z","title":"Efficient Graph Laplacian Estimation by Proximal Newton"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06434","kind":"arxiv","version":3},"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:cc7549fa9a7a19c5fe862ab73d7abaa20e84a8fd29fecbf103c3ec90b408ee53","target":"record","created_at":"2026-07-05T08:07:08Z","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":"9a5fc20b684ac5efebe4f643efb26a25360f39d6b46b765592a8a8c86edcd30c","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-13T15:13:22Z","title_canon_sha256":"f5bc45d4f411e873a29bdc7f363b3e72e4121539b3b167ac282f0aafbb2a2248"},"schema_version":"1.0","source":{"id":"2302.06434","kind":"arxiv","version":3}},"canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"329cef1e1b3a745e045e6828a74b745532c8c3511988f915eb418d0de153a511","first_computed_at":"2026-07-05T08:07:08.701375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:08.701375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Fy06UzvJemFK/vYC4kwLNPFRx0LOBqAMg9v/HdHx9TDY6XFOmcLdj5U5Jmm8y/Z9UYAhTbzq/BPrx3ZI9j4Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:08.701900Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.06434","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc7549fa9a7a19c5fe862ab73d7abaa20e84a8fd29fecbf103c3ec90b408ee53","sha256:772ee0daaa4d0a1f29d82c0bb123b15a391122034c09930cb8e9d3d6b1876b4b"],"state_sha256":"107e1123487ff81eb4ee1c2a8dccd3829520a1757f8c1f020ba556bd1cecb850"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wumsuniE/8qT0WG5zYmn1A3KISS9mxnrPT84uMLbAhWCLAzaFOl53fUzYOTEbECWJPN8u9dYSXZ4HJKPGijnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:37:11.268177Z","bundle_sha256":"a326a136b3e0dbcdc7a4eb8ab29f5bbd61fbc09b86465d0dee38a69bef6115e1"}}