{"as_of":"2026-08-09T04:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:634793b4dd23c4da3264a612230a161e4d495f40b22d98df93e1fac0e8e01097","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:43:48.614883Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16554/citation-record","integrity":"/paper/2607.16554/integrity","json":"/paper/2607.16554/citation-record.json","paper":"/paper/2607.16554"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2108.05036","last_updated":"2021-08-20T19:39:31Z","snapshot_observed_at":"2026-08-04T04:54:10.587671Z","submitted_at":"2021-08-11T05:15:33Z","title":"DEMix Layers: Disentangling Domains for Modular Language Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.05036","snapshot_observed_at":"2026-08-01T20:43:47.709470Z","title":"Demix layers: Disentan- gling domains for modular language modeling.arXiv preprint arXiv:2108.05036,","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-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.709470Z"},"links":{"cited_paper":"/paper/2108.05036","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:b91d1a778042f18dad61a8d42daa1b60ccfe66b3502dad5d2817182d039c4d78","observation_id":"6509145a-8b62-4856-99b3-033735ff69ba","resolution":{"observed_at":"2026-08-01T20:43:47.709470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:43:47.905183Z","title":"doi: 10.18653/v1/2021.acl-long.353","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.905183Z"},"links":{"citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:1fe61dc07fdbb7b84593ed867e0a66750de42bdc8d76843f43f80649a84ce128","observation_id":"56bde78b-b3c7-467e-9411-77a44a10cfa3","resolution":{"observed_at":"2026-08-01T20:43:47.905183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08T10:54:48.111332Z","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:c19be1d7e15af3057a51bca6600d705eef65aa7d4d064e43bf0b598522f8c4f8","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"}},{"citation":{"cited_paper":{"arxiv_id":"2007.00339","last_updated":"2021-03-01T12:12:22Z","snapshot_observed_at":"2026-08-01T21:54:33.800694Z","submitted_at":"2020-07-01T09:06:20Z","title":"Multi-Task Variational Information Bottleneck","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.00339","snapshot_observed_at":"2026-08-01T20:43:48.283886Z","title":"Weizhu Qian, Bowei Chen, Yichao Zhang, Guanghui Wen, and Franck Gechter","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.283886Z"},"links":{"cited_paper":"/paper/2007.00339","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:a238abfaf2f771fb09576459688c82b5f75f46087c35ddda2c253d46dfacde2b","observation_id":"c36e4397-703b-4388-be0c-2f017dcb367d","resolution":{"observed_at":"2026-08-01T20:43:48.283886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:43:48.614883Z","title":"Let A∈R T×d stack a⊤ t as rows","venue":null,"work_id":null,"year":2088},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.614883Z"},"links":{"citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:592b83240bb989e27233faba59b68cd51f69c181389948a0ead43169a6ae6911","observation_id":"721b7ace-62b2-45f6-b32f-b66ae22cdb6b","resolution":{"observed_at":"2026-08-01T20:43:48.614883Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.05808","last_updated":"2020-08-13T10:45:31Z","snapshot_observed_at":"2026-08-08T00:08:47.316086Z","submitted_at":"2020-08-13T10:45:31Z","title":"Small Towers Make Big Differences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.05808","snapshot_observed_at":"2026-08-01T20:43:48.539323Z","title":"Small towers make big differences.arXiv preprint arXiv:2008.05808,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.539323Z"},"links":{"cited_paper":"/paper/2008.05808","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:e9725fa9416b9cea5539a085b7578ab8e4e28f04141921cd719d1871bb249af5","observation_id":"5021456e-7034-4835-9a20-c5a159aa068e","resolution":{"observed_at":"2026-08-01T20:43:48.539323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04489","last_updated":"2021-06-08T16:16:40Z","snapshot_observed_at":"2026-08-03T19:17:21.128233Z","submitted_at":"2021-06-08T16:16:40Z","title":"Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04489","snapshot_observed_at":"2026-08-01T20:43:48.012837Z","title":"Parameter-efficient multi- task fine-tuning for transformers via shared hypernet- works.arXiv preprint arXiv:2106.04489,","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-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.012837Z"},"links":{"cited_paper":"/paper/2106.04489","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:fe93ad83b217c6feef4fffc466cf1f63facf808cdabf04c506192e13eb771ad0","observation_id":"46268373-9710-4714-860e-83a90a7e91f1","resolution":{"observed_at":"2026-08-01T20:43:48.012837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-08-01T20:43:48.391015Z","title":"An overview of multi-task learning in deep neural networks.arXiv preprint arXiv:1706.05098,","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-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.391015Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:13666315b0bd0b1ac4a1c6b5b6d5f3d0e348f163e46ce89fac60dc3543f45642","observation_id":"1678fcc3-d794-479a-859e-e980712b268f","resolution":{"observed_at":"2026-08-01T20:43:48.391015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T20:43:47.574620Z","title":"doi: 10.18653/v1/2020.acl-main.372","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.574620Z"},"links":{"citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:24cf4cc12ad2401bc9270b84950f526a1d717a9eaf0a35795b06b90c2696d7da","observation_id":"3fcb24c6-2898-477c-a7e4-4cf5fdc4b9da","resolution":{"observed_at":"2026-08-01T20:43:47.574620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.00410","last_updated":"2019-10-23T22:47:44Z","snapshot_observed_at":"2026-07-06T05:21:01.935928Z","submitted_at":"2016-12-01T20:12:40Z","title":"Deep Variational Information Bottleneck","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.00410","snapshot_observed_at":"2026-08-01T20:43:47.282658Z","title":"doi: 10.18653/v1/2021.acl-long.568","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.282658Z"},"links":{"cited_paper":"/paper/1612.00410","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:5ec68fb53d933bc2251da1e74c7ac3ecf34ff694b220c871f25be323808dc033","observation_id":"0ebb14ca-da17-4d32-aa96-3baa8320a081","resolution":{"observed_at":"2026-08-01T20:43:47.282658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04366","last_updated":"2022-02-02T16:39:23Z","snapshot_observed_at":"2026-08-08T06:15:11.222260Z","submitted_at":"2021-10-08T20:22:26Z","title":"Towards a Unified View of Parameter-Efficient Transfer Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04366","snapshot_observed_at":"2026-08-01T20:43:47.807286Z","title":"Towards a unified view of parameter-efficient transfer learning.arXiv preprint arXiv:2110.04366,","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-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.807286Z"},"links":{"cited_paper":"/paper/2110.04366","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:5cfd61dd93fd5bc488eb60e118fb11270f5fd6d8aa35d0b171f12af888553687","observation_id":"4c1c03d2-17b8-4ab4-a286-7a418dd79f5f","resolution":{"observed_at":"2026-08-01T20:43:47.807286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.acl-long.144","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi: 10.18653/v1/2023.acl-long.144","venue":null,"work_id":"9cb5d6ba-26cf-4b9a-8000-42961a3dab13","year":2023},"citing_paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:47.407860Z"},"links":{"citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:622e9e49e8a4c91211ac222f6ec4bc23bc267e7c971cd37b923d101123dc11f3","observation_id":"f4a5716a-9ec9-415b-8748-d44b266bf8eb","resolution":{"observed_at":"2026-08-01T20:48:28.309504Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-08-07T10:46:08.274157Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-01T20:43:48.475747Z","title":"The information bottleneck method.arXiv preprint physics/0004057,","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-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T20:43:48.475747Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/2607.16554"},"observation_digest":"sha256:daabd14fd10cf85a47457cb46d933b4e160c4e3c7c13c8e8a8a8208196e309bb","observation_id":"f995367d-5129-4ec1-b24c-ddeb535748fb","resolution":{"observed_at":"2026-08-01T20:43:48.475747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16554","last_updated":"2026-07-17T23:31:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T10:54:48.111332Z","submitted_at":"2026-07-17T23:31:12Z","title":"Capacity and Redundancy Trade-offs in Multi-Task Learning"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":13},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.16554."}