Paper Citation Record · LEDGER

Tractable Fragments of the Maximum Nash Welfare Problem

As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2112.10199.

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

pith.paper-citation-record.v1
2112.10199 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T15:48:52.335917Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

8
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation a5428e28-be7b-4898-abe3-236b1f4163d6 · inbound

p-Mean Regret for Stochastic Bandits cites this paper.

p-Mean Regret for Stochastic Bandits Tractable Fragments of the Maximum Nash Welfare Problem

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-11T15:48:52.335917Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88a151be-3274-486f-9f3a-e74e68551a0f · inbound

Improved Algorithms for Nash Welfare in Linear Bandits cites this paper.

Improved Algorithms for Nash Welfare in Linear Bandits Tractable Fragments of the Maximum Nash Welfare Problem

Reference 1993

Resolution: unresolved; no resolver link, observed 2026-08-03T06:28:51.466698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0839df0-bf18-4735-ad65-ae332b0630d9 · inbound

Some Improved Results on Fair and Balanced Graph Partitions cites this paper.

Some Improved Results on Fair and Balanced Graph Partitions Tractable Fragments of the Maximum Nash Welfare Problem

Reference 113

Resolution: verified exact; arxiv_id, observed 2026-05-09T03:35:04.872030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation de104395-593e-4969-b9d1-7a06e81c60c9 · inbound

A Better-than-$e^{1/e}$ Approximation Algorithm for Nash Social Welfare under Additive Valuations cites this paper.

A Better-than-$e^{1/e}$ Approximation Algorithm for Nash Social Welfare under Additive Valuations Tractable Fragments of the Maximum Nash Welfare Problem

Reference 107

Resolution: unresolved; no resolver link, observed 2026-08-02T05:45:28.776352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.