{"as_of":"2026-08-17T14:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1dc7ead43a1776210cbff0f71c1e3f4f6788d67319e2190e322b24ec7bb74507","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-17T06:30:58.91139+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-15T17:52:28.668655Z","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-12T13:40:10.210297Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","snapshot_observed_at":"2026-08-16T16:57:04.899616Z","submitted_at":"2022-05-27T20:28:52Z","title":"Will Bilevel Optimizers Benefit from Loops","version":3},"cited_work":{"arxiv_id":"2205.14224","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.14224","snapshot_observed_at":"2026-08-12T13:40:10.210297Z","title":"Will Bilevel Optimizers Benefit from Loops","venue":"cs.LG","work_id":"f0b2e9be-73bb-4af6-ab99-bb98b09e35ad","year":2022},"citing_paper":{"arxiv_id":"2411.16081","last_updated":"2024-11-25T04:22:17Z","snapshot_observed_at":"2026-08-15T06:41:06.276603Z","submitted_at":"2024-11-25T04:22:17Z","title":"Exploring the Generalization Capabilities of AID-based Bi-level Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T13:40:10.119797Z"},"links":{"cited_paper":"/paper/2205.14224","citing_paper":"/paper/2411.16081"},"observation_digest":"sha256:de4d6eb91100e8375232c9bd1d34e6a4fb2e03c71fdbc82f65ad1a695356dd63","observation_id":"02d3c9c8-9d51-4040-b41c-4f8fb2758408","resolution":{"observed_at":"2026-08-12T13:40:10.217323Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","snapshot_observed_at":"2026-08-16T16:57:04.899616Z","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-15T17:52:28.668655Z","title":"Will bilevel optimizers benefit from loops","venue":null,"work_id":null,"year":2022},"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":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.668655Z"},"links":{"cited_paper":"/paper/2205.14224","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:b388fb4d573cab1ee008ca191384fa4da53332de228a8fdb79966565a19dca61","observation_id":"1eb3f069-6326-4cda-9d84-eac7d948337e","resolution":{"observed_at":"2026-08-15T17:52:28.668655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","snapshot_observed_at":"2026-08-16T16:57:04.899616Z","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-15T22:59:32.979668Z","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:959ef5827c5f6d012f7f206ea4b0e105f7fc627697ffeda0a081dd7604510555","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-08-16T16:57:04.899616Z","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-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 3 inbound Pith citation observations for arXiv:2205.14224."}