RECORD
Integer completely positive matrices of order two
Optimization and Control · Submitted 12 Feb 2018
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization.
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
The abstract, sentence by sentence
We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization. | result 0.95 | 0.94 | 0.94 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We show that every integer doubly nonnegative $2 \times 2$ matrix has an integer cp-factorization.
Human review
How the literature uses it
1 arXiv paper cite this in 2 sentences
Papers citing it · 1 sentence without a confident label
Cites it as background 1 paper
-
Laffey and Šimgoc [ref] showed that every integral matrix $A ∈$ possesses an integral cp-factorization.
A simplex algorithm for rational cp-factorization · Integral input · 0.89
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.