Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T05:51:27.351902Z
Paper Citation Record · LEDGER
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
As of 16 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:1909.00740.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
15 of 15 outbound references displayed
- verified exact2
- verified fuzzy11
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 8ca36ec0-4e8f-49cd-a131-8ee6a15595ff · outbound
This paper cites Efficient re alloca- tion under additive and ordinal preferences.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Efficient re alloca- tion under additive and ordinal preferences
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.639229Z
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 bb9d4894-f368-4cd9-84ed-23db96136c91 · outbound
This paper cites Fair allocatio n of combinations of indivisible goods and chores.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Fair allocatio n of combinations of indivisible goods and chores
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.623818Z
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 c6e7d38d-c058-485f-82f2-fd4658858ba6 · outbound
This paper cites Weighted maxmin fair share allocation of indivisible chores.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Weighted maxmin fair share allocation of indivisible chores
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.608978Z
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 b16f7df3-9ef8-4020-8081-17b1cf77f84a · outbound
This paper cites The Constrained Round Robin Algorithm for Fair and Efficient Allocation.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation The Constrained Round Robin Algorithm for Fair and Efficient Allocation
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T05:51:27.293464Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c9b1fca9-1545-4618-8552-b17863dae747 · outbound
This paper cites Competitive Equilibrium with Indivisible Goods and Generic Budgets.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Competitive Equilibrium with Indivisible Goods and Generic Budgets
Reference 5
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T05:51:27.438097Z
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 7746e887-d631-4e48-af7b-df684e28cad5 · outbound
This paper cites K., 2019.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation K., 2019
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.593869Z
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 bf9c7579-991a-481a-9e2f-8c9a73d27429 · outbound
This paper cites Algorithms for Competitive Division of Chores.
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.
Observation 481354fb-2544-4360-b578-d8e9af01680b · outbound
This paper cites D., Shah, N ., Wang, J., 2016.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation D., Shah, N ., Wang, J., 2016
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.578010Z
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 031b2a6b-15bf-4e5b-b0c7-b25c8e3f4f15 · outbound
This paper cites Fair public decision makin g.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Fair public decision makin g
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.561331Z
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 89af9067-8c37-4d27-862b-2cd05fc96ec0 · outbound
This paper cites On the co mplexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation On the co mplexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.543868Z
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 909e1153-827a-47e6-b01d-af85fa114724 · outbound
This paper cites M., Seddighin, M., Seddighin, S., Yami, H., 2019.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation M., Seddighin, M., Seddighin, S., Yami, H., 2019
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.526869Z
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 4752a73c-ee28-4ef1-93da-b714690d71c8 · outbound
This paper cites Recent Advances in Fair Resource Allocation (ACM EC 2019 Tutorial).
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Recent Advances in Fair Resource Allocation (ACM EC 2019 Tutorial)
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.509902Z
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 2d678181-9eff-44b7-b724-ce24586b931f · outbound
This paper cites Fair division in the age of internet.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Fair division in the age of internet
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.493328Z
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 c78c00fd-b6ce-4a58-b0e4-ffbb40b04074 · outbound
This paper cites Efficient Fair Division with Minimal Sharing.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation Efficient Fair Division with Minimal Sharing
Reference 14
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T05:51:27.396823Z
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 655d3bae-1d1f-44d5-a32b-948a200ffbe2 · outbound
This paper cites R., 1976.
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation R., 1976
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T05:51:27.476393Z
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.
Pith citing papers
No inbound Pith citation observations are available.