Paper Citation Record · LEDGER

Constant Weighted Maximin Share Approximations for Chores

As of 11 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2510.06581.

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

pith.paper-citation-record.v1
2510.06581 v2

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T11:17:37.952780Z

measured 38 of 38 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

38 of 38 outbound references displayed

verified exact0
verified fuzzy0
unresolved38
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9efd6f30-8deb-4819-8e79-d65f0e1dec5a · outbound

This paper cites Voudouris.

Constant Weighted Maximin Share Approximations for Chores Voudouris

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.726910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d326ff6-dcc5-43f9-a944-43fdb8a20e75 · outbound

This paper cites On truthful mechanisms for maximin share allocations.

Constant Weighted Maximin Share Approximations for Chores On truthful mechanisms for maximin share allocations

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.733982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation beb82d35-0e20-47ca-a243-2045ea43e4a4 · outbound

This paper cites Weighted maxmin fair share allocation of indivisible chores.

Constant Weighted Maximin Share Approximations for Chores Weighted maxmin fair share allocation of indivisible chores

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.739423Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1114898c-5851-431f-ac5f-bd30c861e966 · outbound

This paper cites Breaking the 3/4 barrier for approximate maximin share.

Constant Weighted Maximin Share Approximations for Chores Breaking the 3/4 barrier for approximate maximin share

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.745633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66498095-8c76-49f9-a022-8fd982efe811 · outbound

This paper cites Algorithmic fair allocation of indivisible items: a survey and new questions.

Constant Weighted Maximin Share Approximations for Chores Algorithmic fair allocation of indivisible items: a survey and new questions

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.751159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f40fcb49-b3e4-4238-b218-9575581c0ec9 · outbound

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

Constant Weighted Maximin Share Approximations for Chores A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.757868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d019798b-dbd7-4e3a-857e-ca2d8046eeef · outbound

This paper cites Algorithms for max-min share fair allocation of indivisible chores.

Constant Weighted Maximin Share Approximations for Chores Algorithms for max-min share fair allocation of indivisible chores

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.764417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 646e3178-c80c-4132-9bfb-b657974527dd · outbound

This paper cites Fair-share allocations for agents with arbitrary entitlements.

Constant Weighted Maximin Share Approximations for Chores Fair-share allocations for agents with arbitrary entitlements

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.769573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cbb6c8f-4bab-433f-beeb-7332f9be584e · outbound

This paper cites Approximation algorithms for maximin fair division.

Constant Weighted Maximin Share Approximations for Chores Approximation algorithms for maximin fair division

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.775191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0f84296-84f5-42fd-b7ae-ac5d5ca87b3d · outbound

This paper cites Characterizing conflicts in fair division of indivisible goods using a scale of criteria.

Constant Weighted Maximin Share Approximations for Chores Characterizing conflicts in fair division of indivisible goods using a scale of criteria

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.780283Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 737cf857-a769-485e-8866-98392f32d9a5 · outbound

This paper cites The combinatorial assignment problem: approximate competitive equilibrium from equal incomes.

Constant Weighted Maximin Share Approximations for Chores The combinatorial assignment problem: approximate competitive equilibrium from equal incomes

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.785808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df0dc1d7-f8e2-4eda-80bb-e590b4cc966c · outbound

This paper cites Fair public decision making.

Constant Weighted Maximin Share Approximations for Chores Fair public decision making

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.792161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53b8749f-d034-4ece-924f-4b76650bcd63 · outbound

This paper cites Weighted envy-freeness in indivisible item allocation.

Constant Weighted Maximin Share Approximations for Chores Weighted envy-freeness in indivisible item allocation

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.798098Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e58c9e21-d1ca-407e-bd9d-f6eef4787ae4 · outbound

This paper cites Procaccia, Nisarg Shah, and Junxing Wang.

Constant Weighted Maximin Share Approximations for Chores Procaccia, Nisarg Shah, and Junxing Wang

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.804582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13ed2a0b-179c-44c2-bde5-38a0f08d8ee5 · outbound

This paper cites Pennock, Masoud Seddighin, Saeed Seddighin, and Hadi Yami.

Constant Weighted Maximin Share Approximations for Chores Pennock, Masoud Seddighin, Saeed Seddighin, and Hadi Yami

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.813831Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b540369-f443-42bd-91a9-b571a5c0f082 · outbound

This paper cites On picking sequences for chores.

Constant Weighted Maximin Share Approximations for Chores On picking sequences for chores

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.819234Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9a7ff39-af47-45e5-9f4a-148219452825 · outbound

This paper cites Resource allocation and the public sector.

Constant Weighted Maximin Share Approximations for Chores Resource allocation and the public sector

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.825284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bdcaf54-764b-473a-95dd-872f93257699 · outbound

This paper cites Fair allocation of indivisible goods: Improvements and generalizations.

Constant Weighted Maximin Share Approximations for Chores Fair allocation of indivisible goods: Improvements and generalizations

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.830745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff7cad64-436f-42e9-969c-60126f2cbfbc · outbound

This paper cites A survey on fair allocation of chores.

Constant Weighted Maximin Share Approximations for Chores A survey on fair allocation of chores

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.836210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cd47b5b-2e6e-451c-938d-92487507a014 · outbound

This paper cites Near fairness in matroids.

Constant Weighted Maximin Share Approximations for Chores Near fairness in matroids

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.841955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1aec4be-3723-4f12-b9a7-962a3bb21255 · outbound

This paper cites An algorithmic framework for approximating maximin share allocation of chores.

Constant Weighted Maximin Share Approximations for Chores An algorithmic framework for approximating maximin share allocation of chores

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.848354Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80ef2256-60d6-49e8-883b-fde614419bad · outbound

This paper cites A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach.

Constant Weighted Maximin Share Approximations for Chores A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.853975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01b5c089-25e0-4c5a-b1e5-3086ccee54f7 · outbound

This paper cites Fair and efficient resource allocation with partial information.

Constant Weighted Maximin Share Approximations for Chores Fair and efficient resource allocation with partial information

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.858961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15fb2cae-efd2-4440-91b7-771492a7082f · outbound

This paper cites A reduction from chores allocation to job scheduling.

Constant Weighted Maximin Share Approximations for Chores A reduction from chores allocation to job scheduling

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.865365Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df4fbe03-1bf6-4d39-a67c-53971593c767 · outbound

This paper cites Procaccia, and Junxing Wang.

Constant Weighted Maximin Share Approximations for Chores Procaccia, and Junxing Wang

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.871453Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4defc5a4-e8e4-4094-9a7d-f5b86a6fd4c7 · outbound

This paper cites Almost (weighted) proportional allocations for indivisible chores.

Constant Weighted Maximin Share Approximations for Chores Almost (weighted) proportional allocations for indivisible chores

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.877427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 692f76b8-273c-4166-a8ab-b2c2d530a1b2 · outbound

This paper cites Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi.

Constant Weighted Maximin Share Approximations for Chores Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.884375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 151643d1-03ed-4e6a-b922-fdcda74301ac · outbound

This paper cites Fair allocation of indivisible chores: Beyond additive costs.

Constant Weighted Maximin Share Approximations for Chores Fair allocation of indivisible chores: Beyond additive costs

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.890604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c622ee2-49d2-4197-a714-d293dfad877d · outbound

This paper cites Almost envy-free allocations of indivisible goods or chores with entitlements.

Constant Weighted Maximin Share Approximations for Chores Almost envy-free allocations of indivisible goods or chores with entitlements

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.898772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c72174e-cbbb-4769-b0dd-891938f88083 · outbound

This paper cites Lower Bound for Online MMS Assignment of Indivisible Chores.

Constant Weighted Maximin Share Approximations for Chores Lower Bound for Online MMS Assignment of Indivisible Chores

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.905974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ac84478-9bb7-4d29-9a9e-6f326e38d41a · outbound

This paper cites Shmoys and \' E va Tardos.

Constant Weighted Maximin Share Approximations for Chores Shmoys and \' E va Tardos

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.913470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a1afb0c-7228-4b4a-95e8-2760c943fd35 · outbound

This paper cites The problem of fair division.

Constant Weighted Maximin Share Approximations for Chores The problem of fair division

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.920374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d74efc8-fd5d-4d96-8bc2-16ccb0cc3f9d · outbound

This paper cites Online MMS allocation for chores.

Constant Weighted Maximin Share Approximations for Chores Online MMS allocation for chores

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.926073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca500a45-4788-4244-9ca6-d18bda49d0f6 · outbound

This paper cites Weighted fair division of indivisible items: A review.

Constant Weighted Maximin Share Approximations for Chores Weighted fair division of indivisible items: A review

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.930873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9c85c0d-f604-43ba-8bdd-10f8ae0d9f80 · outbound

This paper cites Equity, envy, and efficiency.

Constant Weighted Maximin Share Approximations for Chores Equity, envy, and efficiency

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.936097Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b89adc2f-11bb-46c2-b5d9-11fc6ada5cfd · outbound

This paper cites Improved approximation of weighted MMS fairness for indivisible chores.

Constant Weighted Maximin Share Approximations for Chores Improved approximation of weighted MMS fairness for indivisible chores

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.941115Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd779ad7-1356-4c89-8fcd-2b2cae00b210 · outbound

This paper cites Weighted EF1 allocations for indivisible chores.

Constant Weighted Maximin Share Approximations for Chores Weighted EF1 allocations for indivisible chores

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.947943Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7ee6881-75cf-403d-b20b-90f7ca075344 · outbound

This paper cites Multi-agent online scheduling: MMS allocations for indivisible items.

Constant Weighted Maximin Share Approximations for Chores Multi-agent online scheduling: MMS allocations for indivisible items

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T11:17:37.952780Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.