{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ILGCW5MHM2T3BLONUQNWRUYRUR","short_pith_number":"pith:ILGCW5MH","schema_version":"1.0","canonical_sha256":"42cc2b758766a7b0adcda41b68d311a441d275c80ff491cfc54c1d6e53e7839a","source":{"kind":"arxiv","id":"1208.3014","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.3014","created_at":"2026-05-18T03:48:45.799786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3014v1","created_at":"2026-05-18T03:48:45.799786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3014","created_at":"2026-05-18T03:48:45.799786+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILGCW5MHM2T3","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILGCW5MHM2T3BLON","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILGCW5MH","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR","json":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR.json","graph_json":"https://pith.science/api/pith-number/ILGCW5MHM2T3BLONUQNWRUYRUR/graph.json","events_json":"https://pith.science/api/pith-number/ILGCW5MHM2T3BLONUQNWRUYRUR/events.json","paper":"https://pith.science/paper/ILGCW5MH"},"agent_actions":{"view_html":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR","download_json":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR.json","view_paper":"https://pith.science/paper/ILGCW5MH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3014&json=true","fetch_graph":"https://pith.science/api/pith-number/ILGCW5MHM2T3BLONUQNWRUYRUR/graph.json","fetch_events":"https://pith.science/api/pith-number/ILGCW5MHM2T3BLONUQNWRUYRUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/action/storage_attestation","attest_author":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/action/author_attestation","sign_citation":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/action/citation_signature","submit_replication":"https://pith.science/pith/ILGCW5MHM2T3BLONUQNWRUYRUR/action/replication_record"}},"created_at":"2026-05-18T03:48:45.799786+00:00","updated_at":"2026-05-18T03:48:45.799786+00:00"}