Triple

T1465599
Position Surface form Disambiguated ID Type / Status
Subject Simon Newcomb E27014 entity
Predicate knownFor P22 FINISHED
Object Newcomb–Benford law
The Newcomb–Benford law is a statistical principle stating that in many naturally occurring datasets, the leading digits are distributed logarithmically, with smaller digits (especially 1) appearing as the first digit more frequently than larger ones.
E167726 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: Newcomb–Benford law | Statement: [Simon Newcomb, knownFor, Newcomb–Benford law]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Newcomb–Benford law
Context triple: [Simon Newcomb, knownFor, Newcomb–Benford law]
  • A. Statistical Independence in Probability, Analysis and Number Theory
    "Statistical Independence in Probability, Analysis and Number Theory" is a mathematical monograph by Mark Kac that explores the concept of independence across probability theory, real analysis, and number theory.
  • B. Dyson’s transform in number theory
    Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
  • C. Hardy–Ramanujan asymptotic formula
    The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
  • D. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • E. Bernoulli numbers
    Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
  • 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: Newcomb–Benford law
Triple: [Simon Newcomb, knownFor, Newcomb–Benford law]
Generated description
The Newcomb–Benford law is a statistical principle stating that in many naturally occurring datasets, the leading digits are distributed logarithmically, with smaller digits (especially 1) appearing as the first digit more frequently than larger ones.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Newcomb–Benford law
Target entity description: The Newcomb–Benford law is a statistical principle stating that in many naturally occurring datasets, the leading digits are distributed logarithmically, with smaller digits (especially 1) appearing as the first digit more frequently than larger ones.
  • A. Statistical Independence in Probability, Analysis and Number Theory
    "Statistical Independence in Probability, Analysis and Number Theory" is a mathematical monograph by Mark Kac that explores the concept of independence across probability theory, real analysis, and number theory.
  • B. Dyson’s transform in number theory
    Dyson’s transform in number theory is a combinatorial technique introduced by Freeman Dyson to manipulate and relate integer partitions, particularly in the study of partition identities and congruences.
  • C. Hardy–Ramanujan asymptotic formula
    The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
  • D. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • E. Bernoulli numbers
    Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
  • 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_69a496d25d6881909dbd84f86d763992 completed March 1, 2026, 7:43 p.m.
NER Named-entity recognition batch_69a4c5bb4e288190997c7e8985e9a2bd completed March 1, 2026, 11:03 p.m.
NED1 Entity disambiguation (via context triple) batch_69ad0e7c8a608190b3ca574c118e89b5 completed March 8, 2026, 5:51 a.m.
NEDg Description generation batch_69ad0f462d708190afa0c2df1e043946 completed March 8, 2026, 5:55 a.m.
NED2 Entity disambiguation (via description) batch_69ad0fb331e881908455844135bb3208 completed March 8, 2026, 5:57 a.m.
Created at: March 1, 2026, 8:01 p.m.