Paper Citation Record · LEDGER

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma

As of 15 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2507.03766.

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

pith.paper-citation-record.v1
2507.03766 v2

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T20:19:10.183818Z

measured 32 of 32 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 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

32 of 32 outbound references displayed

verified exact19
verified fuzzy0
unresolved12
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 879db35d-2d1c-4d75-bc53-dbf49a5acf94 · outbound

This paper cites Pitsoulis.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Pitsoulis

Reference 1

Resolution: verified exact; doi, observed 2026-08-06T20:19:13.532778Z

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 12828d2d-872e-4245-8e11-13c0bf721ea6 · outbound

This paper cites A strongly polynomial algorithm for bimodular integer linear programming.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma A strongly polynomial algorithm for bimodular integer linear programming

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:06.895403Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2564f7cf-0a28-43bc-90b2-aba49db16d48 · outbound

This paper cites On the Power of Linear Dependencies , pages 31--45.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma On the Power of Linear Dependencies , pages 31--45

Reference 3

Resolution: verified exact; doi, observed 2026-08-06T20:19:13.347841Z

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 61b3cf65-9549-4c3a-b86e-b5a87f6585bd · outbound

This paper cites Woeginger.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Woeginger

Reference 4

Resolution: verified exact; doi, observed 2026-08-06T20:19:13.169732Z

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 f115cf7b-8b46-4885-a381-5d023f67a446 · outbound

This paper cites On complexity of lobbying in multiple referenda.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma On complexity of lobbying in multiple referenda

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:07.100900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8403c1cb-1e48-46d2-b3b5-013248d0848a · outbound

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

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Block-structured integer and linear programming in strongly polynomial and near linear time

Reference 6

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.981292Z

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 e7d98ee2-74db-4d87-bff5-fadf13a2fb24 · outbound

This paper cites Parameterized algorithms for block-structured integer programs with large entries.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Parameterized algorithms for block-structured integer programs with large entries

Reference 7

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.824508Z

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 a9583e9c-3567-4604-a754-7a0f60aa7e23 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:07.398044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e5cd66f-a47e-4ca1-a3c0-909203ca775f · outbound

This paper cites Faster algorithms for integer programs with block structure.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Faster algorithms for integer programs with block structure

Reference 9

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.614364Z

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 38481124-33c9-4f3a-9305-9807364feaaa · outbound

This paper cites An Algorithmic Theory of Integer Programming.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma An Algorithmic Theory of Integer Programming

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:07.623391Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48bebfe3-b40f-4ba2-b104-1f3fbe0a3615 · outbound

This paper cites Sensitivity, proximity and FPT algorithms for exact matroid problems.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Sensitivity, proximity and FPT algorithms for exact matroid problems

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:07.719167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70080244-3c6c-418c-927e-e4d84b3b6c84 · outbound

This paper cites Proximity results and faster algorithms for integer programming using the S teinitz L emma.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Proximity results and faster algorithms for integer programming using the S teinitz L emma

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:07.857585Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13afca25-453f-4feb-8864-aa4f0a7867ed · outbound

This paper cites Golovach, and Jan Kratochv \' l.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Golovach, and Jan Kratochv \' l

Reference 13

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.421716Z

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 63478a3e-81ba-463c-88b8-ba993361de42 · outbound

This paper cites an unresolved cited work.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Unresolved cited work

Reference 14

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.261443Z

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 362e5a2f-ac06-4a21-a8f6-d6ff660291f5 · outbound

This paper cites an unresolved cited work.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Unresolved cited work

Reference 15

Resolution: verified exact; doi, observed 2026-08-06T20:19:12.097736Z

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 e9ac14c3-6a7a-459b-9360-7df326c9338b · outbound

This paper cites n-fold integer programming in cubic time.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma n-fold integer programming in cubic time

Reference 16

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.946583Z

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 7968c91f-8b89-47fe-ab9b-a7893e50285a · outbound

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

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Improving the parameter dependency for high-multiplicity scheduling on uniform machines

Reference 17

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.785783Z

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 c979783c-62bd-442b-8837-a95ee0a8c5c7 · outbound

This paper cites N ear-linear time algorithm for n-fold ILP s via color coding.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma N ear-linear time algorithm for n-fold ILP s via color coding

Reference 18

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.540887Z

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 90106726-93fb-4c80-90c1-cdd55176b456 · outbound

This paper cites On integer programming and convolution.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma On integer programming and convolution

Reference 19

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.398500Z

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 d301dd76-7e02-4cf5-9710-87fdb7e07d92 · outbound

This paper cites On integer programming, discrepancy, and convolution.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma On integer programming, discrepancy, and convolution

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:08.836623Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c0f6efe-fc5e-475c-b03f-585e7fe685cd · outbound

This paper cites Minkowski's convex body theorem and integer programming.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Minkowski's convex body theorem and integer programming

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:08.906757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f887ef8-1ffb-458e-851b-fe457b02f3aa · outbound

This paper cites Scheduling meets n-fold integer programming.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Scheduling meets n-fold integer programming

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:08.952887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a31ed8f8-7163-4c8e-a236-936ced3d57da · outbound

This paper cites High-multiplicity n-fold IP via configuration LP.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma High-multiplicity n-fold IP via configuration LP

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:09.001303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ab7ceb4-4f7d-41ba-aa1c-28e2fe8554f3 · outbound

This paper cites Combinatorial n-fold integer programming and applications.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Combinatorial n-fold integer programming and applications

Reference 24

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.207291Z

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 56c172d1-fa74-4e4a-b382-3b398958ca9a · outbound

This paper cites Voting and bribing in single-exponential time.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Voting and bribing in single-exponential time

Reference 25

Resolution: verified exact; doi, observed 2026-08-06T20:19:11.081221Z

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 4654b085-775e-490a-87f0-c0af49515e4c · outbound

This paper cites A parameterized strongly polynomial algorithm for block structured integer programs.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma A parameterized strongly polynomial algorithm for block structured integer programs

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:09.457553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 947cf5d2-312e-488e-bd39-25d49b0e14bb · outbound

This paper cites Complexity results and exact algorithms for fair division of indivisible items: a survey.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Complexity results and exact algorithms for fair division of indivisible items: a survey

Reference 27

Resolution: verified exact; doi, observed 2026-08-06T20:19:10.925616Z

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 0070a65d-c95e-4172-93d7-a0a828f57071 · outbound

This paper cites Papadimitriou.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Papadimitriou

Reference 28

Resolution: metadata mismatch; raw_fallback, observed 2026-08-06T20:19:13.812194Z

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 8cbd87bb-cee5-4f1e-a725-c4710c4c4674 · outbound

This paper cites ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines.

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.

Observation d2f6aafe-99e0-43ee-8496-d45c89d972bb · outbound

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

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Fine-grained equivalence for problems related to integer linear programming

Reference 30

Resolution: verified exact; doi, observed 2026-08-06T20:19:10.561192Z

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 989bcdb2-2291-4960-8229-3cd5a26a0551 · outbound

This paper cites on some geometric methods in scheduling theory: A survey.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma on some geometric methods in scheduling theory: A survey

Reference 31

Resolution: verified exact; doi, observed 2026-08-06T20:19:10.390382Z

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 2a59ab51-b650-4c81-b1f6-4951735a0bd3 · outbound

This paper cites Bedingt konvergente reihen und konvexe systeme.

A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma Bedingt konvergente reihen und konvexe systeme

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-06T20:19:10.183818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.