{"as_of":"2026-08-07T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:956b2a87b9036e99d5115f24bf6dff3e76e04f98b597a7732bd34057a291e443","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:04:23.075091Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T04:29:35.544562Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2109.13396","last_updated":"2021-09-27T23:42:12Z","snapshot_observed_at":"2026-07-06T11:51:58.310046Z","submitted_at":"2021-09-27T23:42:12Z","title":"Bridge Data: Boosting Generalization of Robotic Skills with Cross-Domain Datasets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T19:55:55.434977Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2109.13396"},"observation_digest":"sha256:6ebd463f3d9b7e7ca09f05d2e4880358b8d56f0202069d1dbf6d90853b28119b","observation_id":"cf094cc5-628c-49dc-9d90-ea211d7d6825","resolution":{"observed_at":"2026-05-13T19:55:55.450873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-07T14:04:23.075091Z","title":"Gradient surgery for multi-task learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20380","last_updated":"2025-05-26T17:32:14Z","snapshot_observed_at":"2026-08-07T13:53:51.336748Z","submitted_at":"2025-05-26T17:32:14Z","title":"GRAPE: Optimize Data Mixture for Group Robust Multi-target Adaptive Pretraining","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T14:04:23.075091Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2505.20380"},"observation_digest":"sha256:5dd29364f29094c1783758f5b63d9daaba4b9917f828b3e38ce7bf7a4b952025","observation_id":"ddf230ea-6079-4599-bf9e-7fea37ee7b7d","resolution":{"observed_at":"2026-08-07T14:04:23.075091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-07T13:33:54.509096Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.21598","last_updated":"2025-05-27T16:56:54Z","snapshot_observed_at":"2026-08-07T13:26:02.241328Z","submitted_at":"2025-05-27T16:56:54Z","title":"Rethinking Data Mixture for Large Language Models: A Comprehensive Survey and New Perspectives","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T13:33:54.509096Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2505.21598"},"observation_digest":"sha256:6b8c45ea74c3db3e2857ca94115638dffd9cf81ed30d00aaf18f67028969d464","observation_id":"a18e95ba-7dc5-42a9-b983-6530db2b0d41","resolution":{"observed_at":"2026-08-07T13:33:54.509096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-07T10:31:20.550988Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05447","last_updated":"2025-07-14T23:29:38Z","snapshot_observed_at":"2026-08-07T10:21:15.691562Z","submitted_at":"2025-06-05T15:18:35Z","title":"Training Dynamics Underlying Language Model Scaling Laws: Loss Deceleration and Zero-Sum Learning","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:31:20.550988Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2506.05447"},"observation_digest":"sha256:57dd848944c262fbab75aa3386a4178b40471f1ff35143bec8c623c3c247b9cc","observation_id":"62f9b0f3-c2ac-4530-842f-51ca8ffb82cf","resolution":{"observed_at":"2026-08-07T10:31:20.550988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-06T11:03:31.393593Z","title":"Gradient surgery for multi-task learning, 2020","venue":null,"work_id":null,"year":2020},"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":70,"source":"arxiv_source","source_observed_at":"2026-08-06T11:03:31.393593Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2507.23172"},"observation_digest":"sha256:80ac6643230b3f89acf7af65fae89097fb7d9c008147f06a9a86f09192f7f2a4","observation_id":"6f03fb84-dc42-4b67-b1a5-abfff31214d3","resolution":{"observed_at":"2026-08-06T11:03:31.393593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-03T06:35:48.458359Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22601","last_updated":"2026-06-02T09:17:38Z","snapshot_observed_at":"2026-08-03T06:35:46.185643Z","submitted_at":"2026-01-30T05:50:35Z","title":"Lethe: Adapter-Augmented Dual-Stream Update for Persistent Knowledge Erasure in Federated Unlearning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T06:35:48.458359Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2601.22601"},"observation_digest":"sha256:1602ad7defabf9dbedad8a6fb741a479c8d3d9edb8777b0c6309cc75810ab68a","observation_id":"596672a7-ae96-424b-9679-ea9e3faf195a","resolution":{"observed_at":"2026-08-03T06:35:48.458359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2604.20720","last_updated":"2026-04-22T16:07:10Z","snapshot_observed_at":"2026-07-06T23:07:25.185196Z","submitted_at":"2026-04-22T16:07:10Z","title":"COMPASS: COntinual Multilingual PEFT with Adaptive Semantic Sampling","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-10T01:14:16.831333Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2604.20720"},"observation_digest":"sha256:0fbe326af62f7e2f93fff7042b54a0dd844f46f0b5ee1a70de9cea5009dc4727","observation_id":"e5a88519-75a2-443c-b6b1-f57435f17708","resolution":{"observed_at":"2026-05-11T13:41:05.684146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2605.01224","last_updated":"2026-07-18T21:59:47Z","snapshot_observed_at":"2026-08-02T15:05:46.523619Z","submitted_at":"2026-05-02T03:39:12Z","title":"Lost in the Tower of Babel: The Adverse Effects of Incidental Multilingualism in LLMs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-09T15:17:58.020698Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2605.01224"},"observation_digest":"sha256:193543978b5ab987d81768dd4bfc9dd57df28d1592d35338311c51362d72e47d","observation_id":"5dd613b6-a727-43fc-ab53-4e44b8c5b961","resolution":{"observed_at":"2026-05-11T16:41:23.408011Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2605.15394","last_updated":"2026-05-14T20:27:32Z","snapshot_observed_at":"2026-07-31T12:31:45.613289Z","submitted_at":"2026-05-14T20:27:32Z","title":"Representation Without Reward: A JEPA Audit for LLM Fine-Tuning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T16:27:51.512806Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2605.15394"},"observation_digest":"sha256:3870733fcfa36d96d6c5a4680e02a41e569888aee870cc6d8ec3c3dd383ac4a2","observation_id":"5ad5bed6-1aa8-47e3-8cbf-39e870624b31","resolution":{"observed_at":"2026-05-19T16:32:39.686751Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2605.25025","last_updated":"2026-05-24T12:04:29Z","snapshot_observed_at":"2026-08-05T00:25:58.011074Z","submitted_at":"2026-05-24T12:04:29Z","title":"Micro-Swarm Locomotion Optimization in Dynamic Flow using Multi-Objective Multi-Agent Reinforcement Learning","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-30T00:30:56.136600Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2605.25025"},"observation_digest":"sha256:123a55951c425f9b18626eea8ccd70b679aa8feedf7c3c9c42bcb2631af32b06","observation_id":"9ee1e29f-e5d5-44f2-8111-d45e47df3d31","resolution":{"observed_at":"2026-07-01T16:35:50.559460Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.02381","last_updated":"2026-06-01T15:30:43Z","snapshot_observed_at":"2026-07-06T23:42:49.173711Z","submitted_at":"2026-06-01T15:30:43Z","title":"A Mathematical Conflict Framework for Contextual Data Modulation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T14:20:49.775628Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.02381"},"observation_digest":"sha256:a986bce5e8764db28c67c370ceac301c476a87fea8e3fefaa4d2fe0239b92856","observation_id":"9a584980-763a-4586-a3e4-ec62d7492c35","resolution":{"observed_at":"2026-07-01T23:26:22.743888Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.05800","last_updated":"2026-06-04T07:29:43Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T07:29:43Z","title":"SALT: When More Rollouts Don't Help in Group-Based Policy Optimization and How to Make Them Matter","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T02:53:22.159132Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.05800"},"observation_digest":"sha256:b4b2ff2b9f4973045f5b94765a43098264f2833df1d2f6b280deea172753e40e","observation_id":"3cdf7d47-9639-4b1f-ba14-767e5fd694aa","resolution":{"observed_at":"2026-07-02T11:46:56.200441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.05906","last_updated":"2026-06-04T09:11:04Z","snapshot_observed_at":"2026-08-01T17:26:20.094864Z","submitted_at":"2026-06-04T09:11:04Z","title":"ACE-SQL: Adaptive Co-Optimization via Empirical Credit Assignment for Text-to-SQL","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-28T01:12:42.929665Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.05906"},"observation_digest":"sha256:db462132939532a0aa1e3c97f83e167d01d35f3d3906d2fe40501d6ef0484b78","observation_id":"febd4108-5be3-4235-a761-7d1a2534ae27","resolution":{"observed_at":"2026-07-02T13:36:58.947523Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.10929","last_updated":"2026-06-09T14:38:26Z","snapshot_observed_at":"2026-07-06T23:50:06.645076Z","submitted_at":"2026-06-09T14:38:26Z","title":"Recoverable but Not Stationary:Local Linear Structures in Weights and Activations","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T13:51:39.893972Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.10929"},"observation_digest":"sha256:3b4d719f71f444e652a0d90b810d15715241d5ec66f9bb98c0cfd2c29b7ab34b","observation_id":"5fa89254-5648-46fa-a42b-c8cea1af4a35","resolution":{"observed_at":"2026-07-03T04:27:37.308002Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.20272","last_updated":"2026-06-18T14:17:38Z","snapshot_observed_at":"2026-08-07T11:42:09.084013Z","submitted_at":"2026-06-18T14:17:38Z","title":"Efficiently Linking Real Scenes with Synthetic Data Generation for AI-based Cognitive Robotics and Computer Vision Applications","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T16:56:34.009246Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.20272"},"observation_digest":"sha256:01cf3f02710aaca54a32f56524a56dae93f0801ef75743bb34aed0a019772087","observation_id":"4519dd0b-4297-482b-b9fd-85a9d3d1f56b","resolution":{"observed_at":"2026-07-04T04:29:35.546034Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.20344","last_updated":"2026-06-23T08:32:01Z","snapshot_observed_at":"2026-07-06T23:55:29.991442Z","submitted_at":"2026-06-18T15:13:55Z","title":"Quantum ring all-reduce: communication and privacy advantages for distributed learning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T17:16:39.928093Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.20344"},"observation_digest":"sha256:14a03665dd4328a9bec047ac5eb2757aa8bb9abc49766eedeebfa26c8104bf57","observation_id":"e295d121-a3b4-4c06-a5a4-dd60a87288f1","resolution":{"observed_at":"2026-07-04T04:09:34.022671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":"2001.06782","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-04T04:29:35.544562Z","title":"Gradient surgery for multi-task learning","venue":null,"work_id":"044e1624-6f75-4f7f-8757-624618e6015f","year":2001},"citing_paper":{"arxiv_id":"2606.30011","last_updated":"2026-06-29T09:18:11Z","snapshot_observed_at":"2026-07-07T00:03:56.075924Z","submitted_at":"2026-06-29T09:18:11Z","title":"T3R: Deeper Test-Time Adaptation for Graph Neural Networks via Gradient Rotation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T07:26:05.735508Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2606.30011"},"observation_digest":"sha256:fd8377cb6f22c644e44241a06252a52a90d0b2a4f1db5d87dc0fa4d38525469d","observation_id":"922e7d8b-5276-4d6b-9940-2d403e824beb","resolution":{"observed_at":"2026-06-30T07:34:21.935269Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-01T18:33:44.146479Z","title":"Gradient surgery for multi-task learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.17268","last_updated":"2026-07-19T14:20:13Z","snapshot_observed_at":"2026-08-06T21:29:33.397260Z","submitted_at":"2026-07-19T14:20:13Z","title":"PACE: Polar Axis-Conditioned Estimation for PairUAV Relative Localization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T18:33:44.146479Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2607.17268"},"observation_digest":"sha256:c15615ae7cc11f033672e83640bbc4be525215a60d91454d858c3acaf2f87045","observation_id":"5ab104db-450d-460d-934b-d1d2b807c59f","resolution":{"observed_at":"2026-08-01T18:33:44.146479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-01T09:02:24.634827Z","title":"Gradient surgery for multi-task learning.arXiv preprint arXiv:2001.06782, 2020","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.20922","last_updated":"2026-07-23T04:57:22Z","snapshot_observed_at":"2026-08-07T13:16:14.837746Z","submitted_at":"2026-07-23T04:57:22Z","title":"FA-LAM: Focus-Aware Large Avatar Model for One-Shot 4D Animatable Gaussian Head","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T09:02:24.634827Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2607.20922"},"observation_digest":"sha256:ca0a5e96dae2f285a42b9891777f4d3e0c6c69821d3415767a77438e187e2a55","observation_id":"f2f7db42-7906-45bc-9f4a-f1a66b0a7b07","resolution":{"observed_at":"2026-08-01T09:02:24.634827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-08-01T07:56:33.623851Z","title":"Gra- dient surgery for multi-task learning,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.21290","last_updated":"2026-07-23T13:12:51Z","snapshot_observed_at":"2026-08-07T13:45:53.264655Z","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":5,"source":"pdf_text","source_observed_at":"2026-08-01T07:56:33.623851Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2607.21290"},"observation_digest":"sha256:6297be73c70a9e9ad87868f13b232fc411277b345fbf6d3a4910de22602e3ea2","observation_id":"6adab0ac-805f-4b35-a94b-aded7bcedb02","resolution":{"observed_at":"2026-08-01T07:56:33.623851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery for Multi-Task Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.06782","snapshot_observed_at":"2026-07-31T19:04:35.433141Z","title":"Gradient surgery for multi-task learning, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24292","last_updated":"2026-07-27T11:39:22Z","snapshot_observed_at":"2026-08-07T12:54:19.753424Z","submitted_at":"2026-07-27T11:39:22Z","title":"Learning Adaptive Multi-Task Guidance, Navigation, and Control via Hypernetworks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T19:04:35.433141Z"},"links":{"cited_paper":"/paper/2001.06782","citing_paper":"/paper/2607.24292"},"observation_digest":"sha256:7706371f7a0d16afd7b27f84ded5c875b4f6f4121c5e3c437f1f8dd6acd2016f","observation_id":"81683d4c-db9e-44ab-9f5f-27b4a9b03936","resolution":{"observed_at":"2026-07-31T19:04:35.433141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2001.06782/citation-record","integrity":"/paper/2001.06782/integrity","json":"/paper/2001.06782/citation-record.json","paper":"/paper/2001.06782"},"outbound":[],"paper":{"arxiv_id":"2001.06782","last_updated":"2020-12-22T00:35:46Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:16:18.324802Z","submitted_at":"2020-01-19T06:33:47Z","title":"Gradient Surgery 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2001.06782."}