CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 20459-20576 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T154","span":{"begin":0,"end":117},"obj":"Sentence"}],"text":"The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1."}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T154","span":{"begin":0,"end":117},"obj":"Sentence"},{"id":"TextSentencer_T154","span":{"begin":0,"end":117},"obj":"Sentence"},{"id":"T79217","span":{"begin":0,"end":117},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1."}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T62","span":{"begin":0,"end":117},"obj":"Epistemic_statement"}],"text":"The Set Cover problem is equivalent to deciding if there is a set S of k nodes in this bipartite graph with D(S) ≤ 1."}