{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E33NQWDHAMPTFQC7GZGUMWBAZX","short_pith_number":"pith:E33NQWDH","canonical_record":{"source":{"id":"1311.5422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-20T16:45:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d077b8883a811eaadabaa68799eb53ed1dcb09f1977b2f0b20e011b84b874be8","abstract_canon_sha256":"9e2dfd1cbbc138a9505e1193ee48ed3bea77b0228d5dfb2b4a9c3e889680eff9"},"schema_version":"1.0"},"canonical_sha256":"26f6d85867031f32c05f364d465820cdcf317dc457eaf0157037627a54e17bb9","source":{"kind":"arxiv","id":"1311.5422","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5422","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5422v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5422","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"E33NQWDHAMPT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E33NQWDHAMPTFQC7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E33NQWDH","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E33NQWDHAMPTFQC7GZGUMWBAZX","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-20T16:45:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d077b8883a811eaadabaa68799eb53ed1dcb09f1977b2f0b20e011b84b874be8","abstract_canon_sha256":"9e2dfd1cbbc138a9505e1193ee48ed3bea77b0228d5dfb2b4a9c3e889680eff9"},"schema_version":"1.0"},"canonical_sha256":"26f6d85867031f32c05f364d465820cdcf317dc457eaf0157037627a54e17bb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:32.075524Z","signature_b64":"jebM23V1VAcR3dww5LEVU+Ws/OmRIa/1Xk/lCYZs38kRB7SbqcR+iPFLs5+gqfPFiRfrtqqudKnI/xGWjtKqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26f6d85867031f32c05f364d465820cdcf317dc457eaf0157037627a54e17bb9","last_reissued_at":"2026-05-18T03:06:32.074646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:32.074646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5422","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-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Swtv1BkOt7alulpXS8eMyTYE6r22UY9KG++bA2JIm9pDC69FDF2dNA2PpJTn9/Mxxdo2FCsmbSiB/L5UYm3sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:46:24.749590Z"},"content_sha256":"52d3eea7ab90a05d94b336fa5c5db3bea719ed01afccc8fbb0ec7ef9e2e2916d","schema_version":"1.0","event_id":"sha256:52d3eea7ab90a05d94b336fa5c5db3bea719ed01afccc8fbb0ec7ef9e2e2916d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E33NQWDHAMPTFQC7GZGUMWBAZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysis","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":"2013-11-20T16:45:51Z","abstract_excerpt":"Multitask learning can be effective when features useful in one task are also useful for other tasks, and the group lasso is a standard method for selecting a common subset of features. In this paper, we are interested in a less restrictive form of multitask learning, wherein (1) the available features can be organized into subsets according to a notion of similarity and (2) features useful in one task are similar, but not necessarily identical, to the features best suited for other tasks. The main contribution of this paper is a new procedure called Sparse Overlapping Sets (SOS) lasso, a conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5422","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-18T03:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqqj4NaxiTUHHQDLHUD6361MGt2y43zYypaNJywva+E1fgP4Ti6j044djsRPq3EdLP/CtToQXfTmQgnBENO3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:46:24.749948Z"},"content_sha256":"d8512b82d819d389915f6caa4688a390db567a3e833d46281750f2998077ef32","schema_version":"1.0","event_id":"sha256:d8512b82d819d389915f6caa4688a390db567a3e833d46281750f2998077ef32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/bundle.json","state_url":"https://pith.science/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/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-27T23:46:24Z","links":{"resolver":"https://pith.science/pith/E33NQWDHAMPTFQC7GZGUMWBAZX","bundle":"https://pith.science/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/bundle.json","state":"https://pith.science/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E33NQWDHAMPTFQC7GZGUMWBAZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E33NQWDHAMPTFQC7GZGUMWBAZX","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":"9e2dfd1cbbc138a9505e1193ee48ed3bea77b0228d5dfb2b4a9c3e889680eff9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-20T16:45:51Z","title_canon_sha256":"d077b8883a811eaadabaa68799eb53ed1dcb09f1977b2f0b20e011b84b874be8"},"schema_version":"1.0","source":{"id":"1311.5422","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5422","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5422v2","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5422","created_at":"2026-05-18T03:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"E33NQWDHAMPT","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E33NQWDHAMPTFQC7","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E33NQWDH","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d8512b82d819d389915f6caa4688a390db567a3e833d46281750f2998077ef32","target":"graph","created_at":"2026-05-18T03:06:32Z","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":"Multitask learning can be effective when features useful in one task are also useful for other tasks, and the group lasso is a standard method for selecting a common subset of features. In this paper, we are interested in a less restrictive form of multitask learning, wherein (1) the available features can be organized into subsets according to a notion of similarity and (2) features useful in one task are similar, but not necessarily identical, to the features best suited for other tasks. The main contribution of this paper is a new procedure called Sparse Overlapping Sets (SOS) lasso, a conv","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":"2013-11-20T16:45:51Z","title":"Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5422","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:52d3eea7ab90a05d94b336fa5c5db3bea719ed01afccc8fbb0ec7ef9e2e2916d","target":"record","created_at":"2026-05-18T03:06:32Z","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":"9e2dfd1cbbc138a9505e1193ee48ed3bea77b0228d5dfb2b4a9c3e889680eff9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-20T16:45:51Z","title_canon_sha256":"d077b8883a811eaadabaa68799eb53ed1dcb09f1977b2f0b20e011b84b874be8"},"schema_version":"1.0","source":{"id":"1311.5422","kind":"arxiv","version":2}},"canonical_sha256":"26f6d85867031f32c05f364d465820cdcf317dc457eaf0157037627a54e17bb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26f6d85867031f32c05f364d465820cdcf317dc457eaf0157037627a54e17bb9","first_computed_at":"2026-05-18T03:06:32.074646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:32.074646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jebM23V1VAcR3dww5LEVU+Ws/OmRIa/1Xk/lCYZs38kRB7SbqcR+iPFLs5+gqfPFiRfrtqqudKnI/xGWjtKqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:32.075524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5422","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d3eea7ab90a05d94b336fa5c5db3bea719ed01afccc8fbb0ec7ef9e2e2916d","sha256:d8512b82d819d389915f6caa4688a390db567a3e833d46281750f2998077ef32"],"state_sha256":"992bfe8c01a588b7ee6bc51c6c16e2913a9a54bb9b209bccdc98c703a1046b42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pJwrvRzBWeTcWlH4PT2K9q4OwOwjdO6vrKuBPbI2AnzGic/JV0+v6xvDFacnyNZdtGtbqgHYgUYuJsMFJwJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:46:24.752119Z","bundle_sha256":"c6df3d6718d37859c462fbf6fe2aa06ca5b6bc7f45b1edbb2fcc02a5ad39d5f3"}}