CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 31010-31171 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T258","span":{"begin":0,"end":161},"obj":"Sentence"}],"text":"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.,"}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T258","span":{"begin":0,"end":161},"obj":"Sentence"},{"id":"TextSentencer_T258","span":{"begin":0,"end":161},"obj":"Sentence"},{"id":"T75664","span":{"begin":0,"end":161},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"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.,"}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T108","span":{"begin":0,"end":161},"obj":"Epistemic_statement"}],"text":"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.,"}