{"as_of":"2026-08-15T01:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:41f00d1119f57cea7c84807139e2680b0d62f6434cb234046743922f8265d545","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-14T06:32:32.682623+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-07-30T21:57:09.677303Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.04037","last_updated":"2025-05-07T00:33:14Z","snapshot_observed_at":"2026-08-14T10:41:55.704000Z","submitted_at":"2025-05-07T00:33:14Z","title":"Learning based convex approximation for constrained parametric optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04037","snapshot_observed_at":"2026-07-30T21:57:09.677303Z","title":"arXiv preprint arXiv:2505.04037 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23448","last_updated":"2026-07-26T04:13:43Z","snapshot_observed_at":"2026-08-08T19:30:27.436950Z","submitted_at":"2026-07-26T04:13:43Z","title":"Constraint-Bound Agnostic Bayesian Optimization: One Model for All Thresholds","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-30T21:57:09.677303Z"},"links":{"cited_paper":"/paper/2505.04037","citing_paper":"/paper/2607.23448"},"observation_digest":"sha256:756d3b1df2104927557129d392f48a3eab650c3ae75fd77b61ff2b2bc2561e24","observation_id":"4f91fcf0-cfc9-4547-b9ef-45413ab5f8a5","resolution":{"observed_at":"2026-07-30T21:57:09.677303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.04037/citation-record","integrity":"/paper/2505.04037/integrity","json":"/paper/2505.04037/citation-record.json","paper":"/paper/2505.04037"},"outbound":[],"paper":{"arxiv_id":"2505.04037","last_updated":"2025-05-07T00:33:14Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T10:41:55.704000Z","submitted_at":"2025-05-07T00:33:14Z","title":"Learning based convex approximation for constrained parametric 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2505.04037."}