{"as_of":"2026-08-24T03:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:354244dd5f120b04ca89f1868132ba277bd4b847fd50139ee00ec992f99ca50a","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T23:19:57.768043Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:59:47.764164Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.14231","snapshot_observed_at":"2026-08-02T04:59:47.764164Z","title":"arXiv preprint arXiv:2602.14231 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13550","last_updated":"2026-07-15T07:56:09Z","snapshot_observed_at":"2026-08-19T02:00:21.808319Z","submitted_at":"2026-07-15T07:56:09Z","title":"Parallel gradient boosting for flexible estimation of conditional distributions","version":1},"reference_index":174,"source":"arxiv_source","source_observed_at":"2026-08-02T04:59:47.764164Z"},"links":{"cited_paper":"/paper/2602.14231","citing_paper":"/paper/2607.13550"},"observation_digest":"sha256:417dc74d7e259a10ba15238a44dd9fc0c3adf43f7e0350571cd35e55d8f2dfeb","observation_id":"a60862b3-2747-4d3a-b018-e36aa54b87a2","resolution":{"observed_at":"2026-08-02T04:59:47.764164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.14231/citation-record","integrity":"/paper/2602.14231/integrity","json":"/paper/2602.14231/citation-record.json","paper":"/paper/2602.14231"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.350041Z","title":"A Survey on Multi-Task Learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.350041Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:3d87ce7bf56328bdbb7793fbbfb11b5bd33cc8473a6bd5e9cfa987fd8ddc070a","observation_id":"1f7a2671-f38d-48f2-9015-6ed3cc2556aa","resolution":{"observed_at":"2026-08-02T23:19:49.350041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.393013Z","title":"Multitask Learning","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.393013Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:82d471ac8e5115fe2fe0f1744e57e643f655f9093b8b827b6da95b6881bb4bda","observation_id":"d511a8fa-f8bd-472b-ae3e-4dc115a89176","resolution":{"observed_at":"2026-08-02T23:19:49.393013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.483856Z","title":"Personalized multitask learning for predicting tomorrow’s mood, stress, and health","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.483856Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:b697439b2e5895c0f450538540281a7d01de469401b1102cdca8431f62c60553","observation_id":"ee7c86cb-b163-4be3-9f37-f54cd6daefa2","resolution":{"observed_at":"2026-08-02T23:19:49.483856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.667390Z","title":"Radial Basis Function Network for Multi-task Learning","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.667390Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:012dce2b4d71e8427461e9af530b67f6f58f350c3e0c9f17e63e9e6f1ec712e3","observation_id":"f1559fac-3868-43cf-b0c2-2bc9cd8a5db5","resolution":{"observed_at":"2026-08-02T23:19:49.667390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.824288Z","title":"Silver, Ryan Poirier, and Duane Currie","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.824288Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c1f651ead477b2e013486ffc30bc0ed613bb9ac31c93de8887eaa11f8ef89c35","observation_id":"8fa8637e-21de-41b8-8654-49317b5a9315","resolution":{"observed_at":"2026-08-02T23:19:49.824288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:49.977727Z","title":"Robust multi-task feature learning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:49.977727Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:f2a04067fa5080fa21de6d9e9061d256af62f73abfbbc1c7ced64767018183c6","observation_id":"6d15f334-b133-4ec7-9549-09810a0f8381","resolution":{"observed_at":"2026-08-02T23:19:49.977727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.104661Z","title":"Encoding Tree Sparsity in Multi-Task Learning: A Probabilistic Framework","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.104661Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:ad48d6fd8da0643057ec41bf3717112c677130715d779d497022363b59fbcf49","observation_id":"8b180a87-bdfa-4935-bea7-fefe4908afba","resolution":{"observed_at":"2026-08-02T23:19:50.104661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.193683Z","title":"A framework for learning predictive structures from multiple tasks and unlabeled data","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.193683Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:82310d64f64e856215215e5287fb40139c6da43d64a0a999d2b8af9847ee1a11","observation_id":"69d9fc37-5a62-4a07-a464-587ca6ae6f95","resolution":{"observed_at":"2026-08-02T23:19:50.193683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.361014Z","title":"A convex formulation for learning shared structures from multiple tasks","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.361014Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:3a140a2c08099a825b0aa2925e0a2e7ee787bbaaa91b940f724233d7edc9866f","observation_id":"be042662-6f35-411e-bddf-7e5edee94716","resolution":{"observed_at":"2026-08-02T23:19:50.361014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.425635Z","title":"Learning Multiple Tasks using Manifold Regular- ization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.425635Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:a2a783e23d1d7f21f74784abb39607da8156620503dabb9adfa1faf48735d36d","observation_id":"0189ad2c-f2de-4ce3-af49-18e8c9d4d2ee","resolution":{"observed_at":"2026-08-02T23:19:50.425635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.674293Z","title":"Discovering structure in multiple learning tasks: The TC algorithm","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.674293Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:6a7a149032a9ec97d7c8d4e612f58352c9f72198bebab014349afab8a0eac3f2","observation_id":"1c423b0d-15be-448b-bdc3-a4298dbc5620","resolution":{"observed_at":"2026-08-02T23:19:50.674293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:50.973075Z","title":"Task clustering and gating for bayesian multitask learning","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:50.973075Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:36023b706d5b8cec0a5684b969d34780bf4c705c469ee73f3770e91d20e59c4a","observation_id":"8ef79ced-abf4-4941-bfca-b4d92905913b","resolution":{"observed_at":"2026-08-02T23:19:50.973075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.151821Z","title":"Multi-Task Learning for Classification with Dirichlet Process Priors","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.151821Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c3a31ca75672d4b735a0aa2ace24caa4d952d604776879089c7d4d930912dbff","observation_id":"a0217611-cdbb-474a-b5c6-4512dceeaa00","resolution":{"observed_at":"2026-08-02T23:19:51.151821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.278803Z","title":"Regularized multi–task learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.278803Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:dfd9d4a8890cd0dac560d914e7d682ea80570c5356ecb6c85ad310558bc66bc4","observation_id":"2e0b0b7c-9073-47ba-805b-b5b87b9118b7","resolution":{"observed_at":"2026-08-02T23:19:51.278803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.569307Z","title":"Large Margin Multi-Task Metric Learning","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.569307Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:1636b5e8a8a3eb1028720c1b6b41f03672c466dcc42491811b330b0d33830db8","observation_id":"eca27e56-0044-4919-b707-6f08bb811b51","resolution":{"observed_at":"2026-08-02T23:19:51.569307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.718244Z","title":"Hierarchical Multitask Structured Output Learning for Large-scale Sequence Segmentation","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.718244Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:22260917c934eb1ecb73f59c3ef489f1f6694a59586dbb69fbba92b13c69fc50","observation_id":"99441d9a-87a4-46df-a9d9-6e188ca95658","resolution":{"observed_at":"2026-08-02T23:19:51.718244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.900095Z","title":"A Dirty Model for Multi-task Learning","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.900095Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:47094f8994f743fad438f00108cdf15d497105ddd6bafdfaf574d0a8d187ff4e","observation_id":"06d17f4d-8f48-4ce6-882d-2a806f7f7657","resolution":{"observed_at":"2026-08-02T23:19:51.900095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.044410Z","title":"Learning Tree Structure in Multi-Task Learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.044410Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c961aea532a1ae3ef216140dbd6472a12c4e76408d33b1ae17d917cae54e5639","observation_id":"e6f1d2f9-7a0c-4d8c-b56c-745f838b6e44","resolution":{"observed_at":"2026-08-02T23:19:52.044410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.167868Z","title":"Flexible Clustered Multi-Task Learning by Learning Representative Tasks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.167868Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:59e567b6f293cf3b0c45a68edb46bd7539e9c31e492df3b0c399c8c20bd6986d","observation_id":"d0eeb8a4-3077-4058-af6c-4633662a2c24","resolution":{"observed_at":"2026-08-02T23:19:52.167868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.320234Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.320234Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:a6be2f07c646e16cced6372972f12633ddbdba09768bd3343d1ab12156b48e58","observation_id":"448466b3-1b9b-465a-9ad3-082ed4a2092a","resolution":{"observed_at":"2026-08-02T23:19:52.320234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.405462Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.405462Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:7c8e1bdf624edcd85e65e192cbc26a981f6ea326d0ef3a308ec5d669ef336aaa","observation_id":"34fb3ad8-256f-401f-af9a-cad011b30a8d","resolution":{"observed_at":"2026-08-02T23:19:52.405462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.555387Z","title":"Clustering Methods , pages 321–352","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.555387Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:cf34e8174df9f44d6f3a2bc0c3a792a5499db3d876af99303a86a66304c98884","observation_id":"a95968b5-efa0-440a-aca1-fc3fc144b185","resolution":{"observed_at":"2026-08-02T23:19:52.555387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.722038Z","title":"Hierarchical Clustering Multi-Task Learning for Joint Human Action Grouping and Recognition","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.722038Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:5d9dbc1b007696ff87f3053aad120dd0900d5d14eabce5d87dd1706b1135732c","observation_id":"b6bc6a79-4d0f-4af9-b023-5bac92892d71","resolution":{"observed_at":"2026-08-02T23:19:52.722038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.872935Z","title":"K-Means Clustering , pages 563–564","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.872935Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:1216c6297d0d51e4e2826476db899982b309405320cabb20216fb042f4a5cef8","observation_id":"7ce58653-4e68-43c8-9282-803556383291","resolution":{"observed_at":"2026-08-02T23:19:52.872935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:52.960405Z","title":"Friedman","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:52.960405Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:d3427ecdf46fef8da26c354e7188fec0a70ece2648427f8a00ca235ea0514bcd","observation_id":"ced7b72d-a5eb-4680-97bc-444a323d20a6","resolution":{"observed_at":"2026-08-02T23:19:52.960405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.058611Z","title":"A comparative analysis of gradient boosting algorithms","venue":null,"work_id":null,"year":1937},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.058611Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:504318ee3f69593fc730cc90ddb05dd4a5388de6869bdf64ffea7031a8bd37de","observation_id":"722abc9e-4fb1-4d9a-905b-5835b55012c8","resolution":{"observed_at":"2026-08-02T23:19:53.058611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.198877Z","title":"Tabular data: Deep learning is not all you need","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.198877Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:96d4cd9801a5d2b5f663b1c7c5ee19e8b11714efa0c44bca1c9ef710da5ac7ce","observation_id":"f51e374f-d0e2-480e-ae3c-0fe02afae899","resolution":{"observed_at":"2026-08-02T23:19:53.198877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.317872Z","title":"XGBoost: A Scalable Tree Boosting System","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.317872Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:85efd0b42a133759b11b44e05569bb6a5a1369a277038d60ef78573e166cd61a","observation_id":"50e616ca-9e01-4866-ac6d-eb2af11e1cdb","resolution":{"observed_at":"2026-08-02T23:19:53.317872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.424278Z","title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.424278Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:3f9ce368cc1734ee7b940ee616a6ad3f5cb2274c3d7563a7ebdcf18ea4214e4c","observation_id":"da9ba556-86af-4da4-ade0-01f647db63c0","resolution":{"observed_at":"2026-08-02T23:19:53.424278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.589670Z","title":"CatBoost: unbiased boosting with categorical features","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.589670Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:19eeb270c016c8dfb098107c8c5da656e05dbd81dd01a26733e481df9d0adc58","observation_id":"28def008-9ce1-4660-bb92-48799041529c","resolution":{"observed_at":"2026-08-02T23:19:53.589670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.731203Z","title":"Boosted multi-task learning","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.731203Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:dfbb2a514a75f8a7590c339fb36d48f5cdae181b24bdbf9c4b0880f40dad5d39","observation_id":"89e5ee8a-ce04-44a9-9b6a-4abd7c941def","resolution":{"observed_at":"2026-08-02T23:19:53.731203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.831024Z","title":"Multi-task gradient boosting","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.831024Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:4f49e9ac3526e2b954a6c9109d3ec90c9ad22abdb2bd060d3e1b0aa211fde4c9","observation_id":"c69cf5f4-85ce-417d-ac5c-17aadeeb434f","resolution":{"observed_at":"2026-08-02T23:19:53.831024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:53.934215Z","title":"Robust-multi-task gradient boosting","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:53.934215Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:e124cc66c1d9ff4b42aeccfb3e727239e9f07886f0e3247b196a64e195667688","observation_id":"f6a35fda-e4ee-4b97-856b-aed7b2726b9f","resolution":{"observed_at":"2026-08-02T23:19:53.934215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.076478Z","title":"Robust multi-task learning with t-processes","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.076478Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:ee3c5d5d9ee4f051fcd98544dfbe7666cc07a5b2ac29cd701cec2e80b9c757dd","observation_id":"4c22df3c-3c01-4353-93a1-1aaa230256ff","resolution":{"observed_at":"2026-08-02T23:19:54.076478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.175672Z","title":"Clustered Multi-Task Learning: A Convex For- mulation","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.175672Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:6c806da67d31f3d6850d0618545fa962d62892d9aa1f129cf87bbf64645ccd14","observation_id":"1d1d0958-30d2-4573-bf97-d395d9791c07","resolution":{"observed_at":"2026-08-02T23:19:54.175672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.293346Z","title":"Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.293346Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:f6faa4b3d1ed0a1bd473de84327aa80bf33be5551b9d51eaf7f1094bb202e94c","observation_id":"2664a54b-403d-4bfb-b86d-180511b53dd3","resolution":{"observed_at":"2026-08-02T23:19:54.293346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.402864Z","title":"Learning a kernel for multi-task clustering","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.402864Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c158fd9dd554344b27e9b32ba00a5cb55081a0a9934049606b2c7072eb858fb0","observation_id":"515b9bcc-d3ba-453c-829e-00414c39d4e1","resolution":{"observed_at":"2026-08-02T23:19:54.402864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.516351Z","title":"Clustered Multi-Task Learning Via Alternating Structure Optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.516351Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:59851aa35074d379c42b99cdf2bf1d1eded39fec6f21633caefffaaa2f53e8ea","observation_id":"9f4e8781-c0a4-4295-821e-b60829506596","resolution":{"observed_at":"2026-08-02T23:19:54.516351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.643199Z","title":"Convex Discriminative Multitask Clustering","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.643199Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:bc31bfeaf358791079fb28e59561d39d65ecbb0f1229a8a479cdf0ab01381f03","observation_id":"40603cc4-de4d-476f-bccc-ccb8a6a799e9","resolution":{"observed_at":"2026-08-02T23:19:54.643199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.721619Z","title":"Multitask Spectral Clustering by Exploring Intertask Correlation","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.721619Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:5272911f1ea2db85a1c1251a2d2bf1d655492cd5f2bee7bb7e19ec5c9b661be8","observation_id":"53191e51-f962-423e-b7ac-0120ced78aab","resolution":{"observed_at":"2026-08-02T23:19:54.721619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.807667Z","title":"Self-Adapted Multi-Task Clustering","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.807667Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:acea067f07d2dc49fd6f8d8de12f39a5e592f31b56b1bb6a59149f5197784d1e","observation_id":"c997b317-ea5e-445c-bab6-0e2aedc71538","resolution":{"observed_at":"2026-08-02T23:19:54.807667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:54.919941Z","title":"Multi-Task Clustering with Model Relation Learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:54.919941Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:db8cd55fbca1192448771f5b6620d2c9efd2f36175d8a2a3a2a137a04c0cc374","observation_id":"f9bd921c-43b9-45b6-be35-5e112880d76d","resolution":{"observed_at":"2026-08-02T23:19:54.919941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.046136Z","title":"Multi-Task Learning as Multi-Objective Optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.046136Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:80cedd745116202f15b1aac136393f4021cc20701550d403e9f19dea6e0564dc","observation_id":"b27c00d9-cbbb-4eb3-869b-e19ca8ab27f8","resolution":{"observed_at":"2026-08-02T23:19:55.046136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.212313Z","title":"Gradient Surgery for Multi-Task Learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.212313Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:37c2659051eb80f92c4b1fba7113aff4c7428a2b7ce1a521edff0d2534e2c51a","observation_id":"42607857-f61f-431d-82fe-c18d7bec4166","resolution":{"observed_at":"2026-08-02T23:19:55.212313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.335858Z","title":"Conflict-A verse Gradient Descent for Multi-task learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.335858Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:5f283054fc257752f1cc95d1c6b984e5210f6ace9fc141ae4b0e204b025b2355","observation_id":"28a84b42-6dc2-484e-bed1-3d33bfca3b11","resolution":{"observed_at":"2026-08-02T23:19:55.335858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.457850Z","title":"Zamir, Alexander Sax, William Shen, Leonidas J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.457850Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:92ccda6396c51fd849e056b4abb798a57ad09ba3ec80533fb5d3d4b687cfc9e9","observation_id":"9eb5a69e-e1fc-4d26-ab44-fd89cd5e7948","resolution":{"observed_at":"2026-08-02T23:19:55.457850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.589218Z","title":"Which Tasks Should Be Learned Together in Multi-task Learning? In Proceedings of the 37th International Conference on Machine Learning , volume 119, pages 9120–9132","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.589218Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:2d156f0843e03fa1c15d839252370c96831af2690d40bd56c44172170f660ac2","observation_id":"5cab5479-ddd8-40d1-b77a-16586fa1aac9","resolution":{"observed_at":"2026-08-02T23:19:55.589218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.724202Z","title":"Sokal and Charles D","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.724202Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:dc7ed9a72d4d10560aea03ab633acc483295e3406cec21d045403f48daad22eb","observation_id":"e3ac9658-a5e4-4d98-a07c-a92c385767f1","resolution":{"observed_at":"2026-08-02T23:19:55.724202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.839448Z","title":"Rousseeuw","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.839448Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:11c55f2bfaf12449e0ec9c3a0d939cc78686ffed9bb85a342327224c59f6e65d","observation_id":"029c5e89-ad03-43d7-9234-f40881e5037a","resolution":{"observed_at":"2026-08-02T23:19:55.839448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.911212Z","title":"Algorithms for hierarchical clustering: an overview, II","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.911212Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c7d2f00e3336b96346826725933df6d0f340de9249903f4bec642db2d4617f4f","observation_id":"f56ff629-c0be-4b6d-b550-88ede7684cf4","resolution":{"observed_at":"2026-08-02T23:19:55.911212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:55.967102Z","title":"Random Features for Large-Scale Kernel Machines","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:55.967102Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:5000cf54351f89b52b7b5e288e23382bfc3b5a7b5d090368da2372dfa211ed36","observation_id":"3ad91c9f-73d8-4e94-88f6-f73f8432b090","resolution":{"observed_at":"2026-08-02T23:19:55.967102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.042385Z","title":"Gaussian processes for machine learning , vol- ume 2","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.042385Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:3563df4c985cbabd6aaffbb165b0fb0e4ce66f0ae9352cd58564994ffdcf4671","observation_id":"869a89cd-9b39-43ac-8d8f-c5fd35cc74f6","resolution":{"observed_at":"2026-08-02T23:19:56.042385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.140617Z","title":"Data Poisoning Attacks on Multi-Task Relationship Learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.140617Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:ecd05b08a512504ebeebf8269670b637ca86fffb7107a16c9050c9653ac44d5d","observation_id":"efc8037b-0fbf-47ea-b1de-faea934b78db","resolution":{"observed_at":"2026-08-02T23:19:56.140617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.210554Z","title":"Taking Advantage of Multitask Learning for Fair Classification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.210554Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:62085d06f511ab2c0302dd6ec82e67a53f794318e33da2629b2f274ef842f1fe","observation_id":"b4a7c59b-9349-4370-9c6a-7117cfd00e72","resolution":{"observed_at":"2026-08-02T23:19:56.210554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.310126Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.310126Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:e6b6f59422cb65f41b5053b82998f05b1fb551a7f320547e866d7e0210c35fcd","observation_id":"50e69b50-a716-45c1-b1c6-471f7f607286","resolution":{"observed_at":"2026-08-02T23:19:56.310126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.390757Z","title":"Multi-Task Learning with Calibrated Mixture of Insightful Experts","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.390757Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:10ebabb9de366cebbb2a58b2bb8b854ebf1238cf733465b313ef7ec20a2c9cff","observation_id":"927c7f13-9dfa-46cf-bb51-29dc3d1e8571","resolution":{"observed_at":"2026-08-02T23:19:56.390757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.477264Z","title":"Cilia, C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.477264Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:13d564bf36226e7d1ddfd25ef7ebe3fe9be9bf960d715bafd7f4edb92de1741f","observation_id":"c814c6a6-4d9a-4487-b45c-4aab673b141f","resolution":{"observed_at":"2026-08-02T23:19:56.477264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.586756Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.586756Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:4c0c55906ded8d4f496c68ee0a6dbb8bbb442cbccdb2573eed35df858f130696","observation_id":"73da266e-3e51-49f4-a312-b5076763e18b","resolution":{"observed_at":"2026-08-02T23:19:56.586756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.683599Z","title":"Deep Learning-Based Parkinson’s Disease Classification Using Vocal Feature Sets","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.683599Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:276cd7874935613291f4a52706a3f905d82ebd433440d2a588688cc1f2c7e950","observation_id":"5c1d649e-864e-4bc0-984f-965745812f61","resolution":{"observed_at":"2026-08-02T23:19:56.683599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.776511Z","title":"Detection of Parkinson disease using multiclass machine learning approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.776511Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:f98f8bb1756fa06a67426e7f50eca28eeeed739ce59beb2d0a54da566b83a547","observation_id":"ed491dd1-6464-4cea-80fe-79543e0af3b4","resolution":{"observed_at":"2026-08-02T23:19:56.776511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.837172Z","title":"A Spectral Regularization Framework for Multi-Task Structure Learning","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.837172Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:c0fc513202cddea3ce6f161f732293acf8c09be09e9bcc560121475073355e5a","observation_id":"267c8698-54cd-4cdb-bf9b-81b54404ba0b","resolution":{"observed_at":"2026-08-02T23:19:56.837172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:56.937021Z","title":"De Stefano, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:56.937021Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:59f4e9f637a5a64853c0309bd9d57409fe6a72f97dffc30153f577e4aa2a3e11","observation_id":"7e07c474-56d4-47e6-a3eb-b6b8779436b2","resolution":{"observed_at":"2026-08-02T23:19:56.937021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.047321Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.047321Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:31e47a76bf6b5c683027c9625de9527839ce0f9e4d03569c7134598b9f1c420b","observation_id":"aeb64a0d-ccda-483a-abf4-371c6025fdbd","resolution":{"observed_at":"2026-08-02T23:19:57.047321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.118409Z","title":"Passive Mine Detection and Classification Method Based on Hybrid Model","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.118409Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:df7653781317828619254b7ada2b05a22ea4133c422710397fc778bfd8d53be9","observation_id":"246d5f29-25a1-4709-a85a-00ede42a4c8b","resolution":{"observed_at":"2026-08-02T23:19:57.118409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.199145Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.199145Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:a216808c5bd64357b40184c9fc764134414223b633a96ef4f61c4758e93c4b25","observation_id":"f4854ec2-13ec-46a7-b2ad-6a4bf312c4cc","resolution":{"observed_at":"2026-08-02T23:19:57.199145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.301429Z","title":"Lenk, Wayne S","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.301429Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:d7ccf922ab4a0fe6c049f5c8d0f2d8e884228b01c59dccb2ea82753790d301d0","observation_id":"372d4ca2-a907-4a11-acaa-116a8e2aa8a1","resolution":{"observed_at":"2026-08-02T23:19:57.301429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.374713Z","title":"Parkinsons Telemonitoring","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.374713Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:68a64566591d8638ffccb373ca6b9dc48fc5231bd19e8c9a0de4c04d6d69d81e","observation_id":"2e797259-5975-455d-8c67-7649d2a6c409","resolution":{"observed_at":"2026-08-02T23:19:57.374713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.445245Z","title":"Efficient Output Kernel Learning for Multiple Tasks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.445245Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:ee8f36d2bf16fd8fe611e73bda72b13936cb39a86b7551b4f487a2ef3865cd8f","observation_id":"ec367d69-92c5-4f50-a76f-f8fc2525916d","resolution":{"observed_at":"2026-08-02T23:19:57.445245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.513726Z","title":"Scikit-learn: Machine learning in Python","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.513726Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:ade9cf988bab71d391cb64ba3356ad33891164fc86eca78188730cd42ee6b209","observation_id":"0323f641-aafd-488c-a5b5-5e070a250695","resolution":{"observed_at":"2026-08-02T23:19:57.513726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.607656Z","title":"Statistical comparisons of classifiers over multiple data sets","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.607656Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:1dc2356f71bbbd5fea08f08c14d6b88bb2d185305cd66d7c6e6e5c250aef1db7","observation_id":"e71bcbb0-0380-470a-aacb-194fd2969bb5","resolution":{"observed_at":"2026-08-02T23:19:57.607656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.683944Z","title":"This leads to instability in the estimated residuals error out i","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.683944Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:92450cef57be686d4e32004abd5538877dee80422996afa80d818da39a8e43f0","observation_id":"dd5fa391-0bb5-4a07-8a85-533d6e36d882","resolution":{"observed_at":"2026-08-02T23:19:57.683944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:57.768043Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:57.768043Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:532a33090be62a1b3c56e4ff7f532a5397634661e8547813199f31890ff3b51e","observation_id":"718361d2-9fe0-469e-88b6-061cbe31b850","resolution":{"observed_at":"2026-08-02T23:19:57.768043Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T23:19:51.436176Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling","version":1},"reference_index":117,"source":"pdf_text","source_observed_at":"2026-08-02T23:19:51.436176Z"},"links":{"citing_paper":"/paper/2602.14231"},"observation_digest":"sha256:564970003121d4897befc8031157ccbafe4a7828eb890b9c94cba99da8de7b9e","observation_id":"675ecc1e-c647-4847-9e1b-ed55e47806fb","resolution":{"observed_at":"2026-08-02T23:19:51.436176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.14231","last_updated":"2026-02-15T16:59:23Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-23T17:42:58.957310Z","submitted_at":"2026-02-15T16:59:23Z","title":"Robust multi-task boosting using clustering and local ensembling"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":72,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":73},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 1 inbound Pith citation observation for arXiv:2602.14231."}