Triple

T22150691
Position Surface form Disambiguated ID Type / Status
Subject Bourgain–Tzafriri restricted invertibility principle E547403 entity
Predicate relatedTo P37 FINISHED
Object paving conjecture
The paving conjecture is a problem in operator theory and functional analysis that asks whether every bounded linear operator with zero diagonal can be approximated by block-diagonal operators with uniformly small off-diagonal norms, and is closely connected to the Kadison–Singer problem.
E1522134 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: paving conjecture | Statement: [Bourgain–Tzafriri restricted invertibility principle, relatedTo, paving conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: paving conjecture
Context triple: [Bourgain–Tzafriri restricted invertibility principle, relatedTo, paving conjecture]
  • A. Pólya’s conjecture
    Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
  • B. Bunyakovsky conjecture
    The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
  • C. Poincaré conjecture
    The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
  • D. Mauldin’s conjecture
    Mauldin’s conjecture, more commonly known as the Beal conjecture, is an unsolved problem in number theory asserting that any solution in positive integers to A^x + B^y = C^z with exponents greater than 2 must have A, B, and C sharing a common prime factor.
  • E. Erdős–Turán conjecture
    The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: paving conjecture
Triple: [Bourgain–Tzafriri restricted invertibility principle, relatedTo, paving conjecture]
Generated description
The paving conjecture is a problem in operator theory and functional analysis that asks whether every bounded linear operator with zero diagonal can be approximated by block-diagonal operators with uniformly small off-diagonal norms, and is closely connected to the Kadison–Singer problem.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: paving conjecture
Target entity description: The paving conjecture is a problem in operator theory and functional analysis that asks whether every bounded linear operator with zero diagonal can be approximated by block-diagonal operators with uniformly small off-diagonal norms, and is closely connected to the Kadison–Singer problem.
  • A. Pólya’s conjecture
    Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
  • B. Bunyakovsky conjecture
    The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
  • C. Poincaré conjecture
    The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
  • D. Mauldin’s conjecture
    Mauldin’s conjecture, more commonly known as the Beal conjecture, is an unsolved problem in number theory asserting that any solution in positive integers to A^x + B^y = C^z with exponents greater than 2 must have A, B, and C sharing a common prime factor.
  • E. Erdős–Turán conjecture
    The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69e11e3b52088190ad5df386d01eb2fb completed April 16, 2026, 5:36 p.m.
NER Named-entity recognition batch_69f129f37dac8190a7cecb12f4271515 completed April 28, 2026, 9:43 p.m.
NED1 Entity disambiguation (via context triple) batch_6a0a9704f4988190b03783c006929ad7 completed May 18, 2026, 4:35 a.m.
NEDg Description generation batch_6a0a97e509a88190a7f316cf340d010a completed May 18, 2026, 4:39 a.m.
NED2 Entity disambiguation (via description) batch_6a0a987daa208190bab5b7adec1913e8 completed May 18, 2026, 4:41 a.m.
Created at: April 16, 2026, 8:33 p.m.