Paper Citation Record · LEDGER

Faster Exponential Algorithms for Multi-Machine Scheduling Problems

As of 19 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2608.12224.

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

pith.paper-citation-record.v1
2608.12224 v1

Coverage vector

measured 40 of 40 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:31:35.825460Z

measured 40 of 40 standing notices

One-hop event checks from named stored sources.

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

40 of 40 outbound references displayed

verified exact17
verified fuzzy1
unresolved21
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1252de4e-b642-43d7-94c1-eb45e49055a8 · outbound

This paper cites Scheduling lower bounds via AND subset sum.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Scheduling lower bounds via AND subset sum

Reference 1

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.142405Z

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 fb46af24-7f53-417a-9537-fe5e5c576e1b · outbound

This paper cites Fast deterministic chromatic number under the asymptotic rank conjecture.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Fast deterministic chromatic number under the asymptotic rank conjecture

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.675644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcedd87e-c67d-4f85-8f51-516da9e64b49 · outbound

This paper cites o rklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets M \.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems o rklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets M \

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.680622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b377a0e6-6af8-4e03-b4a3-438edb0626bd · outbound

This paper cites Set partitioning via inclusion-exclusion.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Set partitioning via inclusion-exclusion

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.685953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 388e94e2-3b8b-4c4b-9b0e-ad9ecb2dd738 · outbound

This paper cites The asymptotic rank conjecture and the set cover conjecture are not both true.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems The asymptotic rank conjecture and the set cover conjecture are not both true

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.691330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4b854c3-1989-4738-8048-8f1ad928b7b1 · outbound

This paper cites Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Kronecker Scaling of Tensors with Applications to Arithmetic Circuits and Algorithms

Reference 6

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.769855Z

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 4d77a65e-a7fe-416f-b411-bd4b4161a741 · outbound

This paper cites Faster convolutions: Yates and strassen revisited.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Faster convolutions: Yates and strassen revisited

Reference 7

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.114624Z

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 fddbb453-a51e-4e23-8526-7a374ddc64c4 · outbound

This paper cites Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.703139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6bbfc8e-92b4-4ccc-97bb-f077754d52ef · outbound

This paper cites Faster minimization of tardy processing time on a single machine.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Faster minimization of tardy processing time on a single machine

Reference 9

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.103822Z

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 581281b5-cc55-4d05-873e-68d3d17e1360 · outbound

This paper cites Bruno, Edward G.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Bruno, Edward G

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.711359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74064143-28f5-4164-85a2-288c26bd112b · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.714923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13b6168f-76b0-466b-8891-c5c23cb85b93 · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.718698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94aedbf7-c98b-4424-9465-d7b0b8808789 · outbound

This paper cites Cover and Joy A.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Cover and Joy A

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.722389Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb925632-4e51-4c8c-98d5-b37f5b206ead · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 14

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.078986Z

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 241b2dc5-8c47-4836-a7de-2eba32bfd1b7 · outbound

This paper cites Faster Algorithms for k-Orthogonal Vectors in Low Dimension.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Faster Algorithms for k-Orthogonal Vectors in Low Dimension

Reference 15

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.067053Z

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 a2367b8f-ea98-4912-9ef1-240e64db70db · outbound

This paper cites Minimizing tardy processing time on a single machine in near-linear time.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Minimizing tardy processing time on a single machine in near-linear time

Reference 16

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.054213Z

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 5c7e3ca7-e836-4f2f-8b17-1d43d77e9f9c · outbound

This paper cites Fast approximation algorithm for job sequencing with deadlines.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Fast approximation algorithm for job sequencing with deadlines

Reference 17

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.041636Z

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 2e59b92a-c8b2-4927-bdfc-f3be7b70eb7b · outbound

This paper cites Graham, Eugene L.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Graham, Eugene L

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.742500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e1717af-49e1-4cd2-a75e-371b1d2d1cf4 · outbound

This paper cites Guibas, Jorge Stolfi, and Kenneth L.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Guibas, Jorge Stolfi, and Kenneth L

Reference 19

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.020879Z

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 3b900fb3-e74b-4e03-979f-8392bed15ab9 · outbound

This paper cites Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard

Reference 20

Resolution: verified exact; doi, observed 2026-08-16T00:31:36.008752Z

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 af710169-4156-49a2-8bd8-214162943e77 · outbound

This paper cites Faster Minimization of Total Weighted Completion Time on Parallel Machines.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Faster Minimization of Total Weighted Completion Time on Parallel Machines

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.754759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eab214d6-797b-48e7-94c1-aac31d0184ce · outbound

This paper cites Minimizing the weighted number of tardy jobs via (max,+)-convolutions.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Minimizing the weighted number of tardy jobs via (max,+)-convolutions

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.759301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7309a04-27a9-4ed1-9105-1bfa06f7a0eb · outbound

This paper cites Bounding the running time of algorithms for scheduling and packing problems.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Bounding the running time of algorithms for scheduling and packing problems

Reference 23

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.984255Z

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 c9774428-f9c6-4d85-9baf-cc975e67d571 · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.767023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ceee7f23-ae2a-4339-b3ce-deca9f70cf1b · outbound

This paper cites On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs

Reference 25

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.962010Z

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 2071f7f1-4488-4352-8ffc-cebab3bd4a26 · outbound

This paper cites Scheduling meets n-fold integer programming.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Scheduling meets n-fold integer programming

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.773663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a8a3357-f582-494d-a4b9-aaa7087ed548 · outbound

This paper cites Lawler, Jan Karel Lenstra, Alexander H.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Lawler, Jan Karel Lenstra, Alexander H

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.776659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b7dafe5-f188-42aa-84bc-1023aa88dc20 · outbound

This paper cites Lawler and J.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Lawler and J

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.780174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2bf1b0a-2e4b-4136-870a-a25f66b7d6e3 · outbound

This paper cites Lenstra, A.H.G.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Lenstra, A.H.G

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.784034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bc64171-8a62-470c-be87-0e2a87a4563f · outbound

This paper cites Exponential algorithms for scheduling problems.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Exponential algorithms for scheduling problems

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T00:31:36.756530Z

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 5c1d7341-3f20-46bf-ba5b-d71812265529 · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 31

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.921179Z

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 feb3d258-864b-40c5-bc4b-1267defea449 · outbound

This paper cites Michael Moore.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Michael Moore

Reference 32

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.909438Z

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 19bd15b7-f72c-406c-8a1d-678132536d84 · outbound

This paper cites Finding large set covers faster via the representation method.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Finding large set covers faster via the representation method

Reference 33

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.898074Z

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 895ae3d0-d38c-41df-950d-fb07d463fa8f · outbound

This paper cites Fine-grained complexity of NP -complete problems.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Fine-grained complexity of NP -complete problems

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.802282Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cfbeb51c-add4-4d20-bdc7-b700866dcb32 · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.805841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5927e3f-e6b1-4e60-a0df-0f092d51771f · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 36

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T00:31:36.298969Z

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 d34dc886-8675-4774-ad51-744119e560a1 · outbound

This paper cites Preparata and David E.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Preparata and David E

Reference 37

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.878812Z

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 98bf9cf7-1f5d-49e9-bb08-cb01fd1f8d86 · outbound

This paper cites Rothkopf.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Rothkopf

Reference 38

Resolution: verified exact; doi, observed 2026-08-16T00:31:35.867135Z

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 aebfcb2f-f0ef-4e6a-9e42-6ef96938d9b5 · outbound

This paper cites Algorithms for scheduling independent tasks.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Algorithms for scheduling independent tasks

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.821618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9e78abf-8ffe-4104-9ac3-f23db1ff77da · outbound

This paper cites an unresolved cited work.

Faster Exponential Algorithms for Multi-Machine Scheduling Problems Unresolved cited work

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-16T00:31:35.825460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.