CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 16523-16725 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"ᮀ Since it is intractable to exactly compute D(S) on a typically sized graph, a natural idea is to employ Monte-Carlo methods to estimate D(S), which can be implemented in two different ways as follows:","tracks":[{"project":"Epistemic_Statements","denotations":[{"id":"T53","span":{"begin":0,"end":202},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T53","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"Epistemic_Statements","color":"#ec93b8","default":true}]}]}}