{"as_of":"2026-08-18T01:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55f22302e13fdd957a7e3cf95d6c2f702fed42349758dd7c68f210edfdc88546","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-17T06:30:58.91139+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-15T18:10:55.809372Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T17:39:44.234935Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.06434","last_updated":"2019-09-13T20:23:40Z","snapshot_observed_at":"2026-08-17T23:25:37.033412Z","submitted_at":"2019-09-13T20:23:40Z","title":"Adaptive Scheduling for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06434","snapshot_observed_at":"2026-08-11T21:30:19.490899Z","title":"Adaptive scheduling for multi- task learning,","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.04413","last_updated":"2024-12-09T14:46:09Z","snapshot_observed_at":"2026-08-17T17:59:01.124086Z","submitted_at":"2024-12-05T18:33:59Z","title":"Efficient Task Grouping Through Samplewise Optimisation Landscape Analysis","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:19.490899Z"},"links":{"cited_paper":"/paper/1909.06434","citing_paper":"/paper/2412.04413"},"observation_digest":"sha256:c38059978317b957e75c81a4e6d77518b35f14c85d767bae733cacb99059e313","observation_id":"f3d60ebb-896b-4876-b234-f70ba225efcb","resolution":{"observed_at":"2026-08-11T21:30:19.490899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06434","last_updated":"2019-09-13T20:23:40Z","snapshot_observed_at":"2026-08-17T23:25:37.033412Z","submitted_at":"2019-09-13T20:23:40Z","title":"Adaptive Scheduling for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.06434","snapshot_observed_at":"2026-08-15T18:10:55.809372Z","title":null,"venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.18940","last_updated":"2025-07-25T04:23:24Z","snapshot_observed_at":"2026-08-15T18:02:53.656923Z","submitted_at":"2025-07-25T04:23:24Z","title":"LLaVA-NeuMT: Selective Layer-Neuron Modulation for Efficient Multilingual Multimodal Translation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:10:55.809372Z"},"links":{"cited_paper":"/paper/1909.06434","citing_paper":"/paper/2507.18940"},"observation_digest":"sha256:80a22bef2099029cb096c76e53713554b5d443aedfdbdf85a3624631ae97c4a4","observation_id":"985b4bca-a03b-4e99-8479-457d61c726d6","resolution":{"observed_at":"2026-08-15T18:10:55.809372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.06434","last_updated":"2019-09-13T20:23:40Z","snapshot_observed_at":"2026-08-17T23:25:37.033412Z","submitted_at":"2019-09-13T20:23:40Z","title":"Adaptive Scheduling for Multi-Task Learning","version":1},"cited_work":{"arxiv_id":"1909.06434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.06434","snapshot_observed_at":"2026-08-10T17:39:44.234935Z","title":"Adaptive Scheduling for Multi-Task Learning","venue":"cs.LG","work_id":"9d245a3b-ce18-4a2c-a00c-4df24cee3955","year":2019},"citing_paper":{"arxiv_id":"2608.06963","last_updated":"2026-08-07T08:40:40Z","snapshot_observed_at":"2026-08-14T11:32:07.504602Z","submitted_at":"2026-08-07T08:40:40Z","title":"Learning in Deep Networks under Dale's Constraint","version":1},"reference_index":179,"source":"arxiv_source","source_observed_at":"2026-08-10T17:39:43.053709Z"},"links":{"cited_paper":"/paper/1909.06434","citing_paper":"/paper/2608.06963"},"observation_digest":"sha256:09512b48caf6f90bed9542ece9ed101f1ec1f75283238e696c0dd25c04787346","observation_id":"fab4ab2e-2f57-4440-b2d6-2aa61391a065","resolution":{"observed_at":"2026-08-10T17:39:44.240850Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.06434/citation-record","integrity":"/paper/1909.06434/integrity","json":"/paper/1909.06434/citation-record.json","paper":"/paper/1909.06434"},"outbound":[],"paper":{"arxiv_id":"1909.06434","last_updated":"2019-09-13T20:23:40Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T23:25:37.033412Z","submitted_at":"2019-09-13T20:23:40Z","title":"Adaptive Scheduling 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1909.06434."}