CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 31179-31272 JSONTXT

{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T260","span":{"begin":0,"end":93},"obj":"Sentence"}],"text":"In fact, when the shortest path from u to S in graph G = (V, E, m) is unique, it follows that"}

{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T260","span":{"begin":0,"end":93},"obj":"Sentence"},{"id":"TextSentencer_T260","span":{"begin":0,"end":93},"obj":"Sentence"},{"id":"T72303","span":{"begin":0,"end":93},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"In fact, when the shortest path from u to S in graph G = (V, E, m) is unique, it follows that"}