{"as_of":"2026-08-13T17:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a162bc156b69f79cdbade23d6c6ebd981ae4694a6d90acf5592ef346318b9dc","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-06T15:57:36.129834Z","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-13T06:32:02.005865+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/2507.14747/citation-record","integrity":"/paper/2507.14747/integrity","json":"/paper/2507.14747/citation-record.json","paper":"/paper/2507.14747"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:57:35.412939Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.412939Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:fcca7847162f827a2864116b9946635fedb007756baa3e3068b584b61291eae3","observation_id":"e662917b-af75-4d2e-addc-5300b0379434","resolution":{"observed_at":"2026-08-06T15:57:35.412939Z","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-06T15:57:35.490099Z","title":"H., Hinton, G","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.490099Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:3083abb27bb8318025090ea4bd90949a668862ebd787a97fdee61f1798367ca0","observation_id":"d9d1da3d-64a5-4daf-bbc7-f0413a65a5a9","resolution":{"observed_at":"2026-08-06T15:57:35.490099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.03635","last_updated":"2019-03-04T15:51:11Z","snapshot_observed_at":"2026-08-05T23:54:27.386622Z","submitted_at":"2018-03-09T18:51:28Z","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.03635","snapshot_observed_at":"2026-08-06T15:57:35.567218Z","title":"and Carbin, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.567218Z"},"links":{"cited_paper":"/paper/1803.03635","citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:972c47c28d40fcf68f849f95b91b02430ad703b90ea4f569a01b22712d5ae1bc","observation_id":"1414f309-e7c2-4a9c-8a72-363e932a327a","resolution":{"observed_at":"2026-08-06T15:57:35.567218Z","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-06T15:57:37.218606Z","title":null,"venue":null,"work_id":"e82dc750-1837-4a74-9984-74b26820b843","year":1982},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.667192Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:844dfa33fd29c9852bab04d29f104ce7c42cb6c449e697aa7dea463c3c260d43","observation_id":"265e094e-7417-45ca-9860-e381ff0004ab","resolution":{"observed_at":"2026-08-06T15:57:37.268739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-06T15:57:35.756589Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.756589Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:7bf39f933398a97fed53ba80abfe2d634d5ae571ffaa4daf5e24e270e9f003cb","observation_id":"0a435bce-e002-445d-9bba-44dc437022fe","resolution":{"observed_at":"2026-08-06T15:57:35.756589Z","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-06T15:57:37.059796Z","title":null,"venue":null,"work_id":"3f134a6f-ebff-41be-a169-af03d96c87f8","year":2022},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.803309Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:1412067fffe6befcc6082a6b2b6d9f30a2608df189e8e52939a9e1b0de18b4f8","observation_id":"f8a657d4-035c-40a1-9e18-fdad45243326","resolution":{"observed_at":"2026-08-06T15:57:37.113385Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.01198","last_updated":"2022-06-02T17:58:54Z","snapshot_observed_at":"2026-08-13T15:30:58.911562Z","submitted_at":"2022-06-02T17:58:54Z","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","version":1},"cited_work":{"arxiv_id":"2206.01198","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.01198","snapshot_observed_at":"2026-08-06T15:57:36.232874Z","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","venue":"cs.CV","work_id":"585d7c4d-6d42-4e97-a8a8-87e98f7d9a5e","year":2022},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.869608Z"},"links":{"cited_paper":"/paper/2206.01198","citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:336d9c64e3d45f52907480ba04408336646d9a0a180a67cf985ea50161fa247a","observation_id":"8f5d8d68-1c1f-4165-88b6-edc64b7301ef","resolution":{"observed_at":"2026-08-06T15:57:36.289878Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.895275Z","title":"Seeing is believing: Brain-inspired modular training for mechanistic interpretability","venue":null,"work_id":"79673b6d-7e50-4d81-8b36-f68d84743ed7","year":2023},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.928860Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:ee0b1f37b7f3dd1dee330b3b1d7229f581a4c176e43d07d69912558459f24bbe","observation_id":"a5934079-968e-48ca-99d0-85c45b321fe9","resolution":{"observed_at":"2026-08-06T15:57:36.988085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.737898Z","title":"Proving the lottery ticket hypothesis: Pruning is all you need","venue":null,"work_id":"20cbf460-0f4d-4c21-81f1-40532897421e","year":2020},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.950237Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:8940ad10a1c05d274b6af80bee83a3969711263f21d448f3cdc3d29b20e2fbe0","observation_id":"fe126cfc-9efe-4bd8-8987-1c38ee99239c","resolution":{"observed_at":"2026-08-06T15:57:36.823428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.593855Z","title":"V., and Newsome, W","venue":null,"work_id":"00630ecd-7f5b-4f1d-8914-32524bcb6f22","year":2013},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:35.989529Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:67262cc68f05b8fa91febc3fdcf7357b0d30ad55fae5a35ae63e8937a36c2ccc","observation_id":"b949b2d1-2fad-4d39-a0ea-629c965cd5ce","resolution":{"observed_at":"2026-08-06T15:57:36.658472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.509514Z","title":"The evolutionary origins of hierarchy","venue":null,"work_id":"f603d3fc-eca9-4921-90d1-04f46d7fb068","year":2016},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:36.051911Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:bbaae36a1113b3136cea28403b74042fcea105d1fa9b853304760c752c5455eb","observation_id":"25284bd0-b1ff-47e7-9a21-ca247b7cf38f","resolution":{"observed_at":"2026-08-06T15:57:36.547843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.443728Z","title":null,"venue":null,"work_id":"34b409ca-95e8-48f2-8537-751101488dd0","year":2019},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:36.106073Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:059511b6ab435f10f649c6992a024331b5ddd25ff8d4d31ce799deb98f7eaeed","observation_id":"fdf99821-4d7b-4abf-ac4e-7c2de4bd4ca1","resolution":{"observed_at":"2026-08-06T15:57:36.464339Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:57:36.382105Z","title":null,"venue":null,"work_id":"18d44814-addd-4b86-bce3-01df70ccce81","year":2020},"citing_paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T15:57:36.129834Z"},"links":{"citing_paper":"/paper/2507.14747"},"observation_digest":"sha256:f2c57514d4cb91808a5716b6d57c8778eacd762036f1267714cc34c5db365481","observation_id":"9dd30df7-9f65-4369-a24d-3525d99740bc","resolution":{"observed_at":"2026-08-06T15:57:36.397557Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.14747","last_updated":"2025-07-19T20:44:17Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T20:03:39.423982Z","submitted_at":"2025-07-19T20:44:17Z","title":"Pruning Increases Orderedness in Recurrent Computation"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":4},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2507.14747."}