Paper Citation Record · LEDGER

Envy-free Relaxations for Goods, Chores, and Mixed Items

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

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

pith.paper-citation-record.v1
2006.04428 v1

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-12T00:47:08.547617Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-21T01:19:20.792047Z

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 f3f739e3-c6ce-4aa5-a734-d21e0d8f0720 · inbound

The Team Order Problem: Maximizing the Probability of Matching Being Large Enough cites this paper.

The Team Order Problem: Maximizing the Probability of Matching Being Large Enough Envy-free Relaxations for Goods, Chores, and Mixed Items

Reference 121

Resolution: verified exact; arxiv_id, observed 2026-05-21T01:19:20.794455Z

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 5414d995-4e3a-463a-af7e-e55bd1e9b3ae · 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 Envy-free Relaxations for Goods, Chores, and Mixed Items

Reference 51

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06c84869-4d3a-4d9e-8faf-163361c4c424 · inbound

From Cake-Cutting and Necklace-Splitting to Fair Division of Indivisible Items cites this paper.

From Cake-Cutting and Necklace-Splitting to Fair Division of Indivisible Items Envy-free Relaxations for Goods, Chores, and Mixed Items

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-08T19:33:42.717652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 187f7a3a-6f93-4630-b03a-40935330dddb · inbound

To EFX OR to MMS, That is the Question cites this paper.

To EFX OR to MMS, That is the Question Envy-free Relaxations for Goods, Chores, and Mixed Items

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-12T00:47:08.547617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.