{"as_of":"2026-08-16T09:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59f53cfc64226ad4ab6e3c901f67e9caf4250505c7f5b70effe1faa3875b6d32","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:48:45.703376Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-10T17:39:42.992654Z","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-10T17:39:44.298775Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"cited_work":{"arxiv_id":"1908.04339","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.04339","snapshot_observed_at":"2026-08-10T17:39:44.298775Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","venue":"cs.LG","work_id":"55dc2e81-fddb-4841-9687-c71cfd780de0","year":2019},"citing_paper":{"arxiv_id":"2608.06963","last_updated":"2026-08-07T08:40:40Z","snapshot_observed_at":"2026-08-14T11:32:07.504602Z","submitted_at":"2026-08-07T08:40:40Z","title":"Learning in Deep Networks under Dale's Constraint","version":1},"reference_index":167,"source":"arxiv_source","source_observed_at":"2026-08-10T17:39:42.992654Z"},"links":{"cited_paper":"/paper/1908.04339","citing_paper":"/paper/2608.06963"},"observation_digest":"sha256:3b470121266f6556dece0d0b2df8a3869f193a4635cdc678b6402bd47418ab67","observation_id":"99a35d9c-0a63-44ff-8d8d-1b1b9a40d7ad","resolution":{"observed_at":"2026-08-10T17:39:44.303990Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.04339/citation-record","integrity":"/paper/1908.04339/integrity","json":"/paper/1908.04339/citation-record.json","paper":"/paper/1908.04339"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.10823","last_updated":"2017-11-08T16:09:35Z","snapshot_observed_at":"2026-08-14T20:57:10.006197Z","submitted_at":"2017-05-30T19:00:53Z","title":"Accelerating Neural Architecture Search using Performance Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10823","snapshot_observed_at":"2026-08-14T13:48:45.120571Z","title":"Baker, O","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.120571Z"},"links":{"cited_paper":"/paper/1705.10823","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:72cf0979687b996d3dc349aeea9155dfcb48ab88d763b2a94d4ab031c2260b7f","observation_id":"a93f9279-6909-4c14-835a-64913ef243b2","resolution":{"observed_at":"2026-08-14T13:48:45.120571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.04286","last_updated":"2018-04-12T02:20:47Z","snapshot_observed_at":"2026-08-14T19:26:48.876446Z","submitted_at":"2018-04-12T02:20:47Z","title":"Combating catastrophic forgetting with developmental compression","version":1},"cited_work":{"arxiv_id":"1804.04286","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.04286","snapshot_observed_at":"2026-08-14T13:48:46.056785Z","title":"Combating catastrophic forgetting with developmental compression","venue":"cs.AI","work_id":"6126043e-a9b8-44f5-948a-8d487fa3cfb5","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.158983Z"},"links":{"cited_paper":"/paper/1804.04286","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:d0cb26f5a96951a766727ef74e56fb0f8a9fe793f8327ceec28213d3b046fb31","observation_id":"b17b1c76-11c0-41f8-868e-71de72b1025b","resolution":{"observed_at":"2026-08-14T13:48:46.089376Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.05344","last_updated":"2017-08-17T16:03:33Z","snapshot_observed_at":"2026-08-14T20:40:49.338246Z","submitted_at":"2017-08-17T16:03:33Z","title":"SMASH: One-Shot Model Architecture Search through HyperNetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.05344","snapshot_observed_at":"2026-08-14T13:48:45.189139Z","title":"Brock, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.189139Z"},"links":{"cited_paper":"/paper/1708.05344","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:7caf6923024b90c3193be0072e5b3fff77701f447b6adcec2038715e60fafcf2","observation_id":"9d6a5056-4db8-47de-a641-dddf75d40690","resolution":{"observed_at":"2026-08-14T13:48:45.189139Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.448652Z","title":null,"venue":null,"work_id":"87fbec20-083e-4da2-9098-564f24c09cce","year":1997},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.247263Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:db2a4d01b4a7d6ee0afb03df036795396f094bda2c48e40a3e463a0669d0f0aa","observation_id":"6687794c-fa87-47bc-9323-cb49a4d0db94","resolution":{"observed_at":"2026-08-14T13:48:46.451349Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.04980","last_updated":"2018-05-14T01:32:02Z","snapshot_observed_at":"2026-08-14T19:15:50.818432Z","submitted_at":"2018-05-14T01:32:02Z","title":"Unifying and Merging Well-trained Deep Neural Networks for Inference Stage","version":1},"cited_work":{"arxiv_id":"1805.04980","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.04980","snapshot_observed_at":"2026-08-14T13:48:46.031179Z","title":"Unifying and Merging Well-trained Deep Neural Networks for Inference Stage","venue":"cs.CV","work_id":"05f7006b-f380-49cb-96a7-c41edec011f3","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.251914Z"},"links":{"cited_paper":"/paper/1805.04980","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:694102b2af5bcdea5864fdf161d8e426706a911f2fa9a98613d87945ec15bf64","observation_id":"21ff7864-f960-4294-afc4-a5ec2ab3c90b","resolution":{"observed_at":"2026-08-14T13:48:46.035130Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.03351","last_updated":"2017-12-09T07:50:27Z","snapshot_observed_at":"2026-08-15T15:39:56.246822Z","submitted_at":"2017-12-09T07:50:27Z","title":"Peephole: Predicting Network Performance Before Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.03351","snapshot_observed_at":"2026-08-14T13:48:45.255964Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.255964Z"},"links":{"cited_paper":"/paper/1712.03351","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:f046ad623b008f8209b58543e0198d726602adf22942a405d5839a8d93021b85","observation_id":"aedb617d-6b65-4ac1-80ef-be6601020a37","resolution":{"observed_at":"2026-08-14T13:48:45.255964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.01561","last_updated":"2018-06-28T06:54:39Z","snapshot_observed_at":"2026-08-14T19:48:45.374287Z","submitted_at":"2018-02-05T18:47:30Z","title":"IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.01561","snapshot_observed_at":"2026-08-14T13:48:45.260051Z","title":"Espeholt, H","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.260051Z"},"links":{"cited_paper":"/paper/1802.01561","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:1c6d3eb1d274fe6df562fb7ad9021884bf9b21d741dfaf0378decb74aa4effb7","observation_id":"3daed03e-eb30-4992-bee1-965747f5e13b","resolution":{"observed_at":"2026-08-14T13:48:45.260051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1701.08734","last_updated":"2017-01-30T18:06:07Z","snapshot_observed_at":"2026-08-14T21:18:51.601049Z","submitted_at":"2017-01-30T18:06:07Z","title":"PathNet: Evolution Channels Gradient Descent in Super Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.08734","snapshot_observed_at":"2026-08-14T13:48:45.263111Z","title":"Fernando, D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.263111Z"},"links":{"cited_paper":"/paper/1701.08734","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:2550aa850d89a788d498334b554696b501e971417047c13e5f9cdd068f579ff8","observation_id":"60e64d79-696a-4d30-952d-4d9b2d57712f","resolution":{"observed_at":"2026-08-14T13:48:45.263111Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.438694Z","title":null,"venue":null,"work_id":"323da6e0-8144-4582-8759-e759176fffb6","year":1999},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.267692Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:35be98f7bff5b3b1a9fceeec8ce2c5daa12b4956b5dd21e3827831805ccf838f","observation_id":"94a8378f-adb5-4b53-b333-6ea9788b4fc7","resolution":{"observed_at":"2026-08-14T13:48:46.441959Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09791","last_updated":"2019-03-13T09:05:31Z","snapshot_observed_at":"2026-08-14T19:11:28.410771Z","submitted_at":"2018-05-24T17:33:38Z","title":"Multi-Task Zipping via Layer-wise Neuron Sharing","version":2},"cited_work":{"arxiv_id":"1805.09791","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.09791","snapshot_observed_at":"2026-08-14T13:48:45.989155Z","title":"Multi-Task Zipping via Layer-wise Neuron Sharing","venue":"cs.NE","work_id":"d14bcdec-ddac-43d1-8d17-428bcc3d0458","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.270696Z"},"links":{"cited_paper":"/paper/1805.09791","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:98cc3bad5a8881b76b2dcebff994804a7c8de83c9d62dd60e25bcf99bf0dfa00","observation_id":"a7701be5-04c3-450d-89b0-3f1d2a3903cc","resolution":{"observed_at":"2026-08-14T13:48:45.992999Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.339333Z","title":"Jiang, Z","venue":null,"work_id":"3a2ffeee-ce69-4e1d-bf87-9be6cd72c783","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.273920Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:d275f182e69850845b8256fbfb516b3aabcb7770a2e8cf9327447411f264b866","observation_id":"afdc6f0e-341f-461d-9ccc-1a63e5eb4554","resolution":{"observed_at":"2026-08-14T13:48:46.407650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05137","last_updated":"2017-06-16T03:10:03Z","snapshot_observed_at":"2026-08-14T20:53:41.671424Z","submitted_at":"2017-06-16T03:10:03Z","title":"One Model To Learn Them All","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05137","snapshot_observed_at":"2026-08-14T13:48:45.277322Z","title":"Kaiser, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.277322Z"},"links":{"cited_paper":"/paper/1706.05137","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:589552b70ce96f13627573bedf8056eb98f7739e43c30db4c4392e0647262a4d","observation_id":"3edaf94f-8c75-45d0-b1f9-3fac8a0fcd20","resolution":{"observed_at":"2026-08-14T13:48:45.277322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.10255","last_updated":"2018-05-25T17:12:38Z","snapshot_observed_at":"2026-08-14T19:11:02.672522Z","submitted_at":"2018-05-25T17:12:38Z","title":"Parallel Architecture and Hyperparameter Search via Successive Halving and Classification","version":1},"cited_work":{"arxiv_id":"1805.10255","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.10255","snapshot_observed_at":"2026-08-14T13:48:45.965580Z","title":"Parallel Architecture and Hyperparameter Search via Successive Halving and Classification","venue":"cs.CV","work_id":"c327154b-9e27-4de1-bda4-8d10b5f247ce","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.280917Z"},"links":{"cited_paper":"/paper/1805.10255","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:2f9b7552913e64333c52c9462410a14f88af48423a744a2bfd5b6d0bcf34603d","observation_id":"1a48352f-1986-4db8-8d50-4bb9820293de","resolution":{"observed_at":"2026-08-14T13:48:45.969136Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07638","last_updated":"2019-07-30T20:07:41Z","snapshot_observed_at":"2026-08-14T17:13:44.136286Z","submitted_at":"2019-02-20T16:49:07Z","title":"Random Search and Reproducibility for Neural Architecture Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07638","snapshot_observed_at":"2026-08-14T13:48:45.284290Z","title":"Li and A","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.284290Z"},"links":{"cited_paper":"/paper/1902.07638","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:18e3fa75aeea6641a729b593fe30713cdf6bf331599203a240ff4bde1ee0917b","observation_id":"4084755f-01a0-48d4-8621-fa5269e88ba8","resolution":{"observed_at":"2026-08-14T13:48:45.284290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03745","last_updated":"2018-04-17T18:46:05Z","snapshot_observed_at":"2026-08-14T19:37:37.864451Z","submitted_at":"2018-03-10T03:02:09Z","title":"Evolutionary Architecture Search For Deep Multitask Networks","version":2},"cited_work":{"arxiv_id":"1803.03745","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.03745","snapshot_observed_at":"2026-08-14T13:48:45.890040Z","title":"Evolutionary Architecture Search For Deep Multitask Networks","venue":"cs.NE","work_id":"6bbdd6d7-fe38-45da-b5e0-3ca04b61e57c","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.298147Z"},"links":{"cited_paper":"/paper/1803.03745","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:a0718e0e05781e1c260612d1f20bf8397911f7445f0460208a1374d22f9105d0","observation_id":"df485cd3-4600-4775-a9f7-b84d98350847","resolution":{"observed_at":"2026-08-14T13:48:45.945921Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.00559","last_updated":"2018-07-26T19:51:26Z","snapshot_observed_at":"2026-08-14T20:07:44.068933Z","submitted_at":"2017-12-02T06:23:16Z","title":"Progressive Neural Architecture Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.00559","snapshot_observed_at":"2026-08-14T13:48:45.344249Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.344249Z"},"links":{"cited_paper":"/paper/1712.00559","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:fdb52a11551fa2d73aedeecf1bf1738d399f94bbb0af58c4d6e43318bfc4a487","observation_id":"84981c47-7659-4d00-8995-bf392c91bba9","resolution":{"observed_at":"2026-08-14T13:48:45.344249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00436","last_updated":"2018-02-22T22:31:30Z","snapshot_observed_at":"2026-08-14T20:17:56.379530Z","submitted_at":"2017-11-01T16:46:27Z","title":"Hierarchical Representations for Efficient Architecture Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00436","snapshot_observed_at":"2026-08-14T13:48:45.402006Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.402006Z"},"links":{"cited_paper":"/paper/1711.00436","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:7ad28a64e08a08576c0068edf25a3461574f1460ccb6afb08a262950d6d1cd65","observation_id":"4a1629b9-e150-4c31-9d3d-56835b585deb","resolution":{"observed_at":"2026-08-14T13:48:45.402006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.10704","last_updated":"2019-04-05T05:57:50Z","snapshot_observed_at":"2026-08-14T19:31:26.784303Z","submitted_at":"2018-03-28T16:15:45Z","title":"End-to-End Multi-Task Learning with Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.10704","snapshot_observed_at":"2026-08-14T13:48:45.434360Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.434360Z"},"links":{"cited_paper":"/paper/1803.10704","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:52998e7b3a19163f50cc08bd68c364749fef30c829c0bc503a6937b4a38cfdc7","observation_id":"3a5b3ea8-e961-4f1b-8331-d22f824836ce","resolution":{"observed_at":"2026-08-14T13:48:45.434360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.06519","last_updated":"2018-03-16T21:29:28Z","snapshot_observed_at":"2026-08-14T19:53:41.582109Z","submitted_at":"2018-01-19T18:25:59Z","title":"Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weights","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.06519","snapshot_observed_at":"2026-08-14T13:48:45.438621Z","title":"Mallya and S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.438621Z"},"links":{"cited_paper":"/paper/1801.06519","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:bd5a88e5ad562c0dec3aada896e624a09e858b21bf6b8028aa1a5c005db79db4","observation_id":"01bc20a8-0b77-4102-9b74-7b992ea87ae8","resolution":{"observed_at":"2026-08-14T13:48:45.438621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07055","last_updated":"2018-03-19T17:35:14Z","snapshot_observed_at":"2026-08-14T19:34:42.574238Z","submitted_at":"2018-03-19T17:35:14Z","title":"Simple random search provides a competitive approach to reinforcement learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.07055","snapshot_observed_at":"2026-08-14T13:48:45.442202Z","title":"Mania, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.442202Z"},"links":{"cited_paper":"/paper/1803.07055","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:35440223e2fc1c341fd6ae8f1a2d611cb5166097819d81ca35786c8cd01084bd","observation_id":"11e3ff6d-0fc1-4bf5-8fce-f192cf6d8ec7","resolution":{"observed_at":"2026-08-14T13:48:45.442202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00108","last_updated":"2018-02-13T02:05:34Z","snapshot_observed_at":"2026-08-14T20:18:12.940032Z","submitted_at":"2017-10-31T20:55:06Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00108","snapshot_observed_at":"2026-08-14T13:48:45.445904Z","title":"Meyerson and R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.445904Z"},"links":{"cited_paper":"/paper/1711.00108","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:bc0ea3a3e11218ba355961ab0d5793f1c4184801068da6d4b4567e0aa4acd0b0","observation_id":"66fb5556-903d-4335-bd44-a786089d0b55","resolution":{"observed_at":"2026-08-14T13:48:45.445904Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.268628Z","title":"Misra, A","venue":null,"work_id":"34dbad9e-b75d-4fb9-ab4f-d40360f83144","year":2016},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.449115Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:ae2fbe9e0e2fba68e95a852a11c4d791c6fcef820b4c69eebf4137bf82dca376","observation_id":"729a35d0-98bd-4958-ad00-834d76b6b745","resolution":{"observed_at":"2026-08-14T13:48:46.294675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03268","last_updated":"2018-02-12T03:34:00Z","snapshot_observed_at":"2026-08-14T19:47:21.805117Z","submitted_at":"2018-02-09T14:14:37Z","title":"Efficient Neural Architecture Search via Parameter Sharing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03268","snapshot_observed_at":"2026-08-14T13:48:45.452439Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.452439Z"},"links":{"cited_paper":"/paper/1802.03268","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:e019e0a04bfd2a881310bc18ed7f7e2be9ea071c4319548ba9343760f98de3ab","observation_id":"2f21672a-0fc1-4401-b739-7df629c26086","resolution":{"observed_at":"2026-08-14T13:48:45.452439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.01548","last_updated":"2019-02-16T23:28:16Z","snapshot_observed_at":"2026-08-14T19:48:45.843896Z","submitted_at":"2018-02-05T18:20:52Z","title":"Regularized Evolution for Image Classifier Architecture Search","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.01548","snapshot_observed_at":"2026-08-14T13:48:45.455667Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.455667Z"},"links":{"cited_paper":"/paper/1802.01548","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:b13ced2cd9a5d2af42c2c7a53ff8e613a7b14146f3b43b253089181675f4106c","observation_id":"5114cc11-b047-4188-a69a-9b4ee6cc3e30","resolution":{"observed_at":"2026-08-14T13:48:45.455667Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.217042Z","title":"Rebuffi, H","venue":null,"work_id":"67a6e437-69eb-40eb-bd19-8e9167bea9bc","year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.459011Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:aefcd38080acd842f6d629d83d092340642a4da3534c5b8de1d6ddcdf3d3d4fe","observation_id":"3c1d5de6-84f0-4597-b486-87e052576f11","resolution":{"observed_at":"2026-08-14T13:48:46.237432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.206973Z","title":"Rebuffi, H","venue":null,"work_id":"c3ddfb82-303e-47bd-aa86-47d40eef4d2d","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.461608Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:b7caf5864d192feac9c059f772b195ecf72a308535d6e0af8a0a60fe5ce6af5a","observation_id":"0292eeb9-7e9b-4d26-b75d-b1ccf4560563","resolution":{"observed_at":"2026-08-14T13:48:46.210347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.01239","last_updated":"2017-12-31T14:53:00Z","snapshot_observed_at":"2026-08-14T20:17:12.859311Z","submitted_at":"2017-11-03T17:07:51Z","title":"Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.01239","snapshot_observed_at":"2026-08-14T13:48:45.464569Z","title":"Rosenbaum, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.464569Z"},"links":{"cited_paper":"/paper/1711.01239","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:17e5d4a930399b3a1ff0735241dee1ded15c4dfd30ce96727c2537acc7acabd0","observation_id":"ba6e41c5-f6aa-4408-b828-51c7fdad2482","resolution":{"observed_at":"2026-08-14T13:48:45.464569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.04228","last_updated":"2018-02-13T19:41:40Z","snapshot_observed_at":"2026-08-14T21:01:19.533639Z","submitted_at":"2017-05-11T15:04:10Z","title":"Incremental Learning Through Deep Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.04228","snapshot_observed_at":"2026-08-14T13:48:45.467820Z","title":"Rosenfeld and J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.467820Z"},"links":{"cited_paper":"/paper/1705.04228","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:9cc43f5fec4be6e57f32d3ecf8d66cb8d3b7ae9d502e4e5de037560d82efca1f","observation_id":"671abd4e-c100-4853-bd25-f98fc3ef1601","resolution":{"observed_at":"2026-08-14T13:48:45.467820Z","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-13T21:53:02.384757Z","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-14T13:48:45.471517Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.471517Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:bc526b0bc3d1538b2aec08dd21440646d976e46db6c8040da48c1c90447913aa","observation_id":"cd3a64ed-3906-4727-8948-55b17c8a0147","resolution":{"observed_at":"2026-08-14T13:48:45.471517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.08142","last_updated":"2018-11-19T10:30:52Z","snapshot_observed_at":"2026-08-14T20:58:50.386572Z","submitted_at":"2017-05-23T08:58:09Z","title":"Latent Multi-task Architecture Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.08142","snapshot_observed_at":"2026-08-14T13:48:45.475055Z","title":"Ruder, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.475055Z"},"links":{"cited_paper":"/paper/1705.08142","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:0406bb95a62c412634308d873f7daa68639a354ec25734162d099792ec735095","observation_id":"4de0f676-4a73-4b57-bba7-fa80ae4a0c93","resolution":{"observed_at":"2026-08-14T13:48:45.475055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.06295","last_updated":"2016-01-07T18:43:03Z","snapshot_observed_at":"2026-08-14T22:22:10.851051Z","submitted_at":"2015-11-19T18:38:47Z","title":"Policy Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.06295","snapshot_observed_at":"2026-08-14T13:48:45.479129Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.479129Z"},"links":{"cited_paper":"/paper/1511.06295","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:eda771337c480ae1724f7604334fe5f0b1de316be10397322a909a6fe6b692cd","observation_id":"10e5dd78-efb5-44da-835d-ce9a97664265","resolution":{"observed_at":"2026-08-14T13:48:45.479129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.06053","last_updated":"2017-05-21T12:47:34Z","snapshot_observed_at":"2026-08-14T21:15:40.203606Z","submitted_at":"2017-02-20T16:31:56Z","title":"Learning to Multi-Task by Active Sampling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.06053","snapshot_observed_at":"2026-08-14T13:48:45.565773Z","title":"Sharma, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.565773Z"},"links":{"cited_paper":"/paper/1702.06053","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:f9c662dcd6d6179c4929b98bbd2872116ffe0650df66ff7f19f01a91d696935c","observation_id":"3b3be701-7cd8-4b75-be77-73e5a9f0424b","resolution":{"observed_at":"2026-08-14T13:48:45.565773Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.197360Z","title":"Wierstra, T","venue":null,"work_id":"90fc6b1e-2fa3-463f-b27d-6a72bc47c335","year":2008},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.681194Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:813ae9e93e540c5e52bf4ed747a44de598e7588e01d5ba9f3fcc79c7e3e2a29d","observation_id":"02d40ef2-1a39-44e5-9a95-5b8c0469ac40","resolution":{"observed_at":"2026-08-14T13:48:46.200483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.187900Z","title":null,"venue":null,"work_id":"b587fd45-d421-4356-9c0c-2198db2ebd2e","year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.684757Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:2bbf742fb2ded400471dc844887b2539a8b6693f592183c13c94f32f4bd1aa12","observation_id":"955a2468-9503-41bb-9c32-9249620eb4e9","resolution":{"observed_at":"2026-08-14T13:48:46.191183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.177593Z","title":null,"venue":null,"work_id":"717b530b-4d11-482d-aaec-0163958cc5c1","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.688811Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:78c6660cf8f765ffb1ab66b767c1d90d32c00ddfd73e7c9b7a9ffab66ef0624e","observation_id":"bf0a9037-31af-4f59-8985-c4e521bfaf26","resolution":{"observed_at":"2026-08-14T13:48:46.181333Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:48:46.168083Z","title":null,"venue":null,"work_id":"bb28256c-65b4-4aca-9686-09eef2716e98","year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.692067Z"},"links":{"citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:ddcb768b93c0af6916a87bfb23ece719ddc3040067ace98fd8bce9d66ddf97b7","observation_id":"394570f2-8970-4544-b58d-f9171025936b","resolution":{"observed_at":"2026-08-14T13:48:46.170863Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.06906","last_updated":"2018-07-18T13:11:08Z","snapshot_observed_at":"2026-08-14T18:50:31.264888Z","submitted_at":"2018-07-18T13:11:08Z","title":"Towards Automated Deep Learning: Efficient Joint Neural Architecture and Hyperparameter Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.06906","snapshot_observed_at":"2026-08-14T13:48:45.696321Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.696321Z"},"links":{"cited_paper":"/paper/1807.06906","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:94e59e1ce6e0dc63b4e8ca0cd53fb5e61ab1c3dafd4286e41fc3870d020cb666","observation_id":"372e991a-b9f4-427f-af29-80b8be56d603","resolution":{"observed_at":"2026-08-14T13:48:45.696321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08114","last_updated":"2021-03-29T14:32:58Z","snapshot_observed_at":"2026-08-14T20:45:33.188864Z","submitted_at":"2017-07-25T04:43:47Z","title":"A Survey on Multi-Task Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08114","snapshot_observed_at":"2026-08-14T13:48:45.699797Z","title":"Zhang and Q","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.699797Z"},"links":{"cited_paper":"/paper/1707.08114","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:3068cb73e4d799e0f97cec7f7870a3c761da1d0210b5df93a52fe607e25944e9","observation_id":"2c5f8d7d-2e96-41fb-b9b8-046e3d6ae77c","resolution":{"observed_at":"2026-08-14T13:48:45.699797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01578","last_updated":"2017-02-15T05:28:05Z","snapshot_observed_at":"2026-08-14T21:31:52.294004Z","submitted_at":"2016-11-05T00:41:37Z","title":"Neural Architecture Search with Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01578","snapshot_observed_at":"2026-08-14T13:48:45.703376Z","title":"Zoph and Q","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.703376Z"},"links":{"cited_paper":"/paper/1611.01578","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:782f8c0bd56f3ca2d6fd1c4f533f257b7847660f2d8e0d898c05408b72164344","observation_id":"57d3b437-3398-4c01-bfcb-40f5abc42511","resolution":{"observed_at":"2026-08-14T13:48:45.703376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":5,"verified_fuzzy":5},"total_outbound_references":39},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 1 inbound Pith citation observation for arXiv:1908.04339."}