{"as_of":"2026-08-20T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:684b6315da11a5dc1552a583ed8e1dbccd13064762e1f9f3698d1f96833a66d2","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T20:24:16.373261Z","state":"measured"},{"denominator":101,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":101,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-06-26T06:23:24.212997Z","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-04T12:39:49.432591Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"cited_work":{"arxiv_id":"2605.15551","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.15551","snapshot_observed_at":"2026-07-04T12:39:49.432591Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","venue":"cs.LG","work_id":"8e8b1a1a-ceec-4e8c-a874-1fc273581cfb","year":2026},"citing_paper":{"arxiv_id":"2606.23471","last_updated":"2026-06-22T15:17:54Z","snapshot_observed_at":"2026-08-11T03:37:56.586896Z","submitted_at":"2026-06-22T15:17:54Z","title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T06:23:24.212997Z"},"links":{"cited_paper":"/paper/2605.15551","citing_paper":"/paper/2606.23471"},"observation_digest":"sha256:46c7ac35d91004ff32aeee0d8facad23304196d0d3303a613778a2e93350ea11","observation_id":"91c1e653-7625-4c9f-a31a-8daa3d7fa15f","resolution":{"observed_at":"2026-07-04T12:39:49.434099Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.15551/citation-record","integrity":"/paper/2605.15551/integrity","json":"/paper/2605.15551/citation-record.json","paper":"/paper/2605.15551"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"41989006-b429-43c2-af89-e634e8515bc0","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:3ccb08431d52d4cdf01ac77b92a85d339c8f66d7358b5210dc6221c20d669d99","observation_id":"043f40e4-47b4-4f2f-acfb-7590616a7a38","resolution":{"observed_at":"2026-05-20T20:34:00.124037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"649455ac-a3cb-4ba5-a11d-3274c7be33e6","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:788b310defdd10046edaeb4c1f1ff0c78678d98270969594bdc18dbed2b62e30","observation_id":"be503783-16f1-419c-a2d5-02e9b5857038","resolution":{"observed_at":"2026-05-20T20:34:00.112408Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2008 , publisher=","venue":null,"work_id":"7b79345f-ae93-47fb-ba2b-89fa936367ee","year":2008},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:dd4e554a9250b915c9ef3c5e56fb98950f1f24664710be09419e993591b17a33","observation_id":"e2b0e018-5ee4-4654-a9e1-d4837c0214ac","resolution":{"observed_at":"2026-05-20T20:34:00.107017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-06T17:42:43.625564Z","title":null,"venue":null,"work_id":"06b8c55a-6224-4a19-b16d-0b836087d878","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c842c69ea4ee55cf007a56d2fe1f4285ad7bed26bb9afaaf2acd8e0e1f4af600","observation_id":"f50d9a14-5ded-4d31-a4aa-64aa15de21dd","resolution":{"observed_at":"2026-05-20T20:34:00.121808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.14896","last_updated":"2026-05-15T08:04:24Z","snapshot_observed_at":"2026-08-05T05:41:26.997593Z","submitted_at":"2026-02-16T16:30:38Z","title":"Algorithmic Simplification of Neural Networks with Mosaic-of-Motifs","version":2},"cited_work":{"arxiv_id":"2602.14896","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.14896","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithmic Simplification of Neural Networks with Mosaic-of-Motifs","venue":"cs.LG","work_id":"de45f1bd-461e-46ee-bf6b-14ba6d60ca27","year":2026},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2602.14896","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:543020ecf1d89924133a66d00e5fadf1edc39eef6d808f8904796594ffc820f8","observation_id":"a40dbda2-19b0-4e2b-8e34-e240a20a0811","resolution":{"observed_at":"2026-05-20T20:28:59.957122Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b4345649-76e1-4d4f-b91d-faa4e7c79f32","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:d22eefa328f92e20eec98c3d9e413da601b218ea84ff49c3b22a9654b59cec3e","observation_id":"d531aa36-cd18-4c18-9790-1f413d9a5518","resolution":{"observed_at":"2026-05-20T20:33:59.970615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1073/pnas.1903070116","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://www.pnas.org/doi/abs/10.1073/pnas.1903070116","venue":"Proceedings of the National Academy of Sciences","work_id":"d908978f-17ec-4a11-9873-7f38f7d24c5d","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:9d7e9015f378868a9f55006c1559ceea08942ab82a1c2fc61430cbfca5c1bdb6","observation_id":"a4afe56d-60a2-4615-9643-c1b1cb4a8240","resolution":{"observed_at":"2026-05-20T20:28:59.681470Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-06T20:38:20.454908+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T20:38:20.454908+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6351f2f0-9409-4ac7-becd-79f3e95eb4b5","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:3faea22faaf97a6d6d549cbbcc30988d263cfebc4b168f00c12143cca6e91130","observation_id":"b6471364-be20-48e9-8792-338de312401a","resolution":{"observed_at":"2026-05-20T20:33:59.705268Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2017 , url =","venue":null,"work_id":"861ee730-18fe-4dfb-b4d7-001dd386424a","year":2017},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:f2ee6a4967a0a70bc814b841b759fd4abf97e272c9b0e6df13a3ad75ec39cc58","observation_id":"39d30b07-6dc5-450e-9652-153a952cbccf","resolution":{"observed_at":"2026-05-20T20:33:59.744085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"sztal/pybdm: v0.1.0","venue":null,"work_id":"c2c7e53d-5ab4-4bc9-a8cb-bb0471c824b8","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:f2eebb42cf2fd903f0ade6ebbb53c0f99ccbfaef4cd4f2dd4e48963c700abd95","observation_id":"6d1cb210-d1af-48ca-bc26-690578dada0d","resolution":{"observed_at":"2026-05-20T20:33:59.709473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f592f364-3c89-42ab-9457-e0b26698eec0","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:0369e8a47135eedff9b734926e4ce42e54910279743fe88109c380d2abef05c0","observation_id":"a8e5c06d-df85-4fa1-a235-e37ba4f2ef83","resolution":{"observed_at":"2026-05-20T20:33:59.701390Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1966 , publisher=","venue":null,"work_id":"c38562f5-1be5-4dd9-8987-11164a4e478c","year":1966},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:0fb45ffc386f9a6336e3baf9ed2db971f7845dc828436ac2a46e99c9c7528f9e","observation_id":"3128e6d6-d5fd-4a11-8adb-857972f16275","resolution":{"observed_at":"2026-05-20T20:33:59.974167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2012 , publisher=","venue":null,"work_id":"31e8ac62-9e5f-4363-be89-e0d49f3dfbe7","year":2012},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:9912aa966fdae6fa5a74933f3d66fff43bc94d7a22012c148f5fe1f85b453306","observation_id":"af243567-f494-4699-8520-9ca08942fbdc","resolution":{"observed_at":"2026-05-20T20:34:00.000082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2003 , publisher=","venue":null,"work_id":"68485ee2-efb0-490b-9f89-014d46d0c507","year":2003},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:8514b702f74203505fff29a59a94c61a50cfaf4647cecbf65ea7e9bdd36b78e1","observation_id":"94653755-fa1e-4975-ae27-0bd8e018dbfa","resolution":{"observed_at":"2026-05-20T20:33:59.772208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7eba1b44-f9c3-44c0-9b96-6ad4a92635a8","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:5cf1e3aec4a54781a3efefe73d499e4cf0d4d969c5b865283670406e43514f7c","observation_id":"0e0ccb76-6b51-436d-ade7-44a4988f85f0","resolution":{"observed_at":"2026-05-20T20:34:00.049621Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1964 , publisher=","venue":null,"work_id":"47cf1c16-21e9-4b1c-b61d-f8bcd6c484d9","year":1964},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e8f4c9a41792983c9f627821aa3b71df4b89177480e6d9b5abd51443d6923abe","observation_id":"fcd5be9c-00c1-4dd3-8a72-02ffadf11748","resolution":{"observed_at":"2026-05-20T20:33:59.959682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1969 , publisher=","venue":null,"work_id":"04d153ae-40b4-4014-8670-e1e82cc81d1c","year":1969},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:0ae97510f25e6da1af8c90ae992a603c8d2095888ebf0a0c028bd971e672c665","observation_id":"0b840909-afcb-4b02-85f1-62f850250ba6","resolution":{"observed_at":"2026-05-20T20:33:59.948416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02178","last_updated":"2022-03-04T17:17:31Z","snapshot_observed_at":"2026-08-17T03:16:02.000706Z","submitted_at":"2021-10-05T17:07:53Z","title":"MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformer","version":2},"cited_work":{"arxiv_id":"2110.02178","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02178","snapshot_observed_at":"2026-07-04T17:20:01.055534Z","title":"MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformer","venue":"cs.CV","work_id":"bb34ff1e-5fb7-4912-a744-a89c92c028f7","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2110.02178","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:0524adbdf82679b894a0014888bd700e5284c4a69662cb97e75fb25a7c69eb23","observation_id":"1b43194d-972d-4271-8629-974c2ab04db0","resolution":{"observed_at":"2026-05-20T20:46:35.272401Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05296","last_updated":"2018-11-26T19:31:00Z","snapshot_observed_at":"2026-08-16T03:39:23.727567Z","submitted_at":"2018-02-14T19:38:07Z","title":"Stronger generalization bounds for deep nets via a compression approach","version":4},"cited_work":{"arxiv_id":"1802.05296","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.05296","snapshot_observed_at":"2026-07-03T20:18:56.763722Z","title":"Stronger generalization bounds for deep nets via a compression approach","venue":"cs.LG","work_id":"d852187f-01c8-49b5-8731-a37313eae0a4","year":2018},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1802.05296","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e58a1f585d335e8120647dd35413efedfd3d538c876f9f5c564e9afa3f972d64","observation_id":"39f70247-0494-497e-ac4d-5b32b2ac20a6","resolution":{"observed_at":"2026-05-20T20:28:59.967189Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2024 , url=","venue":null,"work_id":"fa13b8f2-8c01-4151-9f1b-2cfe2d28313a","year":2024},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:770a29f173a090c2234eb5b0552820d053ad809959b6faaf62cfda002b3a5ee0","observation_id":"f6eaaf86-240f-4b20-b981-aca862480af5","resolution":{"observed_at":"2026-05-20T20:33:59.940732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1212.6745","last_updated":"2015-08-26T01:56:48Z","snapshot_observed_at":"2026-08-19T04:21:03.347135Z","submitted_at":"2012-12-30T17:06:59Z","title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility","version":4},"cited_work":{"arxiv_id":"1212.6745","doi":null,"metadata_source":"pith","pith_arxiv_id":"1212.6745","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility","venue":"cs.CC","work_id":"c178adca-fc86-453f-b858-17c0bafcb945","year":2012},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1212.6745","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e6c4c0043bd479e17436c628c18622c8b0f171fae75bb0e4c1be0a2c78837b30","observation_id":"417d3ba8-f32f-444e-9535-6cc7a5f06141","resolution":{"observed_at":"2026-05-20T20:28:59.950733Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2025 , organization=","venue":null,"work_id":"3a7eab6d-9132-49cc-8278-d9cbf9b6c720","year":2025},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:4dd8030c903a04e1224a0ca7c15ef0c6acf1f94ebe474ca0748b33930b946d27","observation_id":"d45409f0-10ef-4de0-9c5a-72e512bcbad6","resolution":{"observed_at":"2026-05-20T20:33:59.742219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7a3a76dc-b9cf-4595-9a45-d7c16f063d67","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:51f8b98a7e5d36be6042b3958e49bc7b7aa872768e0faa3739456a5dece4c290","observation_id":"974d567c-0dad-4ef4-afa4-d88c91da7633","resolution":{"observed_at":"2026-05-20T20:33:59.884321Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-06T17:42:43.933932Z","title":"GitHub repository , doi =","venue":null,"work_id":"0e22cb47-3830-46d4-9e79-8c80d25853ad","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:d63626db85ceb1fba433c0131dbd48b0655be983443504e86b94c629f3a48a90","observation_id":"bf51600c-2651-4507-8cc8-0cf4ad80a419","resolution":{"observed_at":"2026-05-20T20:34:00.087200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1892.321894","doi":"10.1145/321892.321894","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"(1975); A Theory of Program Size Formally Identical to Information Theory, Journal of the Association for Computing Machinery 22:3, pp","venue":"Journal of the ACM","work_id":"d3e39247-57d8-4dc6-86ee-01ea2961b91d","year":1975},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:8f46d157a79c4632a95824abcb0f98925b3ef8046f1296e67054886e5a7b7c40","observation_id":"bba0dba0-8641-48b4-a97f-53223d73dbc6","resolution":{"observed_at":"2026-05-20T20:28:59.676175Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:15.954358+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:15.954358+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"178c28f8-29a8-4135-93cd-4e86e9c33af3","year":1948},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:4dda138f43daec925f3c75db682ed609a36a1287ce03befcdf1c345f747ef9d9","observation_id":"bf158f6c-4cb4-4808-976c-018bc322d990","resolution":{"observed_at":"2026-05-20T20:33:59.845835Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/science.298.5594.824","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Science , author=","venue":"Science","work_id":"7ec82e86-5eb1-42f4-aef7-31a497e8262a","year":2002},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:5fa2376567c65896d3c06d53b9c80d96c2959fc66f7e846f7b31b16a81a78649","observation_id":"9131049d-94c4-40f7-b61a-0d3abe4cbb08","resolution":{"observed_at":"2026-05-20T20:28:59.668023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-11T21:49:33.4779+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T21:49:33.4779+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/science.aad9029","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Benson, David F","venue":"Science","work_id":"b03fef48-3521-46d9-823a-20a126d9313e","year":2016},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:1e5c5fa9b6aae6ba5a7963e1647e4434a05bf056db8f6788b0477b0f3c95e719","observation_id":"16b4746f-6a68-42fa-8a77-27c169556f6f","resolution":{"observed_at":"2026-05-20T20:28:59.672309Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:16.878166+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:16.878166+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1162/neco.1992.4.4.473","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Hinton, Geoffrey E","venue":"Neural Computation","work_id":"93d588c6-9eb2-40be-8f3c-921689c3a88e","year":1992},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:9fc3583bc5fe2b2d0ed8fe4a99b5d03804b27afef4d7c7d41727dfd51be49fa8","observation_id":"eeec0f14-b6ba-4eb1-bb74-73b0d0f94524","resolution":{"observed_at":"2026-05-20T20:28:59.683564Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:17.646391+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:17.646391+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09228","last_updated":"2018-06-24T22:49:24Z","snapshot_observed_at":"2026-08-14T18:59:54.072065Z","submitted_at":"2018-06-24T22:49:24Z","title":"Deep $k$-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutions","version":1},"cited_work":{"arxiv_id":"1806.09228","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.09228","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep $k$-Means: Re-Training and Parameter Sharing with Harder Cluster Assignments for Compressing Deep Convolutions","venue":"cs.LG","work_id":"41b9a50d-7fdf-4028-9648-094b2e636ec2","year":2018},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1806.09228","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:da804aaf818acd3ce64b0209e9fe641593afd7e2b6d2b2a8e84f8ea73f4d60c9","observation_id":"dcc08b3f-a92c-4d1c-86b9-2b791a653c1b","resolution":{"observed_at":"2026-05-20T20:29:00.009420Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Taylor and David J","venue":null,"work_id":"7a27ec89-27a4-40ec-b924-4bca6e809441","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:03c1bb02700f9ee390d96b3c089e27aabae767517fca64524be8bc980122b6d0","observation_id":"fc8080f1-01b9-4dad-a9de-c412536e4185","resolution":{"observed_at":"2026-05-20T20:33:59.733275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1996 , note =","venue":null,"work_id":"b8ef6685-8d77-4fbf-b17f-b8089715a9e5","year":1996},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:0202ce0a6a802961465bba93a68b5958ff2f4b16fb737263e2ee4b9a71c2f408","observation_id":"5d037dc4-2e3f-450f-8842-14e6391de7b4","resolution":{"observed_at":"2026-05-20T20:29:00.672323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"journal=","venue":null,"work_id":"917eb4d0-3a5e-4616-8fc9-3dd4cfad9e31","year":1952},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:740885d7766ab63b89c11f61125771d13763684d79e90f2e3bcfb2db7a8582b5","observation_id":"0b7c4eff-be9a-4162-9890-9836d214ff04","resolution":{"observed_at":"2026-05-20T20:29:00.683447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1992 , url =","venue":null,"work_id":"bfb61ec0-36d1-42d8-a647-766a6e513a1b","year":1992},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:d73deea1f3537a5813129a51adaa0aa094887d9efcf21e5873b6797766863df8","observation_id":"320e5cb3-1b03-4034-8962-b60a7b1bd176","resolution":{"observed_at":"2026-05-20T20:33:59.961428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"and Ziv, J","venue":null,"work_id":"b4435df5-3286-4764-aaa4-114de3ec2820","year":1976},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:122dbf7e7ffaefb6e2da4c6fb8bb360f9359b94b66f86bda4e239b5fe5747f97","observation_id":"96d4329d-3e9a-4502-9333-b930adf849b7","resolution":{"observed_at":"2026-05-20T20:34:00.030387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0005-1098(78)90005-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"year =","venue":"Automatica","work_id":"7b2ad1fb-41f8-4020-b17c-2d075330815c","year":1978},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:40d3bfe32389ccc34bf2f2a6a896b41608c36a87773534cec34601792404ec10","observation_id":"4d93c3f8-ed85-474b-a075-9dc0f6108784","resolution":{"observed_at":"2026-05-20T20:28:59.686067Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-12T22:20:34.058673+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T22:20:34.058673+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0406077","last_updated":"2004-06-04T09:11:18Z","snapshot_observed_at":"2026-08-17T13:14:30.170900Z","submitted_at":"2004-06-04T09:11:18Z","title":"A tutorial introduction to the minimum description length principle","version":1},"cited_work":{"arxiv_id":"math/0406077","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0406077","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A tutorial introduction to the minimum description length principle","venue":"math.ST","work_id":"c70cb23d-c2bf-4821-bd9c-a80d9349d9c6","year":2004},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/math/0406077","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:6f31693141d6e1ede5bd0319fcdc37e097f8f7e6665fca05b80c3895aa162502","observation_id":"8bfdbd99-f12b-41ff-b0e3-02f41d145769","resolution":{"observed_at":"2026-05-20T20:29:00.015535Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1371/journal.pone.0096223","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2014 , month =","venue":"PLoS ONE","work_id":"dd92696b-0b91-4c87-84ad-ff5085a6b408","year":2014},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:fcdd2e7eb858d2a30847cc1dce2ef65d485ed775c3e01c6f00b9a0baf0019173","observation_id":"17370201-b2eb-4611-aba5-9f87e0e9c7f0","resolution":{"observed_at":"2026-05-20T20:28:59.662884Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:18.214618+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:18.214618+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b8b3bde4-d61e-44d6-b22f-08bec3b851b6","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e23caec491e5cac61ed904cea21524691ab8283902d9c703c273af71cc79ff6d","observation_id":"bdbf0420-f4f4-4c61-bf8f-8886a7684714","resolution":{"observed_at":"2026-05-20T20:33:59.932404Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.01350","last_updated":"2018-06-28T17:50:54Z","snapshot_observed_at":"2026-08-15T14:09:03.376490Z","submitted_at":"2017-06-05T14:31:03Z","title":"Emergence of Invariance and Disentanglement in Deep Representations","version":3},"cited_work":{"arxiv_id":"1706.01350","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.01350","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Emergence of Invariance and Disentanglement in Deep Representations","venue":"cs.LG","work_id":"968b1ec2-0ff2-4ce6-b414-e9ed7ba76465","year":2017},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1706.01350","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:cca6efdead24bc06176fafc193ed0806bb71e690758fd7db39d4f62b55f0177a","observation_id":"4db60f98-4755-4130-a038-97cbfc57a0e6","resolution":{"observed_at":"2026-05-20T20:29:00.018978Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2019 , publisher=","venue":null,"work_id":"2de2218f-f606-4ec6-8ac9-c3e99b393429","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:1f1c5371a10daa82adeef0b2f8610147a53e9de457747497e37b5fb1fb7b6ea6","observation_id":"ef4d785d-c80a-43e9-958a-9b1ca2b22382","resolution":{"observed_at":"2026-05-20T20:33:59.703517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2017 , publisher =","venue":null,"work_id":"e152e588-bbde-4e9e-9fc3-6c91cbc400d1","year":2017},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c6d31a311d0d34d4fae21fd679c255c8f20fe094ea3680de1843495b2c457fd7","observation_id":"3c69a81f-ac1d-4b0c-b33b-9d24eeaad52c","resolution":{"observed_at":"2026-05-20T20:33:59.984837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"58e01820-eef6-4f39-b9fb-d6b01d9fcac7","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:819866232fc5840983709e655a30b21e44c5d56894329e0f418b64e1af73647e","observation_id":"ca2bc990-a2fc-4f29-be4e-fa616bc7f63b","resolution":{"observed_at":"2026-05-20T20:33:59.914304Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"330a1175-9315-4d0b-ac1f-0f487e963bf9","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:238b828b31b32a92c17032bb09df52dda5889e352c85d73cb0db6b5c35d0249e","observation_id":"77de13b5-edd4-4f46-9b20-d26ff2e41d3f","resolution":{"observed_at":"2026-05-20T20:34:00.073343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9344857d-d9ad-4175-b520-0df7f6155e89","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:6bf7b05de737725e56ac1e1a010de0bb91c1f1ac6820ae0a8ba53d2882273091","observation_id":"38694641-9425-42f6-9b6f-1be19b0cccaa","resolution":{"observed_at":"2026-05-20T20:33:59.788850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02178","last_updated":"2019-12-04T18:58:26Z","snapshot_observed_at":"2026-08-17T16:10:41.504045Z","submitted_at":"2019-12-04T18:58:26Z","title":"Fantastic Generalization Measures and Where to Find Them","version":1},"cited_work":{"arxiv_id":"1912.02178","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.02178","snapshot_observed_at":"2026-07-04T11:19:48.948516Z","title":"1912.02178 , archivePrefix=","venue":null,"work_id":"06c7469e-b1d3-402e-9575-be0c7c02bd83","year":1912},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1912.02178","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:ad930ce4e668970e1949d68755b032d42c5bed0dd3aa90ec0f394ed98aabdcb8","observation_id":"7f3f568e-ec1e-442a-83e5-3e8b28ecd4ee","resolution":{"observed_at":"2026-05-20T20:29:00.006559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"McAllester , booktitle =","venue":null,"work_id":"ca11c046-d344-4900-a30d-8a83d77dcb31","year":1999},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:bc874165792bf8f4d7ac1a24fbc7a75d45cf66ff39c864410b787d8ed5cf1b35","observation_id":"2ee1b43d-d08d-440f-801d-9e6b59d3f9d6","resolution":{"observed_at":"2026-05-20T20:33:59.935954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Communications of the ACM , doi =","venue":null,"work_id":"de779ff5-1781-43c3-adde-ea9e5e19ab2c","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:814bf4e04e2b4b38f1ea4c89d06a6d6cc252a28850ddc7e83dc0bb9f521bed60","observation_id":"791b7759-58a9-4505-9dcd-cbbb30c61116","resolution":{"observed_at":"2026-05-20T20:34:00.035544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b5efaa39-e5d8-4558-965c-bfe9adae0cf7","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:164b7dd886f7f2dd36e1c124c4af885160c09295a81883a17ec169d81ef69189","observation_id":"c0acfd78-410d-4b67-8d9f-9733561fdc21","resolution":{"observed_at":"2026-05-20T20:33:59.858560Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/72.788640","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Overview of Statistical Learning Theory","venue":"IEEE Transactions on Neural Networks","work_id":"c69b3438-67b9-48c3-bce9-843190909aba","year":1999},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:66f5f1be860650e24433f8e996eb8592a1ccb42a00f3fe04d51b6f452bfec9d8","observation_id":"52fa1592-2691-4c17-bb08-a1be68ecd36a","resolution":{"observed_at":"2026-05-20T20:28:59.665535Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:18.662473+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:18.662473+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11946","last_updated":"2020-09-11T05:08:01Z","snapshot_observed_at":"2026-08-10T19:44:30.311627Z","submitted_at":"2019-05-28T17:05:32Z","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","version":5},"cited_work":{"arxiv_id":"1905.11946","doi":"10.48550/arxiv.1905.11946","metadata_source":"pith","pith_arxiv_id":"1905.11946","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","venue":"cs.LG","work_id":"c2e77a93-b2ac-42ab-8fb4-2427017f7e7c","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1905.11946","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:3f699ac95dcbde2040389fcffef5492d3e163a4bd8e09c0d769d7a4b1f2bd4ce","observation_id":"5a9a0cfd-0db1-4620-bd4e-e162b03b0ddf","resolution":{"observed_at":"2026-05-20T20:28:59.972702Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-14T23:38:11.953218+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T23:38:11.953218+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10597","last_updated":"2019-08-13T20:09:57Z","snapshot_observed_at":"2026-08-16T21:54:05.177735Z","submitted_at":"2019-07-22T19:36:18Z","title":"Green AI","version":3},"cited_work":{"arxiv_id":"1907.10597","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.10597","snapshot_observed_at":"2026-07-02T06:06:41.347593Z","title":"Smith and Oren Etzioni , year=","venue":null,"work_id":"2f2ecc7f-a9df-4003-a924-900d790909d9","year":1907},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1907.10597","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:88cbb906a1c7ad74d62b6058a04ec3e622b43f23c380ecf2c5723999e43b7567","observation_id":"247cdb10-92f2-457b-bb05-a05253b7a4ea","resolution":{"observed_at":"2026-05-20T20:28:59.975645Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.10350","last_updated":"2021-04-23T14:26:29Z","snapshot_observed_at":"2026-08-16T05:11:57.545339Z","submitted_at":"2021-04-21T04:44:25Z","title":"Carbon Emissions and Large Neural Network Training","version":3},"cited_work":{"arxiv_id":"2104.10350","doi":"10.48550/arxiv.2104.10350","metadata_source":"pith","pith_arxiv_id":"2104.10350","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Carbon Emissions and Large Neural Network Training","venue":"cs.LG","work_id":"5cd5f484-8e24-440f-8bed-e8a801f4ac40","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2104.10350","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:033305ddf67779f291a2370261d9cdc93cf14362a0675a4d7b0a0fa561d0f125","observation_id":"2f167b5c-e907-4b1b-8a11-0b55b9590813","resolution":{"observed_at":"2026-05-20T20:28:59.999978Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-14T23:38:11.476712+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T23:38:11.476712+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-17T09:00:10.263175Z","submitted_at":"2018-02-09T14:14:37Z","title":"Efficient Neural Architecture Search via Parameter Sharing","version":2},"cited_work":{"arxiv_id":"1802.03268","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.03268","snapshot_observed_at":"2026-06-29T00:22:51.657712Z","title":"Efficient Neural Architecture Search via Parameter Sharing","venue":"cs.LG","work_id":"31cb83e2-3381-4fe6-b408-69cdfeebfb7e","year":2018},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1802.03268","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:456fa3ecc52d0ad9f2a27baaef35ab77309c4078704942bb7c3ab8b2910ff93c","observation_id":"d38906c2-60bf-49d0-a8c8-f775b5f93f4d","resolution":{"observed_at":"2026-05-20T20:29:00.003204Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08295","last_updated":"2021-06-15T17:12:42Z","snapshot_observed_at":"2026-08-19T05:42:08.537901Z","submitted_at":"2021-06-15T17:12:42Z","title":"A White Paper on Neural Network Quantization","version":1},"cited_work":{"arxiv_id":"2106.08295","doi":"10.48550/arxiv.2106.08295","metadata_source":"pith","pith_arxiv_id":"2106.08295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A White Paper on Neural Network Quantization","venue":"cs.LG","work_id":"7560ab05-45c2-4a5f-8b54-693bdf37c816","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2106.08295","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:47e44a90219a787d96a7adc4e1cc2c9f8111b4a26b9736885332f937a3d675dc","observation_id":"86069d24-bbff-4fec-aa7b-63fffa87c17c","resolution":{"observed_at":"2026-05-20T20:29:00.041117Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7af8da44-8788-4c8f-aeb5-1cba654f5e9d","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:07eb7d2e736977a9d6314a65b810304f557f9879712535afe6ceb6467ce9c702","observation_id":"6d9fba59-1465-46f5-9f8c-41fd23ce9c80","resolution":{"observed_at":"2026-05-20T20:34:00.081930Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":"1510.00149","doi":"10.48550/arxiv.1510.00149","metadata_source":"pith","pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","venue":"cs.CV","work_id":"d79f6a26-2d92-4f7c-aea0-8aabf3b668c8","year":2015},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:a4486082c48cbae0c80188c40a31e087ad358c96c8b970bd2583f689de390575","observation_id":"9283a8ec-d452-4fdb-8cbf-87d360c0d5cd","resolution":{"observed_at":"2026-05-20T20:28:59.996734Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-15T03:08:15.589774+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T03:08:15.589774+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2019 , url =","venue":null,"work_id":"3e62b90a-74b2-402a-8c4c-dc1c0817d6c1","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:a978ee609a5c50b9bcefc6f95a1fbd86ed03f79af3d51bf5375c1089e49f0abb","observation_id":"a0e9f826-036f-4364-ae37-2836e06723c3","resolution":{"observed_at":"2026-05-20T20:34:00.098087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d2221f0e-5309-4abd-b749-5fa3fd8249d0","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:5113ec22fe744b602d8ef1c4f73def48318bb6a99a2a2554f4ccc695fc187c7e","observation_id":"f8c6b5e5-5f0e-48d8-b94a-1292a72b43e0","resolution":{"observed_at":"2026-05-20T20:34:00.078646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00020","last_updated":"2021-02-26T19:04:58Z","snapshot_observed_at":"2026-07-06T10:45:03.059688Z","submitted_at":"2021-02-26T19:04:58Z","title":"Learning Transferable Visual Models From Natural Language Supervision","version":1},"cited_work":{"arxiv_id":"2103.00020","doi":"10.1021/acs.jcim.0c00174","metadata_source":"pith","pith_arxiv_id":"2103.00020","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Learning Transferable Visual Models From Natural Language Supervision","venue":"cs.CV","work_id":"6de86bb5-27bd-4d5c-8b89-967ebfc52659","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2103.00020","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:9b24882d5bce7db92c3808610ce810d2390336e03231cd4f326c291aa29093d6","observation_id":"1bfe1257-47bd-4685-99fd-91f05d373f17","resolution":{"observed_at":"2026-05-20T20:28:59.993989Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Grandmaster level in StarCraft II using multi-agent reinforcement learning","venue":null,"work_id":"7491b015-1100-425c-b6d7-0ee29313c29c","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:6a2563c0b53547468d630487d5130d18179d0b0b2cc7986f0b99e924f28b85a6","observation_id":"7728d0b6-1543-48c6-a828-39f339b67863","resolution":{"observed_at":"2026-05-20T20:33:59.919610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11929","last_updated":"2021-06-03T13:08:56Z","snapshot_observed_at":"2026-08-16T09:25:53.087782Z","submitted_at":"2020-10-22T17:55:59Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","version":2},"cited_work":{"arxiv_id":"2010.11929","doi":"10.1175/jcli-d-22-0357.1","metadata_source":"pith","pith_arxiv_id":"2010.11929","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","venue":"cs.CV","work_id":"e96730e3-129b-4db6-b981-15ab7932e297","year":2020},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2010.11929","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:a05d6ff503593d1ee7fe1077e3cba5f9e7ed101aadb511ab3fe1d0ac78e68a43","observation_id":"05ade4b2-28be-4901-92e9-a6fa022a5d63","resolution":{"observed_at":"2026-05-20T20:28:59.978380Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.12673","last_updated":"2019-12-20T18:20:34Z","snapshot_observed_at":"2026-08-14T10:01:12.940280Z","submitted_at":"2019-09-27T13:27:53Z","title":"A Constructive Prediction of the Generalization Error Across Scales","version":2},"cited_work":{"arxiv_id":"1909.12673","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.12673","snapshot_observed_at":"2026-07-02T16:07:08.680944Z","title":"arXiv preprint arXiv:1909.12673 , year=","venue":null,"work_id":"2e5959fb-8538-47c0-9bd0-989b1bc5ac44","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1909.12673","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:f03714c873aa2b1d674d0710ead89e185591b7c1199124ef0a67997457b87f7b","observation_id":"7da05f3e-7902-48a6-8892-2c33006a8d23","resolution":{"observed_at":"2026-05-20T20:28:59.988428Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.00409","last_updated":"2017-12-01T17:13:14Z","snapshot_observed_at":"2026-08-14T02:46:56.838057Z","submitted_at":"2017-12-01T17:13:14Z","title":"Deep Learning Scaling is Predictable, Empirically","version":1},"cited_work":{"arxiv_id":"1712.00409","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.00409","snapshot_observed_at":"2026-07-04T18:40:03.351817Z","title":"Deep Learning Scaling is Predictable, Empirically","venue":"cs.LG","work_id":"3638ccb4-3a4f-460e-8b6f-867a65922801","year":2017},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1712.00409","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:4add3c5d74a742ac888f9262e7ea86a838264f417f8c1cb4a974a0cfe37d0a52","observation_id":"68564a24-aae0-46b0-a757-94df026f7e98","resolution":{"observed_at":"2026-05-20T20:28:59.960691Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2001.08361","doi":"10.1145/3616855.3635845","metadata_source":"pith","pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scaling Laws for Neural Language Models","venue":"cs.LG","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","year":2020},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:49063089a2aaf4cf6c5f41ddd39879073d9460e6e11f7ff2b000857bcfc579f2","observation_id":"4cee1e3f-4072-473a-8c25-0872b691e735","resolution":{"observed_at":"2026-05-20T20:29:00.031298Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17066","last_updated":"2024-10-22T11:47:04Z","snapshot_observed_at":"2026-08-16T13:15:26.078949Z","submitted_at":"2024-09-25T16:25:45Z","title":"VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Models","version":2},"cited_work":{"arxiv_id":"2409.17066","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.17066","snapshot_observed_at":"2026-07-02T02:06:27.023208Z","title":"L., Cao, T., Li, C., and Yang, M","venue":null,"work_id":"2ae93c54-2beb-49f8-a3c6-bc6a13fe0155","year":2024},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/2409.17066","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c7fe3acc46f615501db1f11f9ccf595406deb112f4e68ee80dcde87daa63ce43","observation_id":"d20a115c-47a0-4f3b-974a-19f0f5440faa","resolution":{"observed_at":"2026-05-20T20:29:00.028432Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b2a2219c-3a86-40af-ad2c-a0dd478009b0","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:923e5d557f321984a4d47a9bfccd7ce7eabe45259bff1827bfd558a052dca040","observation_id":"313d9131-1c68-413b-8dca-024ce7fb7df1","resolution":{"observed_at":"2026-05-20T20:33:59.871257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.20646","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2505.20646v3 , year=","venue":null,"work_id":"b82022ce-501b-4e41-a4bf-64ef5ba70a0b","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:a40db4d0044225246394d9ccbc38fdd85e27f83192276c7fae941a453d13c8ad","observation_id":"76e4a559-a925-42c7-bd16-54b863884ba1","resolution":{"observed_at":"2026-05-20T20:29:00.025363Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cc7f099e-f307-45ca-9065-65966771535e","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:39b0a42c07c8c34e0e0753b76b5d5846fe2e48ac3ec25e5e9f5c3844fd09642f","observation_id":"231c1303-3441-4a20-8c91-b5cfebf17fa1","resolution":{"observed_at":"2026-05-20T20:34:00.085352Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"55945dfb-3ff5-4b57-aaf2-aaa274fa1d41","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c3f08c7db8f002c9c840885370c0a2e2313cb6be62afea9a89e51c21a47cd079","observation_id":"d4cdf113-3e77-4d52-865d-725108b0c905","resolution":{"observed_at":"2026-05-20T20:34:00.022798Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"1977 , publisher=","venue":null,"work_id":"4c3e89d9-f6e2-498f-8e5e-f678eadbacd8","year":1977},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:036e14938e120d0c27c03f2c169b54c3eea4582ea5385308849503d3c3a9d914","observation_id":"b5ba955f-cdad-4203-9e6f-c49de32e06e6","resolution":{"observed_at":"2026-05-20T20:34:00.032116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3d5dcec2-5aae-44bf-bad3-f3f56a3b9c0c","year":2025},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:1153df16675dcbdb27d790d347aa1e092bf6b758248c4f060b1902b5e8292624","observation_id":"bb145c3d-3f44-4506-bf8f-50e39124728a","resolution":{"observed_at":"2026-05-20T20:34:00.064166Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-024-53645-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Toetzke, Malte and Kontoleon, Andreas and Díaz Anadón, Laura and Minx, Jan C","venue":"Nature Communications","work_id":"3328ef94-fb16-42a2-a582-3f431140291d","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:4c41dbeffd222ed1549b3b4534a7dee9bcf7815ffad3a24022480eb25a8ac08d","observation_id":"3cf42276-2b15-4430-842a-b8fd402c540a","resolution":{"observed_at":"2026-05-20T20:28:59.660346Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T12:24:19.198472+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T12:24:19.198472+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2023 , publisher =","venue":null,"work_id":"fd9bfec0-7cec-48ad-994e-9d4308db67ea","year":2023},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:11ec37f86bb4ee73b3d2f56c93c8140f6531521f717bcab7d2d968dc98b39ad3","observation_id":"dc7e1789-a715-4370-8ee0-f101eeabc239","resolution":{"observed_at":"2026-05-20T20:33:59.738329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Nature , doi =","venue":null,"work_id":"181fa95b-7388-47df-a483-6434862e0d71","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:f817472417d89864ab799d021f6b2c74e94af5389faf389aad71d64aca99cace","observation_id":"d26e14b7-703a-48b1-8939-adde18d9ad95","resolution":{"observed_at":"2026-05-20T20:33:59.727308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-08-19T04:42:40.974785Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":"1706.03762","doi":"10.1186/s13550-021-00830-6","metadata_source":"pith","pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Attention Is All You Need","venue":"cs.CL","work_id":"baafb5a2-5272-43bc-932f-09fa9ffe5316","year":2017},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c415f14fc6c2265ae361f6e127dbd5b1e7f3b7a2fae6395aa42b1a6d5d6603aa","observation_id":"58cf52a9-e944-4b79-ac32-87ef7415d206","resolution":{"observed_at":"2026-05-20T20:28:59.945055Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02640","last_updated":"2016-05-09T22:22:11Z","snapshot_observed_at":"2026-08-14T22:45:19.997074Z","submitted_at":"2015-06-08T19:52:52Z","title":"You Only Look Once: Unified, Real-Time Object Detection","version":5},"cited_work":{"arxiv_id":"1506.02640","doi":"10.48550/arxiv.1506.02640","metadata_source":"pith","pith_arxiv_id":"1506.02640","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"You Only Look Once: Unified, Real-Time Object Detection","venue":"cs.CV","work_id":"7ccf7235-5ee3-454a-b58a-973fca288e86","year":2015},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"cited_paper":"/paper/1506.02640","citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:06a938db24bc698dda90c07c11764fca4449f4876ec61d9c3104780139e975e8","observation_id":"bdc1c814-31e8-4e63-be7d-50e5fab03a6d","resolution":{"observed_at":"2026-05-20T20:28:59.942239Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-11T23:49:30.504022+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T23:49:30.504022+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2022 , publisher=","venue":null,"work_id":"179a318c-0beb-4105-bdeb-34954ab75946","year":2022},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e9dab5d16822a01b73ec3d6a32f0fb1943dddb6ecc1049012d7defcb5228f7f1","observation_id":"6475ed1b-43f2-4ab3-90d1-5654cb789496","resolution":{"observed_at":"2026-05-20T20:33:59.902716Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"395eed5d-c549-443f-b433-38a64f661b35","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:712cdbbb1de2ba4cd08d27b747f3ae2d902126576480dd9d39c5a159c317b326","observation_id":"58d68879-1976-430a-8fc9-ec77c9db0384","resolution":{"observed_at":"2026-05-20T20:34:00.042499Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-06T19:12:51.684942Z","title":null,"venue":null,"work_id":"9765e89c-e323-42db-b040-2e55bd331a8e","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:b9ee51cd966ab0688d1fcd5c693d0b07edc73ce2189d3ca8d09a8a56cfbc1b40","observation_id":"9d465064-4b23-4045-b652-aff7ec9e5844","resolution":{"observed_at":"2026-05-20T20:33:59.992353Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2022 , organization=","venue":null,"work_id":"2c10e8a6-dec1-4a47-8152-4b21028c5d9f","year":2022},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:54180dc5ee37839ca89a2511983a9812f5af31ef59a10754e72b4c5694020163","observation_id":"6d399f5e-6466-44f6-baa7-733ecbf8fe96","resolution":{"observed_at":"2026-05-20T20:33:59.847550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"34dda9b2-1a55-456b-94f1-c72695fe3108","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:35451abae84aba78a5ff7f9b1f952cd48593d36e586418837510cbe0a676d999","observation_id":"8caf2247-ad32-4110-a108-5e3a775e84c2","resolution":{"observed_at":"2026-05-20T20:34:00.055662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2018 , publisher=","venue":null,"work_id":"0746bd53-697a-4c96-844e-f54663f66605","year":2018},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e505b56ab5d317463b60c9720d1f07e06b1fd5c84162a643cf3bee7d100ae2e9","observation_id":"f4ba1671-56f3-4ac4-92bc-9b7d01e846aa","resolution":{"observed_at":"2026-05-20T20:34:00.039089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b215f354-e34a-4838-993e-57a0a849c5a5","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:3d596c7519a1a73714b6a6c20f151bc7c2b0f0436d95ab635eeead5eff0da14d","observation_id":"6ae7f450-38cf-4eda-a450-a1e7a410576e","resolution":{"observed_at":"2026-05-20T20:33:59.867538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d880cbf6-2865-4f42-a84c-b08980d7e191","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:628d5ec83bdc9a9b45c68adbdfa444b7b6795f19b49c1d03b972614a3118e4ac","observation_id":"a6dee99f-a05c-4e5d-83c7-bc2e58277b4d","resolution":{"observed_at":"2026-05-20T20:34:00.046122Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2021 , volume =","venue":null,"work_id":"f5b23f94-174a-4036-a069-b15ad90f25e6","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:793b6a2cb5bde20888dd327ec4ad22e1e7ff6bc693bb6ecebab293ed137b7c6d","observation_id":"34bca135-e660-47c3-89ba-50aad10587d2","resolution":{"observed_at":"2026-05-20T20:29:00.697776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2021 , publisher=","venue":null,"work_id":"51e1eb6e-194c-40a9-8583-fb2125b27072","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:dcb9fba9b49c95fe49b19e32841ed93d464e607068557050e1e7f2a02c45e706","observation_id":"59aa75cf-a39d-4b31-8214-405c525c703e","resolution":{"observed_at":"2026-05-20T20:33:59.893567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Frontiers in Artificial Intelligence , volume=","venue":null,"work_id":"04d5aa64-87a9-43e9-8559-1f34137c650f","year":2021},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:e1a3ffb51c0c6b50c010b8f86c17472faabe2558e5f825bdac6d0194e186c2f0","observation_id":"f719368d-0652-4326-bb69-4b7274d83dbd","resolution":{"observed_at":"2026-05-20T20:33:59.891935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7f3a5dd4-d8b5-40e1-967d-0fc224ab81fc","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:26e2940b161c86081e08b19708c136a3966c0ea92a995e443a754d5e241fd8ea","observation_id":"30c7a3fc-123b-4864-8367-9439c93647b0","resolution":{"observed_at":"2026-05-20T20:33:59.849231Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Journal of Machine Learning Research (JMLR) , year =","venue":null,"work_id":"c226b0f6-034a-47a8-b0f9-a10e39f77db6","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:4e24a5b50236737784069c545a97777e8aee3546c296abdd289c1233f3dc9127","observation_id":"df1b35a5-a9b6-496a-bf2a-6f7ba8820335","resolution":{"observed_at":"2026-05-20T20:33:59.851074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ad87682a-f75c-4bc4-a6e1-4bce664c94ab","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:fd69992d323bf8be16bdff9ec46a0875d683b83924f1beb2a6ae249f6949884d","observation_id":"af8dcf92-4d05-4635-ab3c-cfb38dc37614","resolution":{"observed_at":"2026-05-20T20:33:59.899124Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-05T20:51:25.306951Z","title":null,"venue":null,"work_id":"f7848a6b-c165-47cc-b54e-222e0b6df049","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:316ce29bdfb03633de3b382d5c2fc68c89cdbef7d7c56a090da4c5e3ae8c85c6","observation_id":"e7920670-3da1-453f-983b-926db6b396a8","resolution":{"observed_at":"2026-05-20T20:33:59.840008Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2fc8c727-32e8-44e9-9b41-8003a511a57a","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:2a0c03f281f2ecfb407e37b1a46d368e7dc2c3a995f218432ef7837d05f2d340","observation_id":"0e7c653b-0daa-4d97-8c39-cec4ecfb402d","resolution":{"observed_at":"2026-05-20T20:34:00.037463Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2019 , publisher=","venue":null,"work_id":"28f70906-3ed5-4404-a774-e518f088377d","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:9a4201c317a16d899f61bba2780b2b470b8c37a24aba9e3cf426f2899d386111","observation_id":"1f9da483-adda-4bed-91ab-22cc80b6be81","resolution":{"observed_at":"2026-05-20T20:33:59.740134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0857b6fe-7bb1-4706-898a-501e4f3509ba","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:160fc5ff3c024229d03c7deadd72a03f9a152884603b8dfffca199dc21995e57","observation_id":"1d495fce-657d-4e3e-aba9-02de9dcc5982","resolution":{"observed_at":"2026-05-20T20:34:00.099952Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2018 , publisher=","venue":null,"work_id":"088d20e8-0654-4755-b974-f898d084664f","year":2018},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:31ed7f54b3c6df16da91a87dabe24e3bbe9eb1b6dcb29e88082189019bed703e","observation_id":"73cded5d-fdec-4433-afff-2188627c3d61","resolution":{"observed_at":"2026-05-20T20:34:00.118014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"192e0bde-4858-407c-9821-19ae8f3c720d","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:c2a3b7673df5f7e3dc390e855551748f169caa7b2a8f5d758e1f939535100c85","observation_id":"347600f3-2eb8-4545-988f-86fed83df6dc","resolution":{"observed_at":"2026-05-20T20:34:00.119689Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2019 , publisher=","venue":null,"work_id":"61741232-5851-49fa-991e-50f9fe05f28a","year":2019},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:16408b8ca09a743976f39886e8a6fdafa61b68f6e9ba781d350c9a99ee79a887","observation_id":"8cae83fa-b615-4426-a1c5-5ccb6a9a190b","resolution":{"observed_at":"2026-05-20T20:33:59.908937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"2020 , publisher=","venue":null,"work_id":"e5b5cdd7-0364-4f00-aa30-7a94fcb47709","year":2020},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:a933fa799a0505cda25f35a99d995ef8ceff0a15739a3ba817eee9610094d19c","observation_id":"36bfc013-8533-42eb-98cb-06976797bc90","resolution":{"observed_at":"2026-05-20T20:33:59.907000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"86e49c45-93f7-4565-816c-0d9539a36ee3","year":null},"citing_paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-05-20T20:24:16.373261Z"},"links":{"citing_paper":"/paper/2605.15551"},"observation_digest":"sha256:1f712c0b59c1b0673f6524c7d8f2e45b4e7bb6dd5ff82ec3b4c95db2f171cd60","observation_id":"4eb78b4c-e778-41e8-b28e-4918032943cd","resolution":{"observed_at":"2026-05-20T20:33:59.749760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.15551","last_updated":"2026-05-15T02:44:25Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T00:30:25.750765Z","submitted_at":"2026-05-15T02:44:25Z","title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":20,"parse_uncertain":4,"unresolved":29,"verified_exact":12,"verified_fuzzy":35},"total_outbound_references":300},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 1 inbound Pith citation observation for arXiv:2605.15551."}