CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 30468-30568 JSONTXT

{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T253","span":{"begin":0,"end":100},"obj":"Sentence"}],"text":"For any two nodes u and v, let d(u, v) be the smallest time cost among the paths connecting u and v."}

{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T253","span":{"begin":0,"end":100},"obj":"Sentence"},{"id":"TextSentencer_T253","span":{"begin":0,"end":100},"obj":"Sentence"},{"id":"T99652","span":{"begin":0,"end":100},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"For any two nodes u and v, let d(u, v) be the smallest time cost among the paths connecting u and v."}

{"project":"CORD-19-PD-MONDO","denotations":[{"id":"T17","span":{"begin":27,"end":30},"obj":"Disease"}],"attributes":[{"id":"A17","pred":"mondo_id","subj":"T17","obj":"http://purl.obolibrary.org/obo/MONDO_0019560"}],"text":"For any two nodes u and v, let d(u, v) be the smallest time cost among the paths connecting u and v."}