{"as_of":"2026-08-17T19:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80ea83f1241c3d0ecb7ed2ea8ce6cae40acec4f74c1594bf125f2ab9b5d25c9c","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-17T06:30:58.91139+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-08-15T17:52:28.880199Z","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-08-15T17:52:28.978291Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.04692","last_updated":"2021-12-15T20:10:53Z","snapshot_observed_at":"2026-08-16T18:18:35.928871Z","submitted_at":"2021-06-08T21:05:30Z","title":"Provably Faster Algorithms for Bilevel Optimization","version":2},"cited_work":{"arxiv_id":"2106.04692","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04692","snapshot_observed_at":"2026-08-15T17:52:28.978291Z","title":"Provably Faster Algorithms for Bilevel Optimization","venue":"cs.LG","work_id":"dffc4102-ce68-420b-a2f8-43c308da1d19","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.880199Z"},"links":{"cited_paper":"/paper/2106.04692","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:5f28ba837def30b8269567f740ec7d9ff7f727c89b0dcd41182bdd352f770794","observation_id":"2286fcca-a6bb-4bc4-8c53-f0e5af551228","resolution":{"observed_at":"2026-08-15T17:52:28.984284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.04692/citation-record","integrity":"/paper/2106.04692/integrity","json":"/paper/2106.04692/citation-record.json","paper":"/paper/2106.04692"},"outbound":[],"paper":{"arxiv_id":"2106.04692","last_updated":"2021-12-15T20:10:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:18:35.928871Z","submitted_at":"2021-06-08T21:05:30Z","title":"Provably Faster Algorithms 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.04692."}