{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3CRLTTNQDI75Q6M57M6LCLXZRE","short_pith_number":"pith:3CRLTTNQ","canonical_record":{"source":{"id":"1712.05910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-16T06:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"07e3a69b6c3c9eb6471b93010eb806c675d5077dd0876356ed4cb4a3dd2e254d","abstract_canon_sha256":"112e7b8b8c51316817ad4c349c55c58a10efa83a447de3bda4ea377b55c6643c"},"schema_version":"1.0"},"canonical_sha256":"d8a2b9cdb01a3fd8799dfb3cb12ef9892f8dc2253d62700d83b1ab095b66d8b6","source":{"kind":"arxiv","id":"1712.05910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05910","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05910v1","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05910","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"3CRLTTNQDI75","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_16","alias_value":"3CRLTTNQDI75Q6M5","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_8","alias_value":"3CRLTTNQ","created_at":"2026-07-05T01:45:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3CRLTTNQDI75Q6M57M6LCLXZRE","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-16T06:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"07e3a69b6c3c9eb6471b93010eb806c675d5077dd0876356ed4cb4a3dd2e254d","abstract_canon_sha256":"112e7b8b8c51316817ad4c349c55c58a10efa83a447de3bda4ea377b55c6643c"},"schema_version":"1.0"},"canonical_sha256":"d8a2b9cdb01a3fd8799dfb3cb12ef9892f8dc2253d62700d83b1ab095b66d8b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:00.357609Z","signature_b64":"udyZsOi3HWSw4g0hitikWgO+h5s9xoNIiOmCOXckY942ULlKD5OBj2PrJxFQIXaJejzWUTlRSsuXLOT1ty9kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a2b9cdb01a3fd8799dfb3cb12ef9892f8dc2253d62700d83b1ab095b66d8b6","last_reissued_at":"2026-07-05T01:45:00.357122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:00.357122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05910","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-07-05T01:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JrJXkF0v7V904sDJyxy9oXrvkwhtQoZt7+2iz90D8ESSE/m4I/yjQ7ICzSXHy8FlxLYneMc5jCejm0Pyh3LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:19:32.220765Z"},"content_sha256":"174e7ceac38795449e76b515ad7e82e6a8d50d329b3e21b90ceac3de09a87102","schema_version":"1.0","event_id":"sha256:174e7ceac38795449e76b515ad7e82e6a8d50d329b3e21b90ceac3de09a87102"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3CRLTTNQDI75Q6M57M6LCLXZRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ning Zhang, Yangjing Zhang","submitted_at":"2017-12-16T06:42:06Z","abstract_excerpt":"The sparse group Lasso is a widely used statistical model which encourages the sparsity both on a group and within the group level. In this paper, we develop an efficient augmented Lagrangian method for large-scale non-overlapping sparse group Lasso problems with each subproblem being solved by a superlinearly convergent inexact semismooth Newton method. Theoretically, we prove that, if the penalty parameter is chosen sufficiently large, the augmented Lagrangian method converges globally at an arbitrarily fast linear rate for the primal iterative sequence, the dual infeasibility, and the duali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05910","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.05910/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-05T01:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq2itpz7UzAjN0GvTd2q2yHS0j4FJdx760Wyui7i2G+vpzm1nrXe4gDGhy44ZOMCLm1fAJVJEusSXRCLMRiXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:19:32.221270Z"},"content_sha256":"48606509be2afea5b7282ccf01b0bcd85de1e05826610707e675662b936c128b","schema_version":"1.0","event_id":"sha256:48606509be2afea5b7282ccf01b0bcd85de1e05826610707e675662b936c128b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/bundle.json","state_url":"https://pith.science/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/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-04T11:19:32Z","links":{"resolver":"https://pith.science/pith/3CRLTTNQDI75Q6M57M6LCLXZRE","bundle":"https://pith.science/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/bundle.json","state":"https://pith.science/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CRLTTNQDI75Q6M57M6LCLXZRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3CRLTTNQDI75Q6M57M6LCLXZRE","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":"112e7b8b8c51316817ad4c349c55c58a10efa83a447de3bda4ea377b55c6643c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-16T06:42:06Z","title_canon_sha256":"07e3a69b6c3c9eb6471b93010eb806c675d5077dd0876356ed4cb4a3dd2e254d"},"schema_version":"1.0","source":{"id":"1712.05910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05910","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05910v1","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05910","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"3CRLTTNQDI75","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_16","alias_value":"3CRLTTNQDI75Q6M5","created_at":"2026-07-05T01:45:00Z"},{"alias_kind":"pith_short_8","alias_value":"3CRLTTNQ","created_at":"2026-07-05T01:45:00Z"}],"graph_snapshots":[{"event_id":"sha256:48606509be2afea5b7282ccf01b0bcd85de1e05826610707e675662b936c128b","target":"graph","created_at":"2026-07-05T01:45:00Z","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/1712.05910/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The sparse group Lasso is a widely used statistical model which encourages the sparsity both on a group and within the group level. In this paper, we develop an efficient augmented Lagrangian method for large-scale non-overlapping sparse group Lasso problems with each subproblem being solved by a superlinearly convergent inexact semismooth Newton method. Theoretically, we prove that, if the penalty parameter is chosen sufficiently large, the augmented Lagrangian method converges globally at an arbitrarily fast linear rate for the primal iterative sequence, the dual infeasibility, and the duali","authors_text":"Defeng Sun, Kim-Chuan Toh, Ning Zhang, Yangjing Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-16T06:42:06Z","title":"An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05910","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:174e7ceac38795449e76b515ad7e82e6a8d50d329b3e21b90ceac3de09a87102","target":"record","created_at":"2026-07-05T01:45:00Z","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":"112e7b8b8c51316817ad4c349c55c58a10efa83a447de3bda4ea377b55c6643c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-16T06:42:06Z","title_canon_sha256":"07e3a69b6c3c9eb6471b93010eb806c675d5077dd0876356ed4cb4a3dd2e254d"},"schema_version":"1.0","source":{"id":"1712.05910","kind":"arxiv","version":1}},"canonical_sha256":"d8a2b9cdb01a3fd8799dfb3cb12ef9892f8dc2253d62700d83b1ab095b66d8b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8a2b9cdb01a3fd8799dfb3cb12ef9892f8dc2253d62700d83b1ab095b66d8b6","first_computed_at":"2026-07-05T01:45:00.357122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:00.357122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udyZsOi3HWSw4g0hitikWgO+h5s9xoNIiOmCOXckY942ULlKD5OBj2PrJxFQIXaJejzWUTlRSsuXLOT1ty9kCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:00.357609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:174e7ceac38795449e76b515ad7e82e6a8d50d329b3e21b90ceac3de09a87102","sha256:48606509be2afea5b7282ccf01b0bcd85de1e05826610707e675662b936c128b"],"state_sha256":"ce2ad1ab0e25ddee16570b26e9fe9119afce54263cf99425ab41c1cdaf4194c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dM+ikKsKvPq25jpTtjzaN4X48OQb1n2HJ9RdbJQskmHopM6KS5NUbVaFkzVEruQDpamxhoD0MdA/Pp316QU7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:19:32.226242Z","bundle_sha256":"8f77019f731ad97ec596e22a7d989880a743f3c93941f34c7e5ebe8393b57095"}}