{"as_of":"2026-08-04T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a45de5d4d1b51854829a3bffe2adb3fd8ea6e369b2ec01a846a8d97eeb1bc608","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-04T06:34:03.388597+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-01T00:57:14.827671Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","snapshot_observed_at":"2026-07-06T13:14:52.308302Z","submitted_at":"2022-05-27T20:28:52Z","title":"Will Bilevel Optimizers Benefit from Loops","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14224","snapshot_observed_at":"2026-08-01T00:57:14.827671Z","title":"arXiv preprint arXiv:2205.14224 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26032","last_updated":"2026-07-28T17:42:41Z","snapshot_observed_at":"2026-08-03T04:58:59.899643Z","submitted_at":"2026-07-28T17:42:41Z","title":"Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis","version":1},"reference_index":122,"source":"arxiv_source","source_observed_at":"2026-08-01T00:57:14.827671Z"},"links":{"cited_paper":"/paper/2205.14224","citing_paper":"/paper/2607.26032"},"observation_digest":"sha256:bf02056c0020f7294160ed4228a13434d104a0e6d8c0ff17773ea08a344f1967","observation_id":"07adda7d-c359-465d-8bb1-8a2ee1296ec1","resolution":{"observed_at":"2026-08-01T00:57:14.827671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2205.14224/citation-record","integrity":"/paper/2205.14224/integrity","json":"/paper/2205.14224/citation-record.json","paper":"/paper/2205.14224"},"outbound":[],"paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:14:52.308302Z","submitted_at":"2022-05-27T20:28:52Z","title":"Will Bilevel Optimizers Benefit from Loops"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2205.14224."}