{"as_of":"2026-08-18T01:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12e87262a8f4b01139a66cd4b8ae033475221b927d81572f33c3e6972c693774","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:10:56.477251Z","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-11T18:11:27.133658Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.16162","last_updated":"2024-03-24T14:04:40Z","snapshot_observed_at":"2026-08-17T23:43:59.021781Z","submitted_at":"2024-03-24T14:04:40Z","title":"Multi-Task Learning with Multi-Task Optimization","version":1},"cited_work":{"arxiv_id":"2403.16162","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.16162","snapshot_observed_at":"2026-08-11T18:11:27.133658Z","title":"Multi-Task Learning with Multi-Task Optimization","venue":"cs.AI","work_id":"0c8d5a56-4e3a-47d0-8474-da3d9a25afe3","year":2024},"citing_paper":{"arxiv_id":"2412.08198","last_updated":"2025-03-12T07:26:16Z","snapshot_observed_at":"2026-08-12T20:54:21.851590Z","submitted_at":"2024-12-11T08:41:41Z","title":"Adaptive$^2$: Adaptive Domain Mining for Fine-grained Domain Adaptation Modeling","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:10:56.477251Z"},"links":{"cited_paper":"/paper/2403.16162","citing_paper":"/paper/2412.08198"},"observation_digest":"sha256:9ba51ce673c3b8ef46a2da5b9cbd26eb1370667cbac0ff89486a31886a10d6e5","observation_id":"21241995-a6c4-4039-83e6-5b5a7dde3428","resolution":{"observed_at":"2026-08-11T18:11:27.139971Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/2403.16162/citation-record","integrity":"/paper/2403.16162/integrity","json":"/paper/2403.16162/citation-record.json","paper":"/paper/2403.16162"},"outbound":[],"paper":{"arxiv_id":"2403.16162","last_updated":"2024-03-24T14:04:40Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T23:43:59.021781Z","submitted_at":"2024-03-24T14:04:40Z","title":"Multi-Task Learning with Multi-Task Optimization"},"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 1 inbound Pith citation observation for arXiv:2403.16162."}