CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 46638-47001 JSONTXT

Annnotations TAB JSON ListView MergeView

CORD-19_Custom_license_subset

Id Subject Object Predicate Lexical cue
T394 0-269 Sentence denotes 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.
T395 270-363 Sentence denotes Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard.

CORD-19-Sentences

Id Subject Object Predicate Lexical cue
TextSentencer_T394 0-269 Sentence denotes 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.
TextSentencer_T395 270-363 Sentence denotes Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard.
TextSentencer_T394 0-269 Sentence denotes 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.
TextSentencer_T395 270-363 Sentence denotes Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard.
T93774 0-269 Sentence denotes 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.
T84144 270-363 Sentence denotes Thus, from what we have stated, (A1) can be reducible to (A2), which implies (A2) is #P-hard.

Epistemic_Statements

Id Subject Object Predicate Lexical cue
T145 0-363 Epistemic_statement denotes 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.