{"as_of":"2026-08-19T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3f48d5d1bc5de6c8c0df21d750cf8803cdc2be10900466a0da908208aa94169","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:38:58.875393Z","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-10T23:47:11.168922Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","snapshot_observed_at":"2026-08-16T15:22:19.270200Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12067","snapshot_observed_at":"2026-08-12T15:38:58.875393Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14166","last_updated":"2024-12-17T09:38:53Z","snapshot_observed_at":"2026-08-16T15:53:48.158207Z","submitted_at":"2024-11-21T14:23:06Z","title":"SPARKLE: A Unified Single-Loop Primal-Dual Framework for Decentralized Bilevel Optimization","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:38:58.875393Z"},"links":{"cited_paper":"/paper/2306.12067","citing_paper":"/paper/2411.14166"},"observation_digest":"sha256:a29b1ba3878c5b3d4a0801a2a57916ac476816604ce456f61f00167103ad55b9","observation_id":"f6be59ec-148f-43cf-93e6-5025ac101ec6","resolution":{"observed_at":"2026-08-12T15:38:58.875393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","snapshot_observed_at":"2026-08-16T15:22:19.270200Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12067","snapshot_observed_at":"2026-08-12T13:40:10.124082Z","title":"Opti- mal algorithms for stochastic bilevel optimization un- der relaxed smoothness conditions,","venue":null,"work_id":null,"year":2023},"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":46,"source":"pdf_text","source_observed_at":"2026-08-12T13:40:10.124082Z"},"links":{"cited_paper":"/paper/2306.12067","citing_paper":"/paper/2411.16081"},"observation_digest":"sha256:843cd030150dc6c72fc9051299880e59e12cacfd578096ac9842c8159b0acf6d","observation_id":"dfb13727-e791-4f85-a574-1c71b4a221fb","resolution":{"observed_at":"2026-08-12T13:40:10.124082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","snapshot_observed_at":"2026-08-16T15:22:19.270200Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12067","snapshot_observed_at":"2026-08-11T19:10:52.507503Z","title":"Optimal algorithms for stochastic bilevel optimization under relaxed smoothness conditions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07138","last_updated":"2024-12-10T02:57:35Z","snapshot_observed_at":"2026-08-19T08:26:08.904117Z","submitted_at":"2024-12-10T02:57:35Z","title":"Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-11T19:10:52.507503Z"},"links":{"cited_paper":"/paper/2306.12067","citing_paper":"/paper/2412.07138"},"observation_digest":"sha256:3641459c32f82d7c54a1093303b27f75d8ea2121f040da286940fbb538ea7c4a","observation_id":"fdf0ce54-7a42-493f-92bd-171d352166a0","resolution":{"observed_at":"2026-08-11T19:10:52.507503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","snapshot_observed_at":"2026-08-16T15:22:19.270200Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","version":1},"cited_work":{"arxiv_id":"2306.12067","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.12067","snapshot_observed_at":"2026-08-10T23:47:11.168922Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","venue":"math.OC","work_id":"7dc2f504-533a-4e3d-b11e-943807b666b0","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-18T19:45:00.383639Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.654282Z"},"links":{"cited_paper":"/paper/2306.12067","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:fb588b56836f93fb7fecda56b9efd72f9ee656978b88a2b030b9b16401d8ccca","observation_id":"f98a63af-f471-4d09-930a-0248167a420a","resolution":{"observed_at":"2026-08-10T23:47:11.173235Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.12067/citation-record","integrity":"/paper/2306.12067/integrity","json":"/paper/2306.12067/citation-record.json","paper":"/paper/2306.12067"},"outbound":[],"paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:22:19.270200Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2306.12067."}