CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 16228-16365 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"Actually the computation of D(S) is #P-hard, by showing a reduction from the positive partitioned 2-DNF assignment counting problem [9] .","tracks":[{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T122","span":{"begin":0,"end":137},"obj":"Sentence"}],"attributes":[{"subj":"T122","pred":"source","obj":"CORD-19_Custom_license_subset"}]},{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T122","span":{"begin":0,"end":137},"obj":"Sentence"},{"id":"TextSentencer_T122","span":{"begin":0,"end":137},"obj":"Sentence"},{"id":"T33146","span":{"begin":0,"end":137},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"attributes":[{"subj":"TextSentencer_T122","pred":"source","obj":"CORD-19-Sentences"},{"subj":"TextSentencer_T122","pred":"source","obj":"CORD-19-Sentences"},{"subj":"T33146","pred":"source","obj":"CORD-19-Sentences"}]},{"project":"Epistemic_Statements","denotations":[{"id":"T52","span":{"begin":0,"end":137},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T52","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"CORD-19_Custom_license_subset","color":"#ec93c3","default":true},{"id":"CORD-19-Sentences","color":"#93ddec"},{"id":"Epistemic_Statements","color":"#ece193"}]}]}}