Pith. Sign in

RECORD

Realization of abstract convex geometries by point configurations, Part 1

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
Kira Adaricheva, Marcel Wild

Combinatorics · Submitted 5 Oct 2007

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

The authors' main claim We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known NP-hard order type problem.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID0710.1248 (version 1)
Pith IDCWQLZP2I, Pith's permanent record of this paper and its review
CitationKira Adaricheva, Marcel Wild. "Realization of abstract convex geometries by point configurations, Part 1." arXiv:0710.1248 (2007). https://pith.science/paper/CWQLZP2I
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,264 input tokens, $0.0001 reported.

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

The abstract, sentence by sentence

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

The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known NP-hard order type problem.

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 The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. background 1.00 0.04 0.04 asserted 0.99
s1 We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known NP-hard order type problem. result 0.91 0.93 0.76 asserted 1.00

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

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

The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known NP-hard order type problem.

Human review

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

Discussion

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