{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XLZHW4B3JB3MFOQ5IHJRPEJK44","short_pith_number":"pith:XLZHW4B3","canonical_record":{"source":{"id":"1402.4512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-18T22:08:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"af7b33dbbf96835b07b484c9478ea710bcbc3b0f3f1682e1b85bcc9eafc6c793","abstract_canon_sha256":"7d5675b2e11dc43127ab682f024dca11486be0e49008aa55ca192013fe06059e"},"schema_version":"1.0"},"canonical_sha256":"baf27b703b4876c2ba1d41d317912ae7308b5b30146e36695a335fa8f6f68b84","source":{"kind":"arxiv","id":"1402.4512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4512","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4512v2","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4512","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"XLZHW4B3JB3M","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XLZHW4B3JB3MFOQ5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XLZHW4B3","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XLZHW4B3JB3MFOQ5IHJRPEJK44","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-18T22:08:50Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"af7b33dbbf96835b07b484c9478ea710bcbc3b0f3f1682e1b85bcc9eafc6c793","abstract_canon_sha256":"7d5675b2e11dc43127ab682f024dca11486be0e49008aa55ca192013fe06059e"},"schema_version":"1.0"},"canonical_sha256":"baf27b703b4876c2ba1d41d317912ae7308b5b30146e36695a335fa8f6f68b84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:36.391788Z","signature_b64":"aE3Df1wr7bU7Vmb4+I3yT3pfNLz6f67ay+tdvIUwhfiol8voPlQJoTT9WpH4r1OYVOUV2m4p10sskpapffseDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf27b703b4876c2ba1d41d317912ae7308b5b30146e36695a335fa8f6f68b84","last_reissued_at":"2026-05-18T02:43:36.391209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:36.391209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4512","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-05-18T02:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8xigS759I75Gt25CfNQerMyU+zLx/v8hjS3BIutqFDhZQ70NEkwGPdmbKVnOlX4FKHI1mrgvZGhGkOcXrvHNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:13.014980Z"},"content_sha256":"2d0a268b805efc0ccb0c75a7325c00eabeddc73cb5ba6ec709cbbfa2b58a8ea1","schema_version":"1.0","event_id":"sha256:2d0a268b805efc0ccb0c75a7325c00eabeddc73cb5ba6ec709cbbfa2b58a8ea1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XLZHW4B3JB3MFOQ5IHJRPEJK44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification with Sparse Overlapping Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Cox, Nikhil Rao, Robert Nowak, Timothy Rogers","submitted_at":"2014-02-18T22:08:50Z","abstract_excerpt":"Classification with a sparsity constraint on the solution plays a central role in many high dimensional machine learning applications. In some cases, the features can be grouped together so that entire subsets of features can be selected or not selected. In many applications, however, this can be too restrictive. In this paper, we are interested in a less restrictive form of structured sparse feature selection: we assume that while features can be grouped according to some notion of similarity, not all features in a group need be selected for the task at hand. When the groups are comprised of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4512","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":""},"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-18T02:43:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUgPXcVOxhOAkNluKW0QqeHJeXwfh1058/pGl7F4f10mwE+yBwrT28kRCwOECwHGNNmxWOlh839awsnaZqcsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:33:13.015346Z"},"content_sha256":"6dd1f0c5a5b89d8b1990b0b066a8c5a14ba07fa068d3acdd6df58def8ca7381e","schema_version":"1.0","event_id":"sha256:6dd1f0c5a5b89d8b1990b0b066a8c5a14ba07fa068d3acdd6df58def8ca7381e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/bundle.json","state_url":"https://pith.science/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/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-28T08:33:13Z","links":{"resolver":"https://pith.science/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44","bundle":"https://pith.science/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/bundle.json","state":"https://pith.science/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLZHW4B3JB3MFOQ5IHJRPEJK44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XLZHW4B3JB3MFOQ5IHJRPEJK44","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":"7d5675b2e11dc43127ab682f024dca11486be0e49008aa55ca192013fe06059e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-18T22:08:50Z","title_canon_sha256":"af7b33dbbf96835b07b484c9478ea710bcbc3b0f3f1682e1b85bcc9eafc6c793"},"schema_version":"1.0","source":{"id":"1402.4512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4512","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4512v2","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4512","created_at":"2026-05-18T02:43:36Z"},{"alias_kind":"pith_short_12","alias_value":"XLZHW4B3JB3M","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XLZHW4B3JB3MFOQ5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XLZHW4B3","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:6dd1f0c5a5b89d8b1990b0b066a8c5a14ba07fa068d3acdd6df58def8ca7381e","target":"graph","created_at":"2026-05-18T02:43:36Z","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":"Classification with a sparsity constraint on the solution plays a central role in many high dimensional machine learning applications. In some cases, the features can be grouped together so that entire subsets of features can be selected or not selected. In many applications, however, this can be too restrictive. In this paper, we are interested in a less restrictive form of structured sparse feature selection: we assume that while features can be grouped according to some notion of similarity, not all features in a group need be selected for the task at hand. When the groups are comprised of ","authors_text":"Christopher Cox, Nikhil Rao, Robert Nowak, Timothy Rogers","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-18T22:08:50Z","title":"Classification with Sparse Overlapping Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4512","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:2d0a268b805efc0ccb0c75a7325c00eabeddc73cb5ba6ec709cbbfa2b58a8ea1","target":"record","created_at":"2026-05-18T02:43:36Z","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":"7d5675b2e11dc43127ab682f024dca11486be0e49008aa55ca192013fe06059e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-18T22:08:50Z","title_canon_sha256":"af7b33dbbf96835b07b484c9478ea710bcbc3b0f3f1682e1b85bcc9eafc6c793"},"schema_version":"1.0","source":{"id":"1402.4512","kind":"arxiv","version":2}},"canonical_sha256":"baf27b703b4876c2ba1d41d317912ae7308b5b30146e36695a335fa8f6f68b84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baf27b703b4876c2ba1d41d317912ae7308b5b30146e36695a335fa8f6f68b84","first_computed_at":"2026-05-18T02:43:36.391209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:36.391209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aE3Df1wr7bU7Vmb4+I3yT3pfNLz6f67ay+tdvIUwhfiol8voPlQJoTT9WpH4r1OYVOUV2m4p10sskpapffseDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:36.391788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d0a268b805efc0ccb0c75a7325c00eabeddc73cb5ba6ec709cbbfa2b58a8ea1","sha256:6dd1f0c5a5b89d8b1990b0b066a8c5a14ba07fa068d3acdd6df58def8ca7381e"],"state_sha256":"1d25790737732199cf1cdf0a9a119398de969400245c64c57af88c9829117183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/abOoDpM2sLBO9TCSr7RTvflwf7lIxnv5mTXtMltw1+Ado1AOQQKmJYf7RY68mGAvKWBeydLP6SWaBuWrELOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:33:13.017298Z","bundle_sha256":"0eb62e0e7fcaa9c00605657173e9123135362ef7a15514198bd7f65af9b47179"}}