{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HIM5GV2YFM6IDT44R5TAS2RAHJ","short_pith_number":"pith:HIM5GV2Y","schema_version":"1.0","canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","source":{"kind":"arxiv","id":"1607.00315","version":1},"attestation_state":"computed","paper":{"title":"A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.NA","authors_text":"Eran Treister, Irad Yavneh, Javier S. Turek","submitted_at":"2016-07-01T16:59:13Z","abstract_excerpt":"Solving l1 regularized optimization problems is common in the fields of computational biology, signal processing and machine learning. Such l1 regularization is utilized to find sparse minimizers of convex functions. A well-known example is the LASSO problem, where the l1 norm regularizes a quadratic function. A multilevel framework is presented for solving such l1 regularized sparse optimization problems efficiently. We take advantage of the expected sparseness of the solution, and create a hierarchy of problems of similar type, which is traversed in order to accelerate the optimization proce"},"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":"1607.00315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-07-01T16:59:13Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"ae6be5a95ea8575f310f97221b66767bcbf0865850209df4ad387d858da649f3","abstract_canon_sha256":"4236d0a822170aaa035f200f008233027f4bac068b17e6dc2665457ef0d45c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.681255Z","signature_b64":"ckI0+CKY1KJGSskfuLCAgvLJ34kSPXv9k1b8+WEfoPhgWBjsTg069M1XXTVcm22YUcFQPBjo6uKkR5ZpiVwXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","last_reissued_at":"2026-05-18T01:11:37.680805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.680805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.NA","authors_text":"Eran Treister, Irad Yavneh, Javier S. Turek","submitted_at":"2016-07-01T16:59:13Z","abstract_excerpt":"Solving l1 regularized optimization problems is common in the fields of computational biology, signal processing and machine learning. Such l1 regularization is utilized to find sparse minimizers of convex functions. A well-known example is the LASSO problem, where the l1 norm regularizes a quadratic function. A multilevel framework is presented for solving such l1 regularized sparse optimization problems efficiently. We take advantage of the expected sparseness of the solution, and create a hierarchy of problems of similar type, which is traversed in order to accelerate the optimization proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00315","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00315","created_at":"2026-05-18T01:11:37.680877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00315v1","created_at":"2026-05-18T01:11:37.680877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00315","created_at":"2026-05-18T01:11:37.680877+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIM5GV2YFM6I","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIM5GV2YFM6IDT44","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIM5GV2Y","created_at":"2026-05-18T12:30:19.053100+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/HIM5GV2YFM6IDT44R5TAS2RAHJ","json":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ.json","graph_json":"https://pith.science/api/pith-number/HIM5GV2YFM6IDT44R5TAS2RAHJ/graph.json","events_json":"https://pith.science/api/pith-number/HIM5GV2YFM6IDT44R5TAS2RAHJ/events.json","paper":"https://pith.science/paper/HIM5GV2Y"},"agent_actions":{"view_html":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ","download_json":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ.json","view_paper":"https://pith.science/paper/HIM5GV2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00315&json=true","fetch_graph":"https://pith.science/api/pith-number/HIM5GV2YFM6IDT44R5TAS2RAHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HIM5GV2YFM6IDT44R5TAS2RAHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/action/storage_attestation","attest_author":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/action/author_attestation","sign_citation":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/action/citation_signature","submit_replication":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/action/replication_record"}},"created_at":"2026-05-18T01:11:37.680877+00:00","updated_at":"2026-05-18T01:11:37.680877+00:00"}