CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 46638-47001 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T394","span":{"begin":0,"end":269},"obj":"Sentence"},{"id":"T395","span":{"begin":270,"end":363},"obj":"Sentence"}],"text":"Note that any edge of length greater than 1 is irrelevant as the structure of the graph, which ensures it can never be part of a path of length 3 from s to t, For any path from s to t must jump three times: from s to some x i , from x i to some y j , and from y j to t. Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard."}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T394","span":{"begin":0,"end":269},"obj":"Sentence"},{"id":"TextSentencer_T395","span":{"begin":270,"end":363},"obj":"Sentence"},{"id":"TextSentencer_T394","span":{"begin":0,"end":269},"obj":"Sentence"},{"id":"TextSentencer_T395","span":{"begin":270,"end":363},"obj":"Sentence"},{"id":"T93774","span":{"begin":0,"end":269},"obj":"Sentence"},{"id":"T84144","span":{"begin":270,"end":363},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"Note that any edge of length greater than 1 is irrelevant as the structure of the graph, which ensures it can never be part of a path of length 3 from s to t, For any path from s to t must jump three times: from s to some x i , from x i to some y j , and from y j to t. Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard."}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T145","span":{"begin":0,"end":363},"obj":"Epistemic_statement"}],"text":"Note that any edge of length greater than 1 is irrelevant as the structure of the graph, which ensures it can never be part of a path of length 3 from s to t, For any path from s to t must jump three times: from s to some x i , from x i to some y j , and from y j to t. Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard."}