Paper Citation Record · LEDGER

Polyhedral extended formulations that approximate the Gomory closure for packing problems

As of 18 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2607.09222.

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

pith.paper-citation-record.v1
2607.09222 v1

Coverage vector

measured 48 of 48 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-13T04:36:35.448951Z

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

48 of 48 outbound references displayed

verified exact0
verified fuzzy0
unresolved47
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3f9ea0b1-db7d-438a-b697-beb95341f32f · outbound

This paper cites Extended formulations from communication protocols in output-efficient time.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Extended formulations from communication protocols in output-efficient time

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 42f4d0f2-4f89-47f9-99d9-7a47bc4bbe4d · outbound

This paper cites A comprehensive analysis of polyhedral lift-and-project methods.

Polyhedral extended formulations that approximate the Gomory closure for packing problems A comprehensive analysis of polyhedral lift-and-project methods

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98285ab9-b0f2-4dcf-a524-b06aba5f08cd · outbound

This paper cites Mixed 0-1 programming by lift-and- project in a branch-and-cut framework.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Mixed 0-1 programming by lift-and- project in a branch-and-cut framework

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 210c3fe5-c4e9-46fb-89f2-4ff9a7d822b3 · outbound

This paper cites No Small Linear Pro- gram Approximates Vertex Cover within a Factor2 − 𝜀.

Polyhedral extended formulations that approximate the Gomory closure for packing problems No Small Linear Pro- gram Approximates Vertex Cover within a Factor2 − 𝜀

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13bfaf1e-cbc9-454e-88f9-304311e4d37c · outbound

This paper cites Approximate fixed-rank closures of covering prob- lems.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Approximate fixed-rank closures of covering prob- lems

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebd5f90f-c437-4470-ac98-ffa6b5dbb320 · outbound

This paper cites On the Chvátal Rank of Polytopes in the 0/1 Cube.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On the Chvátal Rank of Polytopes in the 0/1 Cube

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74d46358-612c-4c44-92ec-073c501c764b · outbound

This paper cites Primal separation and approximation for the 0,1/2- closure.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Primal separation and approximation for the 0,1/2- closure

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b4116afe-372f-4c0e-bdc5-38c8286cfb31 · outbound

This paper cites On linear and semidefinite programming relaxations for hypergraph matching.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On linear and semidefinite programming relaxations for hypergraph matching

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ded3a49-26b1-452c-bacf-cace01418381 · outbound

This paper cites Edmonds polytopes and a hierarchy of combinatorial problems.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Edmonds polytopes and a hierarchy of combinatorial problems

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04028ad8-edb4-439a-bff5-55cec87193cf · outbound

This paper cites On Cutting-Plane Proofs in Combi- natorial Optimization.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On Cutting-Plane Proofs in Combi- natorial Optimization

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 831dff76-280a-4ac0-9fa9-eba8f89e2b91 · outbound

This paper cites Integer Programming.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Integer Programming

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b5d19cc-05da-4323-af1d-7e17a61b2686 · outbound

This paper cites Cunningham, William R.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Cunningham, William R

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d58487d-d0b7-482f-ae36-c56a9b66b9ce · outbound

This paper cites On the rational polytopes with Chvátal rank 1.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On the rational polytopes with Chvátal rank 1

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06e99ee2-dc64-43c0-8a04-020914fbe314 · outbound

This paper cites When the Gomory–Chvátal closure coincides with the integer hull.

Polyhedral extended formulations that approximate the Gomory closure for packing problems When the Gomory–Chvátal closure coincides with the integer hull

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 863ca5d4-1275-4e02-87ec-ca8421f499d0 · outbound

This paper cites Improved approximation for 3-dimensional matching via bounded pathwidth local search.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Improved approximation for 3-dimensional matching via bounded pathwidth local search

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a43dfbc9-25f0-4371-8a72-004ddc6a8674 · outbound

This paper cites Decomposition principle for linear programs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Decomposition principle for linear programs

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe0d472e-adc1-40fe-bc70-6eda46958fe7 · outbound

This paper cites Maximum matching and a polyhedron with 0,1-vertices.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Maximum matching and a polyhedron with 0,1-vertices

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d607a2d2-3e56-41db-8f46-d96085f05155 · outbound

This paper cites On the membership problem for the elementary closure of a polyhe- dron.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On the membership problem for the elementary closure of a polyhe- dron

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aec8871c-15cd-4983-9bcb-4ebe9f6a6407 · outbound

This paper cites Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67a94ea8-7e77-4100-8d0c-840614b96101 · outbound

This paper cites Strengthening convex relaxations of 0/1- sets using Boolean formulas.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Strengthening convex relaxations of 0/1- sets using Boolean formulas

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 824c9583-ce2b-42aa-9e23-0307e7b95131 · outbound

This paper cites Approximating the k-Set Packing Problem by Local Improve- ments.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Approximating the k-Set Packing Problem by Local Improve- ments

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a51b0d98-ab26-4078-9c02-f407db39c89f · outbound

This paper cites Faces of an integer polyhedron.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Faces of an integer polyhedron

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e15314bb-e886-4fc8-bd47-c1ae1951e533 · outbound

This paper cites Outline of an algorithm for integer solutions to linear programs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Outline of an algorithm for integer solutions to linear programs

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67c12943-29d8-484c-ae02-ca5f294a4d62 · outbound

This paper cites Randomized Communi- cation versus Partition Number.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Randomized Communi- cation versus Partition Number

Reference 24

Resolution: malformed identifier; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 285c14a1-0375-4b67-b84c-b6a5439c16f5 · outbound

This paper cites Deterministic Communication vs. Par- tition Number.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Deterministic Communication vs. Par- tition Number

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9af5a442-7caa-420f-9043-82b1a762f9c2 · outbound

This paper cites On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc15241c-13cf-4bb1-b4be-9df0b87130a3 · outbound

This paper cites Integrality Gaps of Linear and Semi- Definite Programming Relaxations for Knapsack.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Integrality Gaps of Linear and Semi- Definite Programming Relaxations for Knapsack

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 159c2c48-3789-488d-a7cc-48d42dd84e56 · outbound

This paper cites Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e8ac2933-1bea-4868-8d57-e048c52f5cef · outbound

This paper cites An explicit exact SDP relaxation for nonlinear 0-1 programs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems An explicit exact SDP relaxation for nonlinear 0-1 programs

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f938b1c-7ef4-40fc-9730-1ec32bfbb92b · outbound

This paper cites A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre re- laxations for 0-1 programming.

Polyhedral extended formulations that approximate the Gomory closure for packing problems A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre re- laxations for 0-1 programming

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02c5d207-1d0d-4a84-9c0f-e9258c16f99b · outbound

This paper cites Asymptotically Optimal Hardness for k-set packing and k-Matroid Intersection.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Asymptotically Optimal Hardness for k-set packing and k-Matroid Intersection

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01c39384-30ec-4108-b47a-1975ac6f7fde · outbound

This paper cites On the Shannon capacity of a graph.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On the Shannon capacity of a graph

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9fb6f7e-424c-43b3-8584-eb293b29b41f · outbound

This paper cites Matrix cones, projection representations, and stable set polyhedra.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Matrix cones, projection representations, and stable set polyhedra

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 071dacaa-ce50-4a4f-97a3-0f07c9b3ed17 · outbound

This paper cites High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts.

Polyhedral extended formulations that approximate the Gomory closure for packing problems High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66e32a34-eb2d-4037-b816-c47ec7cbbd25 · outbound

This paper cites Sherali-Adams relaxations of the matching polytope.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Sherali-Adams relaxations of the matching polytope

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ea8e80e-a883-4dd4-94af-255bda446be0 · outbound

This paper cites Nemhauser and Laurence A.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Nemhauser and Laurence A

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36c870bf-83d7-47c2-a398-8c89e3c4978e · outbound

This paper cites Communication complexity: and applications.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Communication complexity: and applications

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c133e09-4cc5-4da6-b35c-d04377ca19cf · outbound

This paper cites The matching polytope has exponential extension complexity.

Polyhedral extended formulations that approximate the Gomory closure for packing problems The matching polytope has exponential extension complexity

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4a00886-6f6a-4473-a7a0-b2f91d2e9dae · outbound

This paper cites 0/1 polytopes with quadratic Chvátal rank.

Polyhedral extended formulations that approximate the Gomory closure for packing problems 0/1 polytopes with quadratic Chvátal rank

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4f6865b-1cb9-4e0e-ba1a-f2a83173d63f · outbound

This paper cites Combinatorial optimization.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Combinatorial optimization

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7e546637-4de3-4ed9-a300-248d5d3b45e4 · outbound

This paper cites On cutting planes.

Polyhedral extended formulations that approximate the Gomory closure for packing problems On cutting planes

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15c03d25-a751-4116-b550-61617dd85c1d · outbound

This paper cites Theory of Linear and Integer Programming.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Theory of Linear and Integer Programming

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30a7f1f1-af1f-4028-ba76-7cb029a22304 · outbound

This paper cites A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems.

Polyhedral extended formulations that approximate the Gomory closure for packing problems A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d45f933d-151a-4b4c-9d85-de95fa9b9392 · outbound

This paper cites Improving Integrality Gaps via Chvátal-Gomory Round- ing.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Improving Integrality Gaps via Chvátal-Gomory Round- ing

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4780ada7-6c44-41b6-bfcf-e974080c09e9 · outbound

This paper cites Lower bounds for approximating the matching polytope.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Lower bounds for approximating the matching polytope

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 662f88c7-cdc0-419e-8388-4c0d27df9ced · outbound

This paper cites Integer programming.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Integer programming

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c27417a-e24b-47f9-8fc9-a0fe7a79050f · outbound

This paper cites Expressing combinatorial optimization problems by linear programs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Expressing combinatorial optimization problems by linear programs

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ad9c41a-c51c-4a07-9cca-c9bcfc0bd6d1 · outbound

This paper cites Expressing combinatorial optimization problems by linear programs.

Polyhedral extended formulations that approximate the Gomory closure for packing problems Expressing combinatorial optimization problems by linear programs

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-13T04:36:35.448951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.