{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HO7RRWDEB4ZMS6G77PABF54EN2","short_pith_number":"pith:HO7RRWDE","canonical_record":{"source":{"id":"2010.11559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T09:33:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"99c532b6db44ddbc2c1f2d9d7fa56ab992164d50a2874275a5b0a6060226c96e","abstract_canon_sha256":"ea44ca8408a152b59130d5ffd483575400ca7435c8c60147bf68dbbeeced4920"},"schema_version":"1.0"},"canonical_sha256":"3bbf18d8640f32c978dffbc012f7846e83ffb610824a5ed09530f7af772d2e81","source":{"kind":"arxiv","id":"2010.11559","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.11559","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.11559v2","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.11559","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"HO7RRWDEB4ZM","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_16","alias_value":"HO7RRWDEB4ZMS6G7","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_8","alias_value":"HO7RRWDE","created_at":"2026-07-05T07:46:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HO7RRWDEB4ZMS6G77PABF54EN2","target":"record","payload":{"canonical_record":{"source":{"id":"2010.11559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T09:33:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"99c532b6db44ddbc2c1f2d9d7fa56ab992164d50a2874275a5b0a6060226c96e","abstract_canon_sha256":"ea44ca8408a152b59130d5ffd483575400ca7435c8c60147bf68dbbeeced4920"},"schema_version":"1.0"},"canonical_sha256":"3bbf18d8640f32c978dffbc012f7846e83ffb610824a5ed09530f7af772d2e81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:09.480687Z","signature_b64":"9y661j4CAoG4HxLRSbrExK+8SVOQ0g7eyZCXjuF/Ot49XnJftfrAaK7ZX6Hg4+2EXq2xB8lATLcLJMrfzA99DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bbf18d8640f32c978dffbc012f7846e83ffb610824a5ed09530f7af772d2e81","last_reissued_at":"2026-07-05T07:46:09.480252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:09.480252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.11559","source_version":2,"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-05T07:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFnJxYYVql2MOwO2BBDalE1pwgTCrQYiGc5SD3sliGI0kYCsiSywEyQsF3pDNHZbPooIBxftWYeFQNA0AowDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:25:22.956164Z"},"content_sha256":"9ae478fd7fe82c9bd54ae2578058e6e517da09d55d026d13851a297666759940","schema_version":"1.0","event_id":"sha256:9ae478fd7fe82c9bd54ae2578058e6e517da09d55d026d13851a297666759940"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HO7RRWDEB4ZMS6G77PABF54EN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Graph Laplacian with MCP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Defeng Sun, Kim-Chuan Toh, Yangjing Zhang","submitted_at":"2020-10-22T09:33:49Z","abstract_excerpt":"We consider the problem of learning a graph under the Laplacian constraint with a non-convex penalty: minimax concave penalty (MCP). For solving the MCP penalized graphical model, we design an inexact proximal difference-of-convex algorithm (DCA) and prove its convergence to critical points. We note that each subproblem of the proximal DCA enjoys the nice property that the objective function in its dual problem is continuously differentiable with a semismooth gradient. Therefore, we apply an efficient semismooth Newton method to subproblems of the proximal DCA. Numerical experiments on various"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.11559","kind":"arxiv","version":2},"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/2010.11559/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-05T07:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hi6ZiyH17gh6890rMrRM4EJyvosjjvaMsF7nRFL/58nxZIW33dGAH4akroedvvGihXYrqKXXjtVISnkZxVjfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:25:22.956562Z"},"content_sha256":"d4c47bb81ff3a8cd4e71488d005cbc23d8a288e4ba477bf1655a375a00642365","schema_version":"1.0","event_id":"sha256:d4c47bb81ff3a8cd4e71488d005cbc23d8a288e4ba477bf1655a375a00642365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HO7RRWDEB4ZMS6G77PABF54EN2/bundle.json","state_url":"https://pith.science/pith/HO7RRWDEB4ZMS6G77PABF54EN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HO7RRWDEB4ZMS6G77PABF54EN2/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-14T03:25:22Z","links":{"resolver":"https://pith.science/pith/HO7RRWDEB4ZMS6G77PABF54EN2","bundle":"https://pith.science/pith/HO7RRWDEB4ZMS6G77PABF54EN2/bundle.json","state":"https://pith.science/pith/HO7RRWDEB4ZMS6G77PABF54EN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HO7RRWDEB4ZMS6G77PABF54EN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HO7RRWDEB4ZMS6G77PABF54EN2","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":"ea44ca8408a152b59130d5ffd483575400ca7435c8c60147bf68dbbeeced4920","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T09:33:49Z","title_canon_sha256":"99c532b6db44ddbc2c1f2d9d7fa56ab992164d50a2874275a5b0a6060226c96e"},"schema_version":"1.0","source":{"id":"2010.11559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.11559","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.11559v2","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.11559","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"HO7RRWDEB4ZM","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_16","alias_value":"HO7RRWDEB4ZMS6G7","created_at":"2026-07-05T07:46:09Z"},{"alias_kind":"pith_short_8","alias_value":"HO7RRWDE","created_at":"2026-07-05T07:46:09Z"}],"graph_snapshots":[{"event_id":"sha256:d4c47bb81ff3a8cd4e71488d005cbc23d8a288e4ba477bf1655a375a00642365","target":"graph","created_at":"2026-07-05T07:46:09Z","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/2010.11559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of learning a graph under the Laplacian constraint with a non-convex penalty: minimax concave penalty (MCP). For solving the MCP penalized graphical model, we design an inexact proximal difference-of-convex algorithm (DCA) and prove its convergence to critical points. We note that each subproblem of the proximal DCA enjoys the nice property that the objective function in its dual problem is continuously differentiable with a semismooth gradient. Therefore, we apply an efficient semismooth Newton method to subproblems of the proximal DCA. Numerical experiments on various","authors_text":"Defeng Sun, Kim-Chuan Toh, Yangjing Zhang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T09:33:49Z","title":"Learning Graph Laplacian with MCP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.11559","kind":"arxiv","version":2},"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:9ae478fd7fe82c9bd54ae2578058e6e517da09d55d026d13851a297666759940","target":"record","created_at":"2026-07-05T07:46:09Z","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":"ea44ca8408a152b59130d5ffd483575400ca7435c8c60147bf68dbbeeced4920","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-22T09:33:49Z","title_canon_sha256":"99c532b6db44ddbc2c1f2d9d7fa56ab992164d50a2874275a5b0a6060226c96e"},"schema_version":"1.0","source":{"id":"2010.11559","kind":"arxiv","version":2}},"canonical_sha256":"3bbf18d8640f32c978dffbc012f7846e83ffb610824a5ed09530f7af772d2e81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bbf18d8640f32c978dffbc012f7846e83ffb610824a5ed09530f7af772d2e81","first_computed_at":"2026-07-05T07:46:09.480252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:09.480252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9y661j4CAoG4HxLRSbrExK+8SVOQ0g7eyZCXjuF/Ot49XnJftfrAaK7ZX6Hg4+2EXq2xB8lATLcLJMrfzA99DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:09.480687Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.11559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae478fd7fe82c9bd54ae2578058e6e517da09d55d026d13851a297666759940","sha256:d4c47bb81ff3a8cd4e71488d005cbc23d8a288e4ba477bf1655a375a00642365"],"state_sha256":"f7f460efd504bc03ec958e83548c8aa4a529cd09099ff6e81db86d5bbfff8619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7XWXujxcaEGGZ1rXZCvaOkhBrw/dJAYe46M++ddS/jVxS5zahMeWMgoEZGZ9GLQqDusMg+w4j5x4ec8mpU8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:25:22.960757Z","bundle_sha256":"b68edf60933819f6fd72222222395ec295c80754193037535c83405be959c97e"}}