{"as_of":"2026-08-11T16:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb9534e5029816c42ea3056cb7b1dd28b92904e458bc3842a44f9f25e9bf106e","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:19:14.832695Z","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-02T19:07:17.543570Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-08-06T13:06:04.533911Z","title":"Recon: Reducing conflicting gradients from the root for multi-task learning.ArXiv, abs/2302.11289,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.21049","last_updated":"2025-07-28T17:59:28Z","snapshot_observed_at":"2026-08-07T08:10:15.407964Z","submitted_at":"2025-07-28T17:59:28Z","title":"Rep-MTL: Unleashing the Power of Representation-level Task Saliency for Multi-Task Learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T13:06:04.533911Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2507.21049"},"observation_digest":"sha256:d8e9969a334db9379b408df4feff3e47d1dba31e3d9bfe6e0214d2904e1506ba","observation_id":"9d29d92b-c17e-4e1a-b65a-71154682e705","resolution":{"observed_at":"2026-08-06T13:06:04.533911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"2302.11289","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-07-02T19:07:17.543570Z","title":"arXiv preprint arXiv:2302.11289(2023)","venue":null,"work_id":"f3d17c53-5394-46a9-9c00-4cf72bfaac2f","year":2023},"citing_paper":{"arxiv_id":"2604.04982","last_updated":"2026-04-04T23:13:55Z","snapshot_observed_at":"2026-08-02T14:39:32.415726Z","submitted_at":"2026-04-04T23:13:55Z","title":"CURE:Circuit-Aware Unlearning for LLM-based Recommendation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-13T16:47:25.256063Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2604.04982"},"observation_digest":"sha256:ec1203fed706b1e8a429f4f6f83d105ab286ff0732cfa99df76f1f06336673aa","observation_id":"e8da35a4-c96a-452b-a30c-17fc55ceec27","resolution":{"observed_at":"2026-05-13T16:48:02.727272Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-07-13T12:04:13.336341Z","title":"arXiv preprint arXiv:2302.11289(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2604.04984","last_updated":"2026-05-12T14:04:41Z","snapshot_observed_at":"2026-08-06T05:41:23.373110Z","submitted_at":"2026-04-05T00:44:02Z","title":"A Numerical PDEs Approach to Evolution Equations in Shape Analysis Based on Regularized Morphoelasticity","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T12:04:13.336341Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2604.04984"},"observation_digest":"sha256:810daa7a98871fb99d0e3e814ab587bf2203dd7ec83040f9ea8288fb75b94e08","observation_id":"dd3f4c3f-c6d4-4784-a022-0e2aa6e71652","resolution":{"observed_at":"2026-07-13T12:04:13.336341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"2302.11289","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-07-02T19:07:17.543570Z","title":"arXiv preprint arXiv:2302.11289(2023)","venue":null,"work_id":"f3d17c53-5394-46a9-9c00-4cf72bfaac2f","year":2023},"citing_paper":{"arxiv_id":"2604.13560","last_updated":"2026-04-15T07:09:05Z","snapshot_observed_at":"2026-08-10T02:24:00.629993Z","submitted_at":"2026-04-15T07:09:05Z","title":"Parameter-efficient Quantum Multi-task Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T14:13:39.288961Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2604.13560"},"observation_digest":"sha256:41a4c235c392eaec27f7786cb5c2f2dda85f6562dd224a60fe697816f264a1a3","observation_id":"36d7b2ec-04b2-49c7-bce7-b7625092ad7f","resolution":{"observed_at":"2026-05-10T14:15:29.250655Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"2302.11289","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-07-02T19:07:17.543570Z","title":"arXiv preprint arXiv:2302.11289(2023)","venue":null,"work_id":"f3d17c53-5394-46a9-9c00-4cf72bfaac2f","year":2023},"citing_paper":{"arxiv_id":"2606.07424","last_updated":"2026-06-05T16:18:15Z","snapshot_observed_at":"2026-08-08T07:35:32.425908Z","submitted_at":"2026-06-05T16:18:15Z","title":"Rapid co-design of Buoyancy-assisted robots for Challenging Locomotion using Gaussian Evolutionary Specialists","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T21:42:34.203482Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2606.07424"},"observation_digest":"sha256:0ba7003d3418868ed093a39fbae1f14c1edfcea089ce119daa389646048b2cba","observation_id":"0a73a75a-0f03-40cd-8e28-c898a53c9cdd","resolution":{"observed_at":"2026-07-02T19:07:17.545032Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11289","snapshot_observed_at":"2026-08-08T19:19:14.832695Z","title":"arXiv preprint arXiv:2302.11289 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04349","last_updated":"2026-08-05T01:48:55Z","snapshot_observed_at":"2026-08-11T15:20:05.505001Z","submitted_at":"2026-08-05T01:48:55Z","title":"Poly-OPD: Heterogeneous Multi-Teacher On-Policy Distillation for Capability-Selectable Flow Models","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T19:19:14.832695Z"},"links":{"cited_paper":"/paper/2302.11289","citing_paper":"/paper/2608.04349"},"observation_digest":"sha256:7435aa7fe5bceca856d79409cc5b3b3eaaa00f07549d9d0f30e89421f460ffe4","observation_id":"5037e1ea-deb6-49b3-a606-d136d897841e","resolution":{"observed_at":"2026-08-08T19:19:14.832695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.11289/citation-record","integrity":"/paper/2302.11289/integrity","json":"/paper/2302.11289/citation-record.json","paper":"/paper/2302.11289"},"outbound":[],"paper":{"arxiv_id":"2302.11289","last_updated":"2023-02-22T11:14:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T17:16:39.405514Z","submitted_at":"2023-02-22T11:14:16Z","title":"Recon: Reducing Conflicting Gradients from the Root 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2302.11289."}