{"as_of":"2026-08-14T08:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f9965860faae6914198fc6a757f6de45064a98e60cd9c6a06a5ffb7cf558551","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-14T06:32:32.682623+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-12T16:59:44.125553Z","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-05-20T23:03:50.779885Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.04207","last_updated":"2018-10-16T16:33:50Z","snapshot_observed_at":"2026-07-06T07:07:02.715882Z","submitted_at":"2018-10-09T18:42:22Z","title":"The Computational Complexity of Training ReLU(s)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04207","snapshot_observed_at":"2026-08-12T16:59:44.125553Z","title":"The computational complexity of training relu(s)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.13083","last_updated":"2025-01-22T14:34:14Z","snapshot_observed_at":"2026-08-12T16:49:11.016588Z","submitted_at":"2024-11-20T07:20:49Z","title":"Omnipredicting Single-Index Models with Multi-Index Models","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T16:59:44.125553Z"},"links":{"cited_paper":"/paper/1810.04207","citing_paper":"/paper/2411.13083"},"observation_digest":"sha256:7a30dcfa2f953f03994183338ea7a94dded45d719706c63ba4c177c17c058127","observation_id":"0f722a24-4892-434d-8af8-d68959352d27","resolution":{"observed_at":"2026-08-12T16:59:44.125553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04207","last_updated":"2018-10-16T16:33:50Z","snapshot_observed_at":"2026-07-06T07:07:02.715882Z","submitted_at":"2018-10-09T18:42:22Z","title":"The Computational Complexity of Training ReLU(s)","version":2},"cited_work":{"arxiv_id":"1810.04207","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.04207","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Computational Complexity of Training ReLU(s)","venue":"cs.CC","work_id":"3817e4cb-e444-4de8-b7dc-c41e96bc91df","year":2018},"citing_paper":{"arxiv_id":"2605.07005","last_updated":"2026-05-17T04:27:49Z","snapshot_observed_at":"2026-08-14T04:08:20.180160Z","submitted_at":"2026-05-07T22:37:29Z","title":"Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift","version":1},"reference_index":195,"source":"arxiv_source","source_observed_at":"2026-05-11T01:02:37.662963Z"},"links":{"cited_paper":"/paper/1810.04207","citing_paper":"/paper/2605.07005"},"observation_digest":"sha256:39398b702333a0cb1d61fc44f63021b28bea8b5958fab7ea5040929d37f2a68d","observation_id":"93f7ac93-c078-4039-9b2d-7f7f668f1a3b","resolution":{"observed_at":"2026-05-11T04:50:56.891924Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04207","last_updated":"2018-10-16T16:33:50Z","snapshot_observed_at":"2026-07-06T07:07:02.715882Z","submitted_at":"2018-10-09T18:42:22Z","title":"The Computational Complexity of Training ReLU(s)","version":2},"cited_work":{"arxiv_id":"1810.04207","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.04207","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Computational Complexity of Training ReLU(s)","venue":"cs.CC","work_id":"3817e4cb-e444-4de8-b7dc-c41e96bc91df","year":2018},"citing_paper":{"arxiv_id":"2605.07005","last_updated":"2026-05-17T04:27:49Z","snapshot_observed_at":"2026-08-14T04:08:20.180160Z","submitted_at":"2026-05-07T22:37:29Z","title":"Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift","version":2},"reference_index":195,"source":"arxiv_source","source_observed_at":"2026-05-20T23:00:15.024237Z"},"links":{"cited_paper":"/paper/1810.04207","citing_paper":"/paper/2605.07005"},"observation_digest":"sha256:c6f4b30d3bfd2de16e0dc39a11f664a1c13f053e77de0e3630d9191ee5209c92","observation_id":"600542e2-911c-4d1b-9eeb-7f055f21b985","resolution":{"observed_at":"2026-05-20T23:03:50.781772Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1810.04207/citation-record","integrity":"/paper/1810.04207/integrity","json":"/paper/1810.04207/citation-record.json","paper":"/paper/1810.04207"},"outbound":[],"paper":{"arxiv_id":"1810.04207","last_updated":"2018-10-16T16:33:50Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T07:07:02.715882Z","submitted_at":"2018-10-09T18:42:22Z","title":"The Computational Complexity of Training ReLU(s)"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1810.04207."}