{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:OLXWZPYOBIHABQGBZ66UIMQPLD","short_pith_number":"pith:OLXWZPYO","schema_version":"1.0","canonical_sha256":"72ef6cbf0e0a0e00c0c1cfbd44320f58f067d6e21937a91c720c2bba7b2169c7","source":{"kind":"arxiv","id":"2107.07828","version":1},"attestation_state":"computed","paper":{"title":"Chi-square and normal inference in high-dimensional multi-task regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Gabriel Romon, Pierre C Bellec","submitted_at":"2021-07-16T11:19:49Z","abstract_excerpt":"The paper proposes chi-square and normal inference methodologies for the unknown coefficient matrix $B^*$ of size $p\\times T$ in a Multi-Task (MT) linear model with $p$ covariates, $T$ tasks and $n$ observations under a row-sparse assumption on $B^*$. The row-sparsity $s$, dimension $p$ and number of tasks $T$ are allowed to grow with $n$. In the high-dimensional regime $p\\ggg n$, in order to leverage row-sparsity, the MT Lasso is considered.\n  We build upon the MT Lasso with a de-biasing scheme to correct for the bias induced by the penalty. This scheme requires the introduction of a new data"},"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":"2107.07828","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-07-16T11:19:49Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"95b019a280c9ed96ee1b95375f791c89b0f224f17a5d4b597ad1cf7afc3dfbf5","abstract_canon_sha256":"0e00d042d707729c9c03a8ebc2b5b9bb15bc0af5494eef9e18cab6515097cd85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:29.725243Z","signature_b64":"CYA6AhlvvSYIVBPCIwsD40XUAZoDRiNse1JMu1AbinkSF2jRV0stoQNfBhM5mLXB4qhFkviVlm3Od0HAQOh7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ef6cbf0e0a0e00c0c1cfbd44320f58f067d6e21937a91c720c2bba7b2169c7","last_reissued_at":"2026-07-05T02:58:29.724799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:29.724799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chi-square and normal inference in high-dimensional multi-task regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Gabriel Romon, Pierre C Bellec","submitted_at":"2021-07-16T11:19:49Z","abstract_excerpt":"The paper proposes chi-square and normal inference methodologies for the unknown coefficient matrix $B^*$ of size $p\\times T$ in a Multi-Task (MT) linear model with $p$ covariates, $T$ tasks and $n$ observations under a row-sparse assumption on $B^*$. The row-sparsity $s$, dimension $p$ and number of tasks $T$ are allowed to grow with $n$. In the high-dimensional regime $p\\ggg n$, in order to leverage row-sparsity, the MT Lasso is considered.\n  We build upon the MT Lasso with a de-biasing scheme to correct for the bias induced by the penalty. This scheme requires the introduction of a new data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07828","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.07828/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.07828","created_at":"2026-07-05T02:58:29.724866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07828v1","created_at":"2026-07-05T02:58:29.724866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07828","created_at":"2026-07-05T02:58:29.724866+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLXWZPYOBIHA","created_at":"2026-07-05T02:58:29.724866+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLXWZPYOBIHABQGB","created_at":"2026-07-05T02:58:29.724866+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLXWZPYO","created_at":"2026-07-05T02:58:29.724866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22594","citing_title":"Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD","json":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD.json","graph_json":"https://pith.science/api/pith-number/OLXWZPYOBIHABQGBZ66UIMQPLD/graph.json","events_json":"https://pith.science/api/pith-number/OLXWZPYOBIHABQGBZ66UIMQPLD/events.json","paper":"https://pith.science/paper/OLXWZPYO"},"agent_actions":{"view_html":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD","download_json":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD.json","view_paper":"https://pith.science/paper/OLXWZPYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07828&json=true","fetch_graph":"https://pith.science/api/pith-number/OLXWZPYOBIHABQGBZ66UIMQPLD/graph.json","fetch_events":"https://pith.science/api/pith-number/OLXWZPYOBIHABQGBZ66UIMQPLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD/action/storage_attestation","attest_author":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD/action/author_attestation","sign_citation":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD/action/citation_signature","submit_replication":"https://pith.science/pith/OLXWZPYOBIHABQGBZ66UIMQPLD/action/replication_record"}},"created_at":"2026-07-05T02:58:29.724866+00:00","updated_at":"2026-07-05T02:58:29.724866+00:00"}