{"as_of":"2026-08-05T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54dd5782497c07eeea05a5b5ab5aec41cdd91d8167b252964d8e59cec10298e2","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T08:08:45.069685Z","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-11T20:46:11.064710Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.11211","last_updated":"2023-06-20T00:32:13Z","snapshot_observed_at":"2026-07-06T15:44:23.779912Z","submitted_at":"2023-06-20T00:32:13Z","title":"A New Simple Stochastic Gradient Descent Type Algorithm With Lower Computational Complexity for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":"2306.11211","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.11211","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new simple stochastic gradient descent type algorithm with lower computa- tional complexity for bilevel optimization.arXiv preprint arXiv:2306.11211","venue":null,"work_id":"7c135abc-b7cc-479e-a248-3df18d9d3b43","year":null},"citing_paper":{"arxiv_id":"2605.06431","last_updated":"2026-05-07T15:35:15Z","snapshot_observed_at":"2026-08-02T06:24:15.531785Z","submitted_at":"2026-05-07T15:35:15Z","title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T08:08:45.069685Z"},"links":{"cited_paper":"/paper/2306.11211","citing_paper":"/paper/2605.06431"},"observation_digest":"sha256:55459831e0857bef88b7738ac6f29b749925fb48a0134cd87519200d6c12b32b","observation_id":"1a8e13ee-ca54-44c9-a330-78ef6a3c9ecb","resolution":{"observed_at":"2026-05-11T20:46:11.069759Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.11211/citation-record","integrity":"/paper/2306.11211/integrity","json":"/paper/2306.11211/citation-record.json","paper":"/paper/2306.11211"},"outbound":[],"paper":{"arxiv_id":"2306.11211","last_updated":"2023-06-20T00:32:13Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T15:44:23.779912Z","submitted_at":"2023-06-20T00:32:13Z","title":"A New Simple Stochastic Gradient Descent Type Algorithm With Lower Computational Complexity for Bilevel Optimization"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.11211."}