Triple

T21494057
Position Surface form Disambiguated ID Type / Status
Subject Beal conjecture E530308 entity
Predicate alsoKnownAs P39 FINISHED
Object Beal’s conjecture NE NERFINISHED

How this triple was built (2 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: Beal’s conjecture | Statement: [Beal conjecture, alsoKnownAs, Beal’s conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Beal’s conjecture
Context triple: [Beal conjecture, alsoKnownAs, Beal’s conjecture]
  • A. Beal conjecture chosen
    The Beal conjecture is an unsolved problem in number theory proposing that if A^x + B^y = C^z with A, B, C, x, y, z positive integers and exponents greater than 2, then A, B, and C must share a common prime factor.
  • 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. Pillai’s conjecture
    Pillai’s conjecture is an unproven statement in number theory asserting that the difference between perfect powers takes each positive integer value only finitely many times.
  • D. Erdős–Straus conjecture
    The Erdős–Straus conjecture is an unsolved problem in number theory asserting that for every integer n ≥ 2, the fraction 4/n can be expressed as a sum of three unit fractions.
  • E. Erdős–Moser equation
    The Erdős–Moser equation is a famous unsolved Diophantine equation in number theory that asks whether 1^k + 2^k + ... + (m−1)^k = m^k has any integer solutions beyond the trivial case (k, m) = (1, 2).
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
Created at: April 16, 2026, 6:23 p.m.