Pith. Sign in

RECORD

Polyhedral results for the Equitable Coloring Problem

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin

Discrete Mathematics · Submitted 16 Jun 2011

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

how it is stated · asserted 0.98 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1106.3349 (version 1)
Pith ID2VENPSMJ, Pith's permanent record of this paper and its review
CitationDaniel Severin, Graciela Nasini, Isabel M\'endez-D\'iaz. "Polyhedral results for the Equitable Coloring Problem." arXiv:1106.3349 (2011). https://pith.science/paper/2VENPSMJ
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,858 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.07 · human participants 0.02 · controlled comparison 0.05 · randomized assignment 0.01 · states quantitative result 0.07 · compares with prior results 0.16 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. contribution 0.90 0.87 0.05 asserted 0.93
s1 We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. contribution 0.51 0.97 0.33 asserted 1.00
s2 We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm. result 0.64 0.96 0.23 asserted 0.98

What kind of paper the classifier reports this is: theoretical result 0.98 · evidence from proof or derivation 0.89.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

Papers whose main result relates to this one's

How each label was checked · JSON

Found among the papers closest to this one by title and main claim. Pith's classifier compared each pair's main results and a second model family confirmed the relation; checked against two further families, shown conflicts agreed 118 times in 120 and shown same results 218 times in 239. The quoted sentence is the other paper's main claim.

States the same result 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.