{"as_of":"2026-08-15T18:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aef2a897f82b39a8f5fa7a01ea5768077b5c54fb93c00f41a10efbe53f257d93","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:27:50.065809Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":5,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.03866","last_updated":"2019-04-08T07:02:06Z","snapshot_observed_at":"2026-08-14T16:50:11.719338Z","submitted_at":"2019-04-08T07:02:06Z","title":"On the Learnability of Deep Random Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03866","snapshot_observed_at":"2026-08-14T05:27:50.065809Z","title":"On the learnability of deep random networks,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1909.01838","last_updated":"2020-03-03T22:08:02Z","snapshot_observed_at":"2026-08-15T03:51:48.091288Z","submitted_at":"2019-09-03T17:33:09Z","title":"High Accuracy and High Fidelity Extraction of Neural Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:27:50.065809Z"},"links":{"cited_paper":"/paper/1904.03866","citing_paper":"/paper/1909.01838"},"observation_digest":"sha256:ec2cf6c999c4d4123b4dccd401b007982c81fdff7b8ccec41427bf0907ed0ade","observation_id":"eaaf8b5a-6b17-4dcf-81ef-5cf8aca37a0f","resolution":{"observed_at":"2026-08-14T05:27:50.065809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03866","last_updated":"2019-04-08T07:02:06Z","snapshot_observed_at":"2026-08-14T16:50:11.719338Z","submitted_at":"2019-04-08T07:02:06Z","title":"On the Learnability of Deep Random Networks","version":1},"cited_work":{"arxiv_id":"1904.03866","doi":"10.48550/arxiv.1904.03866","metadata_source":"arxiv_reference","pith_arxiv_id":"1904.03866","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Learnability of Deep Random Networks , publisher =","venue":"arXiv (Cornell University)","work_id":"d89e7fee-dfc7-4df8-9fe8-af60229968e0","year":2019},"citing_paper":{"arxiv_id":"2605.10237","last_updated":"2026-05-11T09:11:20Z","snapshot_observed_at":"2026-08-11T08:29:59.040807Z","submitted_at":"2026-05-11T09:11:20Z","title":"The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-12T05:27:11.761971Z"},"links":{"cited_paper":"/paper/1904.03866","citing_paper":"/paper/2605.10237"},"observation_digest":"sha256:69bede3a30e4d6862be11a18346151dc72f5a0c500d4e1a6f91f7781ecbc84db","observation_id":"bbd9b8b4-76eb-453d-b0d5-ff113828a6b6","resolution":{"observed_at":"2026-07-04T23:32:21.127608Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.03866/citation-record","integrity":"/paper/1904.03866/integrity","json":"/paper/1904.03866/citation-record.json","paper":"/paper/1904.03866"},"outbound":[],"paper":{"arxiv_id":"1904.03866","last_updated":"2019-04-08T07:02:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:50:11.719338Z","submitted_at":"2019-04-08T07:02:06Z","title":"On the Learnability of Deep Random 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1904.03866."}