{"as_of":"2026-08-10T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34576b60f0a43fb20aa1e28938c8acc1682efa07f58a45536173c396d236e700","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-10T06:31:04.303077+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-07T23:43:37.896799Z","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-07-04T06:49:38.770121Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2301.01716","last_updated":"2024-03-07T15:42:33Z","snapshot_observed_at":"2026-08-07T05:20:41.905733Z","submitted_at":"2023-01-04T17:29:04Z","title":"First-order penalty methods for bilevel optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01716","snapshot_observed_at":"2026-08-07T23:43:37.896799Z","title":"and Mei, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08808","last_updated":"2025-08-05T16:27:52Z","snapshot_observed_at":"2026-08-09T21:48:55.277403Z","submitted_at":"2025-02-12T21:44:06Z","title":"A First-order Generative Bilevel Optimization Framework for Diffusion Models","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T23:43:37.896799Z"},"links":{"cited_paper":"/paper/2301.01716","citing_paper":"/paper/2502.08808"},"observation_digest":"sha256:3f54d6f99ec74d49d5c4caf505647cac4b130bd01305041045bd44526e98d9ea","observation_id":"33b7de43-efce-4e12-aaf1-4e82b3e4265c","resolution":{"observed_at":"2026-08-07T23:43:37.896799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01716","last_updated":"2024-03-07T15:42:33Z","snapshot_observed_at":"2026-08-07T05:20:41.905733Z","submitted_at":"2023-01-04T17:29:04Z","title":"First-order penalty methods for bilevel optimization","version":2},"cited_work":{"arxiv_id":"2301.01716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2301.01716","snapshot_observed_at":"2026-07-04T06:49:38.770121Z","title":"First-order penalty methods for bilevel optimization","venue":null,"work_id":"c7635f60-e196-405c-8e07-0808149492c2","year":2023},"citing_paper":{"arxiv_id":"2606.20534","last_updated":"2026-06-18T17:48:15Z","snapshot_observed_at":"2026-08-06T08:22:23.680217Z","submitted_at":"2026-06-18T17:48:15Z","title":"On Second-Order Methods for Bilevel Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T15:48:40.038340Z"},"links":{"cited_paper":"/paper/2301.01716","citing_paper":"/paper/2606.20534"},"observation_digest":"sha256:9371ad2a6a942e4454fc77257c04a4296fd2a65fe4a290ef76a78ee4470e7887","observation_id":"639de219-19c7-4de2-bfb9-1f0c03dd60f1","resolution":{"observed_at":"2026-07-04T05:39:40.079712Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01716","last_updated":"2024-03-07T15:42:33Z","snapshot_observed_at":"2026-08-07T05:20:41.905733Z","submitted_at":"2023-01-04T17:29:04Z","title":"First-order penalty methods for bilevel optimization","version":2},"cited_work":{"arxiv_id":"2301.01716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2301.01716","snapshot_observed_at":"2026-07-04T06:49:38.770121Z","title":"First-order penalty methods for bilevel optimization","venue":null,"work_id":"c7635f60-e196-405c-8e07-0808149492c2","year":2023},"citing_paper":{"arxiv_id":"2606.21153","last_updated":"2026-06-19T06:45:13Z","snapshot_observed_at":"2026-08-07T08:19:58.025546Z","submitted_at":"2026-06-19T06:45:13Z","title":"DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-06-26T14:05:44.844769Z"},"links":{"cited_paper":"/paper/2301.01716","citing_paper":"/paper/2606.21153"},"observation_digest":"sha256:4995eddd159879d7a56a37e4494d19bc2133a0d76295b8d594449911207e25c2","observation_id":"2e86ba2d-28b5-44fa-919f-b557c427d84e","resolution":{"observed_at":"2026-07-04T06:49:38.772143Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2301.01716","last_updated":"2024-03-07T15:42:33Z","snapshot_observed_at":"2026-08-07T05:20:41.905733Z","submitted_at":"2023-01-04T17:29:04Z","title":"First-order penalty methods for bilevel optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.01716","snapshot_observed_at":"2026-08-01T00:57:21.187653Z","title":"arXiv preprint arXiv:2301.01716 , 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-06T08:39:08.415621Z","submitted_at":"2026-07-28T17:42:41Z","title":"Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis","version":1},"reference_index":207,"source":"arxiv_source","source_observed_at":"2026-08-01T00:57:21.187653Z"},"links":{"cited_paper":"/paper/2301.01716","citing_paper":"/paper/2607.26032"},"observation_digest":"sha256:ae33561edff6c302ffad6c52b356b5fa77340fde1c03ef2fb628fd4f93e1535d","observation_id":"051760d4-69fa-449b-9aea-33c22a3436ce","resolution":{"observed_at":"2026-08-01T00:57:21.187653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2301.01716/citation-record","integrity":"/paper/2301.01716/integrity","json":"/paper/2301.01716/citation-record.json","paper":"/paper/2301.01716"},"outbound":[],"paper":{"arxiv_id":"2301.01716","last_updated":"2024-03-07T15:42:33Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T05:20:41.905733Z","submitted_at":"2023-01-04T17:29:04Z","title":"First-order penalty methods 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 4 inbound Pith citation observations for arXiv:2301.01716."}