Paper Citation Record · LEDGER

Machine Learning for Cutting Planes in Integer Programming: A Survey

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2302.09166.

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

pith.paper-citation-record.v1
2302.09166 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:19:53.788524Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-24T00:23:39.806026Z

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 3d13cfb6-a58c-404c-91f9-3fe9a8196d32 · inbound

Decision-Focused Surrogate Modeling for Mixed-Integer Linear Optimization cites this paper.

Decision-Focused Surrogate Modeling for Mixed-Integer Linear Optimization Machine Learning for Cutting Planes in Integer Programming: A Survey

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-05-24T00:23:39.810159Z

Source-reported events for the cited work

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

Observation 59c06e39-e4db-42fa-a465-3499179425ad · inbound

How hard is learning to cut? Trade-offs and sample complexity cites this paper.

How hard is learning to cut? Trade-offs and sample complexity Machine Learning for Cutting Planes in Integer Programming: A Survey

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T12:19:53.788524Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d957ac71-b763-45b8-a2fb-e6140dd40789 · inbound

Disjunctive Benders Decomposition cites this paper.

Disjunctive Benders Decomposition Machine Learning for Cutting Planes in Integer Programming: A Survey

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-05-22T00:55:50.530887Z

Source-reported events for the cited work

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

Observation ae104d3b-45dc-45ff-a79d-8717d4d6dddb · inbound

Learning to Optimize at Scale: A Benders Decomposition-TransfORmers Framework for Stochastic Combinatorial Optimization cites this paper.

Learning to Optimize at Scale: A Benders Decomposition-TransfORmers Framework for Stochastic Combinatorial Optimization Machine Learning for Cutting Planes in Integer Programming: A Survey

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-02T14:13:26.313113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.