{"as_of":"2026-08-21T03:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:739e20a2b27d57cdaae9b3b41fee8b3c6f4d98bff530d3a4f61852c6a0a6bcf8","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:04:28.501850Z","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-11T14:46:45.451806Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.10796","last_updated":"2026-08-09T17:16:04Z","snapshot_observed_at":"2026-08-20T04:37:29.735235Z","submitted_at":"2025-04-15T01:47:11Z","title":"Wasserstein Distributionally Robust Regret Optimization","version":5},"cited_work":{"arxiv_id":"2504.10796","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10796","snapshot_observed_at":"2026-06-30T01:16:23.015854Z","title":"Wasserstein distributionally robust regret optimization.arXiv preprint arXiv:2504.10796","venue":null,"work_id":"f4361c2c-5b7e-431f-8c02-fd80a3e4099d","year":2025},"citing_paper":{"arxiv_id":"2604.06158","last_updated":"2026-08-09T17:19:37Z","snapshot_observed_at":"2026-08-14T23:22:56.968384Z","submitted_at":"2026-04-07T17:55:56Z","title":"Distributionally Robust Regret Optimal LQR with Common Stage-Law Ambiguity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T18:48:53.469118Z"},"links":{"cited_paper":"/paper/2504.10796","citing_paper":"/paper/2604.06158"},"observation_digest":"sha256:7d573e92a6513c5e30e27dbfb2a498274c873d8494ddd2f22cd4f3aec3b4624c","observation_id":"86e3da46-f10e-42d2-b62b-83e9ba9b8203","resolution":{"observed_at":"2026-06-30T01:16:23.015854Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10796","last_updated":"2026-08-09T17:16:04Z","snapshot_observed_at":"2026-08-20T04:37:29.735235Z","submitted_at":"2025-04-15T01:47:11Z","title":"Wasserstein Distributionally Robust Regret Optimization","version":5},"cited_work":{"arxiv_id":"2504.10796","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.10796","snapshot_observed_at":"2026-06-30T01:16:23.015854Z","title":"Wasserstein distributionally robust regret optimization.arXiv preprint arXiv:2504.10796","venue":null,"work_id":"f4361c2c-5b7e-431f-8c02-fd80a3e4099d","year":2025},"citing_paper":{"arxiv_id":"2605.00155","last_updated":"2026-08-09T20:29:32Z","snapshot_observed_at":"2026-08-15T21:51:37.517830Z","submitted_at":"2026-04-30T19:22:56Z","title":"Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-09T21:03:53.045304Z"},"links":{"cited_paper":"/paper/2504.10796","citing_paper":"/paper/2605.00155"},"observation_digest":"sha256:6bce61acac083b11809c9240e421c9a17964fd247ccfb9d551fe7c40403101a3","observation_id":"134290d4-2043-4a6e-9919-d533b2e6e72f","resolution":{"observed_at":"2026-06-30T01:16:23.015854Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10796","last_updated":"2026-08-09T17:16:04Z","snapshot_observed_at":"2026-08-20T04:37:29.735235Z","submitted_at":"2025-04-15T01:47:11Z","title":"Wasserstein Distributionally Robust Regret Optimization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.10796","snapshot_observed_at":"2026-08-15T15:04:28.501850Z","title":"arXiv:2504.10796 , 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":70,"source":"arxiv_source","source_observed_at":"2026-08-15T15:04:28.501850Z"},"links":{"cited_paper":"/paper/2504.10796","citing_paper":"/paper/2608.03075"},"observation_digest":"sha256:2e898d8fb8be7ce28fd88a45b4499f09bdeb51ce9707bfbf82f9f330563cd997","observation_id":"5ea6caa4-605b-41b0-a19d-db15dddafa87","resolution":{"observed_at":"2026-08-15T15:04:28.501850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.10796/citation-record","integrity":"/paper/2504.10796/integrity","json":"/paper/2504.10796/citation-record.json","paper":"/paper/2504.10796"},"outbound":[],"paper":{"arxiv_id":"2504.10796","last_updated":"2026-08-09T17:16:04Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-20T04:37:29.735235Z","submitted_at":"2025-04-15T01:47:11Z","title":"Wasserstein Distributionally Robust Regret 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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.10796."}