{"as_of":"2026-08-08T17:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:75aa7e7890fddabfa93a5068df207b1096232b2362d9f143bbdcd54d38a0c648","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-08T06:32:00.761636+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-07T05:26:27.385625Z","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-07T05:26:27.800554Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.01797","last_updated":"2023-04-04T13:55:07Z","snapshot_observed_at":"2026-07-06T15:12:03.520378Z","submitted_at":"2023-04-04T13:55:07Z","title":"Safe Zeroth-Order Optimization Using Linear Programs","version":1},"cited_work":{"arxiv_id":"2304.01797","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.01797","snapshot_observed_at":"2026-08-07T05:26:27.800554Z","title":"Safe Zeroth-Order Optimization Using Linear Programs","venue":"math.OC","work_id":"183ec2b4-fd99-4b28-a346-4017f80a4dad","year":2023},"citing_paper":{"arxiv_id":"2506.08506","last_updated":"2026-07-29T14:35:20Z","snapshot_observed_at":"2026-08-07T05:06:35.127941Z","submitted_at":"2025-06-10T07:04:15Z","title":"Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:26:27.385625Z"},"links":{"cited_paper":"/paper/2304.01797","citing_paper":"/paper/2506.08506"},"observation_digest":"sha256:9a82f23afc4c9a73a45205f483cb217762b11ad1865ef7d4a24364a53c4fe401","observation_id":"b44a2a54-280d-4ee7-8a9d-f96524f1d646","resolution":{"observed_at":"2026-08-07T05:26:27.809350Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.01797/citation-record","integrity":"/paper/2304.01797/integrity","json":"/paper/2304.01797/citation-record.json","paper":"/paper/2304.01797"},"outbound":[],"paper":{"arxiv_id":"2304.01797","last_updated":"2023-04-04T13:55:07Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T15:12:03.520378Z","submitted_at":"2023-04-04T13:55:07Z","title":"Safe Zeroth-Order Optimization Using Linear Programs"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2304.01797."}