Paper Citation Record · LEDGER

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model

As of 6 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.06343.

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

pith.paper-citation-record.v1
2607.06343 v1

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-08T09:20:51.127674Z

measured 20 of 20 standing notices

One-hop event checks from named stored sources.

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

20 of 20 outbound references displayed

verified exact0
verified fuzzy18
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 14f6959d-3644-498d-8e61-fb4924985c71 · outbound

This paper cites Mixed integer programming: Analyzing 12 years of progress.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Mixed integer programming: Analyzing 12 years of progress

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.117137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation ae2b3c28-3ce7-4bad-8e9d-a3a85e12b577 · outbound

This paper cites Further results on an abstract model for branching and its application to mixed integer programming.Mathematical Programming, 190(1):811–841, 2021.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Further results on an abstract model for branching and its application to mixed integer programming.Mathematical Programming, 190(1):811–841, 2021

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.123086Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 497c6926-c008-447c-b452-0cd4f2a042c5 · outbound

This paper cites On the enumer- ative nature of Gomory’s dual cutting plane method.Mathematical Programming, 125(2):325–351, 2010.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model On the enumer- ative nature of Gomory’s dual cutting plane method.Mathematical Programming, 125(2):325–351, 2010

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.121270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 254f3645-5da6-428b-96aa-8ac5b4461984 · outbound

This paper cites Complexity of branch-and-bound and cutting planes in mixed-integer optimization—II.Combinatorica, 42(Suppl 1):971–996, 2022.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Complexity of branch-and-bound and cutting planes in mixed-integer optimization—II.Combinatorica, 42(Suppl 1):971–996, 2022

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.110630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 4e960b19-d451-458a-8e93-6c989e4d65d4 · outbound

This paper cites Complexity of branch-and-bound and cutting planes in mixed-integer optimization.Mathematical Programming, 198(1):787–810, 2023.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Complexity of branch-and-bound and cutting planes in mixed-integer optimization.Mathematical Programming, 198(1):787–810, 2023

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.112663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 72758dac-3e05-44a0-8db8-b34b966597fa · outbound

This paper cites Learning to use local cuts.Mathematical Programming Computation, 17(3):437–450, 2025.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Learning to use local cuts.Mathematical Programming Computation, 17(3):437–450, 2025

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.114491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 64c06a99-9b67-4832-9e00-f58a4c5e245b · outbound

This paper cites Generalizationguaranteesforlearning score-based branch-and-cut policies in integer programming.Advances in Neural Information Processing Systems, 38:118669–118699, 2026.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Generalizationguaranteesforlearning score-based branch-and-cut policies in integer programming.Advances in Neural Information Processing Systems, 38:118669–118699, 2026

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.119347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation ec3f2a50-8416-48f6-a814-1e7667da6381 · outbound

This paper cites On the complexity of branching proofs.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model On the complexity of branching proofs

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.124817Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 5a1b7c80-8f42-42dc-8b60-b15803b3451d · outbound

This paper cites Lower bounds on the size of general branch-and-bound trees.Mathematical Programming, 198(1):539–559, 2023.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Lower bounds on the size of general branch-and-bound trees.Mathematical Programming, 198(1):539–559, 2023

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.105026Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 63b21a2d-1b26-4045-b5e7-e3d91ca229d2 · outbound

This paper cites A theoretical and computational analysis of full strong-branching.Mathe- matical Programming, 205(1):303–336, 2024.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model A theoretical and computational analysis of full strong-branching.Mathe- matical Programming, 205(1):303–336, 2024

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.103004Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 840d946f-9c03-4768-ac7a-5915f61e4cf8 · outbound

This paper cites Cutting plane generation through sparse principal component analysis.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Cutting plane generation through sparse principal component analysis

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.108632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 2642471d-5865-4094-942c-844aee3eaf5b · outbound

This paper cites Theoretical challenges towards cutting-plane selection.Mathematical Programming, 170(1):237–266, 2018.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Theoretical challenges towards cutting-plane selection.Mathematical Programming, 170(1):237–266, 2018

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.098939Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 1dd664ba-c323-4f55-aa7a-0f813d182f06 · outbound

This paper cites an unresolved cited work.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-07-08T09:24:49.092856Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 1afbfc37-6e4c-4b30-b802-c0df1626fa29 · outbound

This paper cites The strength of root cuts in an extended abstract branch-and-cut model.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model The strength of root cuts in an extended abstract branch-and-cut model

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.094875Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation ce6d3619-a250-404c-8a91-fbf294791dca · outbound

This paper cites Liebling, Denis Naddef, George L.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Liebling, Denis Naddef, George L

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.096788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 75fa5e8f-26fe-4c6d-8e30-f21bccb2c9ce · outbound

This paper cites An abstract model for branch and cut.Mathematical Programming, 206(1):175–202, 2024.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model An abstract model for branch and cut.Mathematical Programming, 206(1):175–202, 2024

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.100868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation f0865608-5da4-4e06-8284-4f96f801140d · outbound

This paper cites an unresolved cited work.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-07-08T09:24:49.106856Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation 71dc87f3-62a4-4f8a-8a9f-262af24f2c09 · outbound

This paper cites An abstract model for branch- ing and its application to mixed integer programming.Mathematical Programming, 166(1):369–405, 2017.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model An abstract model for branch- ing and its application to mixed integer programming.Mathematical Programming, 166(1):369–405, 2017

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.089227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation e1448475-f30d-42b6-9837-acd739f10e20 · outbound

This paper cites Non-monotonicity of branching rules with respect to linear relaxations.INFORMS Journal on Computing, 38(1):53–66, 2026.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Non-monotonicity of branching rules with respect to linear relaxations.INFORMS Journal on Computing, 38(1):53–66, 2026

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.091127Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Observation bebdad51-bdb7-4f9a-90a0-0fcedee24218 · outbound

This paper cites Lexicography and degeneracy: can a pure cutting plane algorithm work?Mathematical Programming, 130(1):153–176, 2011.

Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model Lexicography and degeneracy: can a pure cutting plane algorithm work?Mathematical Programming, 130(1):153–176, 2011

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-07-08T09:24:49.087248Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.

Pith citing papers

No inbound Pith citation observations are available.