{"as_of":"2026-08-10T10:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cfec3aed6186e79f0e5cc53a6998e2f92d4afa72d591c92607d6b6e0d68e3bb1","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-10T06:31:04.303077+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-07T14:26:45.846422Z","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:26:45.995041Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1704.03920","last_updated":"2017-04-12T20:29:12Z","snapshot_observed_at":"2026-07-06T05:37:37.792043Z","submitted_at":"2017-04-12T20:29:12Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric","version":1},"cited_work":{"arxiv_id":"1704.03920","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.03920","snapshot_observed_at":"2026-08-07T14:26:45.995041Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric","venue":"math.OC","work_id":"4d1d98e3-867e-4408-b33a-edaf0ef395de","year":2017},"citing_paper":{"arxiv_id":"2505.19278","last_updated":"2025-05-25T19:20:41Z","snapshot_observed_at":"2026-08-07T14:15:23.540303Z","submitted_at":"2025-05-25T19:20:41Z","title":"Moment Relaxations for Data-Driven Wasserstein Distributionally Robust Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T14:26:45.846422Z"},"links":{"cited_paper":"/paper/1704.03920","citing_paper":"/paper/2505.19278"},"observation_digest":"sha256:60eabbe26936569850769aa852e4af656eab9adb878a9d7de1bc32444606cb2a","observation_id":"b7d48af1-fd25-4827-a256-2ff6fcadb685","resolution":{"observed_at":"2026-08-07T14:26:46.001971Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.03920","last_updated":"2017-04-12T20:29:12Z","snapshot_observed_at":"2026-07-06T05:37:37.792043Z","submitted_at":"2017-04-12T20:29:12Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.03920","snapshot_observed_at":"2026-08-04T20:08:06.427532Z","title":"Decomposition algorithm for distribu- tionally robust optimization using wasserstein metric,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08956","last_updated":"2025-09-10T19:30:04Z","snapshot_observed_at":"2026-08-09T02:26:47.534055Z","submitted_at":"2025-09-10T19:30:04Z","title":"Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T20:08:06.427532Z"},"links":{"cited_paper":"/paper/1704.03920","citing_paper":"/paper/2509.08956"},"observation_digest":"sha256:bb5ef03c6bdff09ed6aae67a28c40f0cf994c92889bb42cb2afa6b45fdd50d8b","observation_id":"ec892d65-cd13-425a-a5ee-7564560881bb","resolution":{"observed_at":"2026-08-04T20:08:06.427532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1704.03920/citation-record","integrity":"/paper/1704.03920/integrity","json":"/paper/1704.03920/citation-record.json","paper":"/paper/1704.03920"},"outbound":[],"paper":{"arxiv_id":"1704.03920","last_updated":"2017-04-12T20:29:12Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T05:37:37.792043Z","submitted_at":"2017-04-12T20:29:12Z","title":"Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1704.03920."}