{"as_of":"2026-08-09T14:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:516283d4febbe767cb03d187a3e843db0e0b4592a1498f7c11d1da684a785aa3","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-09T06:31:02.800959+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-06T19:32:54.352209Z","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-06T19:32:54.844129Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.10703","last_updated":"2019-02-24T02:03:00Z","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T03:12:37Z","title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer Learning","version":2},"cited_work":{"arxiv_id":"1810.10703","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10703","snapshot_observed_at":"2026-08-06T19:32:54.844129Z","title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer Learning","venue":"cs.LG","work_id":"c6824e82-0078-4a98-b067-590142f3fd3d","year":2018},"citing_paper":{"arxiv_id":"2507.10446","last_updated":"2025-07-15T02:06:07Z","snapshot_observed_at":"2026-08-09T07:24:10.601027Z","submitted_at":"2025-07-07T18:48:09Z","title":"Acquiring and Adapting Priors for Novel Tasks via Neural Meta-Architectures","version":2},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-08-06T19:32:54.352209Z"},"links":{"cited_paper":"/paper/1810.10703","citing_paper":"/paper/2507.10446"},"observation_digest":"sha256:f4bccf657053e18208f4cff1ed028903eba9c96c7604c1921bd27d6aefc90e4d","observation_id":"aecca0c6-4557-4e06-8ca8-625a92d6bf61","resolution":{"observed_at":"2026-08-06T19:32:54.847753Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10703","last_updated":"2019-02-24T02:03:00Z","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T03:12:37Z","title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.10703","snapshot_observed_at":"2026-08-01T20:43:48.134105Z","title":"Pramod Kaushik Mudrakarta, Mark Sandler, Andrey Zh- moginov, and Andrew Howard","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-09T04:46:11.099210Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.134105Z"},"links":{"cited_paper":"/paper/1810.10703","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:2164082ea9923d301e92c8bb742e2a73cf047bb82ff33258de4dd89485755cbe","observation_id":"6fa3eb02-427c-4548-882c-000c899c89c5","resolution":{"observed_at":"2026-08-01T20:43:48.134105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1810.10703/citation-record","integrity":"/paper/1810.10703/integrity","json":"/paper/1810.10703/citation-record.json","paper":"/paper/1810.10703"},"outbound":[],"paper":{"arxiv_id":"1810.10703","last_updated":"2019-02-24T02:03:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:10:28.375412Z","submitted_at":"2018-10-25T03:12:37Z","title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer 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 2 inbound Pith citation observations for arXiv:1810.10703."}