CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 31010-31171 JSON TXT

Annnotations TAB JSON ListView MergeView

Id	Subject	Object	Predicate	Lexical cue
T258	0-161	Sentence	denotes	When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,

Id	Subject	Object	Predicate	Lexical cue
TextSentencer_T258	0-161	Sentence	denotes	When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,
TextSentencer_T258	0-161	Sentence	denotes	When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,
T75664	0-161	Sentence	denotes	When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,

Id	Subject	Object	Predicate	Lexical cue
T108	0-161	Epistemic_statement	denotes	When the shortest path from u to S in graph G = (V, E, m) is unique, the quantity d(u, S) ∧ T max can be used to approximate the detection time E[ (u, S)], i.e.,