Paper Citation Record · LEDGER

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2501.04859.

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

pith.paper-citation-record.v1
2501.04859 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T21:43:25.896449Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+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-06T20:19:09.964173Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T06:16:28.064256Z

Reference resolution

18 of 18 outbound references displayed

verified exact2
verified fuzzy16
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3f7e493f-db70-4eaa-a738-e36d3bf22a83 · outbound

This paper cites Knapsack with small items in near-quadr atic time.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Knapsack with small items in near-quadr atic time

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:27.297758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 8b94cbc7-1ad4-41ef-8b2b-a25995d23250 · outbound

This paper cites Structural Results for High-Multiplicity Scheduling on Uniform Machines.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Structural Results for High-Multiplicity Scheduling on Uniform Machines

Reference 2

Resolution: verified exact; local_arxiv, observed 2026-08-10T21:43:26.235263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 213a85c6-bebf-4ef7-80e7-42b62fbeaf0c · outbound

This paper cites On the optima lity of approx- imation schemes for the classical scheduling problem.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines On the optima lity of approx- imation schemes for the classical scheduling problem

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:27.267013Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 5cc9e839-fcaf-4ad2-9628-53631e839a66 · outbound

This paper cites Fas ter algorithms for bounded knapsack and bounded subset sum via ﬁne-grained pro ximity results.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Fas ter algorithms for bounded knapsack and bounded subset sum via ﬁne-grained pro ximity results

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:27.197856Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation cefa586d-e344-4deb-90e2-f2a14da988de · outbound

This paper cites Block-structured integer and linear program- ming in strongly polynomial and near linear time.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Block-structured integer and linear program- ming in strongly polynomial and near linear time

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:27.083053Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 2167da3a-755b-414a-9d76-68efbd5ee5a3 · outbound

This paper cites Proximity results and faster al- gorithms for integer programming using the steinitz lemma.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Proximity results and faster al- gorithms for integer programming using the steinitz lemma

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.979209Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 04d3e626-935a-49ad-81b8-06ee1bb61f4d · outbound

This paper cites Polynomiality for b in packing with a constant number of item types.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Polynomiality for b in packing with a constant number of item types

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.962960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 09af0118-ffb9-4804-9d50-9aa3040d668f · outbound

This paper cites An eptas for scheduling jobs on uniform pro cessors: using an milp relaxation with a constant number of integral variable s.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines An eptas for scheduling jobs on uniform pro cessors: using an milp relaxation with a constant number of integral variable s

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.945899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation b9aedec1-755f-4c87-9aa3-8c25919b0661 · outbound

This paper cites Improving the parameter dependency for high-multiplicity scheduling on uniform machines.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Improving the parameter dependency for high-multiplicity scheduling on uniform machines

Reference 9

Resolution: verified exact; raw_fallback, observed 2026-08-10T21:43:26.197220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 48947684-a491-4d97-ba83-e551c9e33461 · outbound

This paper cites Clo sing the gap for makespan scheduling via sparsiﬁcation techniques.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Clo sing the gap for makespan scheduling via sparsiﬁcation techniques

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.854699Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e6ee1d8b-0974-40d0-9925-115e0dbf9c46 · outbound

This paper cites On integer programmin g, discrepancy, and convolution.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines On integer programmin g, discrepancy, and convolution

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.694245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 162885dc-9744-423c-9063-7132dc513531 · outbound

This paper cites 0-1 knapsack in nearly quadratic time.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines 0-1 knapsack in nearly quadratic time

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.586050Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 2fa829c7-12df-468c-aeee-a0998b64a579 · outbound

This paper cites Scheduling meets n-fol d integer program- ming.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Scheduling meets n-fol d integer program- ming

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.568413Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation c967fd03-0dd1-4c29-bc65-92f708a74b96 · outbound

This paper cites Complexity of sched uling few types of jobs on related and unrelated machines.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Complexity of sched uling few types of jobs on related and unrelated machines

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.540127Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 21594b91-e5b4-410b-bc10-a61c5dd167e6 · outbound

This paper cites Scheduling and ﬁxed- parameter tractabil- ity.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Scheduling and ﬁxed- parameter tractabil- ity

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.497609Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 6bde9937-c232-4581-b5b7-b7f4856fa238 · outbound

This paper cites Knaps ack and subset sum with small items.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Knaps ack and subset sum with small items

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.420771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation 595b50a8-8f75-4105-a771-1615dca2b025 · outbound

This paper cites Fine-grained equi valence for problems related to integer linear programming.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Fine-grained equi valence for problems related to integer linear programming

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.389333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Observation e42b59ef-d57a-42c4-a537-f31046dceaee · outbound

This paper cites Approximate solution of some problems of scheduling theory.

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines Approximate solution of some problems of scheduling theory

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T21:43:26.287897Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

Pith citing papers

Observation 8cbd87bb-cee5-4f1e-a725-c4710c4c4674 · inbound

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma cites this paper.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

Reference 29

Resolution: verified exact; local_arxiv, observed 2026-08-06T20:19:10.749803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.