{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HIM5GV2YFM6IDT44R5TAS2RAHJ","short_pith_number":"pith:HIM5GV2Y","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"},"canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","source":{"kind":"arxiv","id":"1607.00315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00315","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00315v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00315","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"HIM5GV2YFM6I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIM5GV2YFM6IDT44","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIM5GV2Y","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HIM5GV2YFM6IDT44R5TAS2RAHJ","target":"record","payload":{"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"},"canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","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"},"source_kind":"arxiv","source_id":"1607.00315","source_version":1,"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-05-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIWJ6sta5IQw5s+1pFNLW2Sm8cDrXNG9CEGM6/6tdC89MX+MoNL23+hOjzvz82HTnz/F2TrcD2y2b5UOB0myDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:38:28.387234Z"},"content_sha256":"0fd64fc051dba8ed8f4d07e92b3ccb8ce9737914db1f412b99f21d803adbcf5c","schema_version":"1.0","event_id":"sha256:0fd64fc051dba8ed8f4d07e92b3ccb8ce9737914db1f412b99f21d803adbcf5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HIM5GV2YFM6IDT44R5TAS2RAHJ","target":"graph","payload":{"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"},"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-05-18T01:11:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZTq+R1EepznnDfyaE/toXGNYMbCMQ61Q8lJIA9+Da2EzHgUglH1ZkL86GmxSj98B680WiiqalEAAAP6VSbKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:38:28.387833Z"},"content_sha256":"9c1bbcd2d522a26148a2f09bdae0736bff7a5f27254ed0df8d052869debc974d","schema_version":"1.0","event_id":"sha256:9c1bbcd2d522a26148a2f09bdae0736bff7a5f27254ed0df8d052869debc974d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/bundle.json","state_url":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/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-05-27T20:38:28Z","links":{"resolver":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ","bundle":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/bundle.json","state":"https://pith.science/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIM5GV2YFM6IDT44R5TAS2RAHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HIM5GV2YFM6IDT44R5TAS2RAHJ","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":"4236d0a822170aaa035f200f008233027f4bac068b17e6dc2665457ef0d45c54","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-07-01T16:59:13Z","title_canon_sha256":"ae6be5a95ea8575f310f97221b66767bcbf0865850209df4ad387d858da649f3"},"schema_version":"1.0","source":{"id":"1607.00315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00315","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00315v1","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00315","created_at":"2026-05-18T01:11:37Z"},{"alias_kind":"pith_short_12","alias_value":"HIM5GV2YFM6I","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HIM5GV2YFM6IDT44","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HIM5GV2Y","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:9c1bbcd2d522a26148a2f09bdae0736bff7a5f27254ed0df8d052869debc974d","target":"graph","created_at":"2026-05-18T01:11:37Z","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"},"paper":{"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","authors_text":"Eran Treister, Irad Yavneh, Javier S. Turek","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-07-01T16:59:13Z","title":"A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00315","kind":"arxiv","version":1},"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:0fd64fc051dba8ed8f4d07e92b3ccb8ce9737914db1f412b99f21d803adbcf5c","target":"record","created_at":"2026-05-18T01:11:37Z","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":"4236d0a822170aaa035f200f008233027f4bac068b17e6dc2665457ef0d45c54","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-07-01T16:59:13Z","title_canon_sha256":"ae6be5a95ea8575f310f97221b66767bcbf0865850209df4ad387d858da649f3"},"schema_version":"1.0","source":{"id":"1607.00315","kind":"arxiv","version":1}},"canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a19d357582b3c81cf9c8f66096a203a77a1374374c18355eaf69d68cf2746b6","first_computed_at":"2026-05-18T01:11:37.680805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:37.680805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ckI0+CKY1KJGSskfuLCAgvLJ34kSPXv9k1b8+WEfoPhgWBjsTg069M1XXTVcm22YUcFQPBjo6uKkR5ZpiVwXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:37.681255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fd64fc051dba8ed8f4d07e92b3ccb8ce9737914db1f412b99f21d803adbcf5c","sha256:9c1bbcd2d522a26148a2f09bdae0736bff7a5f27254ed0df8d052869debc974d"],"state_sha256":"3a389c69171a6b644cd1c7906d57d79e3d2e5d82c395ad3b2a3eb72c9177c0e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UX5edy07gOUNAYjcIcYcwZleF1dXxkg8fnrbiXXEcy9tJniCBoLlg9ZiHW0capJ77dKP4/h+wiWFfcGUp20XCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:38:28.390670Z","bundle_sha256":"547ae4550d3947b2f99ed0f7738b34d1c0d4dcc8eb54f7177526a3b48af59e58"}}