{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BWUUFR2T4SHVKKAGXPV4TJNHCL","short_pith_number":"pith:BWUUFR2T","canonical_record":{"source":{"id":"1205.2631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"5f2e8c2eded15745c4c3506ab503c89f827f4ad5c0bc54227baff624c67c2cd0","abstract_canon_sha256":"f22ed150756f5e7621ec3001446ae81f3e591acdbabc4c6276bdf63c8226db44"},"schema_version":"1.0"},"canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","source":{"kind":"arxiv","id":"1205.2631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2631","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2631v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2631","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"BWUUFR2T4SHV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWUUFR2T4SHVKKAG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWUUFR2T","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BWUUFR2T4SHVKKAGXPV4TJNHCL","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"5f2e8c2eded15745c4c3506ab503c89f827f4ad5c0bc54227baff624c67c2cd0","abstract_canon_sha256":"f22ed150756f5e7621ec3001446ae81f3e591acdbabc4c6276bdf63c8226db44"},"schema_version":"1.0"},"canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.775391Z","signature_b64":"c0OVcaBi3if+t3ShqRFzTX4t/aCX7pRKL7Zvf/y26j0mFMR0f/gLtNJEzBUk79p4OzM1fyo1y2BcBCzglBwGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","last_reissued_at":"2026-05-18T03:55:47.774584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.774584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2631","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIiwEk4U9viaUYekMBNHQ2rhhBPdDU7Tu9KdFdwyIZszAF5XNCs+OEW0FxEElMyxvx12OLetiYUggYU18c5rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:24:33.428905Z"},"content_sha256":"0b0e222fd082de666f05a64e71f3d077d70bb1ce797082850fb1537694da62e0","schema_version":"1.0","event_id":"sha256:0b0e222fd082de666f05a64e71f3d077d70bb1ce797082850fb1537694da62e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BWUUFR2T4SHVKKAGXPV4TJNHCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jieping Ye, Jun Liu, Shuiwang Ji","submitted_at":"2012-05-09T17:09:42Z","abstract_excerpt":"The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assuming a suitable prior from the exponential family. One appealing feature of the l2,1-norm regularization is that it encourages multiple predictors to share similar sparsity patterns. However, the resulting optimization problem is challenging to solve due to the non-smoothness of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2631","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-18T03:55:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rscX96FlVPy/yvVb/HOzAKnw9XAa43bJ+qRp8mxw2FQokM2h1QlhN/9fSr9Tia6lX+VkqRPCNoODucT3AjkyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:24:33.429651Z"},"content_sha256":"495356aa5d371980bd098349605c89c960a193e65a720a2476cb730e8868524f","schema_version":"1.0","event_id":"sha256:495356aa5d371980bd098349605c89c960a193e65a720a2476cb730e8868524f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/bundle.json","state_url":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/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-06-10T08:24:33Z","links":{"resolver":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL","bundle":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/bundle.json","state":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BWUUFR2T4SHVKKAGXPV4TJNHCL","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":"f22ed150756f5e7621ec3001446ae81f3e591acdbabc4c6276bdf63c8226db44","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","title_canon_sha256":"5f2e8c2eded15745c4c3506ab503c89f827f4ad5c0bc54227baff624c67c2cd0"},"schema_version":"1.0","source":{"id":"1205.2631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2631","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2631v1","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2631","created_at":"2026-05-18T03:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"BWUUFR2T4SHV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWUUFR2T4SHVKKAG","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWUUFR2T","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:495356aa5d371980bd098349605c89c960a193e65a720a2476cb730e8868524f","target":"graph","created_at":"2026-05-18T03:55:47Z","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":"The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assuming a suitable prior from the exponential family. One appealing feature of the l2,1-norm regularization is that it encourages multiple predictors to share similar sparsity patterns. However, the resulting optimization problem is challenging to solve due to the non-smoothness of t","authors_text":"Jieping Ye, Jun Liu, Shuiwang Ji","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","title":"Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2631","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:0b0e222fd082de666f05a64e71f3d077d70bb1ce797082850fb1537694da62e0","target":"record","created_at":"2026-05-18T03:55:47Z","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":"f22ed150756f5e7621ec3001446ae81f3e591acdbabc4c6276bdf63c8226db44","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","title_canon_sha256":"5f2e8c2eded15745c4c3506ab503c89f827f4ad5c0bc54227baff624c67c2cd0"},"schema_version":"1.0","source":{"id":"1205.2631","kind":"arxiv","version":1}},"canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","first_computed_at":"2026-05-18T03:55:47.774584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:47.774584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0OVcaBi3if+t3ShqRFzTX4t/aCX7pRKL7Zvf/y26j0mFMR0f/gLtNJEzBUk79p4OzM1fyo1y2BcBCzglBwGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:47.775391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b0e222fd082de666f05a64e71f3d077d70bb1ce797082850fb1537694da62e0","sha256:495356aa5d371980bd098349605c89c960a193e65a720a2476cb730e8868524f"],"state_sha256":"1afb970b770780698d959f01b52e2ca0b646ee57db04290cd22e34b296e1675f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7LajC9yyfH10UySJIKG4gRDYNXPPoXaQZwjsYC3v4C4F4Vw5fcMlWJCaf6OVHi5o2QC4ymiy4aA3zoFgdMeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:24:33.434782Z","bundle_sha256":"ebb7c405ff57a658b4fcffafe423071fc08f2fba2de42055790558839897690d"}}