Triple
T22815092
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | DCCP |
E565076
|
entity |
| Predicate | fullName |
P16
|
FINISHED |
| Object | Datagram Congestion Control Protocol |
—
|
NE NERFINISHED |
How this triple was built (3 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: Datagram Congestion Control Protocol | Statement: [DCCP, fullName, Datagram Congestion Control Protocol]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Datagram Congestion Control Protocol Context triple: [DCCP, fullName, Datagram Congestion Control Protocol]
-
A.
Jacobson congestion control algorithm
The Jacobson congestion control algorithm is a foundational TCP/IP network mechanism that introduced techniques like slow start and congestion avoidance to dramatically improve Internet stability and performance.
-
B.
Congestion Avoidance and Control (SIGCOMM 1988)
Congestion Avoidance and Control (SIGCOMM 1988) is Van Jacobson’s seminal paper that introduced key TCP congestion control algorithms, fundamentally improving Internet stability and performance.
-
C.
Random Early Detection
Random Early Detection is a congestion avoidance mechanism for packet-switched networks that probabilistically drops packets before a queue becomes full to signal and control incipient congestion.
-
D.
The Addition of Explicit Congestion Notification (ECN) to IP
The Addition of Explicit Congestion Notification (ECN) to IP is an IETF standard (RFC 3168) that specifies how IP and TCP can signal and respond to network congestion without relying solely on packet loss.
-
E.
CoDel
CoDel (Controlled Delay) is an active queue management algorithm designed to control network bufferbloat by keeping packet queuing delays low without requiring manual tuning.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Datagram Congestion Control Protocol Target entity description: Datagram Congestion Control Protocol is a transport-layer network protocol designed to provide congestion-controlled, unreliable datagram delivery for applications such as streaming media and online gaming.
-
A.
Jacobson congestion control algorithm
The Jacobson congestion control algorithm is a foundational TCP/IP network mechanism that introduced techniques like slow start and congestion avoidance to dramatically improve Internet stability and performance.
-
B.
Congestion Avoidance and Control (SIGCOMM 1988)
Congestion Avoidance and Control (SIGCOMM 1988) is Van Jacobson’s seminal paper that introduced key TCP congestion control algorithms, fundamentally improving Internet stability and performance.
-
C.
Random Early Detection
Random Early Detection is a congestion avoidance mechanism for packet-switched networks that probabilistically drops packets before a queue becomes full to signal and control incipient congestion.
-
D.
The Addition of Explicit Congestion Notification (ECN) to IP
The Addition of Explicit Congestion Notification (ECN) to IP is an IETF standard (RFC 3168) that specifies how IP and TCP can signal and respond to network congestion without relying solely on packet loss.
-
E.
CoDel
CoDel (Controlled Delay) is an active queue management algorithm designed to control network bufferbloat by keeping packet queuing delays low without requiring manual tuning.
- F. None of above. chosen
Provenance (2 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_69e2458426188190b58b8ab4844fe420 |
completed | April 17, 2026, 2:36 p.m. |
| NER | Named-entity recognition | batch_69f17dcb872881909a031d8560635fce |
completed | April 29, 2026, 3:40 a.m. |
Created at: April 17, 2026, 3:33 p.m.