{"as_of":"2026-08-07T17:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:004063e50546b6510b47066b044f8657174aac5d09d0551e0030817c8646494b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:33:29.651695Z","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-06T15:33:34.044359Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.01429","last_updated":"2022-09-30T08:41:29Z","snapshot_observed_at":"2026-07-06T11:15:23.626911Z","submitted_at":"2021-06-02T19:18:22Z","title":"Smooth Bilevel Programming for Sparse Regularization","version":2},"cited_work":{"arxiv_id":"2106.01429","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.01429","snapshot_observed_at":"2026-08-06T15:33:34.044359Z","title":"Smooth Bilevel Programming for Sparse Regularization","venue":"stat.ML","work_id":"6f110ed2-6201-4f4f-afdb-fa0ab4dda3d1","year":2021},"citing_paper":{"arxiv_id":"2508.00013","last_updated":"2025-07-21T11:33:57Z","snapshot_observed_at":"2026-08-06T15:27:46.136316Z","submitted_at":"2025-07-21T11:33:57Z","title":"From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:33:29.651695Z"},"links":{"cited_paper":"/paper/2106.01429","citing_paper":"/paper/2508.00013"},"observation_digest":"sha256:f1bc2fc0d402c781c86900f4c17a8618c4d9f03c9d904a8251c844288c90a344","observation_id":"d19e5135-6ca3-4e96-955d-1584fdc24870","resolution":{"observed_at":"2026-08-06T15:33:34.115498Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.01429/citation-record","integrity":"/paper/2106.01429/integrity","json":"/paper/2106.01429/citation-record.json","paper":"/paper/2106.01429"},"outbound":[],"paper":{"arxiv_id":"2106.01429","last_updated":"2022-09-30T08:41:29Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T11:15:23.626911Z","submitted_at":"2021-06-02T19:18:22Z","title":"Smooth Bilevel Programming for Sparse Regularization"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.01429."}