Paper Citation Record · LEDGER

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs

As of 8 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2506.04524.

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

pith.paper-citation-record.v1
2506.04524 v1

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T10:52:50.416822Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+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

29 of 29 outbound references displayed

verified exact2
verified fuzzy27
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3a713d28-08a3-44c6-9d86-2662f51fd33c · outbound

This paper cites Coresets meet edcs: algorithms for matching and vertex cover on massive graphs.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Coresets meet edcs: algorithms for matching and vertex cover on massive graphs

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.707025Z

Source-reported events for the cited work

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

Observation b96465d0-bd55-4304-948c-b6b82a7b3076 · outbound

This paper cites Distributed load balancing: A new framework and improved guarantees.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Distributed load balancing: A new framework and improved guarantees

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.698171Z

Source-reported events for the cited work

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

Observation e0c97053-57a3-4581-a61f-3fdcf5a70db0 · outbound

This paper cites Online ad allocation in bounded-degree graphs.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Online ad allocation in bounded-degree graphs

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.689428Z

Source-reported events for the cited work

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

Observation e15f2855-5180-4fce-b275-ad18d2d170d0 · outbound

This paper cites Mirrokni.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Mirrokni

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.681099Z

Source-reported events for the cited work

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

Observation 4843e840-4743-4b3a-9abf-536ccc9d5ee4 · outbound

This paper cites Karp, and Jara Uitto.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Karp, and Jara Uitto

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.672384Z

Source-reported events for the cited work

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

Observation b5de92fa-2973-4543-94e7-74e2e2522176 · outbound

This paper cites Exponentially faster massively parallel maximal matching.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Exponentially faster massively parallel maximal matching

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.663379Z

Source-reported events for the cited work

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

Observation 1ba20167-ff41-4e43-b957-7f53106e6040 · outbound

This paper cites Balseiro, Haihao Lu, and Vahab Mirrokni.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Balseiro, Haihao Lu, and Vahab Mirrokni

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.655073Z

Source-reported events for the cited work

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

Observation 3eeb4e95-f9f0-4cb3-8b25-4a4a4e755364 · outbound

This paper cites Component stability in low-space massively parallel computation.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Component stability in low-space massively parallel computation

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.646555Z

Source-reported events for the cited work

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

Observation 644fa4b4-8bf9-492a-90a0-76e3839c32b7 · outbound

This paper cites Round compression for parallel matching algorithms.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Round compression for parallel matching algorithms

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.637839Z

Source-reported events for the cited work

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

Observation a5f7013c-4b1a-42d9-b9e4-524da8a0b341 · outbound

This paper cites Parallel set cover and hypergraph matching via uniform random sampling.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Parallel set cover and hypergraph matching via uniform random sampling

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.629479Z

Source-reported events for the cited work

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

Observation e6e596e1-c2d9-4b01-9acd-f1e3c24cbbc7 · outbound

This paper cites Mapreduce: simplified data processing on large clusters.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Mapreduce: simplified data processing on large clusters

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.620707Z

Source-reported events for the cited work

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

Observation 305e2234-7cf3-407a-aa88-e6fdaff38cd6 · outbound

This paper cites Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.611842Z

Source-reported events for the cited work

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

Observation 69e4e3d8-c825-4185-a648-ea67dfb2346c · outbound

This paper cites Dickerson, Karthik A.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Dickerson, Karthik A

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.602738Z

Source-reported events for the cited work

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

Observation 333a4d0c-5da0-4d3f-a63e-f8723e883e94 · outbound

This paper cites Online ad assignment with free disposal.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Online ad assignment with free disposal

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.593674Z

Source-reported events for the cited work

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

Observation 2a9a3230-909a-4edd-9584-52ebe1d3cede · outbound

This paper cites Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.584616Z

Source-reported events for the cited work

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

Observation 3c2dd6b4-a028-45eb-a7aa-111847d0c1a0 · outbound

This paper cites Improved massively parallel computation algorithms for mis, matching, and vertex cover.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Improved massively parallel computation algorithms for mis, matching, and vertex cover

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.575769Z

Source-reported events for the cited work

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

Observation da087578-fa0b-44ff-8f4e-4ed74a07f251 · outbound

This paper cites Massively parallel algorithms for b-matching.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Massively parallel algorithms for b-matching

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.567141Z

Source-reported events for the cited work

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

Observation 8f6664d6-f26f-44f1-b48e-73c283e92970 · outbound

This paper cites Conditional hardness results for massively parallel computation from distributed lower bounds.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Conditional hardness results for massively parallel computation from distributed lower bounds

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.557680Z

Source-reported events for the cited work

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

Observation 35459f69-c667-453a-aa7d-3cefaafa8d18 · outbound

This paper cites Sorting, searching, and simulation in the mapreduce framework.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Sorting, searching, and simulation in the mapreduce framework

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.548336Z

Source-reported events for the cited work

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

Observation c6f3d01e-8512-49d3-82c6-f7c5d4aff6ce · outbound

This paper cites Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.539199Z

Source-reported events for the cited work

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

Observation 1dbf4d45-75fa-4e99-9d45-858dc5145526 · outbound

This paper cites Mirrokni, and Morteza Zadimoghaddam.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Mirrokni, and Morteza Zadimoghaddam

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.530087Z

Source-reported events for the cited work

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

Observation 9e617132-6eab-4f5a-a785-bbcc389a5da0 · outbound

This paper cites A model of computation for mapreduce.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs A model of computation for mapreduce

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.520477Z

Source-reported events for the cited work

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

Observation 63c0f1ae-1905-410e-9f2e-c80027c6086c · outbound

This paper cites Scalable Auction Algorithms for Bipartite Maximum Matching Problems.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Scalable Auction Algorithms for Bipartite Maximum Matching Problems

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:52:50.465034Z

Source-reported events for the cited work

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

Observation 30f13389-d7ba-4175-ab25-387b7f689966 · outbound

This paper cites Filtering: a method for solving graph problems in mapreduce.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Filtering: a method for solving graph problems in mapreduce

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.511384Z

Source-reported events for the cited work

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

Observation 12f73375-61e4-422b-b52b-438ebd3a4d4b · outbound

This paper cites Brief announcement: Exponential speed-up of local algorithms using non-local communication.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Brief announcement: Exponential speed-up of local algorithms using non-local communication

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.502231Z

Source-reported events for the cited work

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

Observation c761bf3b-cbe0-49e5-b4b7-ee59f3890e4e · outbound

This paper cites Adwords and generalized online matching.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Adwords and generalized online matching

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.493122Z

Source-reported events for the cited work

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

Observation 0bedf720-cf2e-4c03-8ba9-4e9fb8dcab1e · outbound

This paper cites Optimal online assignment with forecasts.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Optimal online assignment with forecasts

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.483781Z

Source-reported events for the cited work

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

Observation 8a5098b1-a7aa-47ee-abf8-c7e675ff5b5e · outbound

This paper cites Socially enabled wireless networks: Resource allocation via bipartite graph matching.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Socially enabled wireless networks: Resource allocation via bipartite graph matching

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:52:50.474445Z

Source-reported events for the cited work

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

Observation 4109daae-dfab-4670-82f3-cd1228246363 · outbound

This paper cites Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training.

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training

Reference 29

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:52:50.450204Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.