{"as_of":"2026-08-16T17:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c0395dd69f477a7e20aaee1536e0459ae0c0b429688e65190bfb52e8e3d3f5d","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-16T06:30:59.297886+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-11T16:47:38.871696Z","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-04T13:19:50.441616Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":"1605.06431","doi":null,"metadata_source":"pith","pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-07-04T13:19:50.441616Z","title":"2, 6 [VWB16] Andreas Veit, Michael Wilber, and Serge Belongie","venue":"cs.CV","work_id":"44de2fe2-41d1-4a32-9821-429f7d5a7190","year":2016},"citing_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-08-13T17:41:53.092611Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T15:31:29.677449Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2001.08361"},"observation_digest":"sha256:2bd4b784038c292e85f55e88b0ddec8f7b48879ed14e32aac015a27a548b3da4","observation_id":"3f9e9ae6-f5d0-487a-bfea-e4959acc9979","resolution":{"observed_at":"2026-05-09T04:51:47.643433Z","resolver_source":"arxiv_id","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":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-08-11T16:47:38.871696Z","title":"Wang, C.-Y ., Yeh, I.-H., and Liao, H.-Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.09853","last_updated":"2024-12-13T04:46:17Z","snapshot_observed_at":"2026-08-15T17:37:27.268308Z","submitted_at":"2024-12-13T04:46:17Z","title":"Understand the Effectiveness of Shortcuts through the Lens of DCA","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T16:47:38.871696Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2412.09853"},"observation_digest":"sha256:b4f86a518329fa8214b146e3c4de8081b242ea74a3d4abe3b8b30c80de03933a","observation_id":"cdb2dc31-f769-49c1-a691-747002522c52","resolution":{"observed_at":"2026-08-11T16:47:38.871696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-08-07T00:25:28.449709Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.14198","last_updated":"2025-06-17T05:31:42Z","snapshot_observed_at":"2026-08-13T06:13:03.182338Z","submitted_at":"2025-06-17T05:31:42Z","title":"AMPLIFY: Actionless Motion Priors for Robot Learning from Videos","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:28.449709Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2506.14198"},"observation_digest":"sha256:51ffcf6cb5449b960919ae4b573e932ab70546fd880c306e50f029e9774db52c","observation_id":"80b6b85f-7c2d-4eaf-8e25-98df681e5119","resolution":{"observed_at":"2026-08-07T00:25:28.449709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":"1605.06431","doi":null,"metadata_source":"pith","pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-07-04T13:19:50.441616Z","title":"2, 6 [VWB16] Andreas Veit, Michael Wilber, and Serge Belongie","venue":"cs.CV","work_id":"44de2fe2-41d1-4a32-9821-429f7d5a7190","year":2016},"citing_paper":{"arxiv_id":"2606.26538","last_updated":"2026-06-25T02:25:00Z","snapshot_observed_at":"2026-08-14T12:59:05.572947Z","submitted_at":"2026-06-25T02:25:00Z","title":"CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-26T05:22:26.818078Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2606.26538"},"observation_digest":"sha256:60628881b991344bcc0394d490433a2f7454d51dbeffbf93ba4eadd60ec2b800","observation_id":"fdc858a7-3ef0-4ad3-88be-7b58e5fab955","resolution":{"observed_at":"2026-07-04T13:19:50.443121Z","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":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-08-01T15:58:13.164778Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18130","last_updated":"2026-07-20T16:24:17Z","snapshot_observed_at":"2026-08-12T16:10:34.607145Z","submitted_at":"2026-07-20T16:24:17Z","title":"Manifold-Constrained Hyper-Connections for Parameter-Efficient Finetuning","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-01T15:58:13.164778Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2607.18130"},"observation_digest":"sha256:63676f1bc6bbbc0ce2fc6351c394c91a0ccc3ca406a43e7d005825c9db8f08e0","observation_id":"700fbcec-a778-465c-9072-cd26fece285a","resolution":{"observed_at":"2026-08-01T15:58:13.164778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.06431","last_updated":"2016-10-27T00:43:58Z","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.06431","snapshot_observed_at":"2026-07-31T23:37:15.914181Z","title":"Wilber and Serge J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23925","last_updated":"2026-07-27T01:36:40Z","snapshot_observed_at":"2026-08-15T14:26:43.823087Z","submitted_at":"2026-07-27T01:36:40Z","title":"Greedy dynamical meta-learning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-07-31T23:37:15.914181Z"},"links":{"cited_paper":"/paper/1605.06431","citing_paper":"/paper/2607.23925"},"observation_digest":"sha256:44537115f49dc28d4ac3cc244a59873b5775399bc3164832d247ceb219f744ad","observation_id":"e6d69fb9-c6a3-46b7-bd0b-c792345f98a8","resolution":{"observed_at":"2026-07-31T23:37:15.914181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1605.06431/citation-record","integrity":"/paper/1605.06431/integrity","json":"/paper/1605.06431/citation-record.json","paper":"/paper/1605.06431"},"outbound":[],"paper":{"arxiv_id":"1605.06431","last_updated":"2016-10-27T00:43:58Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-14T21:56:28.089609Z","submitted_at":"2016-05-20T16:44:03Z","title":"Residual Networks Behave Like Ensembles of Relatively Shallow 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-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 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1605.06431."}