{"as_of":"2026-08-09T11:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59c311fc79e04d8ba82db9d91c80ad085e1c78eb1042678635c9975bb9fdadcf","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:32:00.280739Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T09:56:03.893675Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.09167","last_updated":"2025-05-14T06:03:07Z","snapshot_observed_at":"2026-08-08T18:03:54.120620Z","submitted_at":"2025-05-14T06:03:07Z","title":"Online Learning of Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09167","snapshot_observed_at":"2026-08-07T10:32:00.280739Z","title":"Online learning of neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05500","last_updated":"2025-06-05T18:34:56Z","snapshot_observed_at":"2026-08-07T16:35:45.153456Z","submitted_at":"2025-06-05T18:34:56Z","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:32:00.280739Z"},"links":{"cited_paper":"/paper/2505.09167","citing_paper":"/paper/2506.05500"},"observation_digest":"sha256:276864df51e218eaa4adcd772272f2f631be89fd0b6936c91464e7bbb6b50fa5","observation_id":"400b9ef6-9c70-4f0f-8ff6-31cbb1dd5e43","resolution":{"observed_at":"2026-08-07T10:32:00.280739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09167","last_updated":"2025-05-14T06:03:07Z","snapshot_observed_at":"2026-08-08T18:03:54.120620Z","submitted_at":"2025-05-14T06:03:07Z","title":"Online Learning of Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09167","snapshot_observed_at":"2026-08-05T10:46:17.915864Z","title":"Daniely, I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.03892","last_updated":"2025-09-04T05:26:43Z","snapshot_observed_at":"2026-08-08T15:09:56.315096Z","submitted_at":"2025-09-04T05:26:43Z","title":"Mistake-bounded online learning with operation caps","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T10:46:17.915864Z"},"links":{"cited_paper":"/paper/2505.09167","citing_paper":"/paper/2509.03892"},"observation_digest":"sha256:fb3266d9b8eef42ce66838dbec529d6014e1f4f936b11536545475752742a1a2","observation_id":"194fbfcc-2b9f-4d96-8f68-8e83692f730e","resolution":{"observed_at":"2026-08-05T10:46:17.915864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09167","last_updated":"2025-05-14T06:03:07Z","snapshot_observed_at":"2026-08-08T18:03:54.120620Z","submitted_at":"2025-05-14T06:03:07Z","title":"Online Learning of Neural Networks","version":1},"cited_work":{"arxiv_id":"2505.09167","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.09167","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online learning of neural networks.arXiv preprint arXiv:2505.09167","venue":null,"work_id":"373c6375-b99b-47b7-9359-f87077491203","year":null},"citing_paper":{"arxiv_id":"2604.12013","last_updated":"2026-04-18T18:57:54Z","snapshot_observed_at":"2026-07-06T23:00:17.634307Z","submitted_at":"2026-04-13T20:00:13Z","title":"Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T15:44:19.703107Z"},"links":{"cited_paper":"/paper/2505.09167","citing_paper":"/paper/2604.12013"},"observation_digest":"sha256:469f3d85d4ddbebf98c197a29ce81a777db25463b21c0cc17170c42d07fe7249","observation_id":"4c5e447f-35dd-4ea8-b7e5-6a057e42fdee","resolution":{"observed_at":"2026-05-11T09:56:03.902988Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.09167/citation-record","integrity":"/paper/2505.09167/integrity","json":"/paper/2505.09167/citation-record.json","paper":"/paper/2505.09167"},"outbound":[],"paper":{"arxiv_id":"2505.09167","last_updated":"2025-05-14T06:03:07Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-08T18:03:54.120620Z","submitted_at":"2025-05-14T06:03:07Z","title":"Online Learning of Neural Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2505.09167."}