{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ILGCW5MHM2T3BLONUQNWRUYRUR","short_pith_number":"pith:ILGCW5MH","canonical_record":{"source":{"id":"1208.3014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-08-15T01:54:31Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"1930f278f7eb7a42510c088979226eb434cb968ffced616fe2e5e785b1c9e9ca","abstract_canon_sha256":"08d89ef8052ac32b0edcda8362c4b8a211546998ac1494b446a7f89f256bb01c"},"schema_version":"1.0"},"canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","source":{"kind":"arxiv","id":"1208.3014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3014","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3014v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3014","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"ILGCW5MHM2T3","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILGCW5MHM2T3BLON","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILGCW5MH","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ILGCW5MHM2T3BLONUQNWRUYRUR","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-08-15T01:54:31Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"1930f278f7eb7a42510c088979226eb434cb968ffced616fe2e5e785b1c9e9ca","abstract_canon_sha256":"08d89ef8052ac32b0edcda8362c4b8a211546998ac1494b446a7f89f256bb01c"},"schema_version":"1.0"},"canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.800339Z","signature_b64":"upA6/WwL2T7yqClbEVoKmArj7qBwlskDSrsiiIUVvXgh/YMErC3aeoQ8glyhwTv4WWZh7X5LHuY4XdQNPCryAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","last_reissued_at":"2026-05-18T03:48:45.799714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.799714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3014","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l81TZVB6rlBr7AkNBwRjBkV2H4/ts9lcV9GE5uJInfZnZBM1OXJuI+HxdkR0geRBC/MsHWh115K6aUHW5/f4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:55:26.931804Z"},"content_sha256":"8e11b7dbbd91f9dc3c52e6f09f85a1a8d2946fdff40d904debba45077b803f00","schema_version":"1.0","event_id":"sha256:8e11b7dbbd91f9dc3c52e6f09f85a1a8d2946fdff40d904debba45077b803f00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ILGCW5MHM2T3BLONUQNWRUYRUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithm for Extremely Large Multi-task Regression with Massive Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Seunghak Lee","submitted_at":"2012-08-15T01:54:31Z","abstract_excerpt":"We develop a highly scalable optimization method called \"hierarchical group-thresholding\" for solving a multi-task regression model with complex structured sparsity constraints on both input and output spaces. Despite the recent emergence of several efficient optimization algorithms for tackling complex sparsity-inducing regularizers, true scalability in practical high-dimensional problems where a huge amount (e.g., millions) of sparsity patterns need to be enforced remains an open challenge, because all existing algorithms must deal with ALL such patterns exhaustively in every iteration, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3014","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6HOJN//ckwmGsBC/a5UE75tjTqvuSIFsA81zPlXLTaes8Rt4vnavNkoQ/ADBaYIAfnM4ycaNL/t0JsGJaXxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:55:26.932139Z"},"content_sha256":"18c62f6a1c24ab849b8876b58e4d18fcd9a32b9cb708bea20682682cb3bbddc0","schema_version":"1.0","event_id":"sha256:18c62f6a1c24ab849b8876b58e4d18fcd9a32b9cb708bea20682682cb3bbddc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/bundle.json","state_url":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/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-02T04:55:26Z","links":{"resolver":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR","bundle":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/bundle.json","state":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ILGCW5MHM2T3BLONUQNWRUYRUR","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":"08d89ef8052ac32b0edcda8362c4b8a211546998ac1494b446a7f89f256bb01c","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-08-15T01:54:31Z","title_canon_sha256":"1930f278f7eb7a42510c088979226eb434cb968ffced616fe2e5e785b1c9e9ca"},"schema_version":"1.0","source":{"id":"1208.3014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3014","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3014v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3014","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"ILGCW5MHM2T3","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILGCW5MHM2T3BLON","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILGCW5MH","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:18c62f6a1c24ab849b8876b58e4d18fcd9a32b9cb708bea20682682cb3bbddc0","target":"graph","created_at":"2026-05-18T03:48:45Z","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":"We develop a highly scalable optimization method called \"hierarchical group-thresholding\" for solving a multi-task regression model with complex structured sparsity constraints on both input and output spaces. Despite the recent emergence of several efficient optimization algorithms for tackling complex sparsity-inducing regularizers, true scalability in practical high-dimensional problems where a huge amount (e.g., millions) of sparsity patterns need to be enforced remains an open challenge, because all existing algorithms must deal with ALL such patterns exhaustively in every iteration, whic","authors_text":"Eric P. Xing, Seunghak Lee","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-08-15T01:54:31Z","title":"Efficient Algorithm for Extremely Large Multi-task Regression with Massive Structured Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3014","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:8e11b7dbbd91f9dc3c52e6f09f85a1a8d2946fdff40d904debba45077b803f00","target":"record","created_at":"2026-05-18T03:48:45Z","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":"08d89ef8052ac32b0edcda8362c4b8a211546998ac1494b446a7f89f256bb01c","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-08-15T01:54:31Z","title_canon_sha256":"1930f278f7eb7a42510c088979226eb434cb968ffced616fe2e5e785b1c9e9ca"},"schema_version":"1.0","source":{"id":"1208.3014","kind":"arxiv","version":1}},"canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","first_computed_at":"2026-05-18T03:48:45.799714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:45.799714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upA6/WwL2T7yqClbEVoKmArj7qBwlskDSrsiiIUVvXgh/YMErC3aeoQ8glyhwTv4WWZh7X5LHuY4XdQNPCryAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:45.800339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e11b7dbbd91f9dc3c52e6f09f85a1a8d2946fdff40d904debba45077b803f00","sha256:18c62f6a1c24ab849b8876b58e4d18fcd9a32b9cb708bea20682682cb3bbddc0"],"state_sha256":"4f4519b5b97dd72f694e90bc95808516a06bafa1225853f6a9cf068e8fe4d68a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7GALPhw7m6753VkQrYYQzPYk/o7jsqQ2JJPdAR5TDteobHVWp0U0b3SbJsEtr1he4fNK8TiJJNLd8VyUnG7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:55:26.934094Z","bundle_sha256":"6112b289eac7d53e980e39d0c6b28a97c1244afc57477496bc9bc55177ab73e7"}}