{"as_of":"2026-08-09T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b97536717e57c057f5a2c283b9eeaf12f87b0b8e085a507539c96253c8f3c7c8","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:11:46.044751Z","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-07-04T14:19:53.556405Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-08-08T16:11:46.044751Z","title":"Packnet: Adding multiple tasks to a single network by iterative pruning, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06300","last_updated":"2025-02-10T09:43:43Z","snapshot_observed_at":"2026-08-09T13:45:52.887809Z","submitted_at":"2025-02-10T09:43:43Z","title":"The impact of allocation strategies in subset learning on the expressive power of neural networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T16:11:46.044751Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2502.06300"},"observation_digest":"sha256:d3844ba6d55237f8ff333be4a8a17d54ac4db1685af66d2b53cf4c9b9339823a","observation_id":"0d8b0f5a-e18e-4202-938a-c8d361f16c67","resolution":{"observed_at":"2026-08-08T16:11:46.044751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-08-07T11:10:11.568409Z","title":"Mallya, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.03320","last_updated":"2025-06-03T19:06:41Z","snapshot_observed_at":"2026-08-08T23:26:40.245215Z","submitted_at":"2025-06-03T19:06:41Z","title":"The Future of Continual Learning in the Era of Foundation Models: Three Key Directions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:11.568409Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2506.03320"},"observation_digest":"sha256:1d4f078748a1caabb1469767316754844de38472e9b48783645836dde319de68","observation_id":"1e3293f7-faa4-46ae-a36c-40e9b8d32e9a","resolution":{"observed_at":"2026-08-07T11:10:11.568409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-08-06T05:47:37.301030Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.01311","last_updated":"2025-08-02T10:54:55Z","snapshot_observed_at":"2026-08-09T16:38:35.787308Z","submitted_at":"2025-08-02T10:54:55Z","title":"C3D-AD: Toward Continual 3D Anomaly Detection via Kernel Attention with Learnable Advisor","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T05:47:37.301030Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2508.01311"},"observation_digest":"sha256:cc3e06d5cfac1ae86b963b45a231a041de2c8e2e8f64703e05b08fc045870f6c","observation_id":"a5235a8c-ad07-4e8c-b8a8-fa8dfb812089","resolution":{"observed_at":"2026-08-06T05:47:37.301030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":"1711.05769","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-07-04T14:19:53.556405Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","venue":"cs.CV","work_id":"026043c1-5f64-42b5-bbb9-07c1ef3b0c73","year":2017},"citing_paper":{"arxiv_id":"2508.18187","last_updated":"2026-04-13T21:17:05Z","snapshot_observed_at":"2026-07-06T22:18:21.877811Z","submitted_at":"2025-08-25T16:44:43Z","title":"BRAIN: Bias-Mitigation Continual Learning Approach to Vision-Brain Understanding","version":2},"reference_index":114,"source":"pdf_text","source_observed_at":"2026-05-18T21:13:41.362773Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2508.18187"},"observation_digest":"sha256:2b981f68956c4bd184aa804d9abe0e36148ea1449bbd3727145ffad6b629f473","observation_id":"3cbb0ce2-7cde-4140-bd8a-472275b78ce9","resolution":{"observed_at":"2026-05-18T21:16:51.518692Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":"1711.05769","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-07-04T14:19:53.556405Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","venue":"cs.CV","work_id":"026043c1-5f64-42b5-bbb9-07c1ef3b0c73","year":2017},"citing_paper":{"arxiv_id":"2605.01542","last_updated":"2026-05-02T17:09:31Z","snapshot_observed_at":"2026-07-06T23:14:43.034336Z","submitted_at":"2026-05-02T17:09:31Z","title":"Mesh Based Simulations with Spatial and Temporal awareness","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-09T15:00:51.468683Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2605.01542"},"observation_digest":"sha256:68c70d0ab3db7c2a4c7c8f99b3990bf0c552e8826cbc00d26bdfce8cf205f215","observation_id":"21b32f6c-49d1-49f6-a696-5a2be6cf01c3","resolution":{"observed_at":"2026-05-11T16:46:20.952368Z","resolver_source":"arxiv_id","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":"1711.05769","last_updated":"2018-05-13T16:48:51Z","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","version":2},"cited_work":{"arxiv_id":"1711.05769","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.05769","snapshot_observed_at":"2026-07-04T14:19:53.556405Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","venue":"cs.CV","work_id":"026043c1-5f64-42b5-bbb9-07c1ef3b0c73","year":2017},"citing_paper":{"arxiv_id":"2606.27374","last_updated":"2026-06-25T17:59:56Z","snapshot_observed_at":"2026-07-07T00:01:34.696890Z","submitted_at":"2026-06-25T17:59:56Z","title":"World Action Models Enable Continual Imitation Learning with Recurrent Generative Replays","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T04:20:26.522615Z"},"links":{"cited_paper":"/paper/1711.05769","citing_paper":"/paper/2606.27374"},"observation_digest":"sha256:c0e3c596b4a02eb37fe55ec314e6d56d5821578405935af80b17f3dcf1976cd2","observation_id":"83c033c6-826e-4e3f-8bbe-9c2a2c1063e9","resolution":{"observed_at":"2026-07-04T14:19:53.559242Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1711.05769/citation-record","integrity":"/paper/1711.05769/integrity","json":"/paper/1711.05769/citation-record.json","paper":"/paper/1711.05769"},"outbound":[],"paper":{"arxiv_id":"1711.05769","last_updated":"2018-05-13T16:48:51Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-09T02:59:37.531805Z","submitted_at":"2017-11-15T19:36:51Z","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning"},"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 6 inbound Pith citation observations for arXiv:1711.05769."}