Triple

T1397770
Position Surface form Disambiguated ID Type / Status
Subject Supreme Court of the Australian Capital Territory E30705 entity
Predicate hasDivision P35 FINISHED
Object trial division
The trial division is the part of the Supreme Court of the Australian Capital Territory responsible for hearing and determining cases at first instance, including serious criminal and significant civil matters.
E159105 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: trial division | Statement: [Supreme Court of the Australian Capital Territory, hasDivision, trial division]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: trial division
Context triple: [Supreme Court of the Australian Capital Territory, hasDivision, trial division]
  • A. Euler’s totient function φ(n)
    Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
  • B. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
    Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
  • C. Fermat's little theorem
    Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
  • D. Fermat number
    A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
  • E. Fermat's theorem on sums of two squares
    Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
  • 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: trial division
Triple: [Supreme Court of the Australian Capital Territory, hasDivision, trial division]
Generated description
The trial division is the part of the Supreme Court of the Australian Capital Territory responsible for hearing and determining cases at first instance, including serious criminal and significant civil matters.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: trial division
Target entity description: The trial division is the part of the Supreme Court of the Australian Capital Territory responsible for hearing and determining cases at first instance, including serious criminal and significant civil matters.
  • A. Euler’s totient function φ(n)
    Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
  • B. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
    Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
  • C. Fermat's little theorem
    Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
  • D. Fermat number
    A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
  • E. Fermat's theorem on sums of two squares
    Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
  • 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_69a498fd4e408190bd73eca30ea9754c completed March 1, 2026, 7:52 p.m.
NER Named-entity recognition batch_69a4c382b6588190833c39ac84fb6139 completed March 1, 2026, 10:53 p.m.
NED1 Entity disambiguation (via context triple) batch_69acde353b148190b9122f1d6d80fbd4 completed March 8, 2026, 2:25 a.m.
NEDg Description generation batch_69acdea5150c8190ab248df8852bcde6 completed March 8, 2026, 2:27 a.m.
NED2 Entity disambiguation (via description) batch_69acdefd76708190be68b157e83cfd87 completed March 8, 2026, 2:29 a.m.
Created at: March 1, 2026, 7:59 p.m.