Pith. sign in

Paper Citation Record · LEDGER

Algorithms for Competitive Division of Chores

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

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

pith.paper-citation-record.v1
1907.01766 v2

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-16T06:30:59.297886+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-14T05:51:27.310481Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-12T00:47:09.126435Z

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 bf9c7579-991a-481a-9e2f-8c9a73d27429 · inbound

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation cites this paper.

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Algorithms for Competitive Division of Chores

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-14T05:51:27.310481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T05:51:27.310481Z digest=sha256:bb8d83538086bb277138ac3dfbaf99e314e1f5d32f814182e79387adb7d13468

Observation 19d20c6b-7479-4f98-84e6-59cd2f874790 · inbound

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

To EFX OR to MMS, That is the Question Algorithms for Competitive Division of Chores

Reference 33

Resolution
metadata mismatch
local_arxiv, observed 2026-08-12T00:47:09.131009Z

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.

source=arxiv_source observed=2026-08-12T00:47:08.452993Z digest=sha256:807b2b996269882bc973091e9167f5fe7a2174e93f34088c1b611673c1c97acd