Triple

T7664740
Position Surface form Disambiguated ID Type / Status
Subject MMIX E173597 entity
Predicate documentedIn P309 FINISHED
Object The Art of Computer Programming, Volume 1 (later editions) E32446 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: The Art of Computer Programming, Volume 1 (later editions) | Statement: [MMIX, documentedIn, The Art of Computer Programming, Volume 1 (later editions)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: The Art of Computer Programming, Volume 1 (later editions)
Context triple: [MMIX, documentedIn, The Art of Computer Programming, Volume 1 (later editions)]
  • A. The Art of Computer Programming chosen
    The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
  • B. Algorithms + Data Structures = Programs
    "Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
  • C. The Design and Analysis of Computer Algorithms
    The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
  • D. Introduction to Algorithms
    Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
  • E. Concrete Mathematics
    Concrete Mathematics is a widely respected textbook by Ronald Graham, Donald Knuth, and Oren Patashnik that blends continuous and discrete mathematics with an emphasis on problem-solving and rigorous analysis, especially for computer science applications.
  • 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_69c699562484819086752091e3164a27 completed March 27, 2026, 2:51 p.m.
NER Named-entity recognition batch_69c701bfb67c81908b416802eaf0faac completed March 27, 2026, 10:16 p.m.
NED1 Entity disambiguation (via context triple) batch_69c8d6a339a48190936b962579d2d5a5 completed March 29, 2026, 7:37 a.m.
Created at: March 27, 2026, 4 p.m.