{"as_of":"2026-08-06T12:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39fe8618a64b0c38e34a22fb95f8cf3a9e24ce451fcc5c29eee1ef72cf230c1d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:59:21.199311Z","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-06-29T19:23:53.975993Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.09522","last_updated":"2018-06-24T13:55:48Z","snapshot_observed_at":"2026-08-05T14:49:43.316891Z","submitted_at":"2018-03-26T11:48:14Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.09522","snapshot_observed_at":"2026-08-03T05:59:21.199311Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.06065","last_updated":"2026-06-01T13:46:20Z","snapshot_observed_at":"2026-08-03T05:59:17.114409Z","submitted_at":"2026-01-31T17:35:06Z","title":"Deep networks learn to parse uniform-depth context-free languages from local statistics","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-03T05:59:21.199311Z"},"links":{"cited_paper":"/paper/1803.09522","citing_paper":"/paper/2602.06065"},"observation_digest":"sha256:acc5afba6cfbf1c1ed4f22d4ee1d8739e7f1d5b54de620a1d742660801945b81","observation_id":"80d36fb9-f913-429d-b986-a7f2c236632b","resolution":{"observed_at":"2026-08-03T05:59:21.199311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09522","last_updated":"2018-06-24T13:55:48Z","snapshot_observed_at":"2026-08-05T14:49:43.316891Z","submitted_at":"2018-03-26T11:48:14Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","version":2},"cited_work":{"arxiv_id":"1803.09522","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.09522","snapshot_observed_at":"2026-06-29T19:23:53.975993Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","venue":"cs.LG","work_id":"add2b914-811f-4397-83b4-2373a67ca4af","year":2018},"citing_paper":{"arxiv_id":"2605.27006","last_updated":"2026-05-26T13:26:36Z","snapshot_observed_at":"2026-08-03T01:15:03.058879Z","submitted_at":"2026-05-26T13:26:36Z","title":"Sampling Data with Chains of Forward-Backward Diffusion Steps","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T19:19:04.067028Z"},"links":{"cited_paper":"/paper/1803.09522","citing_paper":"/paper/2605.27006"},"observation_digest":"sha256:460e4703a9912a97674565eea6e83dba7c06dcb6bb091f3fb2f514e535a39700","observation_id":"03a67871-7e06-4333-ba6f-8b6941d64349","resolution":{"observed_at":"2026-06-29T19:23:53.977374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09522","last_updated":"2018-06-24T13:55:48Z","snapshot_observed_at":"2026-08-05T14:49:43.316891Z","submitted_at":"2018-03-26T11:48:14Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","version":2},"cited_work":{"arxiv_id":"1803.09522","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.09522","snapshot_observed_at":"2026-06-29T19:23:53.975993Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","venue":"cs.LG","work_id":"add2b914-811f-4397-83b4-2373a67ca4af","year":2018},"citing_paper":{"arxiv_id":"2605.27734","last_updated":"2026-05-26T22:16:42Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-26T22:16:42Z","title":"Learn from your own latents and not from tokens: A sample-complexity theory","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T18:22:40.908929Z"},"links":{"cited_paper":"/paper/1803.09522","citing_paper":"/paper/2605.27734"},"observation_digest":"sha256:49a96ef480593c401158d46fe4807b52e53abce59219e9c75bdd66e3e6697890","observation_id":"d8fa9120-09c2-4107-892a-828a091f06f0","resolution":{"observed_at":"2026-06-29T18:23:50.486409Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09522","last_updated":"2018-06-24T13:55:48Z","snapshot_observed_at":"2026-08-05T14:49:43.316891Z","submitted_at":"2018-03-26T11:48:14Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.09522","snapshot_observed_at":"2026-08-02T11:11:52.259969Z","title":"Eran Malach and Shai Shalev-Shwartz","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.17522","last_updated":"2026-07-17T14:41:49Z","snapshot_observed_at":"2026-08-04T20:48:34.260692Z","submitted_at":"2026-06-16T05:02:13Z","title":"An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T11:11:52.259969Z"},"links":{"cited_paper":"/paper/1803.09522","citing_paper":"/paper/2606.17522"},"observation_digest":"sha256:59e0b00a6977aa9b96856334ec5ec88b9d2f82ddb889f8543dcefbd2dd963197","observation_id":"1349e79d-1d72-4859-abf0-e08325d41b8f","resolution":{"observed_at":"2026-08-02T11:11:52.259969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1803.09522/citation-record","integrity":"/paper/1803.09522/integrity","json":"/paper/1803.09522/citation-record.json","paper":"/paper/1803.09522"},"outbound":[],"paper":{"arxiv_id":"1803.09522","last_updated":"2018-06-24T13:55:48Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T14:49:43.316891Z","submitted_at":"2018-03-26T11:48:14Z","title":"A Provably Correct Algorithm for Deep Learning that Actually Works"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1803.09522."}