{"as_of":"2026-08-09T14:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f994ae92a40479f9cb89b3214fb5a1aa1b484d4584a3f59527350a321eccd663","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:20:38.048244Z","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-05-13T01:52:05.728503Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.15638","last_updated":"2024-07-02T02:09:32Z","snapshot_observed_at":"2026-07-06T17:34:49.001670Z","submitted_at":"2024-02-23T22:46:14Z","title":"Fair Resource Allocation in Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15638","snapshot_observed_at":"2026-08-08T16:20:38.048244Z","title":"Ban and K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06244","last_updated":"2025-06-04T02:16:01Z","snapshot_observed_at":"2026-08-09T06:28:18.256126Z","submitted_at":"2025-02-10T08:23:05Z","title":"PiKE: Adaptive Data Mixing for Large-Scale Multi-Task Learning Under Low Gradient Conflicts","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T16:20:38.048244Z"},"links":{"cited_paper":"/paper/2402.15638","citing_paper":"/paper/2502.06244"},"observation_digest":"sha256:d3784519161cb21580c8e9c6d68e2a9828fe8e9a28bb49a785bc43ecaacbf2f2","observation_id":"d16e5144-f9a8-4058-bfa5-f7d3dd021705","resolution":{"observed_at":"2026-08-08T16:20:38.048244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15638","last_updated":"2024-07-02T02:09:32Z","snapshot_observed_at":"2026-07-06T17:34:49.001670Z","submitted_at":"2024-02-23T22:46:14Z","title":"Fair Resource Allocation in Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15638","snapshot_observed_at":"2026-08-06T20:29:47.740195Z","title":"Fair resource allocation in multi-task learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02714","last_updated":"2025-07-03T15:27:45Z","snapshot_observed_at":"2026-08-09T06:28:39.685973Z","submitted_at":"2025-07-03T15:27:45Z","title":"FairHuman: Boosting Hand and Face Quality in Human Image Generation with Minimum Potential Delay Fairness in Diffusion Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:29:47.740195Z"},"links":{"cited_paper":"/paper/2402.15638","citing_paper":"/paper/2507.02714"},"observation_digest":"sha256:e96dfc0df77300557924084364c8707ea673abf5cc529749221dc3ac138e96f6","observation_id":"63a8f5a7-2638-4db2-8ec5-f3b2ea9a990c","resolution":{"observed_at":"2026-08-06T20:29:47.740195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15638","last_updated":"2024-07-02T02:09:32Z","snapshot_observed_at":"2026-07-06T17:34:49.001670Z","submitted_at":"2024-02-23T22:46:14Z","title":"Fair Resource Allocation in Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15638","snapshot_observed_at":"2026-08-05T18:53:57.375106Z","title":"Fair resource allocation in multi-task learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.13979","last_updated":"2025-08-19T16:14:00Z","snapshot_observed_at":"2026-08-09T06:27:47.034811Z","submitted_at":"2025-08-19T16:14:00Z","title":"AutoScale: Linear Scalarization Guided by Multi-Task Optimization Metrics","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T18:53:57.375106Z"},"links":{"cited_paper":"/paper/2402.15638","citing_paper":"/paper/2508.13979"},"observation_digest":"sha256:5a38dc1e704977839089aacdc2bf255dc0392dd5dbbb7901fc4ee065677784c9","observation_id":"c80858c0-6259-4e95-8534-843306be7e33","resolution":{"observed_at":"2026-08-05T18:53:57.375106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15638","last_updated":"2024-07-02T02:09:32Z","snapshot_observed_at":"2026-07-06T17:34:49.001670Z","submitted_at":"2024-02-23T22:46:14Z","title":"Fair Resource Allocation in Multi-Task Learning","version":2},"cited_work":{"arxiv_id":"2402.15638","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.15638","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c68bcbc4-a14f-4043-be1a-02be832ab046","year":null},"citing_paper":{"arxiv_id":"2605.11473","last_updated":"2026-05-12T03:40:28Z","snapshot_observed_at":"2026-08-08T22:43:14.252060Z","submitted_at":"2026-05-12T03:40:28Z","title":"TOPPO: Rethinking PPO for Multi-Task Reinforcement Learning with Critic Balancing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T01:48:13.679862Z"},"links":{"cited_paper":"/paper/2402.15638","citing_paper":"/paper/2605.11473"},"observation_digest":"sha256:b787315f843399fe1cc6c8d3911c94af91886e390a254ace98135d006bf0ff97","observation_id":"1d94b162-e956-48f4-a5e9-a9ac5b91f884","resolution":{"observed_at":"2026-05-13T01:52:05.731917Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.15638/citation-record","integrity":"/paper/2402.15638/integrity","json":"/paper/2402.15638/citation-record.json","paper":"/paper/2402.15638"},"outbound":[],"paper":{"arxiv_id":"2402.15638","last_updated":"2024-07-02T02:09:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:34:49.001670Z","submitted_at":"2024-02-23T22:46:14Z","title":"Fair Resource Allocation in 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 4 inbound Pith citation observations for arXiv:2402.15638."}