{"as_of":"2026-08-23T18:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d518c2b6f612be646741bff1c6557e635df534f65cd5a949012ace77f521bd31","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:08:29.470911Z","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-15T03:08:59.771899Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02009","last_updated":"2024-07-18T18:43:26Z","snapshot_observed_at":"2026-08-17T16:28:39.148083Z","submitted_at":"2024-02-03T03:46:14Z","title":"Robust Multi-Task Learning with Excess Risks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02009","snapshot_observed_at":"2026-08-07T12:08:29.470911Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00569","last_updated":"2025-05-31T13:57:10Z","snapshot_observed_at":"2026-08-15T09:53:15.432724Z","submitted_at":"2025-05-31T13:57:10Z","title":"AutoMixAlign: Adaptive Data Mixing for Multi-Task Preference Optimization in LLMs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:08:29.470911Z"},"links":{"cited_paper":"/paper/2402.02009","citing_paper":"/paper/2506.00569"},"observation_digest":"sha256:bb92b09363671409f9547c931f5b4916114cab37b445d5740855d11971018c9c","observation_id":"9ef2c85d-0e65-459c-9cdb-04025086f2ed","resolution":{"observed_at":"2026-08-07T12:08:29.470911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02009","last_updated":"2024-07-18T18:43:26Z","snapshot_observed_at":"2026-08-17T16:28:39.148083Z","submitted_at":"2024-02-03T03:46:14Z","title":"Robust Multi-Task Learning with Excess Risks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02009","snapshot_observed_at":"2026-08-05T18:53:58.761796Z","title":"Ro- bust multi-task learning with excess risks","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-18T19:01:33.143084Z","submitted_at":"2025-08-19T16:14:00Z","title":"AutoScale: Linear Scalarization Guided by Multi-Task Optimization Metrics","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T18:53:58.761796Z"},"links":{"cited_paper":"/paper/2402.02009","citing_paper":"/paper/2508.13979"},"observation_digest":"sha256:07658478062b20c82f7e98bf8e8ef6ff6de09a8a2f321f924239460dba3ee3fe","observation_id":"ad8a90bf-6c79-49f7-8eb0-07dafad3e3af","resolution":{"observed_at":"2026-08-05T18:53:58.761796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02009","last_updated":"2024-07-18T18:43:26Z","snapshot_observed_at":"2026-08-17T16:28:39.148083Z","submitted_at":"2024-02-03T03:46:14Z","title":"Robust Multi-Task Learning with Excess Risks","version":3},"cited_work":{"arxiv_id":"2402.02009","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02009","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.02009 , year=","venue":null,"work_id":"6b8a6a52-6400-43a3-872a-80263c59e1f5","year":null},"citing_paper":{"arxiv_id":"2605.14350","last_updated":"2026-05-14T04:22:24Z","snapshot_observed_at":"2026-08-16T10:30:54.722430Z","submitted_at":"2026-05-14T04:22:24Z","title":"Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling","version":1},"reference_index":206,"source":"arxiv_source","source_observed_at":"2026-05-15T03:05:36.871497Z"},"links":{"cited_paper":"/paper/2402.02009","citing_paper":"/paper/2605.14350"},"observation_digest":"sha256:264b7e939ee8bbf16a627a5cdd89586c4a124e6da421733f931003f1be2e4d03","observation_id":"29464862-a9ee-4c53-8e1c-b1e998aac457","resolution":{"observed_at":"2026-05-15T03:08:59.775073Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02009/citation-record","integrity":"/paper/2402.02009/integrity","json":"/paper/2402.02009/citation-record.json","paper":"/paper/2402.02009"},"outbound":[],"paper":{"arxiv_id":"2402.02009","last_updated":"2024-07-18T18:43:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T16:28:39.148083Z","submitted_at":"2024-02-03T03:46:14Z","title":"Robust Multi-Task Learning with Excess Risks"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.02009."}