Paper Citation Record · LEDGER

Lower Bound for Online MMS Assignment of Indivisible Chores

As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2507.12984.

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

pith.paper-citation-record.v1
2507.12984 v1

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:47:23.539002Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

20 of 20 outbound references displayed

verified exact1
verified fuzzy18
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ec906d5e-5517-4953-af32-0f4402604917 · outbound

This paper cites Simplification and im- provement of mms approximation.

Lower Bound for Online MMS Assignment of Indivisible Chores Simplification and im- provement of mms approximation

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:27.052379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 1b4f240c-8766-45a3-b7a6-20ddde4da6de · outbound

This paper cites Random- ized and deterministic maximin-share approximations for fractionally subadditive valuations.

Lower Bound for Online MMS Assignment of Indivisible Chores Random- ized and deterministic maximin-share approximations for fractionally subadditive valuations

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:26.945747Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 294a07ea-e14a-4d0c-92a9-bef4fc8d7343 · outbound

This paper cites Approximation al- gorithms for computing maximin share allocations.ACM Transactions on Algorithms (TALG), 13(4):52, 2017.

Lower Bound for Online MMS Assignment of Indivisible Chores Approximation al- gorithms for computing maximin share allocations.ACM Transactions on Algorithms (TALG), 13(4):52, 2017

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:26.736911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2ad2dd85-aabc-4dde-8215-6826cb88058c · outbound

This paper cites Cambridge University Press, 1996.

Lower Bound for Online MMS Assignment of Indivisible Chores Cambridge University Press, 1996

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:26.540813Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 6f8d9e05-5579-4bf4-aff0-dd39609661de · outbound

This paper cites The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes.Journal of Political Economy, 119(6):1061–1103, 2011.

Lower Bound for Online MMS Assignment of Indivisible Chores The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes.Journal of Political Economy, 119(6):1061–1103, 2011

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T16:47:22.054607Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b29af706-3703-4768-9306-e4c78172304f · outbound

This paper cites The unreasonable fairness of maximum nash welfare.

Lower Bound for Online MMS Assignment of Indivisible Chores The unreasonable fairness of maximum nash welfare

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:26.372368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 5585197d-d64a-4a57-9fc7-0a37f70df00c · outbound

This paper cites How to cut a cake fairly.

Lower Bound for Online MMS Assignment of Indivisible Chores How to cut a cake fairly

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:26.177309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 5dca635b-37d8-4067-befe-e25cbb239639 · outbound

This paper cites A note on cake cutting.Discrete Applied Mathematics, 7(3):285– 296, 1984.

Lower Bound for Online MMS Assignment of Indivisible Chores A note on cake cutting.Discrete Applied Mathematics, 7(3):285– 296, 1984

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:25.931259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 39705b13-a1ac-4a90-8d66-1843bcb61dad · outbound

This paper cites Fair allocation of indivisible goods to asymmetric agents.

Lower Bound for Online MMS Assignment of Indivisible Chores Fair allocation of indivisible goods to asymmetric agents

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:25.725951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation e8211515-2cab-4b2c-bd76-7f83a1e48210 · outbound

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

Lower Bound for Online MMS Assignment of Indivisible Chores Fair allocation of indivisible goods: Improvements and generalizations

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:25.568402Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation fc192369-f960-4f14-a32b-b7996793b478 · outbound

This paper cites A Reduction from Chores Allocation to Job Scheduling.

Lower Bound for Online MMS Assignment of Indivisible Chores A Reduction from Chores Allocation to Job Scheduling

Reference 11

Resolution: verified exact; local_arxiv, observed 2026-08-06T16:47:23.735417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation d65b9369-a8aa-4dc3-a281-666880a1e99a · outbound

This paper cites When can the maximin share guar- antee be guaranteed? InAAAI, volume 16, pages 523–529, 2016.

Lower Bound for Online MMS Assignment of Indivisible Chores When can the maximin share guar- antee be guaranteed? InAAAI, volume 16, pages 523–529, 2016

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:25.418820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f6f5f702-96b3-44a5-80f8-a45dd74ca00c · outbound

This paper cites Fair enough: Guaranteeing approxi- mate maximin shares.Journal of the ACM (JACM), 65(2):8, 2018.

Lower Bound for Online MMS Assignment of Indivisible Chores Fair enough: Guaranteeing approxi- mate maximin shares.Journal of the ACM (JACM), 65(2):8, 2018

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:25.181584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 4ad74058-0432-43c4-950d-7ede33e8c985 · outbound

This paper cites On approximately fair allocations of indivisible goods.

Lower Bound for Online MMS Assignment of Indivisible Chores On approximately fair allocations of indivisible goods

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.995761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 12cdeb57-13bc-4243-83c9-20acbe0760cf · outbound

This paper cites Cake-cutting algorithms: Be fair if you can.

Lower Bound for Online MMS Assignment of Indivisible Chores Cake-cutting algorithms: Be fair if you can

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.829655Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 824ba572-5cb8-4a99-92d7-e243f3799af0 · outbound

This paper cites Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.Artificial Intelligence, 327:104049, 2024.

Lower Bound for Online MMS Assignment of Indivisible Chores Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.Artificial Intelligence, 327:104049, 2024

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.684213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation baafd660-97a9-4e43-aaac-c2343644ade0 · outbound

This paper cites Beating the logarithmic barrier for the subadditive maximin share problem.

Lower Bound for Online MMS Assignment of Indivisible Chores Beating the logarithmic barrier for the subadditive maximin share problem

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.528720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 7fe6b571-b046-40da-be51-df62b86d77af · outbound

This paper cites The problem of fair division.Econometrica, 16(1), 1948.

Lower Bound for Online MMS Assignment of Indivisible Chores The problem of fair division.Econometrica, 16(1), 1948

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.367109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation a0f42ffa-8ce7-46c3-9d4e-de3c85e3259b · outbound

This paper cites How to cut a cake fairly.The American Mathematical Monthly, 87(8):640– 644, 1980.

Lower Bound for Online MMS Assignment of Indivisible Chores How to cut a cake fairly.The American Mathematical Monthly, 87(8):640– 644, 1980

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:24.152693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 1118ec4a-50d1-4db9-944b-125f7e21b39f · outbound

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

Lower Bound for Online MMS Assignment of Indivisible Chores Multi-agent online scheduling: Mms allocations for indivisible items

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:23.934355Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

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

Constant Weighted Maximin Share Approximations for Chores cites this paper.

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.