{"as_of":"2026-08-04T04:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1fbea87d05a832e929fe9e02bcc242565059380b5438c36060b4d42ef677b87b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T06:20:42.781613Z","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-13T06:22:23.305602Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.05140","last_updated":"2024-10-08T21:38:43Z","snapshot_observed_at":"2026-07-06T19:29:05.492290Z","submitted_at":"2024-10-07T15:50:30Z","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","version":2},"cited_work":{"arxiv_id":"2410.05140","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.05140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tuning-free bilevel optimization: New algorithms and convergence analysis","venue":null,"work_id":"8e9ed6eb-3462-4877-904d-21b5f8c3998c","year":2024},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-12T04:47:04.868735Z"},"links":{"cited_paper":"/paper/2410.05140","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:e9c9a766ee0b70ad804c2030a58ce26962b7eb35895eba1a332be8c492e77faa","observation_id":"e8e2195f-ded5-4022-b158-3893aa3bd2c6","resolution":{"observed_at":"2026-05-12T05:56:26.547593Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05140","last_updated":"2024-10-08T21:38:43Z","snapshot_observed_at":"2026-07-06T19:29:05.492290Z","submitted_at":"2024-10-07T15:50:30Z","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis","version":2},"cited_work":{"arxiv_id":"2410.05140","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.05140","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tuning-free bilevel optimization: New algorithms and convergence analysis","venue":null,"work_id":"8e9ed6eb-3462-4877-904d-21b5f8c3998c","year":2024},"citing_paper":{"arxiv_id":"2605.10288","last_updated":"2026-05-12T10:19:03Z","snapshot_observed_at":"2026-07-06T23:22:18.704329Z","submitted_at":"2026-05-11T09:50:10Z","title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-13T06:20:42.781613Z"},"links":{"cited_paper":"/paper/2410.05140","citing_paper":"/paper/2605.10288"},"observation_digest":"sha256:3d570882b38f45dee3b128231d80a316533ba0f0e0f4e9fb9a4c749d97488c40","observation_id":"ab2eb98e-b534-4639-aea3-652309266564","resolution":{"observed_at":"2026-05-13T06:22:23.307010Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.05140/citation-record","integrity":"/paper/2410.05140/integrity","json":"/paper/2410.05140/citation-record.json","paper":"/paper/2410.05140"},"outbound":[],"paper":{"arxiv_id":"2410.05140","last_updated":"2024-10-08T21:38:43Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:29:05.492290Z","submitted_at":"2024-10-07T15:50:30Z","title":"Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis"},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2410.05140."}