Pith. sign in

Paper Citation Record · LEDGER

Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1704.03920 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:26:45.846422Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T14:26:45.995041Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation b7d48af1-fd25-4827-a256-2ff6fcadb685 · inbound

Moment Relaxations for Data-Driven Wasserstein Distributionally Robust Optimization cites this paper.

Moment Relaxations for Data-Driven Wasserstein Distributionally Robust Optimization Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric

Reference 2017

Resolution
metadata mismatch
local_arxiv, observed 2026-08-07T14:26:46.001971Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-07T14:26:45.846422Z digest=sha256:60eabbe26936569850769aa852e4af656eab9adb878a9d7de1bc32444606cb2a

Observation ec892d65-cd13-425a-a5ee-7564560881bb · inbound

Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach cites this paper.

Multi-Agent Inverse Reinforcement Learning for Identifying Pareto-Efficient Coordination -- A Distributionally Robust Approach Decomposition Algorithm for Distributionally Robust Optimization using Wasserstein Metric

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-04T20:08:06.427532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T20:08:06.427532Z digest=sha256:bb5ef03c6bdff09ed6aae67a28c40f0cf994c92889bb42cb2afa6b45fdd50d8b