{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5IOCT2QRTGYGCSL2FAV4OFHJSD","short_pith_number":"pith:5IOCT2QR","canonical_record":{"source":{"id":"1406.4465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9e09c4bea37a03a43ccc358f853d1447675af719ac2a6272f17cd95ed469b5f8","abstract_canon_sha256":"c7fc45049d07ad6fa408a12ffd516dc195977382c68d33fb1ea173ffc7d5994c"},"schema_version":"1.0"},"canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","source":{"kind":"arxiv","id":"1406.4465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4465","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4465v2","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4465","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"5IOCT2QRTGYG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IOCT2QRTGYGCSL2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IOCT2QR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5IOCT2QRTGYGCSL2FAV4OFHJSD","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9e09c4bea37a03a43ccc358f853d1447675af719ac2a6272f17cd95ed469b5f8","abstract_canon_sha256":"c7fc45049d07ad6fa408a12ffd516dc195977382c68d33fb1ea173ffc7d5994c"},"schema_version":"1.0"},"canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:38.730271Z","signature_b64":"ZYm5TF9McQQuSnv68z57qDIDZPafVuUBU1ayj9jwKcMuLGKHCVrl6aoaHkBQCkhC6WXBEzl5Vp5PJ2rCbJlRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","last_reissued_at":"2026-05-18T01:59:38.729510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:38.729510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4465","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-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnxUbN0+Y6RmmHkZN94+NYGq8B4klg8q7tFNqziYkiyIztJvyDqgMFWitHNwbxIhdGvnmGF41RYFM8B1tcEUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:32:49.035426Z"},"content_sha256":"97f61bc7b65a05ada0c4651c3fe59056ac97131e54f2e0de586021eb801555d0","schema_version":"1.0","event_id":"sha256:97f61bc7b65a05ada0c4651c3fe59056ac97131e54f2e0de586021eb801555d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5IOCT2QRTGYGCSL2FAV4OFHJSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-stage Multi-task feature learning via adaptive threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yaru Fan, Yilun Wang","submitted_at":"2014-06-16T12:47:37Z","abstract_excerpt":"Multi-task feature learning aims to identity the shared features among tasks to improve generalization. It has been shown that by minimizing non-convex learning models, a better solution than the convex alternatives can be obtained. Therefore, a non-convex model based on the capped-$\\ell_{1},\\ell_{1}$ regularization was proposed in \\cite{Gong2013}, and a corresponding efficient multi-stage multi-task feature learning algorithm (MSMTFL) was presented. However, this algorithm harnesses a prescribed fixed threshold in the definition of the capped-$\\ell_{1},\\ell_{1}$ regularization and the lack of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4465","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-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQhH8RCc02UHwhAEJxx7Ze0UtF+ZkXsxXVuHWbwLcyxEJZuEb0yLhCmcPuZgIlMoc6daEXmklmK2vtYaIiUfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:32:49.036194Z"},"content_sha256":"e3942bce99c642cf43e214c7fad5cf8699d307bc0f3a6c04652c386cf52e0a48","schema_version":"1.0","event_id":"sha256:e3942bce99c642cf43e214c7fad5cf8699d307bc0f3a6c04652c386cf52e0a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/bundle.json","state_url":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/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-09T18:32:49Z","links":{"resolver":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD","bundle":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/bundle.json","state":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5IOCT2QRTGYGCSL2FAV4OFHJSD","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":"c7fc45049d07ad6fa408a12ffd516dc195977382c68d33fb1ea173ffc7d5994c","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","title_canon_sha256":"9e09c4bea37a03a43ccc358f853d1447675af719ac2a6272f17cd95ed469b5f8"},"schema_version":"1.0","source":{"id":"1406.4465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4465","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4465v2","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4465","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"5IOCT2QRTGYG","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IOCT2QRTGYGCSL2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IOCT2QR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:e3942bce99c642cf43e214c7fad5cf8699d307bc0f3a6c04652c386cf52e0a48","target":"graph","created_at":"2026-05-18T01:59:38Z","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":"Multi-task feature learning aims to identity the shared features among tasks to improve generalization. It has been shown that by minimizing non-convex learning models, a better solution than the convex alternatives can be obtained. Therefore, a non-convex model based on the capped-$\\ell_{1},\\ell_{1}$ regularization was proposed in \\cite{Gong2013}, and a corresponding efficient multi-stage multi-task feature learning algorithm (MSMTFL) was presented. However, this algorithm harnesses a prescribed fixed threshold in the definition of the capped-$\\ell_{1},\\ell_{1}$ regularization and the lack of","authors_text":"Yaru Fan, Yilun Wang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","title":"Multi-stage Multi-task feature learning via adaptive threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4465","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:97f61bc7b65a05ada0c4651c3fe59056ac97131e54f2e0de586021eb801555d0","target":"record","created_at":"2026-05-18T01:59:38Z","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":"c7fc45049d07ad6fa408a12ffd516dc195977382c68d33fb1ea173ffc7d5994c","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","title_canon_sha256":"9e09c4bea37a03a43ccc358f853d1447675af719ac2a6272f17cd95ed469b5f8"},"schema_version":"1.0","source":{"id":"1406.4465","kind":"arxiv","version":2}},"canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","first_computed_at":"2026-05-18T01:59:38.729510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:38.729510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZYm5TF9McQQuSnv68z57qDIDZPafVuUBU1ayj9jwKcMuLGKHCVrl6aoaHkBQCkhC6WXBEzl5Vp5PJ2rCbJlRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:38.730271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97f61bc7b65a05ada0c4651c3fe59056ac97131e54f2e0de586021eb801555d0","sha256:e3942bce99c642cf43e214c7fad5cf8699d307bc0f3a6c04652c386cf52e0a48"],"state_sha256":"7a1e09de339c133703fabba455bcc16f0b79b916704d5520ce56332fb908da74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIlTag0cPLHEg0IEzornPMTgUZRijt97j1c9tzy3euuNhFN2rCGCJlXy/tUcSQoF7e7IEXvrod/bvpJM6YhxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:32:49.040308Z","bundle_sha256":"939048855e4b47b1273be97831efa96de49c882716cedd54a04d1f5653665a51"}}