{"as_of":"2026-08-09T19:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cef3a171da9278f5c5dcfdb4308f90461edca337a10fdc87c8b9184ddf0d0b3d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:04:24.642321Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":32,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-07T14:04:24.642321Z","title":"Conflict-averse gradient descent for multi-task learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20380","last_updated":"2025-05-26T17:32:14Z","snapshot_observed_at":"2026-08-09T06:26:18.435852Z","submitted_at":"2025-05-26T17:32:14Z","title":"GRAPE: Optimize Data Mixture for Group Robust Multi-target Adaptive Pretraining","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T14:04:24.642321Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2505.20380"},"observation_digest":"sha256:6a365134723bf6702babb9d613f3a55087b741ceab40993e22460f52927fd507","observation_id":"f8a9d79b-2215-444b-a291-5b99e7ab11d2","resolution":{"observed_at":"2026-08-07T14:04:24.642321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-06T11:03:25.650538Z","title":"Conflict-averse gradient descent for multi-task learning, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23172","last_updated":"2025-08-01T01:21:35Z","snapshot_observed_at":"2026-08-06T19:28:36.018078Z","submitted_at":"2025-07-31T00:52:05Z","title":"Benchmarking Massively Parallelized Multi-Task Reinforcement Learning for Robotics Tasks","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T11:03:25.650538Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2507.23172"},"observation_digest":"sha256:0488ff7ca7107fe9337417bc3e6290b6b03e5ed6756c3a43bb3876ec5d095ad1","observation_id":"9dcc7e5e-a8a9-45e2-b9b0-eefce8af99a2","resolution":{"observed_at":"2026-08-06T11:03:25.650538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":"2110.14048","doi":"10.48550/arxiv.2110.14048","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conflict-averse gradient descent for multi-task learning.ArXiv, abs/2110.14048","venue":"arXiv (Cornell University)","work_id":"57bd977d-2742-4120-b9ea-80c6e86ea11f","year":2024},"citing_paper":{"arxiv_id":"2605.01712","last_updated":"2026-06-02T05:44:00Z","snapshot_observed_at":"2026-08-01T18:24:36.347017Z","submitted_at":"2026-05-03T04:52:44Z","title":"CoAction: Cross-task Correlation-aware Pareto Set Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T19:30:25.120309Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2605.01712"},"observation_digest":"sha256:10430219e8124facfabef6675e1d838027953588581098c1c1c5f96fa3b3f7ae","observation_id":"f9a673da-2fdc-441b-93c3-df5c93ab1c03","resolution":{"observed_at":"2026-05-09T05:50:26.422068Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":"2110.14048","doi":"10.48550/arxiv.2110.14048","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conflict-averse gradient descent for multi-task learning.ArXiv, abs/2110.14048","venue":"arXiv (Cornell University)","work_id":"57bd977d-2742-4120-b9ea-80c6e86ea11f","year":2024},"citing_paper":{"arxiv_id":"2605.01712","last_updated":"2026-06-02T05:44:00Z","snapshot_observed_at":"2026-08-01T18:24:36.347017Z","submitted_at":"2026-05-03T04:52:44Z","title":"CoAction: Cross-task Correlation-aware Pareto Set Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-01T00:39:34.041979Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2605.01712"},"observation_digest":"sha256:cedf16de2608db043e9e4dc1dbb1564c60387919a8017d78e0a79f50b60e09c0","observation_id":"f9aecc19-7263-4234-9c1a-6ed1a2fd638a","resolution":{"observed_at":"2026-07-01T00:45:11.969220Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":"2110.14048","doi":"10.48550/arxiv.2110.14048","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conflict-averse gradient descent for multi-task learning.ArXiv, abs/2110.14048","venue":"arXiv (Cornell University)","work_id":"57bd977d-2742-4120-b9ea-80c6e86ea11f","year":2024},"citing_paper":{"arxiv_id":"2606.00219","last_updated":"2026-05-29T18:00:05Z","snapshot_observed_at":"2026-07-06T23:40:56.510371Z","submitted_at":"2026-05-29T18:00:05Z","title":"21cmEMUv3: a hybrid diffusion-LSTM emulator of 21cmFAST summary observables","version":1},"reference_index":222,"source":"arxiv_source","source_observed_at":"2026-06-28T20:53:04.280649Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2606.00219"},"observation_digest":"sha256:4af853648e505911b28825fb226c01e8bb21e6a2f0ece4b18bfdaf233bbf0383","observation_id":"712048cb-9684-432a-be6e-c88e00a08c0b","resolution":{"observed_at":"2026-06-28T21:02:38.012562Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":"2110.14048","doi":"10.48550/arxiv.2110.14048","metadata_source":"arxiv_reference","pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Conflict-averse gradient descent for multi-task learning.ArXiv, abs/2110.14048","venue":"arXiv (Cornell University)","work_id":"57bd977d-2742-4120-b9ea-80c6e86ea11f","year":2024},"citing_paper":{"arxiv_id":"2606.08147","last_updated":"2026-06-06T12:56:08Z","snapshot_observed_at":"2026-08-07T03:25:50.518862Z","submitted_at":"2026-06-06T12:56:08Z","title":"Biological Reasoning-Informed Regression for Interpretable Regulatory DNA Activity Prediction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T19:01:43.892354Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2606.08147"},"observation_digest":"sha256:6e1f8873b670834f34cceabf6a76e51c4442f6487d2f6cc262e7533f8948f358","observation_id":"8768e03c-5992-4d3b-97d4-b234ba5853b3","resolution":{"observed_at":"2026-07-02T22:17:26.268861Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14048","snapshot_observed_at":"2026-08-01T07:56:34.332880Z","title":"Conflict-averse gradient descent for multi-task learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21290","last_updated":"2026-07-23T13:12:51Z","snapshot_observed_at":"2026-08-09T05:51:16.024724Z","submitted_at":"2026-07-23T13:12:51Z","title":"Multi-Task Learning for Heterogeneous Prediction from Video Game State with Transfer Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T07:56:34.332880Z"},"links":{"cited_paper":"/paper/2110.14048","citing_paper":"/paper/2607.21290"},"observation_digest":"sha256:3861f7bc69b0de22e5c0c4943c710e408066fadb6136c9d1f75029f79cf9c2db","observation_id":"7c039da9-d5bf-4ade-9ece-376d9db5f419","resolution":{"observed_at":"2026-08-01T07:56:34.332880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2110.14048/citation-record","integrity":"/paper/2110.14048/integrity","json":"/paper/2110.14048/citation-record.json","paper":"/paper/2110.14048"},"outbound":[],"paper":{"arxiv_id":"2110.14048","last_updated":"2024-02-21T04:18:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:02:19.650098Z","submitted_at":"2021-10-26T22:03:51Z","title":"Conflict-Averse Gradient Descent for Multi-task Learning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2110.14048."}