{"as_of":"2026-08-11T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dba46a74b7e3aa8f5d4901f0b40bb4a499cbca3b554e5ea0d041ffaed0f28878","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-11T06:34:44.6726+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-05-10T12:17:46.414837Z","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-10T12:20:22.645744Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.02665","last_updated":"2024-11-04T23:04:03Z","snapshot_observed_at":"2026-07-06T19:45:13.078526Z","submitted_at":"2024-11-04T23:04:03Z","title":"A Trust-Region Algorithm for Noisy Equality Constrained Optimization","version":1},"cited_work":{"arxiv_id":"2411.02665","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.02665","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A trust-region algorithm for noisy equality constrained optimization","venue":null,"work_id":"d02aa763-06e5-4625-b335-f9e0e289aba4","year":2024},"citing_paper":{"arxiv_id":"2604.14368","last_updated":"2026-04-15T19:32:15Z","snapshot_observed_at":"2026-07-06T23:02:09.426599Z","submitted_at":"2026-04-15T19:32:15Z","title":"A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T12:17:46.414837Z"},"links":{"cited_paper":"/paper/2411.02665","citing_paper":"/paper/2604.14368"},"observation_digest":"sha256:efc15c98b3ee52fd42c7c8823e4d2f416bd6bffba97fade8547a12f53de3dce3","observation_id":"7c6b51fd-3197-4edb-b50b-605e8b19dec2","resolution":{"observed_at":"2026-05-10T12:20:22.647372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.02665/citation-record","integrity":"/paper/2411.02665/integrity","json":"/paper/2411.02665/citation-record.json","paper":"/paper/2411.02665"},"outbound":[],"paper":{"arxiv_id":"2411.02665","last_updated":"2024-11-04T23:04:03Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T19:45:13.078526Z","submitted_at":"2024-11-04T23:04:03Z","title":"A Trust-Region Algorithm for Noisy Equality Constrained 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2411.02665."}