{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":418,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":418,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7a7781369b2e","filters":{"topic":"Markov Chains and Monte Carlo Methods"}},"results":[{"id":"W1501586228","doi":"10.1111/j.1467-9868.2009.00736.x","title":"Particle Markov Chain Monte Carlo Methods","year":2010,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series B (Statistical Methodology)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2055,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Hybrid Monte Carlo; Particle filter; Monte Carlo molecular modeling; Monte Carlo method in statistical physics; Computer science; Monte Carlo integration; Statistical physics; Markov chain mixing time; Quasi-Monte Carlo method; Markov chain; Mathematical optimization; Algorithm; Applied mathematics; Markov model; Mathematics; Markov property; Artificial intelligence; Statistics; Machine learning; Physics","authors":[{"name":"Christophe Andrieu","is_ca":false},{"name":"Arnaud Doucet","is_ca":true},{"name":"Roman Holenstein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08842884299117262,"gpt":0.4081792489599942,"spread":0.3197504059688216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002910531,0.0007380596,0.001136141,0.001217559,0.0006338327,0.001708516,0.001644502,0.001491965,0.00899455],"category_scores_gemma":[0.0113602,0.0005925117,0.0009980658,0.00141945,0.001429455,0.001715836,0.001297551,0.002241033,0.002047567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001167971,"about_ca_system_score_gemma":0.002209064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005268648,"about_ca_topic_score_gemma":0.003709503,"domain_scores_codex":[0.9980031,0.001024967,0.00007507617,0.0002906195,0.0005060805,0.0001001544],"domain_scores_gemma":[0.9932869,0.004933515,0.0003276045,0.0005734912,0.0007225712,0.0001558512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003885605,0.00004973748,0.001012404,0.0002114667,0.00008368724,0.0000981119,0.00008475644,0.4118916,0.000459567,0.5104456,0.005680576,0.06994366],"study_design_scores_gemma":[0.00001947484,0.00001413478,0.000158701,0.00005458189,0.00001219978,0.00003710643,0.00001044166,0.725646,0.0003051036,0.2641056,0.009618803,0.00001780753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001247869,0.0005722148,0.9943221,0.000332928,0.00009007647,0.00004243921,0.0001038182,0.0001829844,0.003105602],"genre_scores_gemma":[0.2194061,0.002699262,0.7583238,0.0004318137,0.0004568918,0.0006366373,0.0007682034,0.000358645,0.01691863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00899455,"threshold_uncertainty_score":0.03008974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2920804790","doi":"10.1214/20-ba1221","title":"Rank-Normalization, Folding, and Localization: An Improved Rˆ for Assessing Convergence of MCMC (with Discussion)","year":2020,"lang":"en","type":"article","venue":"Bayesian Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1511,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Convergence (economics); Monte Carlo method; Bayesian probability; Variance (accounting); Markov chain; TRACE (psycholinguistics); Rank (graph theory)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.04196391283684291,"gpt":0.3385584988034436,"spread":0.2965945859666007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03569611,0.001531974,0.001976541,0.004980119,0.001119761,0.0029916,0.002569912,0.002817012,0.004656369],"category_scores_gemma":[0.1443515,0.0008272609,0.001616429,0.004256886,0.004477814,0.004786925,0.003237365,0.003721871,0.001585062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00155286,"about_ca_system_score_gemma":0.002606287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00353431,"about_ca_topic_score_gemma":0.003010541,"domain_scores_codex":[0.9778306,0.01669447,0.000865349,0.001618873,0.002441913,0.0005487765],"domain_scores_gemma":[0.9168884,0.05485728,0.006993495,0.01314356,0.007253121,0.0008641992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003933327,0.0001267914,0.01816742,0.0005257684,0.0002377503,0.0004926816,0.0009171144,0.2035652,0.00647662,0.3429332,0.01009364,0.4160705],"study_design_scores_gemma":[0.00006767938,0.000272439,0.004609091,0.0002201569,0.00009654148,0.0006069932,0.0001702371,0.7658701,0.009321979,0.2078072,0.01074566,0.0002118464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005639922,0.000506986,0.9917001,0.0003305839,0.00004067413,0.00005764285,0.00005919136,0.0007592411,0.0009054999],"genre_scores_gemma":[0.1662873,0.0005077009,0.8299476,0.0004514922,0.0001241928,0.0003234995,0.0001788058,0.0008715082,0.001308016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03569611,"threshold_uncertainty_score":0.1887813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032916024","doi":"10.1111/j.1751-5823.2002.tb00178.x","title":"On Choosing and Bounding Probability Metrics","year":2002,"lang":"en","type":"article","venue":"International Statistical Review","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1204,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Metric (unit); Convergence (economics); Mathematics; Computer science; Mathematical optimization; Artificial intelligence","authors":[{"name":"Alison L. Gibbs","is_ca":true},{"name":"Francis Edward Su","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2082485533330793,"gpt":0.4373832283630112,"spread":0.229134675029932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03748922,0.002487902,0.002704095,0.005411425,0.002328569,0.00501334,0.002681845,0.003765523,0.00474393],"category_scores_gemma":[0.1273242,0.00099219,0.001930548,0.004167788,0.009642236,0.01772406,0.006059724,0.01037709,0.001903921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003432353,"about_ca_system_score_gemma":0.001217108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001564123,"about_ca_topic_score_gemma":0.0009006594,"domain_scores_codex":[0.9768538,0.01464557,0.001384698,0.002291831,0.004153055,0.0006710207],"domain_scores_gemma":[0.852068,0.1238492,0.00546203,0.006569994,0.01012384,0.00192684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002114423,0.00001363462,0.000405827,0.0002136358,0.000025368,0.0001372205,0.0002258122,0.01316825,0.0004372081,0.9611127,0.003315843,0.0209233],"study_design_scores_gemma":[0.000003225455,0.00002612321,0.0001828336,0.0001870649,0.00001029976,0.0001253412,0.00005209464,0.02487333,0.0003464752,0.9678416,0.006327924,0.00002382766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008714172,0.01730264,0.9406816,0.007153345,0.0006879052,0.00007677075,0.00009397345,0.0001873997,0.02510218],"genre_scores_gemma":[0.3566495,0.0324857,0.5833833,0.004747985,0.004208121,0.0009387376,0.0003972407,0.001141204,0.01604827],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03748922,"threshold_uncertainty_score":0.1982643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047978125","doi":"10.1198/jcgs.2009.06134","title":"Examples of Adaptive MCMC","year":2009,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1078,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Metropolis–Hastings algorithm; Gibbs sampling; Markov chain; Computer science; Algorithm; Logarithm; Dimension (graph theory); Multivariate statistics; Mathematics; Artificial intelligence; Machine learning; Bayesian probability","authors":[{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05855318414416023,"gpt":0.3456207258929976,"spread":0.2870675417488374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003695775,0.0009190395,0.0008231438,0.001271561,0.001235595,0.001311579,0.002834996,0.002437905,0.008912517],"category_scores_gemma":[0.02391514,0.0006975124,0.00112203,0.003043755,0.0015641,0.001511101,0.001832315,0.002497395,0.001861866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009961292,"about_ca_system_score_gemma":0.001075163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005269811,"about_ca_topic_score_gemma":0.006295701,"domain_scores_codex":[0.9971016,0.001500349,0.0001413983,0.0004011524,0.0007039108,0.0001515126],"domain_scores_gemma":[0.9899816,0.006667371,0.0003400539,0.001797751,0.001042967,0.000170279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001642213,0.0001120719,0.003667168,0.0005319978,0.0002265423,0.0003998415,0.0003796455,0.2734222,0.002098305,0.536166,0.01684911,0.1659829],"study_design_scores_gemma":[0.0000712102,0.00003193084,0.000715571,0.00007268038,0.00004955076,0.0002894248,0.00004256489,0.6574975,0.001956271,0.3049339,0.03428167,0.00005776466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006121587,0.00152718,0.9789928,0.0004458851,0.0001290098,0.00009562868,0.0002466497,0.0008795855,0.01156175],"genre_scores_gemma":[0.1741015,0.002163192,0.8135062,0.000489378,0.0001963166,0.000430419,0.0007628929,0.0007683732,0.007581601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008912517,"threshold_uncertainty_score":0.02981532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1840847274","doi":"10.1201/9781003453420-2","title":"MCMC Using Hamiltonian Dynamics","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":542,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Statistical physics; Hamiltonian mechanics; Computation; Discretization; Hybrid Monte Carlo; Jacobian matrix and determinant; Applied mathematics; Monte Carlo method; Computer science; Mathematics; Mathematical optimization; Markov chain Monte Carlo; Algorithm; Physics; Mathematical analysis; Phase space; Quantum mechanics","authors":[{"name":"Radford M. Neal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2636789587258027,"gpt":0.4074502954342012,"spread":0.1437713367083986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001456089,0.001265292,0.002126502,0.001689066,0.001541944,0.002151456,0.003068518,0.00238853,0.03261928],"category_scores_gemma":[0.009242723,0.001151937,0.001869079,0.001833781,0.001093883,0.001732363,0.002131212,0.002780322,0.0049599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550994,"about_ca_system_score_gemma":0.002502639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01804688,"about_ca_topic_score_gemma":0.02016118,"domain_scores_codex":[0.9991604,0.0003560437,0.00003899082,0.0001720831,0.0001936526,0.00007885938],"domain_scores_gemma":[0.9968117,0.002075162,0.0001434048,0.0004072038,0.0004350922,0.0001274817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001627221,0.000105583,0.002422613,0.0005908765,0.000390289,0.0002995666,0.0001922392,0.7344863,0.001516368,0.1548906,0.02112601,0.08381696],"study_design_scores_gemma":[0.0000539379,0.00001517781,0.0002052844,0.00005369693,0.00003146503,0.00003300543,0.00001994648,0.9246695,0.0005718106,0.06414891,0.01016795,0.00002925496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008112296,0.0014442,0.9635806,0.0008812586,0.0005702575,0.0002712801,0.002204426,0.004790191,0.01814547],"genre_scores_gemma":[0.2036018,0.001485769,0.7649649,0.001155214,0.0004484732,0.001641208,0.004757557,0.002613325,0.01933171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03261928,"threshold_uncertainty_score":0.1091223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006582998","doi":"10.1239/jap/1183667414","title":"Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":382,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ergodicity; Mathematics; Counterexample; Markov chain; Markov chain Monte Carlo; Convergence (economics); Coupling (piping); Markov chain mixing time; Monte Carlo method; Algorithm; Statistical physics; Applied mathematics; Markov model; Discrete mathematics; Markov property; Statistics","authors":[{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05514559893675608,"gpt":0.3196763472424737,"spread":0.2645307483057177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007942821,0.0009539833,0.001364857,0.00157016,0.001176371,0.002081172,0.00213669,0.001374,0.002344527],"category_scores_gemma":[0.04429974,0.0006583271,0.001259883,0.0009497653,0.003452071,0.003533236,0.004465282,0.002716701,0.0003759337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396213,"about_ca_system_score_gemma":0.001294108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001407666,"about_ca_topic_score_gemma":0.00073671,"domain_scores_codex":[0.9963313,0.001782557,0.0001895046,0.0005157447,0.0008497032,0.0003312484],"domain_scores_gemma":[0.9683355,0.02408538,0.00212982,0.002310489,0.001847552,0.001291339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001221527,0.00007776385,0.001923359,0.00009992306,0.00009929382,0.000116467,0.0002728541,0.2049289,0.00414103,0.7775363,0.000436791,0.01024507],"study_design_scores_gemma":[0.00002780908,0.00007181094,0.0003698919,0.00002438216,0.00002354084,0.00004568565,0.00002759403,0.7986093,0.001707269,0.1983984,0.0006742488,0.00002008769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05152847,0.0001691423,0.9437451,0.0002897998,0.00002324213,0.00005539647,0.0000366965,0.000135487,0.004016622],"genre_scores_gemma":[0.9202231,0.0003254503,0.0765617,0.0002018426,0.00008251829,0.0002498257,0.0001182901,0.0001541227,0.002083177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007942821,"threshold_uncertainty_score":0.04200619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090251478","doi":"10.1214/aoap/1019487508","title":"Analysis of a nonreversible Markov chain sampler","year":2000,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":283,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Markov chain; Mathematics; Markov chain mixing time; Balance equation; Variable-order Markov model; Sampling (signal processing); Markov model; Simple (philosophy); Probabilistic logic; Markov renewal process; Convergence (economics); Markov property; Markov chain Monte Carlo; Continuous-time Markov chain; Applied mathematics; Chain (unit); Examples of Markov chains; Additive Markov chain; Markov process; Statistics; Computer science; Bayesian probability","authors":[{"name":"Persi Diaconis","is_ca":true},{"name":"Susan Holmes","is_ca":true},{"name":"Radford M. Neal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1697908186442776,"gpt":0.3809267444006278,"spread":0.2111359257563503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007338976,0.000782844,0.001410209,0.001391607,0.0008984575,0.001614814,0.002743425,0.001869207,0.007597664],"category_scores_gemma":[0.02852943,0.0009004952,0.0009324725,0.0006486918,0.003036137,0.002639008,0.002337807,0.00230748,0.0007754239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002095284,"about_ca_system_score_gemma":0.00256095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003017681,"about_ca_topic_score_gemma":0.002275418,"domain_scores_codex":[0.9979582,0.0008738617,0.00008054949,0.0002866549,0.0005780612,0.0002226687],"domain_scores_gemma":[0.9769052,0.01779798,0.001416283,0.001251368,0.001709128,0.0009199522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001553126,0.0001128588,0.001864558,0.0001830506,0.00007367411,0.000278347,0.0002741419,0.4475165,0.00405247,0.5355446,0.00128998,0.008654555],"study_design_scores_gemma":[0.0000140685,0.00001671844,0.00008329508,0.000009088361,0.000004937196,0.00001913751,0.000008019318,0.9653899,0.0003488245,0.03388916,0.0002098586,0.000007007239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07584141,0.0003323185,0.9182591,0.0006355633,0.00005274234,0.0001704238,0.0001217398,0.0003437724,0.004242928],"genre_scores_gemma":[0.8425357,0.0004922438,0.1441205,0.0003660408,0.0001231495,0.000494058,0.0004422438,0.0003800404,0.01104604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007597664,"threshold_uncertainty_score":0.03881264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2941443959","doi":"10.1103/physrevd.100.034515","title":"Flow-based generative models for Markov chain Monte Carlo in lattice field theory","year":2019,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":227,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Argonne National Laboratory; Nuclear Physics; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; U.S. Department of Energy; Office of Science","keywords":"Statistical physics; Markov chain Monte Carlo; Generative grammar; Monte Carlo method; Markov chain; Computer science; Mathematics; Physics; Artificial intelligence; Machine learning; Statistics","authors":[{"name":"Michael S. Albergo","is_ca":true},{"name":"Gurtej Kanwar","is_ca":false},{"name":"Phiala E. Shanahan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04610510541183537,"gpt":0.4599356051944695,"spread":0.4138304997826341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002997915,0.0006451083,0.001030163,0.001074304,0.0008501905,0.001379549,0.002446269,0.001618358,0.003790851],"category_scores_gemma":[0.008367992,0.0006513058,0.001160102,0.0009731914,0.002475001,0.0023703,0.001387925,0.002791195,0.0007793189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002499275,"about_ca_system_score_gemma":0.001441144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004875115,"about_ca_topic_score_gemma":0.004556618,"domain_scores_codex":[0.9991457,0.0004975487,0.00003021364,0.00008315517,0.0001862277,0.00005700066],"domain_scores_gemma":[0.9964073,0.002672899,0.0001824529,0.000343242,0.0002406648,0.0001534435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002316318,0.00003227956,0.000313326,0.00004402275,0.00001577391,0.00003722604,0.00008435709,0.4053113,0.000523636,0.5791783,0.0009813814,0.01345513],"study_design_scores_gemma":[0.000004705876,0.000005729003,0.0000238125,0.000007841941,0.000002265133,0.000008259983,0.000003049093,0.9122315,0.0001277306,0.08702154,0.0005566547,0.000006785669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004153105,0.0001799306,0.9937547,0.0001914528,0.00004542369,0.00004009935,0.00004018587,0.0001394889,0.001455568],"genre_scores_gemma":[0.3677125,0.001014822,0.6210917,0.0003576005,0.0002872509,0.0007610997,0.0003230651,0.0004207583,0.008031163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004875115,"threshold_uncertainty_score":0.01813364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963561977","doi":"","title":"The bouncy particle sampler: A non-reversible rejection free Markov chain Monte Carlo method","year":2017,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council","keywords":"Markov chain Monte Carlo; Monte Carlo method; Markov chain; Statistical physics; Mathematics; Applied mathematics; Markov chain mixing time; Particle filter; Computer science; Physics; Balance equation; Statistics; Markov model; Kalman filter","authors":[{"name":"Sebastian J. Vollmer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07136927114476796,"gpt":0.3376477929546848,"spread":0.2662785218099168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003124238,0.0007269172,0.001597579,0.0007411908,0.0006557876,0.001317778,0.004019453,0.001953873,0.005526665],"category_scores_gemma":[0.01059623,0.000783266,0.0009980839,0.0009205451,0.001292485,0.001569178,0.001866353,0.002964455,0.001624311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000922653,"about_ca_system_score_gemma":0.00291513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007696944,"about_ca_topic_score_gemma":0.008341713,"domain_scores_codex":[0.9986079,0.0007180176,0.00004495115,0.0001912136,0.0003245688,0.0001133007],"domain_scores_gemma":[0.9936941,0.004799971,0.0002407324,0.0006120112,0.0004369665,0.0002161184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003079794,0.0001414864,0.001193074,0.0002230979,0.0001563769,0.0002203132,0.0001493934,0.7843727,0.002466114,0.1240891,0.004019865,0.08266052],"study_design_scores_gemma":[0.0000331304,0.000008149937,0.00004209995,0.00000776632,0.000007049524,0.00001344712,0.000002950918,0.9878526,0.0003056737,0.01094979,0.000769502,0.000007923061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003373113,0.0001677077,0.9946872,0.00009675192,0.00004019128,0.00007462974,0.00006731936,0.0005970451,0.0008959443],"genre_scores_gemma":[0.2038371,0.0003710924,0.789465,0.0003330495,0.0001373395,0.0005325105,0.0005845038,0.0006006439,0.004138781],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007696944,"threshold_uncertainty_score":0.01848853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1550160156","doi":"10.1090/fim/016","title":"Lectures on Monte Carlo Methods","year":2001,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Monte Carlo method; Markov chain Monte Carlo; Variance reduction; Statistical physics; Monte Carlo method in statistical physics; Computer science; Markov chain; Variance (accounting); Hybrid Monte Carlo; Ising model; Mathematics; Statistics; Physics; Economics","authors":[{"name":"Neal Madras","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06093238297592173,"gpt":0.3924025198980453,"spread":0.3314701369221235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002484135,0.001575198,0.001195984,0.001573702,0.0009667492,0.003400133,0.001483178,0.002237954,0.05398055],"category_scores_gemma":[0.01010151,0.0008861565,0.00134183,0.002118188,0.002241546,0.004239505,0.00195996,0.005147316,0.02444387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002176594,"about_ca_system_score_gemma":0.002087314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002008192,"about_ca_topic_score_gemma":0.001908683,"domain_scores_codex":[0.9978166,0.0005976151,0.0001087792,0.0002880171,0.001053283,0.0001356687],"domain_scores_gemma":[0.99573,0.002979282,0.0001100851,0.0004087685,0.0006123229,0.0001595968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001139725,0.0000333767,0.0001623997,0.000245191,0.00003077857,0.00006463748,0.0001260632,0.007403826,0.0002474815,0.7969601,0.1056825,0.08903227],"study_design_scores_gemma":[0.00001012565,0.00001250506,0.0001408024,0.0002506586,0.00001037423,0.0001145082,0.00002120461,0.007514697,0.0001775063,0.6414321,0.3502947,0.00002070162],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009999087,0.04548958,0.5301592,0.01177207,0.00507826,0.0001481273,0.001142584,0.001483827,0.4037264],"genre_scores_gemma":[0.06654096,0.0798897,0.4364026,0.007816581,0.00941344,0.0007504701,0.002311534,0.002398993,0.3944758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05398055,"threshold_uncertainty_score":0.1805829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075954168","doi":"10.1007/s11009-006-8550-0","title":"An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift","year":2006,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":160,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Metropolis–Hastings algorithm; Mathematics; Convergence (economics); Algorithm; Random walk; Langevin dynamics; Mathematical optimization; Markov chain Monte Carlo; Monte Carlo method; Statistics","authors":[{"name":"Yves F. Atchadé","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1348409524048685,"gpt":0.3571457967899159,"spread":0.2223048443850474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003274243,0.0008222312,0.001307973,0.0008082345,0.0007418073,0.001352477,0.003966899,0.002262232,0.007986627],"category_scores_gemma":[0.01182711,0.0006498629,0.001289979,0.001130999,0.001665456,0.002802832,0.002485652,0.003406487,0.001964762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051003,"about_ca_system_score_gemma":0.002871212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004024676,"about_ca_topic_score_gemma":0.003813891,"domain_scores_codex":[0.9986318,0.000547733,0.00007707941,0.0001994055,0.0004470077,0.00009701322],"domain_scores_gemma":[0.9968202,0.001627367,0.0001448913,0.0004919906,0.0007297306,0.0001858139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002371475,0.0001557276,0.0008534045,0.0001827854,0.0001499645,0.0001685739,0.0001653246,0.3978527,0.005410199,0.4894509,0.005028884,0.1003444],"study_design_scores_gemma":[0.00002347185,0.00002048936,0.00006520946,0.00001034641,0.00001050304,0.00002566939,0.000004686903,0.9631226,0.0003839438,0.03462885,0.001686412,0.00001788243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002716752,0.0001016989,0.9955837,0.0001219755,0.0001178621,0.00004201903,0.00002980778,0.0001232142,0.001162956],"genre_scores_gemma":[0.09800042,0.0003340796,0.8902299,0.0002569821,0.0002462177,0.0004067348,0.0002259388,0.000485265,0.009814452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007986627,"threshold_uncertainty_score":0.02671796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146960149","doi":"10.1007/s11222-010-9192-1","title":"Towards optimal scaling of metropolis-coupled Markov chain Monte Carlo","year":2010,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Parallel tempering; Metropolis–Hastings algorithm; Markov chain Monte Carlo; Monte Carlo method; Scaling; Markov chain; Random walk; Statistical physics; Mathematics; Mathematical optimization; Work (physics); Hybrid Monte Carlo; Applied mathematics; Computer science; Algorithm; Statistics; Physics; Thermodynamics","authors":[{"name":"Yves F. Atchadé","is_ca":false},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02539699512440044,"gpt":0.334028828772443,"spread":0.3086318336480425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0108433,0.001807771,0.003721558,0.002833842,0.00175908,0.003420283,0.004266121,0.002742767,0.006341679],"category_scores_gemma":[0.05847458,0.002238675,0.001694885,0.001889876,0.004843056,0.006270037,0.006767162,0.005121316,0.001212223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003370475,"about_ca_system_score_gemma":0.003610376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006374404,"about_ca_topic_score_gemma":0.00539117,"domain_scores_codex":[0.9942555,0.003454298,0.0002495206,0.0005217446,0.001167794,0.0003511149],"domain_scores_gemma":[0.9713859,0.02060536,0.0009208607,0.003284781,0.002628885,0.001174214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001487821,0.0001420194,0.0006588792,0.0002050045,0.00008081056,0.00006786059,0.0001906018,0.3292986,0.001011283,0.6449445,0.002924315,0.02032742],"study_design_scores_gemma":[0.000008634805,0.000007066595,0.00003958551,0.00001537387,0.000005941387,0.000005260104,0.000008256764,0.8633922,0.0001350287,0.1358809,0.0004930487,0.000008713963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0124618,0.0007893984,0.9790351,0.0006184093,0.0002291178,0.0000876635,0.00007149792,0.0005270777,0.006179801],"genre_scores_gemma":[0.4728423,0.001614899,0.5130759,0.0008351231,0.0006704575,0.0008148266,0.0004265318,0.00178616,0.007933748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0108433,"threshold_uncertainty_score":0.05734557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162340617","doi":"10.1198/jasa.2009.tm08393","title":"Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC","year":2009,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":131,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Social Sciences and Humanities Research Council","funders":"","keywords":"Markov chain Monte Carlo; Chain (unit); Computer science; Mathematics; Artificial intelligence; Bayesian probability; Physics","authors":[{"name":"Radu V. Craiu","is_ca":true},{"name":"Jeffrey S. Rosenthal","is_ca":true},{"name":"Chao Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03818152078787884,"gpt":0.3317143763202894,"spread":0.2935328555324106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003695254,0.0006267237,0.001125977,0.0008399992,0.0008075682,0.001083352,0.002686438,0.001228086,0.004461195],"category_scores_gemma":[0.01632134,0.0006238932,0.0007064096,0.001039416,0.001223316,0.00192794,0.001817164,0.00198809,0.0009446613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260647,"about_ca_system_score_gemma":0.001797326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01348637,"about_ca_topic_score_gemma":0.01955522,"domain_scores_codex":[0.9986832,0.0006443657,0.00004432424,0.0003053403,0.0002432777,0.00007966054],"domain_scores_gemma":[0.9945691,0.003167807,0.0002779859,0.001163347,0.0006442563,0.0001774872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002454034,0.0001014904,0.002626442,0.00007625726,0.0001209672,0.00007677865,0.0001516162,0.7839401,0.0007456999,0.07581501,0.003213632,0.1328866],"study_design_scores_gemma":[0.00001168839,0.000006338014,0.00008639668,0.000003413124,0.000005211226,0.000008888085,0.00000531772,0.9853272,0.0002006422,0.0139062,0.0004331837,0.000005555453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01655084,0.0002776636,0.9796666,0.0002410412,0.00005914201,0.00008242312,0.00007877916,0.0006803937,0.002363029],"genre_scores_gemma":[0.3295461,0.0002485423,0.6646644,0.000251183,0.00009181853,0.0002640177,0.0003570412,0.0004225683,0.004154457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01348637,"threshold_uncertainty_score":0.02681571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084668838","doi":"10.1016/j.spa.2007.12.005","title":"Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234","year":2008,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Algorithm; Metropolis–Hastings algorithm; Applied mathematics; Mathematical optimization; Statistics; Monte Carlo method; Markov chain Monte Carlo","authors":[{"name":"Mylène Bédard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04884437887349389,"gpt":0.3535913551804132,"spread":0.3047469763069193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01605628,0.001481282,0.00255057,0.001779164,0.001602415,0.003528679,0.003845279,0.002612951,0.008900256],"category_scores_gemma":[0.08676199,0.001372239,0.001404796,0.001617778,0.004040934,0.008412846,0.003558718,0.00683081,0.001851663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003082204,"about_ca_system_score_gemma":0.003723035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003503657,"about_ca_topic_score_gemma":0.002781352,"domain_scores_codex":[0.993064,0.004326362,0.0002432504,0.0007802065,0.001019089,0.0005671],"domain_scores_gemma":[0.9166231,0.07343544,0.001486683,0.003893974,0.003304569,0.001256288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000239879,0.0001380309,0.0007413942,0.0001756015,0.00006605245,0.00004242227,0.0001947379,0.1482018,0.0006535765,0.8121417,0.004208717,0.03319612],"study_design_scores_gemma":[0.00004984274,0.0000409677,0.0001453918,0.00005345397,0.00002566441,0.00002718201,0.0000266987,0.6159455,0.0006248625,0.3813668,0.001664349,0.00002930441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01455015,0.001264034,0.9763415,0.001159681,0.0001717071,0.00009937709,0.00007291971,0.000301336,0.00603922],"genre_scores_gemma":[0.4858315,0.00302669,0.4891175,0.001040955,0.0008932082,0.0009878107,0.0004027551,0.0009018077,0.01779786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01605628,"threshold_uncertainty_score":0.08491474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048759201","doi":"10.1007/s00440-007-0131-9","title":"On the hardness of sampling independent sets beyond the tree threshold","year":2008,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Office of Naval Research; Microsoft Research; National Science Foundation","keywords":"Mathematics; Gibbs measure; Markov chain; Gibbs sampling; Combinatorics; Markov chain Monte Carlo; Discrete mathematics; Bipartite graph; Random graph; Monte Carlo method; Graph; Statistics; Bayesian probability","authors":[{"name":"Elchanan Mossel","is_ca":false},{"name":"Dror Weitz","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07685186113986163,"gpt":0.3136031688352385,"spread":0.2367513076953768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01243789,0.001177186,0.004654651,0.002826225,0.003673368,0.005702367,0.00505524,0.005809138,0.008957727],"category_scores_gemma":[0.1117457,0.002009594,0.002658565,0.003229421,0.0110056,0.02041619,0.007143868,0.01294709,0.000844607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004151356,"about_ca_system_score_gemma":0.002923774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00433185,"about_ca_topic_score_gemma":0.002581293,"domain_scores_codex":[0.9923011,0.003816361,0.0002908834,0.001042023,0.001758288,0.0007913859],"domain_scores_gemma":[0.7645842,0.2207762,0.003377896,0.006487382,0.002211822,0.002562492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000218362,0.00008618148,0.001094746,0.0001894277,0.00004918567,0.0001198944,0.000407787,0.03751373,0.0003391659,0.9482026,0.004581645,0.00719733],"study_design_scores_gemma":[0.00003914686,0.00001168252,0.0002122061,0.00002944391,0.00001205111,0.00003759988,0.00003074296,0.08428614,0.0001013276,0.9147867,0.000438395,0.00001447328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2257877,0.005306824,0.6892011,0.02521393,0.0005598674,0.0001918898,0.001252057,0.0007903125,0.05169642],"genre_scores_gemma":[0.9073522,0.003178857,0.07006332,0.00377062,0.00186189,0.0004938669,0.001041956,0.0006492872,0.01158805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243789,"threshold_uncertainty_score":0.06577867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153811005","doi":"10.1111/j.1467-9868.2005.00500.x","title":"Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms","year":2005,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series B (Statistical Methodology)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metropolis–Hastings algorithm; Convergence (economics); Algorithm; Random walk; Transient (computer programming); Scaling; Path (computing); Trajectory; Langevin dynamics; Computer science; Statistical physics; Mathematics; Physics; Monte Carlo method; Statistics; Markov chain Monte Carlo","authors":[{"name":"Ole Fredslund Christensen","is_ca":false},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1757608270161161,"gpt":0.4326136336505182,"spread":0.2568528066344021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00917729,0.0006971658,0.001276468,0.00178644,0.001921544,0.003544734,0.002320152,0.001725538,0.008131994],"category_scores_gemma":[0.08022448,0.0006494828,0.00132984,0.0009402247,0.00505923,0.006650928,0.003040998,0.004163811,0.001135852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002398453,"about_ca_system_score_gemma":0.001416937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00177173,"about_ca_topic_score_gemma":0.0008929954,"domain_scores_codex":[0.9965539,0.001642324,0.0001907239,0.0004347387,0.0008315198,0.0003468645],"domain_scores_gemma":[0.9526905,0.03594292,0.002412526,0.003585156,0.003472328,0.00189657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005732393,0.00004564556,0.0005097555,0.00007309243,0.00001990935,0.00008844277,0.0002152717,0.02514439,0.0008101037,0.9664733,0.001531601,0.005031164],"study_design_scores_gemma":[0.00003058519,0.00004772227,0.0003154101,0.00005682682,0.00001485143,0.00005221689,0.00006518582,0.3824528,0.0009873443,0.6142119,0.001736442,0.00002869253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1290786,0.002087172,0.8196063,0.003159565,0.0003199229,0.0001910828,0.0001357467,0.001209987,0.04421167],"genre_scores_gemma":[0.9156134,0.0009574697,0.07264598,0.0006539191,0.0003658386,0.000714917,0.000173546,0.0007116044,0.008163328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00917729,"threshold_uncertainty_score":0.04853469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168173277","doi":"10.1002/1098-2418(200010/12)17:3/4<290::aid-rsa6>3.0.co;2-q","title":"Extension of Fill's perfect rejection sampling algorithm to general chains","year":2000,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Western University","funders":"","keywords":"Extension (predicate logic); Randomness; Bounding overwatch; Algorithm; Sampling (signal processing); Computer science; Simple (philosophy); Connection (principal bundle); Rejection sampling; Mathematics; Theoretical computer science; Artificial intelligence; Statistics; Programming language; Hybrid Monte Carlo; Markov chain Monte Carlo","authors":[{"name":"James Allen Fill","is_ca":false},{"name":"Motoya Machida","is_ca":false},{"name":"Duncan J. Murdoch","is_ca":true},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04046938814774089,"gpt":0.3395489419876489,"spread":0.299079553839908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007727746,0.0006745356,0.001322734,0.001418052,0.0008683723,0.001689432,0.002966059,0.001822175,0.004869838],"category_scores_gemma":[0.02817465,0.0006512977,0.001413378,0.001373836,0.002394612,0.003188899,0.004807571,0.002711489,0.001077536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105157,"about_ca_system_score_gemma":0.002014113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001796972,"about_ca_topic_score_gemma":0.001636517,"domain_scores_codex":[0.9965127,0.001491386,0.0001812526,0.0004694478,0.001071836,0.0002733306],"domain_scores_gemma":[0.9897631,0.00601688,0.0004449057,0.002351377,0.001091506,0.0003321492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002469296,0.0001039826,0.001399835,0.0001434501,0.0000740508,0.0001917342,0.000305658,0.1762895,0.00223692,0.6427599,0.003929606,0.1723185],"study_design_scores_gemma":[0.00004367485,0.00006100117,0.0001549759,0.00002149639,0.00001545744,0.0001146929,0.00001859464,0.7810189,0.001382797,0.2115465,0.005597035,0.00002488724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002942312,0.00004323458,0.994969,0.0001189117,0.00001854935,0.00004248516,0.00002990927,0.0002197047,0.001615924],"genre_scores_gemma":[0.1722412,0.0002243512,0.8216298,0.0003823242,0.0001233476,0.0003172409,0.0002273784,0.0002635269,0.004590862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007727746,"threshold_uncertainty_score":0.0408687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3099541808","doi":"10.6084/m9.figshare.1581629.v2","title":"Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations","year":2019,"lang":"en","type":"article","venue":"Figshare","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain Monte Carlo; Mathematics; Applied mathematics; Mathematical optimization; Inference; Ergodicity; Approximate inference; Markov chain; Convergence (economics); Monte Carlo method; Algorithm; Computer science; Statistics; Artificial intelligence","authors":[{"name":"Patrick R. Conrad","is_ca":false},{"name":"Youssef Marzouk","is_ca":false},{"name":"Natesh S. Pillai","is_ca":false},{"name":"Aaron Smith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1740633116752489,"gpt":0.3590485212035675,"spread":0.1849852095283185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005099405,0.001104978,0.001404044,0.001213048,0.0008452092,0.001320679,0.002841003,0.001288536,0.005528803],"category_scores_gemma":[0.02257735,0.0008678408,0.001120669,0.001231089,0.001862787,0.001844104,0.002661637,0.00348499,0.001519468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907935,"about_ca_system_score_gemma":0.003420989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0078088,"about_ca_topic_score_gemma":0.01355825,"domain_scores_codex":[0.9983911,0.0007041308,0.00007007429,0.0002436381,0.0004739892,0.0001169708],"domain_scores_gemma":[0.9910269,0.006262861,0.0005189312,0.001350038,0.0005872443,0.0002538744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009640127,0.00007487331,0.001623074,0.000154097,0.00007832802,0.0001220008,0.0001568644,0.7959393,0.003068032,0.1449922,0.001916043,0.05177887],"study_design_scores_gemma":[0.000008816254,0.000009215937,0.00006413224,0.000008961087,0.000005608534,0.00001316914,0.000005401113,0.9756542,0.0006720148,0.02291287,0.0006394085,0.000006136867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002081153,0.00006073667,0.9968509,0.00007472691,0.000012994,0.00002236492,0.0000287662,0.0004148881,0.0004535439],"genre_scores_gemma":[0.1526445,0.0002852016,0.8436448,0.0002136858,0.00007808943,0.000361684,0.0002933798,0.00054635,0.001932408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0078088,"threshold_uncertainty_score":0.02696854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1737070927","doi":"10.1080/01621459.2015.1096787","title":"Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations","year":2015,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Markov chain Monte Carlo; Ergodicity; Importance sampling; Inference; Monte Carlo method; Convergence (economics); Gaussian process; Ode; Rejection sampling","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1125788164123556,"gpt":0.3749705992627148,"spread":0.2623917828503592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005983412,0.001209664,0.001745002,0.001376195,0.0009167892,0.001328874,0.003093245,0.001328087,0.004374203],"category_scores_gemma":[0.02738023,0.0009472236,0.001238629,0.001410088,0.001975241,0.002005706,0.002743863,0.003832951,0.001195633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002130493,"about_ca_system_score_gemma":0.004021254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009847834,"about_ca_topic_score_gemma":0.01613588,"domain_scores_codex":[0.9980395,0.0008909802,0.00008777395,0.0002818604,0.0005621357,0.0001376429],"domain_scores_gemma":[0.9879622,0.008689043,0.000664069,0.001627495,0.0007541677,0.0003031007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009851236,0.00007641284,0.001673721,0.000148991,0.00008235216,0.0001126011,0.0001634311,0.831586,0.002256931,0.1167255,0.001405104,0.04567062],"study_design_scores_gemma":[0.000008681932,0.000009047733,0.00005894403,0.00000812627,0.000005973278,0.00001166881,0.000005509275,0.9807003,0.000486436,0.01825795,0.0004419342,0.00000548599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002491777,0.00007248847,0.9965475,0.00007415732,0.00001174102,0.00002452313,0.00002374609,0.0003643713,0.0003896295],"genre_scores_gemma":[0.167808,0.0003132933,0.8287966,0.0002064562,0.00008293198,0.0004021935,0.0002641975,0.0004516448,0.001674687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009847834,"threshold_uncertainty_score":0.03164369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128598176","doi":"10.1111/1467-9469.00250","title":"Markov Chains and De‐initializing Processes","year":2001,"lang":"en","type":"article","venue":"Scandinavian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Initialization; Markov chain Monte Carlo; Markov chain mixing time; Mathematics; Convergence (economics); Variable-order Markov model; Examples of Markov chains; Markov process; Additive Markov chain; Markov model; Markov property; Applied mathematics; Markov kernel; Monte Carlo method; Mathematical optimization; Computer science; Statistics; Economics","authors":[{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06189568995941064,"gpt":0.3586947562524259,"spread":0.2967990662930153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918014,0.001182648,0.0007825091,0.00201209,0.001192346,0.002327148,0.0013459,0.00145886,0.004168684],"category_scores_gemma":[0.01401898,0.0006193645,0.001032983,0.001815315,0.004479558,0.003712838,0.003286899,0.004506454,0.0005766104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039131,"about_ca_system_score_gemma":0.001594661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002746825,"about_ca_topic_score_gemma":0.001394145,"domain_scores_codex":[0.9975229,0.0009020409,0.0001533398,0.0005364182,0.0005362964,0.0003489185],"domain_scores_gemma":[0.9889562,0.006820348,0.001263026,0.000920761,0.001457885,0.0005818695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001395416,0.0000132376,0.0003749871,0.00002948585,0.00001241353,0.00006196208,0.0001742924,0.01890994,0.0005826405,0.9761223,0.0003123195,0.003392469],"study_design_scores_gemma":[0.0000116889,0.00002856623,0.0003313492,0.00005223643,0.00001455803,0.00007785641,0.00006549624,0.1161957,0.001058828,0.8760915,0.006050163,0.00002206197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02517946,0.001114803,0.9603215,0.0007821882,0.0001079527,0.00007013416,0.0001747912,0.0001159996,0.01213314],"genre_scores_gemma":[0.7115876,0.003687825,0.2685357,0.0008151939,0.0003958963,0.0005797827,0.0007991705,0.0001973364,0.0134015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004168684,"threshold_uncertainty_score":0.02072066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979619742","doi":"10.1007/s11222-012-9373-1","title":"Split Hamiltonian Monte Carlo","year":2013,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Monte Carlo method; Hamiltonian (control theory); Gaussian; Mathematics; Statistical physics; Applied mathematics; Quadratic equation; Hybrid Monte Carlo; Hamiltonian mechanics; Computation; Mathematical optimization; Algorithm; Physics; Markov chain Monte Carlo; Quantum mechanics; Statistics; Phase space; Geometry","authors":[{"name":"Babak Shahbaba","is_ca":false},{"name":"Shiwei Lan","is_ca":false},{"name":"Wesley O. Johnson","is_ca":false},{"name":"Radford M. Neal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03487638221484857,"gpt":0.3229034758441773,"spread":0.2880270936293287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550485,0.000566926,0.001588453,0.00118122,0.00101054,0.001715487,0.001483576,0.001461239,0.0167207],"category_scores_gemma":[0.008089245,0.0006077226,0.0007658478,0.001036086,0.002351452,0.002788522,0.002369202,0.002055384,0.001580266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008779224,"about_ca_system_score_gemma":0.0009814436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053223,"about_ca_topic_score_gemma":0.001635416,"domain_scores_codex":[0.9989139,0.0005056562,0.00002755375,0.000149142,0.0003069473,0.00009683909],"domain_scores_gemma":[0.9961274,0.002126863,0.0001471518,0.0008888886,0.0004242309,0.0002854101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004722812,0.00003606566,0.0002267185,0.00004514062,0.00002916508,0.00002772876,0.00006012212,0.03785166,0.000335456,0.9441083,0.002505156,0.01472732],"study_design_scores_gemma":[0.00001547915,0.00001183411,0.0001054379,0.000013094,0.000009592772,0.00002305393,0.0000144641,0.2892271,0.0002853188,0.7081249,0.002161042,0.00000862207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0277823,0.0007626922,0.9437878,0.0007355127,0.0002755435,0.00007445255,0.0002048937,0.000428724,0.02594799],"genre_scores_gemma":[0.6472837,0.0006543354,0.3139083,0.000754636,0.0003430176,0.0003420553,0.0006080049,0.0006900652,0.03541593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0167207,"threshold_uncertainty_score":0.05593628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2977245197","doi":"10.1111/rssb.12464","title":"Non-Reversible Parallel Tempering: A Scalable Highly Parallel MCMC Scheme","year":2021,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series B (Statistical Methodology)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Parallel tempering; Markov chain Monte Carlo; Computer science; Markov chain; Scalability; Prior probability; Scaling; Piecewise; Algorithm; Range (aeronautics); Applied mathematics; Schedule; Simulated annealing; Distribution (mathematics); Mathematical optimization; Statistical physics; Mathematics; Bayesian probability; Hybrid Monte Carlo; Artificial intelligence; Physics; Materials science; Mathematical analysis","authors":[{"name":"Saifuddin Syed","is_ca":true},{"name":"Alexandre Bouchard‐Côté","is_ca":true},{"name":"George Deligiannidis","is_ca":false},{"name":"Arnaud Doucet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09901716239151234,"gpt":0.3612658349096236,"spread":0.2622486725181112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621006,0.0004639974,0.0007988646,0.0003610324,0.0006083093,0.0008093466,0.00203454,0.0009801838,0.004082624],"category_scores_gemma":[0.00480829,0.0004071545,0.0006195487,0.0005883847,0.0009340455,0.0007160645,0.001504116,0.001418677,0.0007839888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009143601,"about_ca_system_score_gemma":0.001402534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005105863,"about_ca_topic_score_gemma":0.005230067,"domain_scores_codex":[0.9993796,0.0002380384,0.00003427775,0.00009235638,0.0001962333,0.00005944007],"domain_scores_gemma":[0.9982677,0.000837835,0.0001247293,0.0004218512,0.0002367549,0.0001112156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001108271,0.00004982594,0.0006245375,0.00005196552,0.0000312286,0.0001071612,0.00008259331,0.9032765,0.004553094,0.04738279,0.001354955,0.04237445],"study_design_scores_gemma":[0.00001044996,0.000006455193,0.00002585024,0.000002507242,0.000001840821,0.00000583926,0.000002257375,0.9948642,0.0003707714,0.004316177,0.0003909555,0.00000282835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01218254,0.00007907175,0.9845418,0.0001157885,0.0000328969,0.0000687022,0.00004720315,0.0005921209,0.002339924],"genre_scores_gemma":[0.3294675,0.00009087153,0.6672441,0.00009930933,0.00004069246,0.0002803214,0.000120817,0.0002457652,0.002410552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005105863,"threshold_uncertainty_score":0.01365775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968782267","doi":"10.1002/cjs.5550360401","title":"Optimal scaling of Metropolis algorithms: Heading toward general target distributions","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Toronto; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Heading (navigation); Simple (philosophy); Scaling; Independent and identically distributed random variables; Gaussian; Algorithm; Distribution (mathematics); Asymptotically optimal algorithm; Computer science; Mathematics; Mathematical optimization; Statistical physics; Applied mathematics; Random variable; Statistics; Mathematical analysis; Geometry; Physics","authors":[{"name":"Mylène Bédard","is_ca":true},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09391328041418588,"gpt":0.3312765790653092,"spread":0.2373632986511233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01049209,0.001119374,0.002172828,0.001535598,0.0009622372,0.002894051,0.002170266,0.001713722,0.004780759],"category_scores_gemma":[0.05143594,0.001052775,0.001111691,0.001582774,0.002913206,0.005296609,0.003201068,0.003510786,0.001080474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002100446,"about_ca_system_score_gemma":0.001735887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870837,"about_ca_topic_score_gemma":0.0009288538,"domain_scores_codex":[0.9934915,0.003946817,0.0003043657,0.0007169162,0.001139794,0.0004006058],"domain_scores_gemma":[0.9737824,0.02056132,0.0009777927,0.002319801,0.001816691,0.0005419012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001920519,0.0001255508,0.0009170895,0.00026794,0.00009197211,0.00009521023,0.0002672278,0.258956,0.002241631,0.6751663,0.003509213,0.05816978],"study_design_scores_gemma":[0.00002578267,0.00003533338,0.0001423514,0.00003292152,0.00001346924,0.00002867055,0.00002674444,0.7797778,0.001094157,0.2169914,0.00181296,0.00001852035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0120621,0.001056761,0.9811643,0.0005529324,0.0001189286,0.00007294084,0.0000254143,0.0003972297,0.004549502],"genre_scores_gemma":[0.4906939,0.002552895,0.4977103,0.000676909,0.0006650974,0.0006405262,0.0002029915,0.0009814089,0.005876048],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01049209,"threshold_uncertainty_score":0.05548811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071768380","doi":"10.1214/009117906000000034","title":"Subtree prune and regraft: A reversible real tree-valued Markov process","year":2006,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Markov chain; Dirichlet distribution; Markov process; Markov property; Hierarchical Dirichlet process; Dirichlet process; Variable-order Markov model; Path (computing); Brownian motion","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1430059525250482,"gpt":0.3894167694051828,"spread":0.2464108168801347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279868,0.0004019645,0.0006752367,0.0009478037,0.0007063043,0.001409019,0.00127511,0.001217899,0.003250889],"category_scores_gemma":[0.004280151,0.0003584893,0.001150345,0.0007377723,0.0032303,0.002010091,0.00143339,0.002009879,0.0005578793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009518679,"about_ca_system_score_gemma":0.0005764686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001191609,"about_ca_topic_score_gemma":0.001061594,"domain_scores_codex":[0.9994192,0.0002164391,0.00002117194,0.000141872,0.0001308133,0.00007043348],"domain_scores_gemma":[0.9984429,0.0008308364,0.000252976,0.0001759814,0.0001026978,0.0001945672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002221553,0.000015019,0.0003801895,0.00003070791,0.00001030519,0.0002206933,0.0001981617,0.03075597,0.001993131,0.9605238,0.0003420099,0.005507817],"study_design_scores_gemma":[0.00001487356,0.00002752084,0.0002529819,0.00001812254,0.00001048047,0.0001872101,0.00004834211,0.3512936,0.001307635,0.6436841,0.003122645,0.00003238554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1081298,0.0008406184,0.881864,0.0007292646,0.00007801898,0.00004449913,0.00009784438,0.00015124,0.008064836],"genre_scores_gemma":[0.8158875,0.00098463,0.1695287,0.0002083012,0.0001978327,0.0001223295,0.0001623361,0.0001296291,0.01277879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003250889,"threshold_uncertainty_score":0.01087534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W84569508","doi":"","title":"Adaptive MCMC with Bayesian Optimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada); University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Probabilistic logic; Markov chain; Mathematical optimization; Bayesian probability; Adaptive sampling; Bayesian optimization; Sampling (signal processing); Graphical model; Markov process; Machine learning; Artificial intelligence; Mathematics; Monte Carlo method; Statistics","authors":[{"name":"Nimalan Mahendran","is_ca":false},{"name":"Ziyu Wang","is_ca":true},{"name":"Firas Hamze","is_ca":true},{"name":"Nando de Freitas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06814830895941162,"gpt":0.3270986019886887,"spread":0.2589502930292771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004393546,0.00130888,0.001943624,0.001472525,0.001164624,0.001626387,0.003876028,0.002256572,0.004568228],"category_scores_gemma":[0.01762444,0.001275073,0.001394889,0.001544229,0.00217304,0.001915668,0.002558379,0.003846119,0.001169113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002035707,"about_ca_system_score_gemma":0.002851071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009701291,"about_ca_topic_score_gemma":0.009746183,"domain_scores_codex":[0.9964936,0.001963176,0.0001146839,0.0004669433,0.0007822619,0.0001793964],"domain_scores_gemma":[0.9942572,0.004372541,0.0002828628,0.0005830774,0.0003596398,0.0001446348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000107006,0.00007114925,0.0005962193,0.0001176736,0.0001466418,0.0001022441,0.0000941237,0.7160978,0.001557454,0.2136422,0.003084331,0.06438302],"study_design_scores_gemma":[0.00002509415,0.000007757393,0.00004751526,0.00001055413,0.000008364026,0.0000137986,0.000002683915,0.9598633,0.0003028819,0.03842781,0.001277895,0.00001241703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000926222,0.0001001347,0.9977451,0.000103871,0.00002250344,0.00002742475,0.00002090238,0.0002111787,0.0008426558],"genre_scores_gemma":[0.1089264,0.0003127168,0.8864298,0.000327996,0.0001410245,0.0005076186,0.0002223605,0.0004250818,0.002706951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009701291,"threshold_uncertainty_score":0.02323556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1624558029","doi":"","title":"Adaptive Hamiltonian and Riemann Manifold Monte Carlo","year":2013,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Monte Carlo method; Hybrid Monte Carlo; Computer science; Hamiltonian (control theory); Statistical physics; Mathematics; Applied mathematics; Physics; Topology (electrical circuits); Mathematical optimization; Markov chain Monte Carlo; Combinatorics; Statistics","authors":[{"name":"Ziyu Wang","is_ca":true},{"name":"Shakir Mohamed","is_ca":true},{"name":"De Freitas Nando","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05936358466552672,"gpt":0.3039147555494982,"spread":0.2445511708839714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003383973,0.0004978132,0.0008540949,0.0007816636,0.000738519,0.0009962152,0.001971,0.001423073,0.00373779],"category_scores_gemma":[0.01804521,0.0004572885,0.0005520592,0.0006428561,0.002361821,0.001935042,0.002036711,0.00204004,0.0006463847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001292151,"about_ca_system_score_gemma":0.00133346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003190147,"about_ca_topic_score_gemma":0.004091628,"domain_scores_codex":[0.9978892,0.001310381,0.0000585052,0.0002521732,0.0003772121,0.0001124609],"domain_scores_gemma":[0.993827,0.004345957,0.0003080501,0.0008977305,0.0003967815,0.0002245051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007436594,0.00004944645,0.001136248,0.00007096643,0.00004700375,0.00007110179,0.0001548962,0.4965779,0.001257944,0.4545891,0.001256414,0.04471453],"study_design_scores_gemma":[0.000009712169,0.00001398024,0.0001197523,0.000007983042,0.000003866086,0.00001725186,0.000006976319,0.9160975,0.0003620448,0.08212588,0.001222739,0.00001238674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008258986,0.0001963474,0.9889103,0.0001690006,0.00003353085,0.00004284679,0.00002706538,0.0002331494,0.002128736],"genre_scores_gemma":[0.3953396,0.0003349636,0.5992936,0.0003068393,0.0001145219,0.0002543709,0.000154905,0.0002645308,0.003936664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00373779,"threshold_uncertainty_score":0.01789641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038604769","doi":"10.1016/j.spa.2011.11.004","title":"Scaling analysis of multiple-try MCMC methods","year":2011,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Markov chain Monte Carlo; Metropolis–Hastings algorithm; Implementation; Markov chain; Scaling; Set (abstract data type); Mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Computer science; Monte Carlo method; Statistics","authors":[{"name":"Mylène Bédard","is_ca":true},{"name":"Randal Douc","is_ca":false},{"name":"Éric Moulines","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1025433624569132,"gpt":0.381014057591398,"spread":0.2784706951344847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01281543,0.001470989,0.002227606,0.003173289,0.002102276,0.002787284,0.003242725,0.002736584,0.009032047],"category_scores_gemma":[0.07390338,0.001437797,0.001922534,0.002239566,0.003614165,0.004576588,0.003341717,0.003834452,0.0008277892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002441522,"about_ca_system_score_gemma":0.002274373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004096642,"about_ca_topic_score_gemma":0.003710236,"domain_scores_codex":[0.9951211,0.003042845,0.0001639013,0.0004341637,0.001001796,0.0002361442],"domain_scores_gemma":[0.9469302,0.04281304,0.002285359,0.00331985,0.003678016,0.0009736175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005333089,0.00006087582,0.001147868,0.0001812831,0.00009077914,0.00009425315,0.0001892725,0.2154745,0.0006540113,0.7597812,0.00270766,0.01956491],"study_design_scores_gemma":[0.000008894653,0.000008970802,0.0002563952,0.00003602818,0.00001290083,0.0000213833,0.00001627999,0.844547,0.0001608155,0.1539055,0.001008903,0.00001706131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01298366,0.001255129,0.9784176,0.0007942807,0.0001611595,0.00006465082,0.00007272818,0.0002396392,0.006011032],"genre_scores_gemma":[0.5667001,0.002767299,0.41348,0.000698877,0.001008465,0.0009186663,0.0004253685,0.001209165,0.01279196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281543,"threshold_uncertainty_score":0.06777531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047000577","doi":"10.1239/jap/1044476831","title":"On the geometric ergodicity of hybrid samplers","year":2003,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Ergodicity; Random walk; Metropolis–Hastings algorithm; Statistical physics; Applied mathematics; Statistics; Markov chain Monte Carlo; Monte Carlo method","authors":[{"name":"Gersende Fort","is_ca":false},{"name":"Éric Moulines","is_ca":false},{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08652925242123094,"gpt":0.3120676138887566,"spread":0.2255383614675257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008784991,0.001011641,0.001434251,0.002170891,0.001307056,0.00238876,0.002513019,0.001414598,0.004842856],"category_scores_gemma":[0.04290851,0.0008073747,0.00124601,0.001001662,0.006145479,0.004786107,0.004552644,0.002384949,0.0006967982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002022295,"about_ca_system_score_gemma":0.001447016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002081769,"about_ca_topic_score_gemma":0.001635966,"domain_scores_codex":[0.9963605,0.00187479,0.0001443154,0.0005615433,0.0006316992,0.0004271919],"domain_scores_gemma":[0.9668387,0.02534746,0.002051717,0.002678382,0.002140634,0.000943093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008510137,0.0000221837,0.001173535,0.00006517249,0.0000489985,0.00009389996,0.0001164542,0.1015166,0.0007579688,0.8899831,0.0004968122,0.005640247],"study_design_scores_gemma":[0.00003067858,0.00004705598,0.0002552868,0.00003062403,0.00001587825,0.00005578127,0.00002925311,0.6674364,0.000795039,0.3305615,0.0007202883,0.00002212025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07260767,0.0007940129,0.9172446,0.0005984231,0.00006756347,0.00009089353,0.0001331239,0.0003881208,0.008075651],"genre_scores_gemma":[0.9015473,0.0007947817,0.09056907,0.0003409978,0.0002351442,0.0003717563,0.0003938524,0.0003922244,0.005354797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008784991,"threshold_uncertainty_score":0.04646003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488446430","doi":"10.1002/rsa.20539","title":"The mixing time of the giant component of a random graph","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Expander graph; Mixing (physics); Random graph; Random walk; Mathematics; Combinatorics; Constant (computer programming); Vertex (graph theory); Component (thermodynamics); Exponential function; Discrete mathematics; Graph; Statistical physics; Computer science; Physics; Statistics; Mathematical analysis; Quantum mechanics","authors":[{"name":"Itaï Benjamini","is_ca":false},{"name":"Gady Kozma","is_ca":false},{"name":"Nicholas Wormald","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01511420349440316,"gpt":0.2716785362266982,"spread":0.256564332732295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998082,0.0004232079,0.0005395469,0.001606266,0.0007332696,0.001169816,0.0009896929,0.0008685212,0.003086694],"category_scores_gemma":[0.008280764,0.0004181658,0.0005070296,0.0005335268,0.002036645,0.001730204,0.001376645,0.0008080986,0.00022957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262517,"about_ca_system_score_gemma":0.0004066142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217259,"about_ca_topic_score_gemma":0.001560024,"domain_scores_codex":[0.999608,0.0001227216,0.00001320378,0.0001017256,0.0000907946,0.00006361611],"domain_scores_gemma":[0.9967437,0.001829407,0.0004056164,0.0002122788,0.0002343025,0.0005745871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003083393,0.00004642312,0.006874146,0.0001632605,0.0001418307,0.0004997664,0.0004951488,0.1292338,0.01991295,0.828392,0.002793229,0.01113913],"study_design_scores_gemma":[0.00002863838,0.00004922513,0.002741455,0.00003750157,0.00004121666,0.0002116427,0.00007712388,0.731237,0.004071643,0.2598553,0.001602047,0.00004721913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8143937,0.0005164596,0.1721253,0.0009116731,0.00008373645,0.00006391773,0.0002097845,0.0003994615,0.01129591],"genre_scores_gemma":[0.9902061,0.0001129118,0.007201837,0.00007256726,0.00003285196,0.00004437098,0.0001184947,0.00007097478,0.002139937],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003086694,"threshold_uncertainty_score":0.01032597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497401739","doi":"10.1137/130930339","title":"An Iterative Minimization Formulation for Saddle Point Search","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Numerical Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Saddle point; Minification; Iterative method; Rate of convergence; Applied mathematics; Mathematical optimization; Quadratic equation; Local convergence; Manifold (fluid mechanics); Saddle; Computer science; Geometry","authors":[{"name":"Weiguo Gao","is_ca":false},{"name":"Jing Leng","is_ca":false},{"name":"Xiang Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1243300050969161,"gpt":0.4196921434342967,"spread":0.2953621383373806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779651,0.001015974,0.0008784534,0.0007448277,0.0005536196,0.0009015318,0.001808082,0.00166264,0.004583503],"category_scores_gemma":[0.003407984,0.0005337526,0.001033462,0.0005736918,0.001368343,0.001428204,0.001482812,0.001468702,0.001041117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009399349,"about_ca_system_score_gemma":0.001218526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001119341,"about_ca_topic_score_gemma":0.001187972,"domain_scores_codex":[0.9994189,0.0002444291,0.00002627592,0.00007590251,0.0001974197,0.00003714401],"domain_scores_gemma":[0.9992687,0.0004116248,0.00006727313,0.00005613996,0.0001623418,0.0000338905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002329283,0.00003093436,0.00029676,0.0001242501,0.00003845492,0.00009496377,0.000139729,0.5214874,0.002492791,0.4514082,0.002221296,0.02164193],"study_design_scores_gemma":[0.000006548869,0.00002288332,0.00004113372,0.00001648588,0.000005404273,0.0000376215,0.000011628,0.938849,0.0004637648,0.05769277,0.002841914,0.0000109739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001021128,0.00008335539,0.9956965,0.0001302352,0.00002353004,0.00002779119,0.00001353825,0.00003408729,0.002969812],"genre_scores_gemma":[0.1608967,0.000664181,0.8222769,0.0002862249,0.0001716595,0.0007072462,0.0001470737,0.0003133952,0.01453659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004583503,"threshold_uncertainty_score":0.01533335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042221696","doi":"10.1007/s11222-008-9051-5","title":"Metropolis–Hastings algorithms with adaptive proposals","year":2008,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Marsden Fund; Royal Society","keywords":"Metropolis–Hastings algorithm; Markov chain Monte Carlo; Rejection sampling; Algorithm; Markov chain; Gibbs sampling; Computer science; Convergence (economics); Sampling (signal processing); Mathematics; Univariate; Monte Carlo method; Mathematical optimization; Artificial intelligence; Hybrid Monte Carlo; Bayesian probability; Machine learning; Statistics; Multivariate statistics; Filter (signal processing)","authors":[{"name":"Bo Cai","is_ca":false},{"name":"Renate Meyer","is_ca":false},{"name":"François Perron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07367654801908341,"gpt":0.3306847149384586,"spread":0.2570081669193752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008678976,0.002312441,0.003746388,0.00270218,0.002011272,0.003789777,0.007951246,0.004638692,0.01063105],"category_scores_gemma":[0.05000261,0.003097929,0.002161961,0.005507088,0.005425665,0.008436452,0.004504739,0.007763349,0.004698742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901588,"about_ca_system_score_gemma":0.003081257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003356712,"about_ca_topic_score_gemma":0.004393452,"domain_scores_codex":[0.9928359,0.004346061,0.0003092499,0.0008659056,0.001353702,0.0002890897],"domain_scores_gemma":[0.9597855,0.03145439,0.0009632097,0.005342061,0.001850724,0.0006040646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000237392,0.0001563932,0.0005741702,0.0002551821,0.0001618788,0.00008707135,0.0002067196,0.2127203,0.0007106597,0.6962422,0.00545264,0.08319552],"study_design_scores_gemma":[0.00006632607,0.00001921907,0.00005823517,0.00002065949,0.0000235211,0.00003328983,0.00001078873,0.6837012,0.0005705036,0.3126727,0.002793355,0.00003019654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001268982,0.0002786905,0.9969832,0.0001617452,0.00008621621,0.00003623894,0.00002769277,0.000249001,0.0009082323],"genre_scores_gemma":[0.0788007,0.0007754757,0.9093226,0.0002202842,0.0005006599,0.0005624225,0.0003688499,0.0005878635,0.008861114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01063105,"threshold_uncertainty_score":0.04589933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078014848","doi":"10.1214/11-aap806","title":"Adaptive Gibbs samplers and related MCMC methods","year":2013,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Gibbs sampling; Convergence (economics); Markov chain Monte Carlo; Selection (genetic algorithm); Set (abstract data type); Markov chain","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2503156941519951,"gpt":0.4202935983879869,"spread":0.1699779042359917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007024344,0.001094865,0.001234565,0.001895986,0.001296758,0.002167565,0.003511622,0.002773349,0.007068131],"category_scores_gemma":[0.03336151,0.0009529782,0.001235118,0.00268153,0.003814822,0.002999916,0.002517367,0.004787453,0.001440234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001847817,"about_ca_system_score_gemma":0.002283591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00651849,"about_ca_topic_score_gemma":0.005629699,"domain_scores_codex":[0.9958034,0.002460523,0.0001541921,0.0005701373,0.0008308191,0.0001808861],"domain_scores_gemma":[0.985814,0.01157062,0.0004852966,0.001033611,0.0008386436,0.0002577779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003183933,0.00002385407,0.0005200743,0.0001246506,0.00005748843,0.00005690783,0.0001306212,0.1179736,0.00027038,0.8458793,0.00241308,0.03251814],"study_design_scores_gemma":[0.00002725739,0.00001144173,0.000141135,0.00005291077,0.00001868573,0.00004815188,0.00001709423,0.4040077,0.0002870366,0.5860567,0.009306929,0.00002493573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001248616,0.000901325,0.9940585,0.0004173595,0.00009077317,0.00004703478,0.00006369865,0.0001664109,0.003006307],"genre_scores_gemma":[0.1288522,0.003584804,0.8566266,0.0008654153,0.0007551685,0.00059326,0.0003677238,0.0004604562,0.007894409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007068131,"threshold_uncertainty_score":0.03714877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913888525","doi":"10.1017/s0963548306007541","title":"Rayleigh Matroids","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Binary number; Matroid partitioning; Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","authors":[{"name":"YoungBin Choe","is_ca":true},{"name":"David G. Wagner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05178645719083579,"gpt":0.3178471076443546,"spread":0.2660606504535188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365456,0.0005378233,0.000505889,0.0007643208,0.0007009011,0.001669818,0.0007785915,0.0006199625,0.007164749],"category_scores_gemma":[0.001967442,0.0003068361,0.000513425,0.0005730783,0.001057064,0.002603368,0.001237207,0.00107237,0.001133556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006029136,"about_ca_system_score_gemma":0.0002838133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006221175,"about_ca_topic_score_gemma":0.0006169715,"domain_scores_codex":[0.9993302,0.0001229216,0.00003853723,0.000166458,0.0002135947,0.000128371],"domain_scores_gemma":[0.9985959,0.0004611299,0.0003037506,0.0002050549,0.0002896806,0.0001444454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008128049,0.00002858219,0.0009663114,0.00009179279,0.00002207677,0.0001882898,0.0001949319,0.01553367,0.00790301,0.9496801,0.002782859,0.02252707],"study_design_scores_gemma":[0.00003082878,0.0001135611,0.001363995,0.00003664033,0.0000235705,0.0009983849,0.0002315934,0.1415232,0.007112643,0.8218814,0.02664851,0.00003566212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2848154,0.001417463,0.6288438,0.001436141,0.0001738741,0.0001767888,0.001050763,0.0006505529,0.08143511],"genre_scores_gemma":[0.9171931,0.0009052542,0.05519386,0.0003940783,0.0003380501,0.0001622813,0.0005931004,0.00009894925,0.0251213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007164749,"threshold_uncertainty_score":0.02396846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3098551378","doi":"","title":"Invariant Gaussian processes and independent sets on regular graphs of large Girth","year":2015,"lang":"en","type":"article","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Mathematics education","authors":[{"name":"Endre Csóka","is_ca":false},{"name":"Balázs Gerencsér","is_ca":false},{"name":"Viktor Harangi","is_ca":true},{"name":"Bálint Virág","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05510388448335679,"gpt":0.3059500311985111,"spread":0.2508461467151543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001923922,0.0007298047,0.0008757923,0.002386126,0.0009147435,0.001279699,0.001225166,0.0009254775,0.002862296],"category_scores_gemma":[0.0141554,0.0005387607,0.001392468,0.001184207,0.003543701,0.001581794,0.001928268,0.00209595,0.0004618162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182409,"about_ca_system_score_gemma":0.0007337204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001632971,"about_ca_topic_score_gemma":0.001540106,"domain_scores_codex":[0.9991035,0.0003263713,0.00002817326,0.0001498105,0.0002375858,0.0001544315],"domain_scores_gemma":[0.9901199,0.007247824,0.000912694,0.0008324892,0.0004715212,0.0004154451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009219057,0.00006332173,0.003281414,0.00009457053,0.00005984738,0.0002401072,0.0003441577,0.1598047,0.003602037,0.8207175,0.001240356,0.01045987],"study_design_scores_gemma":[0.00001653753,0.00002434409,0.0006964641,0.00002022861,0.00001688264,0.0000904164,0.0000397014,0.6021671,0.001517214,0.3945654,0.000829004,0.00001670487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1795478,0.0003113149,0.8093565,0.0003932633,0.00004669423,0.00006167601,0.0001226023,0.0002152725,0.009945004],"genre_scores_gemma":[0.9045774,0.0006084154,0.08979175,0.0001612772,0.0001095197,0.0001528733,0.0002199791,0.0001148481,0.004263967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002862296,"threshold_uncertainty_score":0.01017475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992601594","doi":"10.1080/10618600.2015.1005213","title":"Tweedie’s Compound Poisson Model With Grouped Elastic Net","year":2015,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Poisson distribution; Mathematics; Library science; Statistics; Computer science","authors":[{"name":"Wei Qian","is_ca":false},{"name":"Yi Yang","is_ca":true},{"name":"Hui Zou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06901214203725027,"gpt":0.3349939212535888,"spread":0.2659817792163386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00463906,0.0008311032,0.00132751,0.001389333,0.0007452538,0.002088661,0.003598607,0.002415167,0.0111075],"category_scores_gemma":[0.01279326,0.0007010057,0.001673691,0.001860407,0.001251299,0.002660523,0.002072373,0.003053756,0.002121586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117833,"about_ca_system_score_gemma":0.001690318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006987641,"about_ca_topic_score_gemma":0.008101474,"domain_scores_codex":[0.9985805,0.0006415468,0.00007464812,0.0003222946,0.0002477102,0.000133396],"domain_scores_gemma":[0.9955465,0.002910385,0.0004723823,0.0005526023,0.0003446567,0.0001735067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001473869,0.00008279688,0.002649293,0.0001051859,0.00007662551,0.0003016118,0.0001488622,0.7362192,0.0007521395,0.2038412,0.01071698,0.04495873],"study_design_scores_gemma":[0.00001120246,0.00001271554,0.0001670299,0.00000967801,0.000006443282,0.00003215008,0.00001228445,0.9607851,0.0001700895,0.0365722,0.00220867,0.00001242925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01242504,0.0002115837,0.9835692,0.0004907594,0.0001038461,0.0001157538,0.0009237208,0.0003761889,0.001783855],"genre_scores_gemma":[0.3482194,0.0007321273,0.6148599,0.0005702971,0.0003367732,0.00122181,0.003922768,0.0006223376,0.02951457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0111075,"threshold_uncertainty_score":0.03715831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113328396","doi":"10.1007/s11222-011-9301-9","title":"Interacting multiple try algorithms with different proposal distributions","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Exploit; Extension (predicate logic); Monte Carlo method; Markov chain; Class (philosophy); Population; Selection (genetic algorithm)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.06591323379604168,"gpt":0.3268388600126755,"spread":0.2609256262166338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01666936,0.001796044,0.003397064,0.002288359,0.002078656,0.005102267,0.008678746,0.006210232,0.008640292],"category_scores_gemma":[0.07240778,0.001964367,0.00261348,0.003170667,0.004604246,0.01104237,0.00754451,0.005773531,0.002097383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002345896,"about_ca_system_score_gemma":0.002943797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431454,"about_ca_topic_score_gemma":0.002458123,"domain_scores_codex":[0.9880569,0.007524984,0.0004822511,0.001367855,0.001931044,0.0006369856],"domain_scores_gemma":[0.9113769,0.07297184,0.002188933,0.00902294,0.002809125,0.001630215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001022701,0.0004028057,0.00298784,0.0002867392,0.0003864563,0.0001754965,0.0005511859,0.4577723,0.001312555,0.4502893,0.002989875,0.08182274],"study_design_scores_gemma":[0.0000958676,0.00003731339,0.0001307172,0.00001821092,0.0000399297,0.00006215771,0.00002759115,0.8645544,0.0006885229,0.133717,0.0005906438,0.00003768725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008282783,0.0001644567,0.9892229,0.0003379625,0.00005495718,0.00006604478,0.00002307423,0.0003181823,0.001529566],"genre_scores_gemma":[0.213687,0.0003072661,0.7767188,0.0004039681,0.000186988,0.0008417363,0.0002209937,0.0005249258,0.00710831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666936,"threshold_uncertainty_score":0.08815706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160639001","doi":"10.1214/ecp.v12-1336","title":"On Variance Conditions for Markov Chain CLTs","year":2007,"lang":"en","type":"article","venue":"Electronic Communications in Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Markov chain; Variance (accounting); Limit (mathematics); Chain (unit); Applied mathematics; Econometrics; Statistics; Mathematical analysis; Economics","authors":[{"name":"Olle Häggström","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07906550605768099,"gpt":0.4114142508277198,"spread":0.3323487447700388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01941342,0.001546364,0.002872277,0.005415138,0.002019552,0.005025232,0.004078837,0.003400017,0.01431643],"category_scores_gemma":[0.1246879,0.00127227,0.00243872,0.003250373,0.006602204,0.009531557,0.00481236,0.007569163,0.001675575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003249908,"about_ca_system_score_gemma":0.002762456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001805953,"about_ca_topic_score_gemma":0.00144676,"domain_scores_codex":[0.9928119,0.003283371,0.0004088237,0.001039188,0.001528417,0.0009283948],"domain_scores_gemma":[0.840564,0.1333043,0.006965068,0.004363224,0.01157718,0.003226162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004174808,0.00003364613,0.0004755785,0.0001193218,0.00002965655,0.0001852605,0.0001650262,0.01332381,0.0006113413,0.9803979,0.001328882,0.00328787],"study_design_scores_gemma":[0.00003290232,0.00003257502,0.0003255359,0.0001282929,0.00001664293,0.0001381234,0.00007805052,0.1496169,0.0004740096,0.8480245,0.001083066,0.00004948034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0594651,0.003621775,0.8964708,0.003867169,0.000511458,0.000188284,0.000550102,0.0005940818,0.03473116],"genre_scores_gemma":[0.8685822,0.005279382,0.1031266,0.002389494,0.00218066,0.001145054,0.001075732,0.001104811,0.01511612],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01941342,"threshold_uncertainty_score":0.1026692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152650468","doi":"10.1109/9.898698","title":"A probabilistic analysis of bias optimality in unichain Markov decision processes","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Probabilistic logic; Markov process; Mathematical optimization; State space; Markov chain; Partially observable Markov decision process; Decision theory; Computer science; Mathematics; Markov model; Optimal decision; Value (mathematics); Decision problem; Markov kernel; Variable-order Markov model; Artificial intelligence; Algorithm; Statistics; Decision tree","authors":[{"name":"Mark Edward Lewis","is_ca":false},{"name":"Martin L. Puterman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05701441502884771,"gpt":0.3422949579532089,"spread":0.2852805429243612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007310138,0.0009468663,0.001452912,0.001887374,0.001174584,0.002161805,0.00229704,0.001713062,0.00600786],"category_scores_gemma":[0.02339104,0.0008218791,0.001511611,0.002105541,0.004109676,0.005439182,0.002986136,0.003992911,0.0006318312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003257847,"about_ca_system_score_gemma":0.001820986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002461811,"about_ca_topic_score_gemma":0.002109276,"domain_scores_codex":[0.9968147,0.001193124,0.0001498884,0.0005932827,0.0009022778,0.0003468808],"domain_scores_gemma":[0.9850662,0.01165415,0.001240905,0.0006722491,0.0009682613,0.0003981769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002601992,0.00001887623,0.0004139952,0.00006162172,0.00003775305,0.00003759252,0.00006995747,0.105093,0.0005529146,0.884936,0.000560712,0.008191378],"study_design_scores_gemma":[0.000006500263,0.00002368254,0.000236078,0.00003197663,0.0000143207,0.00003126229,0.00001032169,0.3055098,0.0003598246,0.6928453,0.0009093358,0.00002143148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01324241,0.0007117782,0.9805695,0.0006330857,0.00005350128,0.00002316101,0.00006883906,0.00009348852,0.004604314],"genre_scores_gemma":[0.6791621,0.003144416,0.3090352,0.0007250159,0.0004964003,0.0002458812,0.000228558,0.0003219467,0.006640433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007310138,"threshold_uncertainty_score":0.03866017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2496191157","doi":"10.1017/cbo9780511791277.013","title":"Markov chain Monte Carlo","year":2005,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Computer science; Hybrid Monte Carlo; Monte Carlo molecular modeling; Monte Carlo method in statistical physics; Statistical physics; Metropolis–Hastings algorithm; Bayesian probability; Monte Carlo integration; Applied mathematics; Quasi-Monte Carlo method; Mathematical optimization; Computation; Approximate Bayesian computation; Algorithm; Mathematics; Artificial intelligence; Physics; Statistics","authors":[{"name":"Phil Gregory","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04933256967473269,"gpt":0.2564852831290715,"spread":0.2071527134543389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595737,0.001264198,0.001717336,0.001499886,0.001395672,0.00300756,0.002404743,0.002326637,0.02729452],"category_scores_gemma":[0.01218839,0.0008412764,0.001619285,0.002068498,0.001804782,0.003254791,0.002024318,0.003129049,0.005885355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001830005,"about_ca_system_score_gemma":0.00217374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004008324,"about_ca_topic_score_gemma":0.005515702,"domain_scores_codex":[0.9979488,0.001005882,0.00009674682,0.0003283971,0.0004779804,0.0001421776],"domain_scores_gemma":[0.9941765,0.004445856,0.0002102513,0.0004634975,0.0005679964,0.0001358763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004986699,0.00007161764,0.0007713152,0.0003160802,0.00009117436,0.0001543758,0.0002075316,0.1699573,0.0003953324,0.7477075,0.01375802,0.06652006],"study_design_scores_gemma":[0.00004200455,0.00002584752,0.0001753028,0.0001748575,0.00003455009,0.0001024343,0.0000388536,0.387499,0.0005883311,0.5599227,0.05134233,0.00005390241],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00239211,0.003376011,0.9545604,0.001128917,0.000462202,0.0001923165,0.0005523591,0.0008639031,0.03647182],"genre_scores_gemma":[0.1427352,0.01036434,0.785183,0.00131888,0.0007418242,0.001273773,0.002088471,0.0008069285,0.05548765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02729452,"threshold_uncertainty_score":0.09130925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238723945","doi":"10.1017/s0021900200117954","title":"Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ergodicity; Mathematics; Counterexample; Markov chain Monte Carlo; Markov chain; Statistical physics; Coupling (piping); Markov chain mixing time; Convergence (economics); Monte Carlo method; Algorithm; Applied mathematics; Markov model; Variable-order Markov model; Discrete mathematics; Statistics; Physics","authors":[{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05514559893675608,"gpt":0.3196763472424737,"spread":0.2645307483057177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007942821,0.0009539833,0.001364857,0.00157016,0.001176371,0.002081172,0.00213669,0.001374,0.002344527],"category_scores_gemma":[0.04429974,0.0006583271,0.001259883,0.0009497653,0.003452071,0.003533236,0.004465282,0.002716701,0.0003759337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396213,"about_ca_system_score_gemma":0.001294108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001407666,"about_ca_topic_score_gemma":0.00073671,"domain_scores_codex":[0.9963313,0.001782557,0.0001895046,0.0005157447,0.0008497032,0.0003312484],"domain_scores_gemma":[0.9683355,0.02408538,0.00212982,0.002310489,0.001847552,0.001291339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001221527,0.00007776385,0.001923359,0.00009992306,0.00009929382,0.000116467,0.0002728541,0.2049289,0.00414103,0.7775363,0.000436791,0.01024507],"study_design_scores_gemma":[0.00002780908,0.00007181094,0.0003698919,0.00002438216,0.00002354084,0.00004568565,0.00002759403,0.7986093,0.001707269,0.1983984,0.0006742488,0.00002008769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05152847,0.0001691423,0.9437451,0.0002897998,0.00002324213,0.00005539647,0.0000366965,0.000135487,0.004016622],"genre_scores_gemma":[0.9202231,0.0003254503,0.0765617,0.0002018426,0.00008251829,0.0002498257,0.0001182901,0.0001541227,0.002083177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007942821,"threshold_uncertainty_score":0.04200619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088606685","doi":"10.1007/s00362-006-0032-5","title":"On the natural restrictions in the singular Gauss–Markov model","year":2006,"lang":"en","type":"article","venue":"Statistical Papers","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Natural (archaeology); Gauss; Markov chain; Markov model; Econometrics; Mathematical economics; Mathematics; Applied mathematics; Computer science; Statistical physics; Statistics; Geography; Physics","authors":[{"name":"Yongge Tian","is_ca":false},{"name":"Mary Beisiegel","is_ca":true},{"name":"E. Dagenais","is_ca":true},{"name":"Christina Haines","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0362272021142136,"gpt":0.32963675568475,"spread":0.2934095535705364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006380683,0.0007881544,0.001607756,0.002201428,0.00189849,0.002591016,0.002108859,0.001911159,0.006607523],"category_scores_gemma":[0.0328146,0.0008327112,0.001583308,0.001522627,0.006692074,0.006701682,0.004009754,0.004929621,0.0007452634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002272312,"about_ca_system_score_gemma":0.002649654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00626681,"about_ca_topic_score_gemma":0.004082162,"domain_scores_codex":[0.9966934,0.001816194,0.0001743675,0.0003827554,0.0006491321,0.0002842102],"domain_scores_gemma":[0.976517,0.01635615,0.002227121,0.001805239,0.001432656,0.001661804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001336257,0.00001471967,0.0001781557,0.00001973335,0.00000681146,0.00003670187,0.0000703626,0.004614474,0.00007754144,0.9933597,0.0005263381,0.001082106],"study_design_scores_gemma":[0.000006479964,0.000005060066,0.0001073122,0.00001217044,0.000003358147,0.00002553351,0.00001624553,0.03919523,0.00003673297,0.9600604,0.000522333,0.000009279748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1469903,0.002390187,0.7880632,0.008281117,0.0004862385,0.00008190277,0.0004900859,0.0003012525,0.05291568],"genre_scores_gemma":[0.913458,0.00309407,0.05882294,0.001463187,0.001803943,0.0002462151,0.000719184,0.0003249757,0.02006757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006607523,"threshold_uncertainty_score":0.03374463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089048182","doi":"10.1016/j.spa.2005.03.005","title":"Exponential forgetting and geometric ergodicity for optimal filtering in general state-space models","year":2005,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Markov chain; Ergodicity; State space; Continuous-time Markov chain; Context (archaeology); Sequence (biology); Ergodic theory; Applied mathematics; Additive Markov chain; Filter (signal processing); Markov process; Variable-order Markov model; Markov model; Pure mathematics; Computer science; Statistics","authors":[{"name":"Vladislav B. Tadić","is_ca":false},{"name":"Arnaud Doucet","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04613108094967818,"gpt":0.316571938793911,"spread":0.2704408578442328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01065638,0.002357652,0.003894825,0.002849468,0.001531195,0.004043704,0.003903812,0.004116129,0.003479762],"category_scores_gemma":[0.04748693,0.001930436,0.00309492,0.002408992,0.007385613,0.008326091,0.003486695,0.005687768,0.0004722681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003251613,"about_ca_system_score_gemma":0.002622736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008001616,"about_ca_topic_score_gemma":0.006532874,"domain_scores_codex":[0.9970099,0.00119908,0.0001982773,0.0006707889,0.00052515,0.0003969321],"domain_scores_gemma":[0.9587736,0.03312097,0.002655464,0.002336472,0.002104353,0.001009209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005795561,0.00004602755,0.0005730491,0.0001313257,0.00009720662,0.0001170115,0.0001753187,0.154888,0.0005372451,0.8357477,0.0008095898,0.006819634],"study_design_scores_gemma":[0.00001361684,0.00001595951,0.0002042279,0.00002795553,0.00003436412,0.00003267323,0.00001930197,0.5639058,0.0002394498,0.4351023,0.0003665705,0.00003788541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02908912,0.001536331,0.9656262,0.0007674989,0.0001316939,0.00002605469,0.0001022643,0.0001690645,0.002551828],"genre_scores_gemma":[0.8510577,0.007187253,0.122162,0.0008357575,0.0012252,0.0003714556,0.0007799312,0.0004607566,0.01591998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01065638,"threshold_uncertainty_score":0.05635697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2613020357","doi":"10.1080/00949655.2017.1326117","title":"Bayesian computation for Log-Gaussian Cox processes: a comparative analysis of methods","year":2017,"lang":"en","type":"article","venue":"Journal of Statistical Computation and Simulation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Institute of Neurological Disorders and Stroke; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bayesian probability; Computation; Gaussian process; Gaussian; Applied mathematics; Statistics; Algorithm","authors":[{"name":"Ming Teng","is_ca":false},{"name":"Farouk S. Nathoo","is_ca":true},{"name":"Timothy D. Johnson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1758087556041645,"gpt":0.5287679271883436,"spread":0.3529591715841792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03081771,0.001164098,0.002264532,0.003878495,0.001139149,0.003106712,0.002989329,0.002205348,0.007101514],"category_scores_gemma":[0.1209163,0.0009165508,0.001541925,0.003463135,0.002330827,0.005657183,0.003129699,0.002932528,0.0009412698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003133513,"about_ca_system_score_gemma":0.004431124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00570733,"about_ca_topic_score_gemma":0.006268679,"domain_scores_codex":[0.9832023,0.01226628,0.0004680665,0.0007391984,0.003033718,0.0002904319],"domain_scores_gemma":[0.8568015,0.1320773,0.001963932,0.003723104,0.004758582,0.0006756259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001951244,0.0001342926,0.001963187,0.0003712651,0.0001625965,0.000075256,0.0003847038,0.1750002,0.0003595038,0.6746099,0.002707184,0.1440368],"study_design_scores_gemma":[0.000050977,0.00005380503,0.0007780269,0.0001467346,0.00005435678,0.00009304578,0.00008476634,0.7611868,0.0003068276,0.2327331,0.004465249,0.00004628504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003475015,0.002157538,0.9916345,0.0005228173,0.00005099129,0.00006447532,0.0000346029,0.0001198054,0.001940264],"genre_scores_gemma":[0.09950127,0.005777823,0.8908291,0.0002676875,0.0002803731,0.0005898161,0.0001614183,0.0003142455,0.002278175],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03081771,"threshold_uncertainty_score":0.1629815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108293203","doi":"10.1007/s10957-007-9297-7","title":"Measure-Valued Differentiation for Markov Chains","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Markov chain; Mathematics; Measure (data warehouse); Markov kernel; Estimator; Kernel (algebra); Applied mathematics; Generality; Markov model; Discrete mathematics; Combinatorics; Mathematical optimization; Variable-order Markov model; Computer science; Statistics","authors":[{"name":"Bernd Heidergott","is_ca":false},{"name":"Felisa J. Vázquez-Abad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03489857493065025,"gpt":0.3465355127841554,"spread":0.3116369378535052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007951054,0.00179875,0.002338052,0.003116778,0.001411036,0.003617055,0.001979463,0.002577049,0.004207397],"category_scores_gemma":[0.03053338,0.001134481,0.001617668,0.002637434,0.006172571,0.006134169,0.003576005,0.00501953,0.0005122322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005148076,"about_ca_system_score_gemma":0.003257123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005522289,"about_ca_topic_score_gemma":0.004626785,"domain_scores_codex":[0.997623,0.001274094,0.0001496881,0.0003023399,0.0004793337,0.0001714721],"domain_scores_gemma":[0.977044,0.01733107,0.001643001,0.000895075,0.001879325,0.001207578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001094683,0.00001499119,0.0001883076,0.00005148656,0.00002082007,0.00003476788,0.00009613967,0.01596322,0.0001995207,0.9793869,0.0005891892,0.003443758],"study_design_scores_gemma":[0.000007451521,0.000006461207,0.00008097684,0.0000264577,0.00000679797,0.00002331472,0.00001560349,0.1378169,0.00005647226,0.8609902,0.000958491,0.00001097427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01714498,0.003484695,0.9683903,0.001979304,0.0003141329,0.00004103747,0.000109532,0.0001045134,0.008431576],"genre_scores_gemma":[0.6343929,0.009247062,0.3213782,0.001298741,0.001344754,0.0004167711,0.0004595684,0.0004861222,0.03097587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007951054,"threshold_uncertainty_score":0.04204971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013770427","doi":"10.1007/s00440-006-0003-8","title":"Faster Mixing and Small Bottlenecks","year":2006,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixing (physics); Markov chain; Mathematics; Mathematical finance; Upper and lower bounds; Statistical physics; Conductance; Markov chain mixing time; Markov process; Combinatorics; Chain (unit); Discrete mathematics; Markov property; Mathematical analysis; Markov model; Statistics; Physics; Quantum mechanics","authors":[{"name":"Nikolaos Fountoulakis","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02706464160399145,"gpt":0.2703303037262976,"spread":0.2432656621223062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009170493,0.001651739,0.003417554,0.003136237,0.002272802,0.003933475,0.003933541,0.004559991,0.01645975],"category_scores_gemma":[0.06145965,0.001860026,0.001589343,0.001660452,0.004640456,0.01832209,0.006137917,0.007756138,0.001661444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002227834,"about_ca_system_score_gemma":0.001230408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456022,"about_ca_topic_score_gemma":0.001026552,"domain_scores_codex":[0.995695,0.00218044,0.0001235616,0.000943307,0.0006490411,0.0004086752],"domain_scores_gemma":[0.9444541,0.04311928,0.002008666,0.006362024,0.001902614,0.00215331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001859966,0.00009959952,0.0004835852,0.0001452377,0.0000489404,0.00008351523,0.0002718962,0.02677557,0.001746795,0.9572149,0.00320057,0.009743386],"study_design_scores_gemma":[0.00003729996,0.00002225308,0.0001986716,0.00001929233,0.00001880884,0.00005661455,0.00003062467,0.1700663,0.0008192766,0.8271203,0.001587221,0.00002331055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0860515,0.001792664,0.8904985,0.003114986,0.0004279211,0.00009316247,0.0002503259,0.001107087,0.01666389],"genre_scores_gemma":[0.7834628,0.001368747,0.181376,0.001584519,0.001015569,0.0005389024,0.0005500684,0.001834197,0.02826924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01645975,"threshold_uncertainty_score":0.05506337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066357294","doi":"10.1214/07-aap486","title":"Variance bounding Markov chains","year":2008,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Variance (accounting); Markov chain; Property (philosophy); Markov property; Limit (mathematics)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2445090963513248,"gpt":0.3829196259814799,"spread":0.1384105296301551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002972453,0.0008485682,0.001075029,0.001251961,0.001044767,0.001897984,0.001584097,0.001567699,0.006298264],"category_scores_gemma":[0.01808418,0.0005359161,0.00104477,0.0009688797,0.003220743,0.003635256,0.002406306,0.003129824,0.0009721613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342283,"about_ca_system_score_gemma":0.001340856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001407023,"about_ca_topic_score_gemma":0.001133167,"domain_scores_codex":[0.9971592,0.0009097217,0.0001144514,0.0006672644,0.0007909974,0.0003583422],"domain_scores_gemma":[0.9883385,0.007619728,0.001057878,0.001520699,0.001087896,0.0003751817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001826217,0.00001810762,0.0005452943,0.00005095381,0.00002832817,0.00009065515,0.0001061944,0.03338938,0.001721358,0.9568312,0.001030277,0.006169902],"study_design_scores_gemma":[0.00001262418,0.00002699154,0.0002345762,0.00003453403,0.00001420413,0.00007291581,0.00001957474,0.2925362,0.001415933,0.7017277,0.003878562,0.00002611967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01770634,0.0006468322,0.9684379,0.0006632926,0.0001318408,0.00005028244,0.0001584679,0.0002559814,0.01194907],"genre_scores_gemma":[0.8083825,0.00178342,0.1697499,0.001148507,0.0006895104,0.0005122707,0.000552379,0.000487628,0.01669389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006298264,"threshold_uncertainty_score":0.02106982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114493774","doi":"10.1063/1.1649728","title":"Multicanonical basin hopping: A new global optimization method for complex systems","year":2004,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Maxima and minima; Global optimization; Minification; Monte Carlo method; Computation; Structural basin; Computer science; Multivariable calculus; Energy landscape; Energy minimization; Complex system; Mathematical optimization; Energy (signal processing); Algorithm; Mathematics; Physics; Engineering; Geology; Artificial intelligence","authors":[{"name":"Lixin Zhan","is_ca":true},{"name":"Bart Piwowar","is_ca":true},{"name":"Wing‐Ki Liu","is_ca":true},{"name":"Po‐Jen Hsu","is_ca":false},{"name":"S. K. Lai","is_ca":false},{"name":"Jeff Z. Y. Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1177199628182187,"gpt":0.4018856091586752,"spread":0.2841656463404564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929014,0.0006392042,0.0008472496,0.0005458736,0.0004265019,0.0005564741,0.0009988595,0.0009639362,0.002492397],"category_scores_gemma":[0.001240499,0.0003510554,0.000500639,0.0006090556,0.0007700359,0.0009439789,0.0009615207,0.001024181,0.0004639065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003593176,"about_ca_system_score_gemma":0.0007393756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001530456,"about_ca_topic_score_gemma":0.001725247,"domain_scores_codex":[0.9997361,0.0001021828,0.000009783719,0.00003564634,0.00009721901,0.0000190062],"domain_scores_gemma":[0.9996725,0.0001813392,0.00002563955,0.00003608274,0.00006004509,0.00002433542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004275941,0.00004314873,0.0003373683,0.0001602986,0.00006447378,0.00005730305,0.00008753219,0.7970597,0.005709304,0.08569587,0.002507982,0.1082343],"study_design_scores_gemma":[0.000008452152,0.0000172179,0.00004179714,0.000007108355,0.00000377343,0.00001676627,0.000003623325,0.9858624,0.000399518,0.01152459,0.002106442,0.000008259452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002796174,0.0002445512,0.9955261,0.0000957188,0.00003604016,0.00001854233,0.00001751372,0.0001380211,0.001127315],"genre_scores_gemma":[0.1067551,0.0005172136,0.8889603,0.0001409069,0.00007799794,0.0002744668,0.00006659293,0.000290884,0.00291658],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002492397,"threshold_uncertainty_score":0.008337915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012518296","doi":"10.1081/stm-200033117","title":"Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration","year":2004,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Markov chain; Wasserstein metric; Metric (unit); Markov chain Monte Carlo; Convergence (economics); Algorithm; Upper and lower bounds; Total variation; Applied mathematics; Image (mathematics); Bayesian probability; Mathematical optimization; Statistics; Computer science; Artificial intelligence; Mathematical analysis","authors":[{"name":"Alison L. Gibbs","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06900419749926845,"gpt":0.3476320010813868,"spread":0.2786278035821184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01024687,0.001480837,0.001221058,0.001905005,0.001171209,0.001766288,0.001803628,0.002496628,0.004734848],"category_scores_gemma":[0.05423723,0.000932532,0.00133156,0.001430525,0.003876044,0.004833057,0.003098565,0.004263571,0.0009118341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003378263,"about_ca_system_score_gemma":0.001818536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006271177,"about_ca_topic_score_gemma":0.005092933,"domain_scores_codex":[0.9957646,0.002638686,0.0002125722,0.0004508932,0.0007771279,0.0001560626],"domain_scores_gemma":[0.9658456,0.02916791,0.001410503,0.001312776,0.001649634,0.0006135535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008722806,0.00004390212,0.0009432021,0.0001952496,0.0000739059,0.000122511,0.0002046813,0.3362816,0.001235821,0.628839,0.001550357,0.03042257],"study_design_scores_gemma":[0.000006926849,0.00002453464,0.0001060578,0.0000289889,0.000008386078,0.0000442538,0.00001193679,0.8130878,0.0005246042,0.1845012,0.001637651,0.00001766058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002972104,0.0008553808,0.9932473,0.0004385763,0.00006617701,0.00003433375,0.00002426283,0.000159037,0.002202851],"genre_scores_gemma":[0.257041,0.002438681,0.7306809,0.0005747249,0.0002841504,0.0005157267,0.000268097,0.0005999155,0.00759682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01024687,"threshold_uncertainty_score":0.05419123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011918585","doi":"10.1016/s0304-4149(02)00096-0","title":"One-shot coupling for certain stochastic recursive sequences","year":2002,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Markov chain; Coupling (piping); Combinatorics; Chain (unit); Convergence (economics); Discrete mathematics; Statistics; Physics; Quantum mechanics","authors":[{"name":"Gareth O. Roberts","is_ca":false},{"name":"Jeffrey S. Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1437429349638152,"gpt":0.354352583947851,"spread":0.2106096489840358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005946915,0.001783007,0.002711444,0.002560294,0.001747815,0.003424624,0.003509095,0.004603304,0.005283634],"category_scores_gemma":[0.03253489,0.001876555,0.002214177,0.001676854,0.005919226,0.005984819,0.004168367,0.004121877,0.0004942446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003542231,"about_ca_system_score_gemma":0.001960967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00526659,"about_ca_topic_score_gemma":0.004108589,"domain_scores_codex":[0.9968711,0.001130414,0.0001336507,0.0007798176,0.0007051948,0.0003799004],"domain_scores_gemma":[0.9723725,0.02132513,0.002564083,0.0009728626,0.001195066,0.001570379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005303745,0.00005480486,0.0004696996,0.00007118866,0.00005407624,0.0001865852,0.0002790649,0.05715574,0.001297156,0.936545,0.0004318311,0.003401855],"study_design_scores_gemma":[0.00002238704,0.00002526913,0.0003284507,0.00002263091,0.00003090069,0.00009908005,0.00005449031,0.5807909,0.0004339392,0.4177095,0.0004333284,0.00004909413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1053442,0.0005607823,0.8850632,0.0006633872,0.00007841478,0.00007583482,0.0001129845,0.0002016571,0.007899525],"genre_scores_gemma":[0.9051636,0.001134207,0.07327466,0.0004486917,0.0002587443,0.0003104904,0.0002921898,0.0002529575,0.01886457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005946915,"threshold_uncertainty_score":0.03145069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544040121","doi":"10.1023/a:1018674822185","title":"Universality and Conformal Invariance for the Ising Model in Domains with Boundary","year":2000,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Statistical physics; Physics; Mathematics; Computer science","authors":[{"name":"R. P. Langlands","is_ca":false},{"name":"Marc-André Lewis","is_ca":false},{"name":"Yvan Saint-Aubin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05269549209718155,"gpt":0.3442890203115299,"spread":0.2915935282143483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002503598,0.000541766,0.001598159,0.002698248,0.001619679,0.002604197,0.002033251,0.001659412,0.002850418],"category_scores_gemma":[0.01047024,0.0006822944,0.001542412,0.0008230841,0.006071347,0.005014289,0.00249547,0.002373194,0.0002001642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001613614,"about_ca_system_score_gemma":0.001385576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005410604,"about_ca_topic_score_gemma":0.002989479,"domain_scores_codex":[0.9992309,0.0002689402,0.00004222455,0.0001243627,0.0001623149,0.0001713271],"domain_scores_gemma":[0.9933482,0.003415139,0.0008943782,0.0008038399,0.0004895453,0.001048852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004185232,0.00004017187,0.0009020088,0.00003894538,0.00002119177,0.0001088748,0.0001636121,0.01465869,0.0008942407,0.9811677,0.0004569184,0.001505738],"study_design_scores_gemma":[0.00002541989,0.00001357299,0.0005341051,0.00001745755,0.00001044777,0.00006149641,0.00004276644,0.1565141,0.0001829786,0.8423395,0.0002365492,0.00002161842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8022788,0.001244868,0.1791145,0.001699365,0.0001719766,0.00006285398,0.0002264875,0.0003651142,0.01483602],"genre_scores_gemma":[0.98956,0.0004251271,0.007471642,0.0001463472,0.0002446047,0.00003542437,0.0001847684,0.0001019683,0.001830125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005410604,"threshold_uncertainty_score":0.01324046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}