Triple

T2936474
Position Surface form Disambiguated ID Type / Status
Subject Georges-Louis Leclerc, Comte de Buffon E79280 entity
Predicate knownFor P22 FINISHED
Object Buffon's needle probability problem E86905 NE FINISHED

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: Buffon's needle probability problem | Statement: [Georges-Louis Leclerc, Comte de Buffon, knownFor, Buffon's needle probability problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Buffon's needle probability problem
Context triple: [Georges-Louis Leclerc, Comte de Buffon, knownFor, Buffon's needle probability problem]
  • A. Conway’s soldiers
    Conway’s soldiers is a mathematical puzzle and thought experiment in combinatorial game theory that explores how far checkers-like pieces can advance on an infinite grid under specific movement rules.
  • B. Conway circle theorem
    The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
  • C. Seven Bridges of Königsberg problem
    The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
  • D. de Bruijn–van Aardenne–Ehrenfest theorem
    The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
  • E. Monte Carlo method chosen
    The Monte Carlo method is a computational technique that uses random sampling to approximate numerical results, especially for complex integrals, simulations, and probabilistic systems.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69ad8b0fbab081908f6a61567c045d8d completed March 8, 2026, 2:43 p.m.
NER Named-entity recognition batch_69ad983df5e08190939cd8acf8ad5b55 completed March 8, 2026, 3:39 p.m.
NED1 Entity disambiguation (via context triple) batch_69b0867edf3481909c5fa9d02c5f11b3 completed March 10, 2026, 9 p.m.
Created at: March 8, 2026, 2:56 p.m.