{"as_of":"2026-08-08T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fb8f2d4c4b7bf4c73304fe8b8f2eb75e029433f8a4fa014fc75b4c1ab9e45b0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:48:30.167420Z","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-06T18:35:19.503584Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.10292","last_updated":"2021-05-11T17:58:18Z","snapshot_observed_at":"2026-08-01T10:22:15.291477Z","submitted_at":"2020-08-24T09:49:19Z","title":"Automated Search for Resource-Efficient Branched Multi-Task Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.10292","snapshot_observed_at":"2026-08-06T18:48:30.167420Z","title":"Automated search for resource- efficient branched multi-task networks","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.07485","last_updated":"2025-07-21T06:05:16Z","snapshot_observed_at":"2026-08-06T18:37:11.386732Z","submitted_at":"2025-07-10T07:13:22Z","title":"Resolving Token-Space Gradient Conflicts: Token Space Manipulation for Transformer-Based Multi-Task Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:48:30.167420Z"},"links":{"cited_paper":"/paper/2008.10292","citing_paper":"/paper/2507.07485"},"observation_digest":"sha256:5988b2434dd60820aec109e4eeab681de01ef93386fe271fed05377a0162605e","observation_id":"781e05b3-2753-423b-bf3d-c812e0ef5d9f","resolution":{"observed_at":"2026-08-06T18:48:30.167420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.10292","last_updated":"2021-05-11T17:58:18Z","snapshot_observed_at":"2026-08-01T10:22:15.291477Z","submitted_at":"2020-08-24T09:49:19Z","title":"Automated Search for Resource-Efficient Branched Multi-Task Networks","version":2},"cited_work":{"arxiv_id":"2008.10292","doi":null,"metadata_source":"pith","pith_arxiv_id":"2008.10292","snapshot_observed_at":"2026-08-06T18:35:19.503584Z","title":"Automated Search for Resource-Efficient Branched Multi-Task Networks","venue":"cs.CV","work_id":"641d3185-dc71-43fb-a857-fb5cdf7f8bb2","year":2020},"citing_paper":{"arxiv_id":"2507.07883","last_updated":"2025-07-15T22:07:45Z","snapshot_observed_at":"2026-08-06T18:27:39.448830Z","submitted_at":"2025-07-10T16:06:02Z","title":"SAMO: A Lightweight Sharpness-Aware Approach for Multi-Task Optimization with Joint Global-Local Perturbation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:35:18.490872Z"},"links":{"cited_paper":"/paper/2008.10292","citing_paper":"/paper/2507.07883"},"observation_digest":"sha256:e2bb25339b505a24559221e66ba88568c22b42e0aca0f9799747ac57fef3ddb1","observation_id":"37e5197d-86a8-4f2f-a8df-4a197e44e30f","resolution":{"observed_at":"2026-08-06T18:35:19.515872Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2008.10292/citation-record","integrity":"/paper/2008.10292/integrity","json":"/paper/2008.10292/citation-record.json","paper":"/paper/2008.10292"},"outbound":[],"paper":{"arxiv_id":"2008.10292","last_updated":"2021-05-11T17:58:18Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-01T10:22:15.291477Z","submitted_at":"2020-08-24T09:49:19Z","title":"Automated Search for Resource-Efficient Branched Multi-Task Networks"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2008.10292."}