Paper Citation Record · LEDGER

An Algorithmic Theory of Integer Programming

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

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

pith.paper-citation-record.v1
1904.01361 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 7 of 7 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 7 of 7 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T16:53:52.300235Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-13T21:08:17.745153Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation d443c60e-e5fe-4e75-9c6a-1c24ef807651 · inbound

Parameterized Complexity of the Star Decomposition Problem cites this paper.

Parameterized Complexity of the Star Decomposition Problem An Algorithmic Theory of Integer Programming

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-12T16:53:52.300235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80e6c981-b25b-4d40-828f-ec6f887df1a1 · inbound

Parameterized Complexity of Fair Many-to-One Matchings cites this paper.

Parameterized Complexity of Fair Many-to-One Matchings An Algorithmic Theory of Integer Programming

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-12T11:31:19.141526Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcac3ed5-c353-4e64-9b7c-09c7be57c7f1 · inbound

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs cites this paper.

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs An Algorithmic Theory of Integer Programming

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-07T13:25:59.195132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38481124-33c9-4f3a-9305-9807364feaaa · 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 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 17e3c3c2-ec16-4249-ac50-35acbb47b7d3 · inbound

Complexity of Eliminating (Majority) Illusion in Directed Networks cites this paper.

Complexity of Eliminating (Majority) Illusion in Directed Networks An Algorithmic Theory of Integer Programming

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-13T21:08:17.748431Z

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 5d5c5777-6472-4357-b30e-d4092b2d97b0 · inbound

Complexity of Eliminating (Majority) Illusion in Directed Networks cites this paper.

Complexity of Eliminating (Majority) Illusion in Directed Networks An Algorithmic Theory of Integer Programming

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T17:02:37.109812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c1c857f-6461-4efb-83a7-de17b5a8d74f · inbound

Parameterized Capacitated Vertex Cover Revisited cites this paper.

Parameterized Capacitated Vertex Cover Revisited An Algorithmic Theory of Integer Programming

Reference 35

Resolution: verified exact; arxiv_id, observed 2026-05-11T12:41:05.098785Z

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.