CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 30468-30568 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"For any two nodes u and v, let d(u, v) be the smallest time cost among the paths connecting u and v.","tracks":[{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T253","span":{"begin":0,"end":100},"obj":"Sentence"}],"attributes":[{"subj":"T253","pred":"source","obj":"CORD-19_Custom_license_subset"}]},{"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#"}],"attributes":[{"subj":"TextSentencer_T253","pred":"source","obj":"CORD-19-Sentences"},{"subj":"TextSentencer_T253","pred":"source","obj":"CORD-19-Sentences"},{"subj":"T99652","pred":"source","obj":"CORD-19-Sentences"}]},{"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"},{"subj":"T17","pred":"source","obj":"CORD-19-PD-MONDO"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"CORD-19_Custom_license_subset","color":"#c2ec93","default":true},{"id":"CORD-19-Sentences","color":"#ec93dc"},{"id":"CORD-19-PD-MONDO","color":"#93ece2"}]}]}}