{"as_of":"2026-08-09T15:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e49e62b71868eef341f9fd934e6d463ae824b85b073b1e82242df8355c72bd8","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-09T06:31:02.800959+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-08-08T05:44:07.630411Z","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-07T14:22:50.647068Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.07812","last_updated":"2024-07-10T16:32:21Z","snapshot_observed_at":"2026-07-06T18:44:20.262496Z","submitted_at":"2024-07-10T16:32:21Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07812","snapshot_observed_at":"2026-08-08T05:44:07.630411Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08308","last_updated":"2025-02-12T11:22:23Z","snapshot_observed_at":"2026-08-08T05:34:32.720241Z","submitted_at":"2025-02-12T11:22:23Z","title":"prunAdag: an adaptive pruning-aware gradient method","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T05:44:07.630411Z"},"links":{"cited_paper":"/paper/2407.07812","citing_paper":"/paper/2502.08308"},"observation_digest":"sha256:99475005e8307e958b56013d81daf3390e72ebb7c5d0680eae0d0f1612c5a0f0","observation_id":"f2ab038a-bff9-4808-a6be-432b4efa0f9d","resolution":{"observed_at":"2026-08-08T05:44:07.630411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07812","last_updated":"2024-07-10T16:32:21Z","snapshot_observed_at":"2026-07-06T18:44:20.262496Z","submitted_at":"2024-07-10T16:32:21Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","version":1},"cited_work":{"arxiv_id":"2407.07812","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.07812","snapshot_observed_at":"2026-08-07T14:22:50.647068Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","venue":"math.OC","work_id":"08d6325f-4221-40b2-9dab-366803be82f7","year":2024},"citing_paper":{"arxiv_id":"2505.19382","last_updated":"2025-05-26T00:50:41Z","snapshot_observed_at":"2026-08-09T05:02:37.513007Z","submitted_at":"2025-05-26T00:50:41Z","title":"Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:22:50.157210Z"},"links":{"cited_paper":"/paper/2407.07812","citing_paper":"/paper/2505.19382"},"observation_digest":"sha256:12a1784af7d0305e225f79fde8b612f50dec6536fb2636ee5f57898de7729dcf","observation_id":"ea9fbf47-64d6-46dd-a0cc-8099008cae6d","resolution":{"observed_at":"2026-08-07T14:22:50.655890Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.07812/citation-record","integrity":"/paper/2407.07812/integrity","json":"/paper/2407.07812/citation-record.json","paper":"/paper/2407.07812"},"outbound":[],"paper":{"arxiv_id":"2407.07812","last_updated":"2024-07-10T16:32:21Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T18:44:20.262496Z","submitted_at":"2024-07-10T16:32:21Z","title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.07812."}