{"as_of":"2026-08-07T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:423d21d08337353c449aec4683f87eae85a4e56a12cb3b52ca178fec329f26ff","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:27:36.573287Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-04T23:35:21.709682Z","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-01T21:46:15.185972Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"cited_work":{"arxiv_id":"2602.02431","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.02431","snapshot_observed_at":"2026-07-01T21:46:15.185972Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","venue":"stat.ML","work_id":"69756c3b-c2be-4bc4-ba6f-68b7634628e1","year":2026},"citing_paper":{"arxiv_id":"2606.01257","last_updated":"2026-05-31T14:22:37Z","snapshot_observed_at":"2026-07-06T23:41:48.357871Z","submitted_at":"2026-05-31T14:22:37Z","title":"Statistical Inference on Gradient Flows","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-28T16:26:55.468917Z"},"links":{"cited_paper":"/paper/2602.02431","citing_paper":"/paper/2606.01257"},"observation_digest":"sha256:24e8dcc2d0fae44e715b8b8701a59b72fb9fee6fd55b9b9da43141d9565caa21","observation_id":"051dcdca-26ec-4585-b47d-e3111c292843","resolution":{"observed_at":"2026-07-01T21:46:15.187582Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.02431","snapshot_observed_at":"2026-08-04T23:35:21.709682Z","title":"arXiv preprint arXiv:2602.02431 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01654","last_updated":"2026-08-03T03:44:13Z","snapshot_observed_at":"2026-08-07T16:35:33.631222Z","submitted_at":"2026-08-03T03:44:13Z","title":"Approximate Message Passing with Random Initialization for Phase Retrieval","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T23:35:21.709682Z"},"links":{"cited_paper":"/paper/2602.02431","citing_paper":"/paper/2608.01654"},"observation_digest":"sha256:94c62de31538bf941803b7ba6e5d7236063ff95cd3428dda4246e58aa18a9a48","observation_id":"b5c581aa-e286-4c48-9fe2-29a3cd0c3319","resolution":{"observed_at":"2026-08-04T23:35:21.709682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.02431/citation-record","integrity":"/paper/2602.02431/integrity","json":"/paper/2602.02431/citation-record.json","paper":"/paper/2602.02431"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:27:36.251932Z","title":"4 cosφ− √ 3 s 2 R√ M e− M 2R2 + 2e− M 2 !# · tanφ 1 + tanφ ∥θ∥ ≤","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T05:27:36.251932Z"},"links":{"citing_paper":"/paper/2602.02431"},"observation_digest":"sha256:ad498b97da6c9efe7644991ff3ade02b7cc95385a3703a7fd1102cc5fdb053f6","observation_id":"f5dd3e6d-78e0-4801-82aa-4424269b72a8","resolution":{"observed_at":"2026-08-03T05:27:36.251932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:27:36.391442Z","title":"67 Furthermore, we have ⟨gS, a⟩=rcosθ,⟨g S, b⟩=rcos(θ−α), which implies that D(a, b) ={cosθ·cos(θ−α)<0}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T05:27:36.391442Z"},"links":{"citing_paper":"/paper/2602.02431"},"observation_digest":"sha256:bca0370dfc3e3e906aff5378acfbab72c216aa8f2c2a10baa4ecf45a0ed07aaf","observation_id":"f0c6aa5b-654c-41d4-8b31-341bc2d00e40","resolution":{"observed_at":"2026-08-03T05:27:36.391442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:27:36.573287Z","title":"Therefore, we have E[(a−b) 21{B}] =E[(⟨x, u⟩)21{B}]≥E[(u 1g1 +u 2g2)21{B}]","venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T05:27:36.573287Z"},"links":{"citing_paper":"/paper/2602.02431"},"observation_digest":"sha256:e5b3e8d41638e5f3dc01038b7a6a2f8ff33ca159c3bbc0cf13dcdcc89320bd31","observation_id":"7ff1f73e-4e46-48d1-bbaa-75cb11acefb3","resolution":{"observed_at":"2026-08-03T05:27:36.573287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T05:27:36.172766Z","title":"Alex Damian, Jason D Lee, and Joan Bruna","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning","version":2},"reference_index":1262,"source":"pdf_text","source_observed_at":"2026-08-03T05:27:36.172766Z"},"links":{"citing_paper":"/paper/2602.02431"},"observation_digest":"sha256:d5667287c6b68634027309888e0e00e51fe443b5e83cb0b5e404f006c6473f6c","observation_id":"707b2009-c44e-4771-a38f-93c6172cbd67","resolution":{"observed_at":"2026-08-03T05:27:36.172766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.02431","last_updated":"2026-06-05T18:19:06Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-04T00:38:51.670555Z","submitted_at":"2026-02-02T18:31:51Z","title":"Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":4},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 2 inbound Pith citation observations for arXiv:2602.02431."}