{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JYO3STRFQG2OEA2GQY4TGPYXAX","short_pith_number":"pith:JYO3STRF","canonical_record":{"source":{"id":"1104.2748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-04-14T13:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"464845dc210f1552834a6bfa5410dd6d783056d851baec7d960c829da4e9b165","abstract_canon_sha256":"e9411edfe8ce278eb25a962c59df93d2d9820d204411df1df301c864101d2730"},"schema_version":"1.0"},"canonical_sha256":"4e1db94e2581b4e203468639333f1705d8658a165afd402bd432fd5aa5e24e12","source":{"kind":"arxiv","id":"1104.2748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2748","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2748v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2748","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"JYO3STRFQG2O","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JYO3STRFQG2OEA2G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JYO3STRF","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JYO3STRFQG2OEA2GQY4TGPYXAX","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-04-14T13:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"464845dc210f1552834a6bfa5410dd6d783056d851baec7d960c829da4e9b165","abstract_canon_sha256":"e9411edfe8ce278eb25a962c59df93d2d9820d204411df1df301c864101d2730"},"schema_version":"1.0"},"canonical_sha256":"4e1db94e2581b4e203468639333f1705d8658a165afd402bd432fd5aa5e24e12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:26.904843Z","signature_b64":"I5IIKgwPrV7Q+shNPEeYqP0pXjARo/Kyb/YbaxdVV8PexwnWnjYcz+NAy3v43xeQi9Oips9TfOVThhy3HrnZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e1db94e2581b4e203468639333f1705d8658a165afd402bd432fd5aa5e24e12","last_reissued_at":"2026-05-18T04:24:26.904164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:26.904164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2748","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYp9laFNqpC4ajywUgs+/jobOypZmZh8OelNHki6YcjY82LdwVgTuui57Rprk4tn9kQsL07zLrlbubTcOq2ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:49.626274Z"},"content_sha256":"b76e40a8d4f08cab969b7f6ef64fe4b391ae19b76495487da8b01ae788775bb8","schema_version":"1.0","event_id":"sha256:b76e40a8d4f08cab969b7f6ef64fe4b391ae19b76495487da8b01ae788775bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JYO3STRFQG2OEA2GQY4TGPYXAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Jian Huang, Patrick Breheny","submitted_at":"2011-04-14T13:00:34Z","abstract_excerpt":"A number of variable selection methods have been proposed involving nonconvex penalty functions. These methods, which include the smoothly clipped absolute deviation (SCAD) penalty and the minimax concave penalty (MCP), have been demonstrated to have attractive theoretical properties, but model fitting is not a straightforward task, and the resulting solutions may be unstable. Here, we demonstrate the potential of coordinate descent algorithms for fitting these models, establishing theoretical convergence properties and demonstrating that they are significantly faster than competing approaches"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2748","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"285cFzizBY1qX/Jl7VoaipbkDJTjedNJz9bufS73IoFrXMAXWVlWbMA9TYBjUrDo3DHCBJ1qNut2um4CY+F0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:49.626641Z"},"content_sha256":"b7419096a7b3a2a9fa1ea66b608c5ad69fd41f4812ebd454c2605bd824451549","schema_version":"1.0","event_id":"sha256:b7419096a7b3a2a9fa1ea66b608c5ad69fd41f4812ebd454c2605bd824451549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/bundle.json","state_url":"https://pith.science/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/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-30T05:26:49Z","links":{"resolver":"https://pith.science/pith/JYO3STRFQG2OEA2GQY4TGPYXAX","bundle":"https://pith.science/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/bundle.json","state":"https://pith.science/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYO3STRFQG2OEA2GQY4TGPYXAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JYO3STRFQG2OEA2GQY4TGPYXAX","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":"e9411edfe8ce278eb25a962c59df93d2d9820d204411df1df301c864101d2730","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-04-14T13:00:34Z","title_canon_sha256":"464845dc210f1552834a6bfa5410dd6d783056d851baec7d960c829da4e9b165"},"schema_version":"1.0","source":{"id":"1104.2748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2748","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2748v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2748","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"JYO3STRFQG2O","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JYO3STRFQG2OEA2G","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JYO3STRF","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b7419096a7b3a2a9fa1ea66b608c5ad69fd41f4812ebd454c2605bd824451549","target":"graph","created_at":"2026-05-18T04:24:26Z","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":"A number of variable selection methods have been proposed involving nonconvex penalty functions. These methods, which include the smoothly clipped absolute deviation (SCAD) penalty and the minimax concave penalty (MCP), have been demonstrated to have attractive theoretical properties, but model fitting is not a straightforward task, and the resulting solutions may be unstable. Here, we demonstrate the potential of coordinate descent algorithms for fitting these models, establishing theoretical convergence properties and demonstrating that they are significantly faster than competing approaches","authors_text":"Jian Huang, Patrick Breheny","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-04-14T13:00:34Z","title":"Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2748","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:b76e40a8d4f08cab969b7f6ef64fe4b391ae19b76495487da8b01ae788775bb8","target":"record","created_at":"2026-05-18T04:24:26Z","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":"e9411edfe8ce278eb25a962c59df93d2d9820d204411df1df301c864101d2730","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-04-14T13:00:34Z","title_canon_sha256":"464845dc210f1552834a6bfa5410dd6d783056d851baec7d960c829da4e9b165"},"schema_version":"1.0","source":{"id":"1104.2748","kind":"arxiv","version":1}},"canonical_sha256":"4e1db94e2581b4e203468639333f1705d8658a165afd402bd432fd5aa5e24e12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e1db94e2581b4e203468639333f1705d8658a165afd402bd432fd5aa5e24e12","first_computed_at":"2026-05-18T04:24:26.904164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:26.904164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5IIKgwPrV7Q+shNPEeYqP0pXjARo/Kyb/YbaxdVV8PexwnWnjYcz+NAy3v43xeQi9Oips9TfOVThhy3HrnZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:26.904843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76e40a8d4f08cab969b7f6ef64fe4b391ae19b76495487da8b01ae788775bb8","sha256:b7419096a7b3a2a9fa1ea66b608c5ad69fd41f4812ebd454c2605bd824451549"],"state_sha256":"4067d81fd0a09efdbb9e966cea5eeb5d385c5fcd5d4295de56603ffec3f1517f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WvJjw+v/B7/fY96Mg1/9GJQolPFxvWhCUwvVftTYu+oxA/NYZk4oKgWapFZHqaYxqGEDRi8q4cjDGwVxSeHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:26:49.628601Z","bundle_sha256":"652e50e9386d662f098cd85fe1c1ec27f035cd4f329598cfc69ffb4ff38ffc04"}}