Triple
T3196727
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PageRank |
E66951
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object |
HITS algorithm
The HITS algorithm is a link analysis method that ranks web pages by separately evaluating their authority and hub scores based on the structure of hyperlinks.
|
E336027
|
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: HITS algorithm | Statement: [PageRank, relatedConcept, HITS algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: HITS algorithm Context triple: [PageRank, relatedConcept, HITS algorithm]
-
A.
PageRank algorithm
The PageRank algorithm is a link analysis method used by search engines, notably Google, to rank web pages in search results based on their importance within the web’s link structure.
-
B.
The Anatomy of a Large-Scale Hypertextual Web Search Engine
"The Anatomy of a Large-Scale Hypertextual Web Search Engine" is a seminal research paper by Sergey Brin and Larry Page that introduced the design and PageRank algorithm behind the early Google search engine.
-
C.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
D.
Eigenfactor Score
Eigenfactor Score is a journal influence metric that estimates the importance of scholarly journals by considering the origin and frequency of citations in a network-based model.
-
E.
Resnik
Resnik is a surname most notably associated with Judith Resnik, the American astronaut who died in the Space Shuttle Challenger disaster.
- 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: HITS algorithm Triple: [PageRank, relatedConcept, HITS algorithm]
Generated description
The HITS algorithm is a link analysis method that ranks web pages by separately evaluating their authority and hub scores based on the structure of hyperlinks.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: HITS algorithm Target entity description: The HITS algorithm is a link analysis method that ranks web pages by separately evaluating their authority and hub scores based on the structure of hyperlinks.
-
A.
PageRank algorithm
The PageRank algorithm is a link analysis method used by search engines, notably Google, to rank web pages in search results based on their importance within the web’s link structure.
-
B.
The Anatomy of a Large-Scale Hypertextual Web Search Engine
"The Anatomy of a Large-Scale Hypertextual Web Search Engine" is a seminal research paper by Sergey Brin and Larry Page that introduced the design and PageRank algorithm behind the early Google search engine.
-
C.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
D.
Eigenfactor Score
Eigenfactor Score is a journal influence metric that estimates the importance of scholarly journals by considering the origin and frequency of citations in a network-based model.
-
E.
Resnik
Resnik is a surname most notably associated with Judith Resnik, the American astronaut who died in the Space Shuttle Challenger disaster.
- 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_69ad8588ba18819086a10951c32ecb80 |
completed | March 8, 2026, 2:19 p.m. |
| NER | Named-entity recognition | batch_69ada7177b488190b7a1b40ff3fae15f |
completed | March 8, 2026, 4:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b24bb2c9908190b3abc395537e22ac |
completed | March 12, 2026, 5:14 a.m. |
| NEDg | Description generation | batch_69b24cda28308190b33f189b8c7f3c58 |
completed | March 12, 2026, 5:19 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b24d84f29c819087c15fd3883d6657 |
completed | March 12, 2026, 5:22 a.m. |
Created at: March 8, 2026, 3:07 p.m.