{"as_of":"2026-08-21T10:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58d23297c1e48cbc49041b8f9c1f31e6cf8898e7032739a768b62c7c2b4cde05","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-21T06:32:19.484+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-15T15:04:28.485171Z","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-11T21:16:35.756372Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.05377","last_updated":"2024-04-08T10:32:30Z","snapshot_observed_at":"2026-08-16T14:02:47.793192Z","submitted_at":"2024-04-08T10:32:30Z","title":"A Max-Min-Max Algorithm for Large-Scale Robust Optimization","version":1},"cited_work":{"arxiv_id":"2404.05377","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.05377","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tsaknakis, M","venue":null,"work_id":"f4d5566b-3e1d-41af-80e8-98a7ab84e44e","year":2023},"citing_paper":{"arxiv_id":"2604.23487","last_updated":"2026-04-26T01:24:22Z","snapshot_observed_at":"2026-08-09T03:53:28.800250Z","submitted_at":"2026-04-26T01:24:22Z","title":"Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T05:59:54.996482Z"},"links":{"cited_paper":"/paper/2404.05377","citing_paper":"/paper/2604.23487"},"observation_digest":"sha256:543e67b4915a3435f07b410b439bae8c1fb617c860c111be18726f5cbcccc2ba","observation_id":"d2f49eeb-5817-4568-820f-4383c1bff29d","resolution":{"observed_at":"2026-05-11T21:16:35.786048Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05377","last_updated":"2024-04-08T10:32:30Z","snapshot_observed_at":"2026-08-16T14:02:47.793192Z","submitted_at":"2024-04-08T10:32:30Z","title":"A Max-Min-Max Algorithm for Large-Scale Robust Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05377","snapshot_observed_at":"2026-08-15T15:04:28.485171Z","title":"arXiv:2404.05377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03075","last_updated":"2026-08-04T03:39:43Z","snapshot_observed_at":"2026-08-20T22:32:46.134256Z","submitted_at":"2026-08-04T03:39:43Z","title":"Oracle-Based Distributionally Robust Optimization under Optimal Transport Ambiguity Sets","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T15:04:28.485171Z"},"links":{"cited_paper":"/paper/2404.05377","citing_paper":"/paper/2608.03075"},"observation_digest":"sha256:f0afbe88565305272f7197918c13b3d9a89bc8fe38531909a6afd3232283a78a","observation_id":"08c4e756-6a9f-4584-aed7-ff50dfb32c36","resolution":{"observed_at":"2026-08-15T15:04:28.485171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.05377/citation-record","integrity":"/paper/2404.05377/integrity","json":"/paper/2404.05377/citation-record.json","paper":"/paper/2404.05377"},"outbound":[],"paper":{"arxiv_id":"2404.05377","last_updated":"2024-04-08T10:32:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:02:47.793192Z","submitted_at":"2024-04-08T10:32:30Z","title":"A Max-Min-Max Algorithm for Large-Scale Robust 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.05377."}