Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T10:42:14.668855Z
Paper Citation Record · LEDGER
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
As of 18 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 1 inbound Pith citation observation for arXiv:2506.05613.
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-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T22:38:12.621346Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-06T22:38:12.757195Z
Reference resolution
6 of 6 outbound references displayed
- verified exact1
- verified fuzzy5
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 917ac0f0-bf98-4994-9149-768fde0d9a0e · outbound
This paper cites Breaking the 3/4 barrier for approximate maximin share.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem Breaking the 3/4 barrier for approximate maximin share
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:42:15.322811Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 2a37ec28-c7f2-490a-bef3-110cf91b1e7a · outbound
This paper cites Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
Reference 8
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T10:42:14.824268Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 84a1dad4-7f56-4378-8bd2-9aa316c6442d · outbound
This paper cites The unreasonable fairness of maximum Nash welfare.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem The unreasonable fairness of maximum Nash welfare
Reference 1103
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:42:15.132787Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 0419e846-0e47-4cb5-95d0-61a6492fa110 · outbound
This paper cites The combinatorial assignment problem: Approximate competitive equilib- rium from equal incomes.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem The combinatorial assignment problem: Approximate competitive equilib- rium from equal incomes
Reference 1996
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:42:15.251997Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 3c1f9374-5b0e-4b89-8316-0a708069909f · outbound
This paper cites Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
Reference 1998
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:42:14.952394Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 3b366241-ea87-4459-89ea-80db0e58218b · outbound
This paper cites A constant-factor approximation for nash social welfare with subadditive valuations.
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem A constant-factor approximation for nash social welfare with subadditive valuations
Reference 2022
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:42:15.046549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Pith citing papers
Observation bb193ef9-1aea-466a-9427-35aa0f18c7fb · inbound
From multi-allocations to allocations, with subadditive valuations cites this paper.
From multi-allocations to allocations, with subadditive valuations Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
Reference 15
- Resolution
- verified exact
- local_arxiv, observed 2026-08-06T22:38:12.933279Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.