{"as_of":"2026-08-10T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffe04e2688f7520d4857012c53fe4309663fdbb3dd0c372cc1faabd50c7ae141","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-10T06:31:04.303077+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-04T21:22:14.185484Z","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-11T14:31:04.754218Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.00126","last_updated":"2023-06-30T20:36:44Z","snapshot_observed_at":"2026-08-02T11:39:52.136579Z","submitted_at":"2023-06-30T20:36:44Z","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.00126","snapshot_observed_at":"2026-08-04T21:22:14.185484Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08161","last_updated":"2025-09-09T21:46:22Z","snapshot_observed_at":"2026-08-09T02:18:14.286842Z","submitted_at":"2025-09-09T21:46:22Z","title":"Finding a Multiple Follower Stackelberg Equilibrium: A Fully First-Order Method","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T21:22:14.185484Z"},"links":{"cited_paper":"/paper/2307.00126","citing_paper":"/paper/2509.08161"},"observation_digest":"sha256:83b0454d3f9073d28533d2d9f8d9f8e01e09a4b82f78628abbcde726231f2520","observation_id":"2b0f3ca7-1b23-47c6-9f5e-3d53a4b91603","resolution":{"observed_at":"2026-08-04T21:22:14.185484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00126","last_updated":"2023-06-30T20:36:44Z","snapshot_observed_at":"2026-08-02T11:39:52.136579Z","submitted_at":"2023-06-30T20:36:44Z","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.00126","snapshot_observed_at":"2026-08-03T20:01:28.138181Z","title":"Accelerating inexact hypergradient descent for bilevel optimization.arXiv preprint arXiv:2307.00126, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.22331","last_updated":"2026-07-12T02:37:59Z","snapshot_observed_at":"2026-08-10T03:46:49.311029Z","submitted_at":"2025-11-27T11:03:24Z","title":"On the Condition Number Dependency in Bilevel Optimization","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T20:01:28.138181Z"},"links":{"cited_paper":"/paper/2307.00126","citing_paper":"/paper/2511.22331"},"observation_digest":"sha256:b4cff4133524b5e7efccad983dcb3e3ce357dea2dd70e38845b856fd743c5b3d","observation_id":"7625cc3f-db76-4175-9cd6-a78aafc8ceae","resolution":{"observed_at":"2026-08-03T20:01:28.138181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.00126","last_updated":"2023-06-30T20:36:44Z","snapshot_observed_at":"2026-08-02T11:39:52.136579Z","submitted_at":"2023-06-30T20:36:44Z","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":"2307.00126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.00126","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"857db8c5-5f71-4d2c-923f-d7a62d5a4f41","year":null},"citing_paper":{"arxiv_id":"2604.21371","last_updated":"2026-04-23T07:35:22Z","snapshot_observed_at":"2026-08-03T21:11:29.529798Z","submitted_at":"2026-04-23T07:35:22Z","title":"Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T21:45:05.692378Z"},"links":{"cited_paper":"/paper/2307.00126","citing_paper":"/paper/2604.21371"},"observation_digest":"sha256:ef8b67628a1d037e836d650b3f5515e301e446a199077f327437e3fea44dd7be","observation_id":"396a2e26-de5f-4e18-a602-1f13688e0191","resolution":{"observed_at":"2026-05-11T14:31:04.758996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.00126/citation-record","integrity":"/paper/2307.00126/integrity","json":"/paper/2307.00126/citation-record.json","paper":"/paper/2307.00126"},"outbound":[],"paper":{"arxiv_id":"2307.00126","last_updated":"2023-06-30T20:36:44Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-02T11:39:52.136579Z","submitted_at":"2023-06-30T20:36:44Z","title":"Accelerating Inexact HyperGradient Descent 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2307.00126."}