{"meta":{"query_hash":"7a7781369b2e","filters":{"topic":"Markov Chains and Monte Carlo Methods"},"cohort_total":418,"direct_labels_cover":1,"predictions_cover":418,"exported":418,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7a7781369b2e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Markov+Chains+and+Monte+Carlo+Methods"},"results":[{"id":"W1043410557","doi":"10.1017/cbo9780511819407.001","title":"Introduction","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.06849185076379798,"score_gpt":0.24870177711497135,"score_spread":0.1802099263511734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1043410557","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010629621,0.023013208,0.007334872,0.012445504,0.023839055,0.00016014754,0.0044370624,0.0010960173,0.9266111],"genre_scores_gemma":[0.005347946,0.014326791,0.0031413285,0.003651482,0.0060546184,0.000105991174,0.0044775154,0.00059075,0.9623037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898595,0.000107645494,0.000056729517,0.0002316334,0.00053627434,0.00008179605],"domain_scores_gemma":[0.9987606,0.00026501884,0.00006472288,0.00016455849,0.0005394113,0.00020563908],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069990056,0.0008997799,0.00066710496,0.001856019,0.0012680087,0.004996433,0.001465777,0.0016197615,0.35374227],"category_scores_gemma":[0.003785979,0.00029039636,0.00053976715,0.0021508725,0.0008106472,0.0039376114,0.0021471495,0.0020207518,0.22804078],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029622493,0.00002955965,0.00017964716,0.00028105523,0.000005028186,0.000047781825,0.00023636411,0.00014363292,0.00036335227,0.038917232,0.8289293,0.13083734],"study_design_scores_gemma":[0.0000010789772,0.0000049392042,0.00009056616,0.000067911955,9.182381e-7,0.000042570133,0.000033038166,0.000015559834,0.000041196694,0.0032478939,0.9964522,0.000002161525],"about_ca_topic_score_codex":0.0012115096,"about_ca_topic_score_gemma":0.001629322,"teacher_disagreement_score":0.35374227,"about_ca_system_score_codex":0.0014462618,"about_ca_system_score_gemma":0.0014624483,"threshold_uncertainty_score":0.92180824},"labels":[],"label_agreement":null},{"id":"W11938153","doi":"10.1007/978-3-642-04107-5_9","title":"Markov Chain Monte Carlo Algorithms: Theory and Practice","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Convergence (economics); Algorithm; Monte Carlo method; Markov chain; Metropolis–Hastings algorithm; Mathematical optimization; Hybrid Monte Carlo; Mathematics; Machine learning; Artificial intelligence; Bayesian probability; Statistics","score_opus":0.05438608574720542,"score_gpt":0.34715882546436533,"score_spread":0.2927727397171599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11938153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004090707,0.0060490505,0.9598392,0.0008558853,0.000419476,0.00003927011,0.000090945265,0.00054808555,0.031748936],"genre_scores_gemma":[0.04069204,0.01663995,0.8747075,0.00090806227,0.0012286188,0.00040796513,0.0005136894,0.0012197378,0.063682415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974433,0.0010705168,0.000099731,0.00025734294,0.0010564211,0.00007257377],"domain_scores_gemma":[0.991891,0.006378799,0.00012591279,0.00067816087,0.0008387781,0.00008726525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027494465,0.0013891892,0.001706365,0.0016408664,0.00075363717,0.0031589787,0.0018532922,0.0025270202,0.019944714],"category_scores_gemma":[0.013815405,0.0012521364,0.000824523,0.0032677879,0.00233027,0.00394742,0.001574868,0.004029855,0.010229668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001560837,0.0000557246,0.00021509182,0.00029368905,0.00003687895,0.000032242006,0.00014614675,0.036583815,0.00023083443,0.6672137,0.050700095,0.2444762],"study_design_scores_gemma":[0.000013718957,0.000011771985,0.00012309276,0.00019344443,0.000018490708,0.00011238238,0.000029166218,0.13840504,0.0004922147,0.743365,0.11720739,0.000028361354],"about_ca_topic_score_codex":0.0028773313,"about_ca_topic_score_gemma":0.002993845,"teacher_disagreement_score":0.019944714,"about_ca_system_score_codex":0.0015293013,"about_ca_system_score_gemma":0.002487186,"threshold_uncertainty_score":0.06672174},"labels":[],"label_agreement":null},{"id":"W1411197776","doi":"10.1017/cbo9780511611131.011","title":"Problems and further results","year":2007,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Content (measure theory); Computer science; World Wide Web; Information retrieval; Internet privacy; Mathematics","score_opus":0.10432906811925316,"score_gpt":0.2748982089960372,"score_spread":0.17056914087678401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1411197776","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047187908,0.04616752,0.08046014,0.04161247,0.005909502,0.00011250878,0.0010957626,0.00037642906,0.8195469],"genre_scores_gemma":[0.14463085,0.063197516,0.062604666,0.015970448,0.011016456,0.000679807,0.0034555858,0.0011930319,0.6972516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998743,0.00047637447,0.000053549673,0.0002144317,0.0003536251,0.00015902692],"domain_scores_gemma":[0.99822336,0.0009949756,0.00007222327,0.0002946104,0.00028474696,0.00013001813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181812,0.0012116648,0.0010163704,0.0014200966,0.0018626907,0.0034414649,0.0017043436,0.0020705499,0.083673604],"category_scores_gemma":[0.0066111456,0.00028190986,0.0017112372,0.0015374164,0.0029961972,0.005510416,0.0024924136,0.004572777,0.019999199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024098066,0.00003501817,0.000069687914,0.00026882553,0.000009297475,0.000049066846,0.000097511576,0.00090624165,0.00010901643,0.8796955,0.08378218,0.03495363],"study_design_scores_gemma":[0.0000058181113,0.000008126705,0.00008151773,0.00011541002,0.0000040622153,0.000058847258,0.000044507473,0.000917369,0.00008187192,0.90743315,0.09124436,0.000004978403],"about_ca_topic_score_codex":0.0019365547,"about_ca_topic_score_gemma":0.0015071157,"teacher_disagreement_score":0.083673604,"about_ca_system_score_codex":0.0028763383,"about_ca_system_score_gemma":0.002107717,"threshold_uncertainty_score":0.27991605},"labels":[],"label_agreement":null},{"id":"W1432510334","doi":"10.1016/j.spa.2017.02.002","title":"Elementary bounds on mixing times for decomposable Markov chains","year":2017,"lang":"en","type":"preprint","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mixing (physics); Mathematical proof; Examples of Markov chains; Mathematics; Projection (relational algebra); Simple (philosophy); Markov chain mixing time; Decomposition; Statistical physics; Pure mathematics; Discrete mathematics; Variable-order Markov model; Markov model; Algorithm; Physics; Statistics; Chemistry","score_opus":0.056170568854739276,"score_gpt":0.36409609271683174,"score_spread":0.3079255238620925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1432510334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025678448,0.0033304447,0.9466614,0.0022053176,0.00033697946,0.000077070246,0.00048895314,0.00035041952,0.020870907],"genre_scores_gemma":[0.70242125,0.013551432,0.22973534,0.0029564996,0.0036882097,0.001293635,0.0024804946,0.0021054435,0.04176766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99466634,0.0020526957,0.00028095703,0.0010776235,0.0012910927,0.00063134544],"domain_scores_gemma":[0.91906434,0.0654546,0.003718315,0.004283782,0.0033202663,0.0041588116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014460698,0.0059205666,0.0040280237,0.0067953654,0.002597693,0.007872144,0.0068282643,0.0050831544,0.014626826],"category_scores_gemma":[0.0680709,0.0026921828,0.0042683496,0.0043539694,0.009854973,0.01574582,0.010033624,0.019442206,0.0021671639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068455345,0.00005953939,0.00048241884,0.00015714405,0.000051641382,0.00009053807,0.00021716075,0.018798264,0.0007929075,0.97282445,0.0015891085,0.0048683304],"study_design_scores_gemma":[0.000011172217,0.000013846538,0.00020643025,0.00006558284,0.000031127835,0.00004072341,0.000029467901,0.098635815,0.00043120942,0.8991649,0.0013452382,0.00002450715],"about_ca_topic_score_codex":0.0019782842,"about_ca_topic_score_gemma":0.0021000677,"teacher_disagreement_score":0.014626826,"about_ca_system_score_codex":0.005353078,"about_ca_system_score_gemma":0.0024255961,"threshold_uncertainty_score":0.076476395},"labels":[],"label_agreement":null},{"id":"W1480561599","doi":"10.48550/arxiv.1302.6182","title":"Adaptive Hamiltonian and Riemann Manifold Monte Carlo Samplers","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hybrid Monte Carlo; Monte Carlo method; Markov chain Monte Carlo; Hamiltonian (control theory); Mathematical optimization; Ergodic theory; Statistical physics; Computer science; Monte Carlo molecular modeling; Applied mathematics; Monte Carlo integration; Algorithm; Mathematics; Physics; Mathematical analysis; Statistics","score_opus":0.15398600468409682,"score_gpt":0.21487398512935582,"score_spread":0.060887980445259005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480561599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009073532,0.00012948489,0.9885429,0.00016386964,0.000033368106,0.000053747928,0.000032624677,0.00024219425,0.0017282492],"genre_scores_gemma":[0.38043076,0.0002511853,0.6141225,0.00036315783,0.00011908105,0.00034682223,0.00022722952,0.00030237422,0.0038368013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768806,0.0014275833,0.000070076385,0.000311484,0.00037678028,0.00012610632],"domain_scores_gemma":[0.99288684,0.0049224,0.00034789956,0.0010866155,0.00049875054,0.000257491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004031172,0.0005311283,0.00092441234,0.0008564317,0.0007910395,0.0011062478,0.0020466608,0.0013902222,0.0048525245],"category_scores_gemma":[0.023764556,0.00046311383,0.000639408,0.0006413357,0.002153368,0.002274116,0.0021767458,0.002237643,0.00076618727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117698284,0.00007599984,0.0014634588,0.00007849059,0.00005891043,0.00010089471,0.00021082598,0.4151051,0.0016033549,0.5196935,0.0019257745,0.05956596],"study_design_scores_gemma":[0.000018081364,0.000018341354,0.00014463953,0.000010463623,0.000005662358,0.000023576495,0.000010921718,0.8914946,0.0005035913,0.10618731,0.0015675906,0.000015230028],"about_ca_topic_score_codex":0.0024091445,"about_ca_topic_score_gemma":0.003079286,"teacher_disagreement_score":0.0048525245,"about_ca_system_score_codex":0.0011388437,"about_ca_system_score_gemma":0.0012735819,"threshold_uncertainty_score":0.021319091},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015114203494403162,"score_gpt":0.2716785362266982,"score_spread":0.256564332732295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488446430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8143937,0.0005164596,0.17212532,0.0009116731,0.00008373645,0.00006391773,0.00020978451,0.00039946145,0.011295909],"genre_scores_gemma":[0.99020606,0.00011291177,0.007201837,0.00007256726,0.00003285196,0.000044370983,0.00011849472,0.000070974784,0.0021399374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00012272155,0.0000132037785,0.00010172558,0.0000907946,0.00006361611],"domain_scores_gemma":[0.9967437,0.0018294067,0.00040561645,0.00021227876,0.00023430254,0.0005745871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998082,0.00042320788,0.00053954695,0.0016062655,0.00073326955,0.0011698155,0.0009896929,0.0008685212,0.0030866943],"category_scores_gemma":[0.008280764,0.0004181658,0.00050702965,0.00053352676,0.0020366448,0.001730204,0.0013766446,0.0008080986,0.00022956995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030833925,0.000046423123,0.006874146,0.00016326047,0.00014183072,0.00049976644,0.00049514876,0.12923376,0.019912954,0.82839197,0.0027932294,0.011139127],"study_design_scores_gemma":[0.000028638378,0.000049225127,0.0027414546,0.000037501573,0.000041216656,0.00021164266,0.000077123885,0.731237,0.0040716426,0.25985527,0.0016020468,0.00004721913],"about_ca_topic_score_codex":0.0021725905,"about_ca_topic_score_gemma":0.0015600236,"teacher_disagreement_score":0.0030866943,"about_ca_system_score_codex":0.001262517,"about_ca_system_score_gemma":0.00040661418,"threshold_uncertainty_score":0.010325968},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12433000509691614,"score_gpt":0.4196921434342967,"score_spread":0.29536213833738056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497401739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010211285,0.00008335539,0.99569654,0.00013023523,0.000023530041,0.000027791186,0.000013538247,0.000034087287,0.002969812],"genre_scores_gemma":[0.16089672,0.00066418096,0.82227695,0.00028622488,0.00017165951,0.00070724625,0.0001470737,0.00031339523,0.0145365875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941885,0.0002444291,0.000026275922,0.00007590251,0.0001974197,0.00003714401],"domain_scores_gemma":[0.9992687,0.00041162476,0.000067273126,0.00005613996,0.00016234184,0.000033890505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017796507,0.0010159735,0.0008784534,0.00074482773,0.00055361964,0.0009015318,0.0018080823,0.00166264,0.0045835027],"category_scores_gemma":[0.0034079836,0.0005337526,0.0010334615,0.0005736918,0.0013683431,0.0014282035,0.0014828122,0.0014687022,0.0010411171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023292832,0.000030934363,0.00029675997,0.00012425007,0.00003845492,0.00009496377,0.00013972902,0.52148736,0.0024927906,0.45140824,0.0022212956,0.021641929],"study_design_scores_gemma":[0.000006548869,0.000022883316,0.00004113372,0.000016485883,0.000005404273,0.000037621503,0.000011627998,0.938849,0.00046376477,0.057692774,0.0028419143,0.000010973905],"about_ca_topic_score_codex":0.0011193415,"about_ca_topic_score_gemma":0.0011879717,"teacher_disagreement_score":0.0045835027,"about_ca_system_score_codex":0.0009399349,"about_ca_system_score_gemma":0.0012185258,"threshold_uncertainty_score":0.0153333545},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08842884299117262,"score_gpt":0.40817924895999425,"score_spread":0.31975040596882165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501586228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012478688,0.00057221483,0.99432206,0.00033292797,0.00009007647,0.000042439206,0.00010381818,0.00018298444,0.0031056015],"genre_scores_gemma":[0.2194061,0.0026992615,0.7583238,0.00043181368,0.00045689175,0.0006366373,0.0007682034,0.00035864496,0.016918633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800307,0.0010249674,0.00007507617,0.0002906195,0.00050608045,0.0001001544],"domain_scores_gemma":[0.9932869,0.0049335146,0.00032760447,0.00057349115,0.00072257116,0.00015585116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029105311,0.0007380596,0.0011361408,0.0012175593,0.0006338327,0.0017085163,0.0016445019,0.0014919647,0.0089945495],"category_scores_gemma":[0.011360199,0.00059251173,0.0009980658,0.0014194504,0.0014294548,0.0017158362,0.0012975507,0.0022410334,0.0020475667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038856055,0.000049737482,0.0010124044,0.00021146667,0.000083687235,0.0000981119,0.00008475644,0.4118916,0.00045956703,0.5104456,0.0056805755,0.06994366],"study_design_scores_gemma":[0.000019474843,0.00001413478,0.00015870102,0.00005458189,0.000012199778,0.000037106427,0.000010441664,0.72564596,0.00030510357,0.26410562,0.009618803,0.000017807526],"about_ca_topic_score_codex":0.0052686483,"about_ca_topic_score_gemma":0.0037095028,"teacher_disagreement_score":0.0089945495,"about_ca_system_score_codex":0.0011679706,"about_ca_system_score_gemma":0.0022090643,"threshold_uncertainty_score":0.030089736},"labels":[],"label_agreement":null},{"id":"W1510967706","doi":"","title":"Interacting Multiple Try Algorithms","year":2012,"lang":"en","type":"article","venue":"ARCA (Università Ca' Foscari Venezia)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.10110417459127552,"score_gpt":0.3427725788739356,"score_spread":0.24166840428266007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510967706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025755053,0.00013631298,0.992386,0.0001510736,0.000089702735,0.00007428856,0.000038181726,0.00046009928,0.004088892],"genre_scores_gemma":[0.14277804,0.00045490786,0.84192294,0.00046661365,0.00020858028,0.00079550536,0.00025145483,0.0007718844,0.012350027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644995,0.0015085735,0.00015047018,0.00042513385,0.0011679407,0.00029793862],"domain_scores_gemma":[0.9921463,0.0045127925,0.00045213994,0.0015691506,0.00091978774,0.000399833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035434698,0.0013943706,0.0017731931,0.001424935,0.0013369183,0.0029304076,0.0050903866,0.0027342727,0.015292475],"category_scores_gemma":[0.016594237,0.0008974381,0.0017995491,0.0015114474,0.0017325808,0.004250579,0.0045555495,0.0038296247,0.00335459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019846817,0.00020571164,0.0015998906,0.0002585032,0.0001979472,0.00016990233,0.0002341547,0.22456104,0.002395841,0.671833,0.006309011,0.09203654],"study_design_scores_gemma":[0.000051332685,0.00003746472,0.00011364655,0.000026468848,0.000027292215,0.00009010988,0.000020518148,0.8192278,0.0015989146,0.17255858,0.0062120673,0.000035706016],"about_ca_topic_score_codex":0.0012966087,"about_ca_topic_score_gemma":0.002318115,"teacher_disagreement_score":0.015292475,"about_ca_system_score_codex":0.0010826426,"about_ca_system_score_gemma":0.0017738855,"threshold_uncertainty_score":0.05115837},"labels":[],"label_agreement":null},{"id":"W1517540866","doi":"10.1002/rsa.20693","title":"The cutoff phenomenon for random birth and death chains","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Statistics Canada","funders":"","keywords":"Cutoff; Pi; Tridiagonal matrix; Mathematics; Combinatorics; Block (permutation group theory); Random matrix; Distribution (mathematics); Stationary distribution; Markov chain; Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Statistics; Chemistry; Eigenvalues and eigenvectors; Geometry","score_opus":0.045748252455866945,"score_gpt":0.33821568476917685,"score_spread":0.2924674323133099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517540866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47795996,0.0009558455,0.50734574,0.0013427939,0.00006537649,0.000100348254,0.00021361974,0.00039323053,0.01162318],"genre_scores_gemma":[0.96592736,0.00037355677,0.029839136,0.00019568823,0.000057191915,0.00017640594,0.00016644075,0.00007905155,0.003185053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988784,0.0004919326,0.000050023304,0.00020344551,0.0001948439,0.00018134482],"domain_scores_gemma":[0.9865095,0.009307499,0.0013900996,0.0010348279,0.0007683525,0.0009897453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037091428,0.0004581598,0.00092295976,0.0014801895,0.0012158928,0.0019552482,0.0013155125,0.0014150329,0.0029297264],"category_scores_gemma":[0.025457269,0.00041495488,0.0007456555,0.00082370196,0.003577536,0.0028418961,0.0016963184,0.0022563878,0.00030660562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013317609,0.0000739372,0.005016111,0.0000840872,0.000040018604,0.00049650384,0.00056819594,0.051190697,0.0023796353,0.93268704,0.0014270163,0.005903533],"study_design_scores_gemma":[0.00004861104,0.000033916043,0.0011250243,0.00005405511,0.000015102907,0.00016264802,0.00012987679,0.42647192,0.0008158938,0.57009417,0.0010245655,0.00002425038],"about_ca_topic_score_codex":0.0022329267,"about_ca_topic_score_gemma":0.0016495435,"teacher_disagreement_score":0.0037091428,"about_ca_system_score_codex":0.0020977077,"about_ca_system_score_gemma":0.0009624807,"threshold_uncertainty_score":0.019616008},"labels":[],"label_agreement":null},{"id":"W1522904549","doi":"10.5555/1496770.1496777","title":"The complexity of simulating Brownian Motion","year":2009,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Upper and lower bounds; Brownian motion; Bounded function; Domain (mathematical analysis); Boundary (topology); Convergence (economics); Random walk; Rate of convergence; Combinatorics; Algorithm; Position (finance); Mathematical analysis; Computer science","score_opus":0.20328453213782524,"score_gpt":0.39527701858076897,"score_spread":0.19199248644294373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522904549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40614814,0.00068024604,0.5757551,0.002834445,0.00012698474,0.00027194835,0.00054313085,0.0012839459,0.012355998],"genre_scores_gemma":[0.8288872,0.00029157632,0.16563654,0.00031075723,0.00007655643,0.00034331816,0.0008923234,0.0003311415,0.003230558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965699,0.0014544134,0.00024304945,0.0005387651,0.00083795906,0.00035582465],"domain_scores_gemma":[0.9576272,0.03649867,0.0013260064,0.0024056758,0.0013410854,0.00080128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043752436,0.00074341556,0.0014135345,0.00095487596,0.0011395052,0.0023248042,0.0021876623,0.002116931,0.0044659628],"category_scores_gemma":[0.034915857,0.0008618088,0.001315738,0.0009837375,0.0021928751,0.0041718944,0.0019769517,0.0023489024,0.00046884353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005125234,0.00007840216,0.0038583393,0.00018827173,0.00011694943,0.00013129003,0.00023893609,0.9084904,0.0028474596,0.06482521,0.0015093026,0.017202916],"study_design_scores_gemma":[0.000016415494,0.000009099919,0.00014950134,0.000004999639,0.0000055184223,0.000010840185,0.000008032412,0.98184067,0.0003782159,0.017423408,0.0001487266,0.000004596966],"about_ca_topic_score_codex":0.0076182215,"about_ca_topic_score_gemma":0.0056321505,"teacher_disagreement_score":0.0076182215,"about_ca_system_score_codex":0.003029642,"about_ca_system_score_gemma":0.002136079,"threshold_uncertainty_score":0.023138821},"labels":[],"label_agreement":null},{"id":"W1524737199","doi":"10.1007/11682462_61","title":"Randomly Colouring Graphs with Girth Five and Large Maximum Degree","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Combinatorics; Degree (music); Girth (graph theory); Graph; Mathematics; Discrete mathematics; Computer science; Physics","score_opus":0.030508984719750328,"score_gpt":0.27637773377912556,"score_spread":0.24586874905937522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524737199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7390614,0.00086815486,0.23141924,0.0024835805,0.00021314672,0.00015237195,0.00071050867,0.00097374606,0.024117835],"genre_scores_gemma":[0.9270717,0.00045354242,0.06236042,0.0005109281,0.00012217963,0.00012678019,0.0006928565,0.00040535783,0.008256155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981988,0.0007800116,0.00005627696,0.0003617712,0.0003205383,0.00028256234],"domain_scores_gemma":[0.9746061,0.01883324,0.001588349,0.0029049765,0.0007355326,0.0013318228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019303113,0.0008242987,0.0012306976,0.0015358843,0.0014260603,0.0021925224,0.002261768,0.0025326626,0.0046034525],"category_scores_gemma":[0.016145123,0.0013857656,0.0013382088,0.001651147,0.0028858876,0.0033697835,0.0023689428,0.002641791,0.00062379363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008502893,0.00022158712,0.0048439824,0.0005186548,0.0001701414,0.00068025454,0.001061681,0.23279576,0.017605152,0.6897214,0.012429697,0.03910143],"study_design_scores_gemma":[0.00014452671,0.00011834733,0.0016391553,0.00006314687,0.00006856117,0.0005189787,0.00019648604,0.18617803,0.0055265706,0.8018053,0.0036935343,0.000047414407],"about_ca_topic_score_codex":0.0010148431,"about_ca_topic_score_gemma":0.0019761692,"teacher_disagreement_score":0.0046034525,"about_ca_system_score_codex":0.0017139276,"about_ca_system_score_gemma":0.00073720585,"threshold_uncertainty_score":0.015400052},"labels":[],"label_agreement":null},{"id":"W1527147916","doi":"10.1017/cbo9781139022262.023","title":"Monte Carlo methods","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monte Carlo method; Computer science; Content (measure theory); Statistical physics; Information retrieval; Statistics; Mathematics; Physics","score_opus":0.10082825331990969,"score_gpt":0.31722022952697404,"score_spread":0.21639197620706435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527147916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006616768,0.0039594057,0.9598451,0.00069556205,0.00045740095,0.00014802763,0.00055867305,0.00096765306,0.032706387],"genre_scores_gemma":[0.06922081,0.009514806,0.8273225,0.0012629298,0.00088709267,0.0015389757,0.0023868945,0.0021131283,0.08575286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566096,0.002505196,0.00016542195,0.0005057907,0.0009650427,0.00019745583],"domain_scores_gemma":[0.99031806,0.0070139053,0.00031720527,0.0011227247,0.001026785,0.00020121821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042442326,0.0015685845,0.0018655244,0.0019682888,0.0009882211,0.0028142985,0.0029897331,0.0022811943,0.05776625],"category_scores_gemma":[0.021018878,0.0008377587,0.0018061874,0.0022785184,0.0014225643,0.0022469715,0.002378772,0.0029738545,0.019543016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009610026,0.00011845541,0.0009449463,0.00081901916,0.00028605122,0.00010412402,0.00018417242,0.10001146,0.00046657538,0.60740113,0.058438513,0.23112951],"study_design_scores_gemma":[0.00006617961,0.000045126264,0.00037562175,0.00040973342,0.00007329971,0.0001868255,0.00006233045,0.31903392,0.00084576535,0.53522176,0.14361756,0.00006194166],"about_ca_topic_score_codex":0.004015117,"about_ca_topic_score_gemma":0.00506986,"teacher_disagreement_score":0.05776625,"about_ca_system_score_codex":0.0016633177,"about_ca_system_score_gemma":0.002781434,"threshold_uncertainty_score":0.19324738},"labels":[],"label_agreement":null},{"id":"W1529384316","doi":"10.48550/arxiv.1003.3201","title":"Covariance-Adaptive Slice Sampling","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Covariance; Sampling (signal processing); Computer science; Adaptive sampling; Multivariate statistics; Algorithm; Curvature; Statistics; Mathematics; Monte Carlo method; Computer vision; Geometry","score_opus":0.3120369468951365,"score_gpt":0.27867680030079756,"score_spread":0.033360146594338946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529384316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050537884,0.000116272815,0.99293464,0.000052364452,0.000039319606,0.00007665657,0.00006525151,0.0005423837,0.0011192614],"genre_scores_gemma":[0.12725179,0.00016221657,0.8685687,0.00016835135,0.00006687078,0.0003149056,0.00047298273,0.00043006573,0.0025640812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855095,0.0005847684,0.00006117258,0.00024816065,0.00044451427,0.00011048491],"domain_scores_gemma":[0.995261,0.0019765086,0.00027051385,0.0013199614,0.00090521015,0.00026680497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024852434,0.0009258219,0.0010861952,0.0011255099,0.00068147434,0.0010836311,0.0031193483,0.0012570106,0.0075498344],"category_scores_gemma":[0.014016419,0.0006098543,0.0012051654,0.0012331036,0.001294005,0.0017544541,0.0021212224,0.0017688619,0.0016176938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007405261,0.00026288643,0.007740804,0.00030567334,0.00027766285,0.00035162526,0.0004811738,0.24634783,0.01981599,0.21384229,0.011384725,0.4984488],"study_design_scores_gemma":[0.000103265535,0.000108594475,0.0009823773,0.000037276703,0.000042090447,0.00029370462,0.000045784887,0.9299269,0.008900794,0.050618958,0.008877642,0.00006270346],"about_ca_topic_score_codex":0.005507041,"about_ca_topic_score_gemma":0.008519387,"teacher_disagreement_score":0.0075498344,"about_ca_system_score_codex":0.00073799834,"about_ca_system_score_gemma":0.002196952,"threshold_uncertainty_score":0.025256693},"labels":[],"label_agreement":null},{"id":"W1532747171","doi":"10.1023/a:1008991527785","title":"Efficient use of exact samples","year":2000,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Markov chain; Estimator; Computer science; Sampling (signal processing); Stationary distribution; Algorithm; Event (particle physics); Sample (material); Mathematics; Distribution (mathematics); Monte Carlo method; Statistics","score_opus":0.09316534972048257,"score_gpt":0.34718052815224965,"score_spread":0.2540151784317671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532747171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003260445,0.00019115435,0.9934575,0.000119598626,0.00005366839,0.00003652063,0.000070760645,0.00088686927,0.0019235279],"genre_scores_gemma":[0.18978329,0.00041793968,0.80214596,0.00023807923,0.00015308731,0.00029919195,0.00060584117,0.0006741967,0.0056823837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913543,0.0034443494,0.00043908815,0.0011813059,0.0030514402,0.0005295697],"domain_scores_gemma":[0.97531813,0.013347089,0.00067103014,0.008123249,0.002155234,0.00038530506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049252626,0.0014293976,0.0026585069,0.0021378023,0.0011556966,0.0032405634,0.003330926,0.0013796831,0.0137425205],"category_scores_gemma":[0.046508413,0.0011909334,0.0014661965,0.002740667,0.0020688067,0.0063202493,0.0056588645,0.003254938,0.004557987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096719543,0.00029513045,0.0025096748,0.0003942794,0.0001888316,0.00026601044,0.00034753978,0.14099322,0.005571779,0.30994985,0.010481614,0.52803487],"study_design_scores_gemma":[0.000074140655,0.000054497366,0.00036111893,0.000038912647,0.00004388924,0.00016310113,0.00004710986,0.70445925,0.0040495778,0.2847907,0.005887394,0.000030272298],"about_ca_topic_score_codex":0.002729121,"about_ca_topic_score_gemma":0.0051691853,"teacher_disagreement_score":0.0137425205,"about_ca_system_score_codex":0.0015240671,"about_ca_system_score_gemma":0.0032847857,"threshold_uncertainty_score":0.04597324},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Statistical physics; Physics; Mathematics; Computer science","score_opus":0.05269549209718155,"score_gpt":0.34428902031152986,"score_spread":0.2915935282143483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544040121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8022788,0.0012448679,0.17911449,0.0016993652,0.00017197659,0.00006285398,0.00022648751,0.00036511422,0.01483602],"genre_scores_gemma":[0.98956,0.0004251271,0.0074716415,0.00014634721,0.0002446047,0.000035424368,0.00018476836,0.00010196834,0.0018301246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923086,0.00026894017,0.00004222455,0.00012436266,0.00016231493,0.0001713271],"domain_scores_gemma":[0.9933482,0.0034151387,0.0008943782,0.00080383994,0.00048954535,0.0010488515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025035979,0.000541766,0.0015981589,0.0026982478,0.0016196789,0.002604197,0.0020332509,0.0016594123,0.002850418],"category_scores_gemma":[0.010470242,0.0006822944,0.0015424121,0.00082308415,0.006071347,0.0050142887,0.0024954705,0.002373194,0.00020016418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041852323,0.000040171868,0.00090200885,0.00003894538,0.000021191772,0.00010887476,0.00016361207,0.014658694,0.0008942407,0.9811677,0.00045691838,0.0015057379],"study_design_scores_gemma":[0.000025419893,0.000013572994,0.0005341051,0.000017457545,0.000010447766,0.00006149641,0.00004276644,0.15651412,0.00018297856,0.8423395,0.00023654923,0.00002161842],"about_ca_topic_score_codex":0.005410604,"about_ca_topic_score_gemma":0.0029894786,"teacher_disagreement_score":0.005410604,"about_ca_system_score_codex":0.0016136143,"about_ca_system_score_gemma":0.0013855762,"threshold_uncertainty_score":0.013240457},"labels":[],"label_agreement":null},{"id":"W1548534681","doi":"10.1002/9781118445112.stat04385","title":"<scp>M</scp>arkov Chain<scp>M</scp>onte<scp>C</scp>arlo Methods","year":2014,"lang":"en","type":"other","venue":"Wiley StatsRef: Statistics Reference Online","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Markov chain Monte Carlo; Ergodic theory; Curse of dimensionality; Markov process; Markov chain mixing time; Computer science; Chain (unit); Statistical physics; Monte Carlo method; Measure (data warehouse); Markov model; Mathematics; Mathematical optimization; Variable-order Markov model; Physics; Statistics; Artificial intelligence; Data mining; Machine learning","score_opus":0.08054809269280755,"score_gpt":0.39106522309332875,"score_spread":0.3105171304005212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548534681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020043328,0.002252357,0.79045916,0.0053141634,0.001811136,0.00028627043,0.006400386,0.008416849,0.18305525],"genre_scores_gemma":[0.10122181,0.003708386,0.57138866,0.0028117208,0.001968392,0.0016003188,0.011086966,0.012396114,0.2938177],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974916,0.0008857834,0.00013755026,0.0004460166,0.0008933311,0.00014571218],"domain_scores_gemma":[0.98912674,0.004841348,0.00068404916,0.0026197026,0.0022459961,0.00048221697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989791,0.00097809,0.0010367986,0.0029738364,0.0010830485,0.003097277,0.002436983,0.0014817379,0.20627008],"category_scores_gemma":[0.018646518,0.00061760814,0.0010234427,0.0035193793,0.0013543436,0.002061206,0.003158273,0.0022958487,0.09751693],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118247975,0.00012457154,0.0012193079,0.00038496053,0.00007808375,0.00014839853,0.000068602916,0.020846257,0.00064564066,0.27304476,0.331873,0.37144813],"study_design_scores_gemma":[0.00010378703,0.000031961783,0.0010114814,0.00034101788,0.000036266487,0.00018055609,0.000041076823,0.17281166,0.0030987007,0.34138584,0.48086923,0.00008844495],"about_ca_topic_score_codex":0.0062230853,"about_ca_topic_score_gemma":0.011289799,"teacher_disagreement_score":0.20627008,"about_ca_system_score_codex":0.0021099248,"about_ca_system_score_gemma":0.0032696803,"threshold_uncertainty_score":0.69004214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06093238297592173,"score_gpt":0.39240251989804525,"score_spread":0.3314701369221235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550160156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009999087,0.045489576,0.53015924,0.011772072,0.00507826,0.00014812732,0.001142584,0.0014838275,0.4037264],"genre_scores_gemma":[0.06654096,0.0798897,0.43640262,0.007816581,0.00941344,0.00075047015,0.0023115335,0.0023989934,0.3944758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781656,0.00059761514,0.00010877921,0.0002880171,0.0010532826,0.00013566871],"domain_scores_gemma":[0.99573,0.0029792818,0.00011008509,0.0004087685,0.00061232294,0.00015959679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024841346,0.0015751977,0.0011959843,0.0015737024,0.0009667492,0.003400133,0.0014831779,0.002237954,0.05398055],"category_scores_gemma":[0.010101515,0.00088615646,0.00134183,0.0021181884,0.0022415463,0.004239505,0.0019599602,0.0051473165,0.024443872],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011397251,0.0000333767,0.00016239974,0.00024519104,0.000030778567,0.000064637476,0.00012606318,0.007403826,0.00024748154,0.7969601,0.1056825,0.08903227],"study_design_scores_gemma":[0.000010125648,0.0000125050565,0.00014080243,0.00025065857,0.000010374226,0.00011450824,0.000021204612,0.0075146966,0.0001775063,0.6414321,0.35029468,0.00002070162],"about_ca_topic_score_codex":0.0020081918,"about_ca_topic_score_gemma":0.0019086829,"teacher_disagreement_score":0.05398055,"about_ca_system_score_codex":0.0021765935,"about_ca_system_score_gemma":0.0020873137,"threshold_uncertainty_score":0.18058294},"labels":[],"label_agreement":null},{"id":"W155415014","doi":"","title":"The phase transition in NK landscapes is easy","year":2001,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase transition; Infinity; Mathematics; Upper and lower bounds; Polynomial; Phase (matter); Discrete mathematics; Applied mathematics; Statistical physics; Mathematical optimization; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.06180675138591939,"score_gpt":0.3805121732328596,"score_spread":0.3187054218469402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155415014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.414675,0.0005803192,0.5420643,0.0019109023,0.00009818876,0.0002018776,0.00051558384,0.00046999587,0.03948388],"genre_scores_gemma":[0.9513006,0.00033339197,0.039775584,0.0003397818,0.000060178736,0.00021692865,0.00035843818,0.00012481459,0.0074901646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991462,0.00016723979,0.000045595018,0.00027503667,0.00022074812,0.00014519574],"domain_scores_gemma":[0.9966323,0.0021250811,0.00038162022,0.00041034323,0.00021471012,0.00023598167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084258814,0.0003392043,0.0008864077,0.00050450856,0.0006502077,0.0018765659,0.0010967186,0.0009734872,0.007368623],"category_scores_gemma":[0.0077053467,0.00034522507,0.00076584995,0.00042006795,0.0018931257,0.0048271734,0.0015391535,0.0016734718,0.0007919959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019909565,0.00015744042,0.0013881234,0.00020229809,0.000041640804,0.00024474945,0.0002475039,0.07218157,0.0048598098,0.8964888,0.0034615875,0.020527434],"study_design_scores_gemma":[0.00007016192,0.00006976506,0.00057331735,0.000021566108,0.000013242156,0.00022323987,0.000103073835,0.21780814,0.0023032892,0.77467495,0.0041168616,0.000022486302],"about_ca_topic_score_codex":0.0010698038,"about_ca_topic_score_gemma":0.0007698283,"teacher_disagreement_score":0.007368623,"about_ca_system_score_codex":0.000841632,"about_ca_system_score_gemma":0.00052111794,"threshold_uncertainty_score":0.024650514},"labels":[],"label_agreement":null},{"id":"W1582332289","doi":"10.1007/978-3-540-74208-1_26","title":"Derandomization of Euclidean Random Walks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random walk; Euclidean space; Corollary; Combinatorics; Euclidean geometry; Binary logarithm; Space (punctuation); Dirichlet distribution; Euclidean distance; Mathematics; Computer science; Discrete mathematics; Statistics; Mathematical analysis; Geometry","score_opus":0.05354793019906154,"score_gpt":0.33273044431317816,"score_spread":0.27918251411411665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582332289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0365921,0.0024236385,0.9107105,0.0023241458,0.00036173634,0.0001216482,0.0004051168,0.0005396771,0.046521377],"genre_scores_gemma":[0.7519406,0.0048421263,0.17007749,0.0018430864,0.0012978229,0.0012614707,0.0018322337,0.0018847142,0.06502053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99339974,0.003684096,0.00024668514,0.0009605096,0.0012309168,0.00047812043],"domain_scores_gemma":[0.96955824,0.023065323,0.000968059,0.0040719607,0.0015653643,0.0007709631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071064173,0.0013399574,0.0019864861,0.0020275696,0.0012855588,0.0030324545,0.0032554837,0.0021452438,0.011601025],"category_scores_gemma":[0.039315768,0.00092970335,0.0016969797,0.0017161155,0.005214624,0.0059337346,0.0042967373,0.0061701355,0.002116354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051870175,0.00001535625,0.00018677564,0.00006954202,0.000022463631,0.000029296925,0.000063840474,0.021196611,0.0003946551,0.96787304,0.0024319885,0.007664527],"study_design_scores_gemma":[0.000023056826,0.000016207874,0.00014474067,0.000034814137,0.000010843237,0.000046149966,0.000015154094,0.104406826,0.0004471996,0.8921809,0.0026587239,0.000015438945],"about_ca_topic_score_codex":0.0012636738,"about_ca_topic_score_gemma":0.0011931122,"teacher_disagreement_score":0.011601025,"about_ca_system_score_codex":0.003053408,"about_ca_system_score_gemma":0.001961426,"threshold_uncertainty_score":0.0388093},"labels":[],"label_agreement":null},{"id":"W1593254397","doi":"10.1023/a:1020993322286","title":"Exact Asymptotics for k i -limited Exponential Polling Models","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Polling system; Queue; Class (philosophy); Polling; Heuristics; Mathematics; Exponential function; Applied mathematics; Computer science; Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer network","score_opus":0.1805786110144647,"score_gpt":0.3364654264797178,"score_spread":0.15588681546525307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593254397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07590324,0.0033644645,0.8975968,0.0020512233,0.00026544026,0.000105210536,0.00037524762,0.0008245285,0.019513842],"genre_scores_gemma":[0.933382,0.002471815,0.048689257,0.00055664364,0.00046476212,0.00027456885,0.0005621673,0.00047022605,0.013128612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783367,0.0008282162,0.00010773174,0.00030782048,0.0005247195,0.00039788414],"domain_scores_gemma":[0.9756968,0.018316913,0.0017223548,0.0018169949,0.0016813689,0.000765534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068622697,0.0013983772,0.0023163678,0.002878169,0.0014220963,0.00359378,0.004990034,0.003255368,0.008099406],"category_scores_gemma":[0.04598431,0.0015562818,0.0015266037,0.002345577,0.0043906854,0.008380351,0.0041565006,0.0043705394,0.0010559855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012877521,0.00012565115,0.0013896913,0.00025347108,0.00006406833,0.00018542286,0.00030762903,0.38692832,0.0010451989,0.5964632,0.0031587959,0.00994985],"study_design_scores_gemma":[0.0000133766725,0.000007710839,0.00024056861,0.0000366996,0.000013684621,0.00004575683,0.000036981193,0.8440221,0.00018734233,0.15498342,0.00038872263,0.000023623335],"about_ca_topic_score_codex":0.008338578,"about_ca_topic_score_gemma":0.0064143697,"teacher_disagreement_score":0.008338578,"about_ca_system_score_codex":0.00480307,"about_ca_system_score_gemma":0.002666451,"threshold_uncertainty_score":0.0362916},"labels":[],"label_agreement":null},{"id":"W1606072092","doi":"10.1023/a:1013561529682","title":"A Note on Eigenvalues of Liouvilleans","year":2001,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Ergodicity; Ergodic theory; Eigenvalues and eigenvectors; Mixing (physics); Mathematics; Simple (philosophy); Zero (linguistics); Pure mathematics; State (computer science); Combinatorics; Mathematical physics; Physics; Quantum mechanics; Statistics","score_opus":0.07759756311077466,"score_gpt":0.40155989639041556,"score_spread":0.3239623332796409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606072092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07491945,0.010350516,0.6390163,0.023327347,0.01429283,0.00007585537,0.00026851628,0.0009446204,0.23680468],"genre_scores_gemma":[0.75674754,0.006749909,0.12827781,0.007210145,0.015056905,0.00023940435,0.00015696629,0.0012633548,0.08429789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837947,0.0007144719,0.00009776637,0.00023489329,0.0004276407,0.00014584689],"domain_scores_gemma":[0.9893764,0.007891972,0.00040572198,0.0008737891,0.0008961045,0.0005559356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467989,0.0010833642,0.0015395544,0.0029126145,0.0031834687,0.003819469,0.0017135041,0.003056997,0.008633009],"category_scores_gemma":[0.017170833,0.0007537331,0.0011981204,0.001790171,0.0063057863,0.008714424,0.0030637854,0.005929147,0.0014175692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009094471,0.0000066091975,0.000042561744,0.000017073777,0.0000025733455,0.00003511145,0.00010303444,0.00051356107,0.0001638066,0.99469596,0.0021322537,0.002278365],"study_design_scores_gemma":[0.00000307419,0.0000035126907,0.00002833307,0.000008745785,0.0000016517907,0.000025091276,0.000015473168,0.0034104646,0.000094886665,0.993638,0.0027614175,0.0000091745815],"about_ca_topic_score_codex":0.0010283863,"about_ca_topic_score_gemma":0.0008328195,"teacher_disagreement_score":0.008633009,"about_ca_system_score_codex":0.0013793258,"about_ca_system_score_gemma":0.0007413409,"threshold_uncertainty_score":0.028880298},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05936358466552672,"score_gpt":0.30391475554949815,"score_spread":0.24455117088397144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624558029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008258986,0.0001963474,0.9889103,0.00016900059,0.000033530847,0.00004284679,0.000027065376,0.00023314943,0.002128736],"genre_scores_gemma":[0.3953396,0.00033496364,0.5992936,0.00030683927,0.00011452194,0.0002543709,0.00015490504,0.00026453077,0.003936664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978892,0.0013103806,0.0000585052,0.0002521732,0.00037721207,0.00011246092],"domain_scores_gemma":[0.99382704,0.0043459567,0.00030805013,0.00089773047,0.00039678154,0.00022450507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033839731,0.00049781316,0.0008540949,0.0007816636,0.000738519,0.0009962152,0.0019709996,0.001423073,0.0037377898],"category_scores_gemma":[0.018045215,0.00045728846,0.00055205915,0.0006428561,0.0023618215,0.001935042,0.002036711,0.00204004,0.0006463847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007436594,0.000049446455,0.0011362482,0.00007096643,0.00004700375,0.000071101786,0.00015489619,0.49657795,0.0012579443,0.45458907,0.0012564139,0.044714533],"study_design_scores_gemma":[0.000009712169,0.000013980242,0.000119752316,0.000007983042,0.0000038660864,0.000017251856,0.000006976319,0.91609746,0.00036204475,0.08212588,0.0012227386,0.000012386742],"about_ca_topic_score_codex":0.003190147,"about_ca_topic_score_gemma":0.004091628,"teacher_disagreement_score":0.0037377898,"about_ca_system_score_codex":0.0012921508,"about_ca_system_score_gemma":0.0013334595,"threshold_uncertainty_score":0.017896414},"labels":[],"label_agreement":null},{"id":"W1659092632","doi":"","title":"Pipage Rounding, Pessimistic Estimators and Matrix Concentration","year":2014,"lang":"en","type":"article","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Orthonormal basis; Estimator; Random matrix; Matrix (chemical analysis); Discrete mathematics; Computer science; Eigenvalues and eigenvectors; Physics; Statistics","score_opus":0.08111849549018943,"score_gpt":0.4249902210763903,"score_spread":0.3438717255862008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659092632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01366475,0.0008540156,0.97755843,0.0009260801,0.00008862365,0.000044411183,0.00010748558,0.00018629938,0.0065699234],"genre_scores_gemma":[0.6578404,0.0022837897,0.32630032,0.0013697806,0.0005734363,0.00040461606,0.00041309785,0.0003060061,0.010508604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936289,0.0029934836,0.0002474915,0.0010055634,0.0017209321,0.00040357953],"domain_scores_gemma":[0.9465062,0.0412682,0.0037373344,0.005102425,0.0026873392,0.0006985321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007842903,0.0010371795,0.0013371081,0.0016663888,0.0012009243,0.0024854017,0.001972835,0.0017517462,0.0049702143],"category_scores_gemma":[0.070368394,0.00088834687,0.00089179864,0.0017250862,0.0048395065,0.004626379,0.0031147255,0.004243817,0.00085772783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013328563,0.000039917715,0.0016726335,0.00014160106,0.000055792316,0.00015341536,0.00017768545,0.10704899,0.0018550693,0.8579093,0.0035625468,0.02724987],"study_design_scores_gemma":[0.00003109076,0.000083448096,0.00046178413,0.00008534298,0.000023128787,0.00020355692,0.000049932503,0.44243684,0.0032806944,0.54932004,0.003970631,0.000053488082],"about_ca_topic_score_codex":0.0014493791,"about_ca_topic_score_gemma":0.00112277,"teacher_disagreement_score":0.007842903,"about_ca_system_score_codex":0.0017102063,"about_ca_system_score_gemma":0.0012374823,"threshold_uncertainty_score":0.04147768},"labels":[],"label_agreement":null},{"id":"W1705626586","doi":"10.48550/arxiv.1206.5239","title":"Large-Flip Importance Sampling","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Markov chain Monte Carlo; Sampling (signal processing); Monte Carlo method; Importance sampling; Computer science; Algorithm; Rejection sampling; Process (computing); Event (particle physics); Hybrid Monte Carlo; Statistical physics; Mathematical optimization; Mathematics; Statistics; Physics; Telecommunications","score_opus":0.2828764205792926,"score_gpt":0.28428203967396876,"score_spread":0.0014056190946761804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1705626586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021894893,0.00005925961,0.9965593,0.00008961666,0.000038837206,0.00004215606,0.000021385402,0.0001760217,0.0008239172],"genre_scores_gemma":[0.16327186,0.00019172179,0.8308276,0.00033180858,0.00018873592,0.00044458185,0.00027025118,0.00027907998,0.0041943095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985007,0.0007316449,0.00004574556,0.00025769763,0.0003599739,0.0001042841],"domain_scores_gemma":[0.99548846,0.002781323,0.00023745534,0.00075491297,0.00048330834,0.00025445202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029978242,0.00074733543,0.001073084,0.0010144139,0.00073620013,0.0013189857,0.002267621,0.0014222784,0.006037072],"category_scores_gemma":[0.015948538,0.0006068109,0.00081147795,0.0008521533,0.0015063658,0.0018650993,0.0026507024,0.002362526,0.0013646731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019231939,0.0001420562,0.0029415314,0.00017020818,0.000102567115,0.00022365061,0.00019164252,0.40679112,0.00361819,0.38004425,0.0078090997,0.19777335],"study_design_scores_gemma":[0.00003556951,0.000020705033,0.00017940163,0.0000134376705,0.000009550715,0.000054595203,0.000007037657,0.9206957,0.00074359984,0.075534366,0.0026931774,0.000012835551],"about_ca_topic_score_codex":0.001774306,"about_ca_topic_score_gemma":0.0030787927,"teacher_disagreement_score":0.006037072,"about_ca_system_score_codex":0.00090657134,"about_ca_system_score_gemma":0.0013387379,"threshold_uncertainty_score":0.02019608},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11257881641235555,"score_gpt":0.3749705992627148,"score_spread":0.26239178285035925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737070927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002491777,0.000072488474,0.9965475,0.000074157324,0.000011741015,0.000024523126,0.000023746086,0.00036437134,0.00038962954],"genre_scores_gemma":[0.167808,0.00031329333,0.82879657,0.00020645617,0.000082931976,0.00040219355,0.0002641975,0.0004516448,0.0016746874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803954,0.0008909802,0.00008777395,0.00028186035,0.00056213565,0.00013764288],"domain_scores_gemma":[0.9879622,0.008689043,0.00066406897,0.0016274952,0.0007541677,0.0003031007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005983412,0.001209664,0.0017450018,0.001376195,0.00091678917,0.0013288745,0.0030932452,0.0013280868,0.0043742033],"category_scores_gemma":[0.027380234,0.0009472236,0.0012386292,0.0014100879,0.0019752411,0.0020057056,0.002743863,0.0038329512,0.0011956333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009851236,0.00007641284,0.001673721,0.000148991,0.00008235216,0.00011260115,0.00016343108,0.831586,0.0022569306,0.11672545,0.0014051037,0.045670625],"study_design_scores_gemma":[0.000008681932,0.000009047733,0.000058944028,0.00000812627,0.0000059732783,0.000011668808,0.0000055092746,0.98070025,0.000486436,0.018257951,0.00044193416,0.00000548599],"about_ca_topic_score_codex":0.009847834,"about_ca_topic_score_gemma":0.016135884,"teacher_disagreement_score":0.009847834,"about_ca_system_score_codex":0.002130493,"about_ca_system_score_gemma":0.004021254,"threshold_uncertainty_score":0.03164369},"labels":[],"label_agreement":null},{"id":"W1778602239","doi":"10.1002/rsa.20625","title":"Random walks on stochastic hyperbolic half planar triangulations","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Random walk; Planar; Boundary (topology); Mathematics; Simple (philosophy); Simple random sample; Point (geometry); Combinatorics; Mathematical analysis; Statistical physics; Geometry; Physics; Computer science; Statistics; Demography","score_opus":0.04674601922730397,"score_gpt":0.3337392050272816,"score_spread":0.2869931857999776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778602239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896,0.00072331884,0.2990203,0.0006728568,0.000087468376,0.00007403578,0.00028842487,0.00017256668,0.009361013],"genre_scores_gemma":[0.9784894,0.00042620694,0.016940072,0.00007987552,0.000049451362,0.00005194527,0.0002458711,0.000039740706,0.0036774832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995505,0.00018146062,0.000018935138,0.000058601705,0.000114087474,0.00007638557],"domain_scores_gemma":[0.9982102,0.00082385394,0.00045035244,0.00012379757,0.00014753151,0.0002441964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066111377,0.00062569755,0.00062721496,0.0012905059,0.00055813964,0.0011235971,0.0011009622,0.0012059767,0.002314168],"category_scores_gemma":[0.0044719027,0.0004380915,0.00059850304,0.0008205065,0.0017764524,0.0014784526,0.0014677569,0.000834157,0.0003188505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012563921,0.000037368212,0.002403174,0.000081205464,0.0000571306,0.00057378033,0.0001645166,0.4025111,0.003296782,0.5851801,0.0010167125,0.0045525385],"study_design_scores_gemma":[0.000030933195,0.000024969038,0.00044843933,0.000014862405,0.0000075599587,0.00008007332,0.000053557877,0.8472639,0.0004860369,0.15095434,0.00061814056,0.000017189073],"about_ca_topic_score_codex":0.0023947433,"about_ca_topic_score_gemma":0.001965329,"teacher_disagreement_score":0.0023947433,"about_ca_system_score_codex":0.00084173476,"about_ca_system_score_gemma":0.00029541022,"threshold_uncertainty_score":0.0077416897},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.26367895872580266,"score_gpt":0.40745029543420125,"score_spread":0.1437713367083986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840847274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008112296,0.0014442003,0.9635806,0.0008812586,0.0005702575,0.00027128006,0.0022044263,0.004790191,0.018145468],"genre_scores_gemma":[0.20360182,0.0014857689,0.76496494,0.0011552139,0.00044847323,0.0016412082,0.0047575566,0.0026133254,0.01933171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991604,0.00035604366,0.00003899082,0.00017208315,0.00019365255,0.000078859375],"domain_scores_gemma":[0.9968117,0.0020751623,0.00014340485,0.00040720377,0.00043509217,0.00012748175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014560893,0.0012652924,0.0021265016,0.0016890664,0.0015419445,0.002151456,0.003068518,0.0023885304,0.032619275],"category_scores_gemma":[0.009242723,0.0011519371,0.0018690793,0.0018337806,0.0010938826,0.0017323632,0.0021312118,0.002780322,0.0049599004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001627221,0.000105582985,0.002422613,0.0005908765,0.00039028897,0.0002995666,0.00019223921,0.7344863,0.0015163681,0.15489058,0.021126006,0.08381696],"study_design_scores_gemma":[0.0000539379,0.000015177813,0.00020528444,0.00005369693,0.000031465028,0.000033005428,0.000019946483,0.9246695,0.0005718106,0.06414891,0.010167949,0.000029254965],"about_ca_topic_score_codex":0.018046878,"about_ca_topic_score_gemma":0.020161182,"teacher_disagreement_score":0.032619275,"about_ca_system_score_codex":0.0015509939,"about_ca_system_score_gemma":0.0025026393,"threshold_uncertainty_score":0.109122336},"labels":[],"label_agreement":null},{"id":"W1887716531","doi":"10.1109/sfcs.1996.548478","title":"Factoring graphs to bound mixing rates","year":2002,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Markov chain Monte Carlo; Mixing (physics); Factorization; Markov chain mixing time; Computer science; Statistical physics; Gibbs sampling; Examples of Markov chains; Markov process; Bounding overwatch; Sampling (signal processing); Algorithm; Monte Carlo method; Mathematics; Variable-order Markov model; Markov model; Statistics; Physics; Artificial intelligence; Machine learning","score_opus":0.16693407375027106,"score_gpt":0.3785547397536901,"score_spread":0.21162066600341903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887716531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014929804,0.00057681237,0.9803376,0.00023894361,0.000056995723,0.000067982124,0.00008115711,0.0004291594,0.0032815717],"genre_scores_gemma":[0.42488933,0.0015782263,0.5665327,0.0005189985,0.0003802622,0.0005793779,0.0005479281,0.0010862156,0.0038869542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948725,0.0019232682,0.00023085986,0.0011380531,0.0013311574,0.0005040463],"domain_scores_gemma":[0.960739,0.029718548,0.0023828137,0.004399741,0.0017357664,0.0010241704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006236225,0.0023516538,0.0016672021,0.003587025,0.0014883024,0.0022949404,0.00232413,0.0023017337,0.0051829154],"category_scores_gemma":[0.0429103,0.0012539498,0.0021469134,0.0017845179,0.003607807,0.007596032,0.0035685995,0.0050973753,0.0010230492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018113528,0.00008379122,0.0015212815,0.00018143353,0.00011916428,0.000119691846,0.0002853192,0.22936666,0.005823907,0.73137987,0.0015739116,0.029363882],"study_design_scores_gemma":[0.00002292091,0.000049841212,0.00023568247,0.000040735507,0.00003896202,0.00010977953,0.0000212579,0.5877595,0.0034069077,0.40419218,0.004089832,0.000032480802],"about_ca_topic_score_codex":0.0021760685,"about_ca_topic_score_gemma":0.0016816518,"teacher_disagreement_score":0.006236225,"about_ca_system_score_codex":0.0026813862,"about_ca_system_score_gemma":0.0011171913,"threshold_uncertainty_score":0.03298068},"labels":[],"label_agreement":null},{"id":"W1908763546","doi":"10.1109/cdc.1989.70111","title":"Some new results in the theory of recursive identification","year":2003,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimator; Mixing (physics); Convergence (economics); Identification (biology); Computer science; Rate of convergence; Applied mathematics; Stochastic approximation; Stochastic process; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Statistics; Asynchronous communication; Key (lock)","score_opus":0.09686085439480932,"score_gpt":0.3643812168064582,"score_spread":0.2675203624116489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1908763546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015353515,0.021362424,0.9314115,0.0023603146,0.0018191342,0.000040550116,0.00028241088,0.00035270673,0.040835626],"genre_scores_gemma":[0.14590275,0.06587744,0.6526045,0.00777647,0.01688176,0.00076175656,0.0011463055,0.0011928914,0.10785607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979819,0.0007513721,0.00015203508,0.00048012726,0.00050106616,0.00013345393],"domain_scores_gemma":[0.99807227,0.0011667159,0.00014413224,0.0003535447,0.00019450941,0.000068811074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003054587,0.0015302066,0.0012117975,0.0022918459,0.0010139868,0.003009419,0.0017546596,0.0019253166,0.012461477],"category_scores_gemma":[0.006608496,0.00084997946,0.00242046,0.0029633273,0.0029473396,0.004721055,0.0020639875,0.0059410944,0.0058054924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119466595,0.000032256903,0.00023395746,0.0002862529,0.000033461263,0.00011924798,0.0001829897,0.007681748,0.0007527324,0.9173046,0.00926498,0.06409573],"study_design_scores_gemma":[0.000007010339,0.000036513924,0.00022786364,0.00013006988,0.00002166498,0.0002799768,0.000033691853,0.02565399,0.00047669368,0.8634473,0.109655365,0.000029878778],"about_ca_topic_score_codex":0.0012254682,"about_ca_topic_score_gemma":0.0011707001,"teacher_disagreement_score":0.012461477,"about_ca_system_score_codex":0.0014005715,"about_ca_system_score_gemma":0.0010306092,"threshold_uncertainty_score":0.041687787},"labels":[],"label_agreement":null},{"id":"W1931339794","doi":"10.1007/s10955-015-1433-4","title":"Representation and Poly-time Approximation for Pressure of $$\\mathbb {Z}^2$$ Lattice Models in the Non-uniqueness Region","year":2016,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Directorate for Mathematical and Physical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Inverse temperature; Potts model; Gibbs measure; Representation (politics); Representation theorem; Lattice (music); Work (physics); Supercritical fluid","score_opus":0.09049710218915843,"score_gpt":0.37445959008460117,"score_spread":0.28396248789544276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931339794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25889388,0.00252028,0.67067444,0.006265885,0.0008649808,0.00012983035,0.0004570251,0.00045223848,0.059741504],"genre_scores_gemma":[0.9160226,0.001229334,0.050541274,0.0010837533,0.0009300126,0.0003391215,0.0005134418,0.0005026066,0.028837804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990036,0.0004200738,0.000032784013,0.000104608225,0.0002375267,0.0002013709],"domain_scores_gemma":[0.99725014,0.0010976087,0.0003424562,0.00026875673,0.00040440692,0.0006365613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019723384,0.0010637561,0.0017928103,0.0024630048,0.0020880944,0.003476489,0.0042295344,0.003049438,0.0072014513],"category_scores_gemma":[0.006285445,0.00081518345,0.0016108013,0.0011142003,0.004334921,0.0057956013,0.002676349,0.003892219,0.00068353984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019728725,0.000032020744,0.00015421082,0.000025194926,0.000010246809,0.000055529767,0.000050837425,0.020741394,0.00024831548,0.9770832,0.00086014386,0.0007191306],"study_design_scores_gemma":[0.000014258962,0.000010707922,0.0001056013,0.000013313141,0.000006924931,0.000042025727,0.000029774907,0.5688664,0.000084064886,0.43026796,0.0005433101,0.00001561181],"about_ca_topic_score_codex":0.0055966377,"about_ca_topic_score_gemma":0.0042432854,"teacher_disagreement_score":0.0072014513,"about_ca_system_score_codex":0.0021617499,"about_ca_system_score_gemma":0.0022409896,"threshold_uncertainty_score":0.024091303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.09391328041418588,"score_gpt":0.33127657906530916,"score_spread":0.23736329865112327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968782267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012062098,0.0010567608,0.9811643,0.00055293244,0.000118928576,0.00007294084,0.000025414303,0.00039722974,0.004549502],"genre_scores_gemma":[0.49069387,0.0025528953,0.49771026,0.000676909,0.0006650974,0.00064052624,0.00020299149,0.0009814089,0.005876048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934915,0.0039468165,0.0003043657,0.0007169162,0.0011397942,0.00040060576],"domain_scores_gemma":[0.9737824,0.020561319,0.0009777927,0.0023198014,0.0018166909,0.0005419012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010492086,0.001119374,0.0021728282,0.0015355977,0.00096223725,0.0028940511,0.0021702657,0.001713722,0.004780759],"category_scores_gemma":[0.051435936,0.0010527746,0.001111691,0.0015827738,0.002913206,0.005296609,0.0032010681,0.0035107858,0.0010804738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019205193,0.00012555078,0.0009170895,0.00026794,0.000091972106,0.000095210235,0.00026722776,0.25895602,0.0022416313,0.6751663,0.0035092128,0.058169782],"study_design_scores_gemma":[0.000025782674,0.00003533338,0.00014235145,0.00003292152,0.000013469245,0.00002867055,0.000026744443,0.77977777,0.0010941565,0.21699144,0.0018129596,0.000018520352],"about_ca_topic_score_codex":0.0018708371,"about_ca_topic_score_gemma":0.0009288538,"teacher_disagreement_score":0.010492086,"about_ca_system_score_codex":0.0021004465,"about_ca_system_score_gemma":0.001735887,"threshold_uncertainty_score":0.05548811},"labels":[],"label_agreement":null},{"id":"W1970635910","doi":"10.1109/isit.2014.6875084","title":"On stochastic estimation of the partition function","year":2014,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Estimator; Partition function (quantum field theory); Partition (number theory); Potts model; Sampling (signal processing); Mathematics; Duality (order theory); Importance sampling; Applied mathematics; Function (biology); Statistics; Computer science; Statistical physics; Combinatorics; Monte Carlo method; Physics","score_opus":0.04323136819590417,"score_gpt":0.32091332809048684,"score_spread":0.27768195989458266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970635910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069327466,0.0003839113,0.9269504,0.0004474479,0.00004986725,0.00005657499,0.00012979127,0.00024095409,0.002413604],"genre_scores_gemma":[0.8656009,0.0005315038,0.13072476,0.00022264614,0.000118487595,0.00017292253,0.0005091184,0.0001818029,0.0019380153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978557,0.0012751975,0.00004944951,0.00030228848,0.00032836047,0.00018902807],"domain_scores_gemma":[0.9818003,0.014714796,0.0009718579,0.0014093841,0.0007434185,0.0003601261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005608257,0.0008456091,0.0012972425,0.0015805591,0.0008682432,0.0015554604,0.0017054813,0.0013356354,0.0022078846],"category_scores_gemma":[0.040969472,0.0006411554,0.00073525886,0.00086175295,0.0032840972,0.003063389,0.0020220012,0.0021215212,0.00034157335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013499486,0.000057793135,0.0022744078,0.00008611349,0.000056300265,0.00005677561,0.00012144829,0.48604435,0.0013326043,0.49387673,0.0009893351,0.01496911],"study_design_scores_gemma":[0.000008605069,0.000012598239,0.00021447592,0.000014550185,0.000004809398,0.000016828157,0.000011298934,0.8797628,0.0003508925,0.119317785,0.00027282967,0.000012534626],"about_ca_topic_score_codex":0.004089522,"about_ca_topic_score_gemma":0.0030631355,"teacher_disagreement_score":0.005608257,"about_ca_system_score_codex":0.00204378,"about_ca_system_score_gemma":0.0013589239,"threshold_uncertainty_score":0.029659688},"labels":[],"label_agreement":null},{"id":"W1972913069","doi":"10.1080/07362990701857178","title":"A Note on Convergence of the Equi-Energy Sampler","year":2008,"lang":"en","type":"article","venue":"Stochastic Analysis and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Applied mathematics; Convergence (economics); Markov chain; Correctness; Mathematics; Monte Carlo method; Statistical inference; Calculus (dental); Computer science; Mathematical economics; Algorithm; Statistics","score_opus":0.05250576763044224,"score_gpt":0.3337830712684618,"score_spread":0.28127730363801956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972913069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002794563,0.0011699127,0.9795024,0.002084512,0.0004447341,0.00009968637,0.000088072724,0.00030686037,0.013509353],"genre_scores_gemma":[0.23742452,0.0029060224,0.7288951,0.0051256665,0.0013920335,0.0013127713,0.0005623026,0.0017368586,0.02064467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9814353,0.010844327,0.00069786777,0.0017353519,0.0046070367,0.000680056],"domain_scores_gemma":[0.8613715,0.11914997,0.0015178032,0.0068587917,0.0099371355,0.0011648076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031521536,0.0017283781,0.0021525433,0.0030389775,0.0016779486,0.002823613,0.0046485197,0.0032642737,0.010293323],"category_scores_gemma":[0.16986853,0.0011472075,0.003420966,0.0019482808,0.0068716127,0.0063907304,0.006317965,0.013669425,0.0020396672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016019387,0.000063070016,0.0011558399,0.00018708337,0.00008271633,0.00030171085,0.0003264952,0.034593146,0.0009569753,0.9284257,0.0061886627,0.027558323],"study_design_scores_gemma":[0.000041734664,0.00006266956,0.00034628419,0.00021825815,0.00003024433,0.000274104,0.000059850143,0.47059137,0.0017447294,0.51499283,0.01158713,0.000050785537],"about_ca_topic_score_codex":0.0038420146,"about_ca_topic_score_gemma":0.0020488717,"teacher_disagreement_score":0.031521536,"about_ca_system_score_codex":0.002874423,"about_ca_system_score_gemma":0.00279686,"threshold_uncertainty_score":0.16670382},"labels":[],"label_agreement":null},{"id":"W1975938103","doi":"10.1016/j.sysconle.2006.06.004","title":"A note on exponential stability of the nonlinear filter for denumerable Markov chains","year":2006,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Mitacs","keywords":"Markov chain; Mathematics; Countable set; Examples of Markov chains; Exponential stability; Ergodicity; Filter (signal processing); Applied mathematics; Markov chain mixing time; Markov renewal process; Nonlinear system; Markov process; Markov property; Stability (learning theory); Class (philosophy); Exponential function; Nonlinear filter; Control theory (sociology); Discrete mathematics; Mathematical analysis; Markov model; Filter design; Computer science; Statistics; Physics; Artificial intelligence","score_opus":0.02812076244011097,"score_gpt":0.28458225008621657,"score_spread":0.2564614876461056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975938103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014577384,0.001917896,0.96949255,0.0017770553,0.00049484137,0.000029935987,0.00011177449,0.00011743395,0.011481117],"genre_scores_gemma":[0.7643589,0.007854266,0.1893091,0.002375178,0.0025888481,0.00033215815,0.0003358768,0.00047434252,0.032371294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984189,0.0005363499,0.00008428224,0.00036664327,0.00045682595,0.00013703824],"domain_scores_gemma":[0.9749249,0.02209166,0.00057061645,0.0009171134,0.0011572965,0.00033835546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057320152,0.0009151275,0.0014753409,0.0012864885,0.0011315494,0.0020804806,0.0016279939,0.0019401697,0.0043966174],"category_scores_gemma":[0.02549184,0.0006834076,0.0020837132,0.0010407146,0.0035730614,0.004150375,0.0028801209,0.0052137384,0.0005462981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076609045,0.00001703665,0.00034876697,0.00010758594,0.00007089693,0.00017060524,0.00019321527,0.07519925,0.0018828686,0.91125906,0.0014326082,0.009241405],"study_design_scores_gemma":[0.0000127222265,0.000020950514,0.00014978422,0.00003360063,0.000020015366,0.00004667175,0.000014080408,0.36936897,0.00056584255,0.62722075,0.0025161644,0.000030411766],"about_ca_topic_score_codex":0.004226872,"about_ca_topic_score_gemma":0.002789495,"teacher_disagreement_score":0.0057320152,"about_ca_system_score_codex":0.0016319574,"about_ca_system_score_gemma":0.0011468049,"threshold_uncertainty_score":0.030314147},"labels":[],"label_agreement":null},{"id":"W1976121046","doi":"10.1007/s00791-011-0163-7","title":"Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method","year":2011,"lang":"en","type":"article","venue":"Computing and Visualization in Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ellipsoid; Mathematical optimization; Norm (philosophy); Quadratic programming; Uniform norm; Applied mathematics; Mathematical analysis","score_opus":0.1251798667458862,"score_gpt":0.41144274240226153,"score_spread":0.2862628756563753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976121046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029848749,0.00007945386,0.99586415,0.000059983955,0.000016720636,0.000019605815,0.000015464178,0.00010281876,0.0008568946],"genre_scores_gemma":[0.12897436,0.00016436394,0.86724156,0.00009830075,0.000047391874,0.0003264185,0.00015182751,0.00043764745,0.0025581329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802196,0.0011317036,0.000083295476,0.00017122675,0.00049087685,0.000100978425],"domain_scores_gemma":[0.9944354,0.0041105393,0.00024625656,0.000440527,0.0005699595,0.0001972739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038126337,0.0006920096,0.001624486,0.0010372892,0.00074014824,0.0013776139,0.002226856,0.001838141,0.0049367743],"category_scores_gemma":[0.013687598,0.0007109298,0.0011201483,0.00093052845,0.0012715105,0.0017625081,0.002929739,0.0026628887,0.0010614167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018426917,0.00011642644,0.0006829892,0.000181534,0.00009249418,0.000063527834,0.00025493515,0.64870214,0.0028542646,0.25799623,0.002553481,0.08631766],"study_design_scores_gemma":[0.000008165559,0.000009592218,0.000027272157,0.0000075420676,0.0000030671874,0.000006057443,0.0000043070772,0.9822198,0.0002449025,0.0169849,0.00047890336,0.000005593496],"about_ca_topic_score_codex":0.0036328596,"about_ca_topic_score_gemma":0.0035611822,"teacher_disagreement_score":0.0049367743,"about_ca_system_score_codex":0.0010379076,"about_ca_system_score_gemma":0.0016318401,"threshold_uncertainty_score":0.020163417},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034876382214848574,"score_gpt":0.3229034758441773,"score_spread":0.2880270936293287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979619742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027782297,0.00076269225,0.9437878,0.0007355127,0.00027554345,0.00007445255,0.00020489366,0.00042872402,0.025947992],"genre_scores_gemma":[0.6472837,0.00065433537,0.3139083,0.00075463596,0.00034301763,0.00034205528,0.00060800486,0.0006900652,0.035415925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989139,0.0005056562,0.000027553746,0.00014914204,0.00030694733,0.00009683909],"domain_scores_gemma":[0.9961274,0.0021268635,0.0001471518,0.0008888886,0.0004242309,0.0002854101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015504853,0.00056692597,0.0015884534,0.00118122,0.00101054,0.0017154875,0.0014835763,0.0014612386,0.016720695],"category_scores_gemma":[0.008089245,0.00060772256,0.0007658478,0.0010360858,0.0023514524,0.0027885218,0.0023692022,0.002055384,0.0015802664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004722812,0.000036065656,0.00022671855,0.00004514062,0.00002916508,0.000027728762,0.000060122118,0.037851658,0.000335456,0.9441083,0.0025051555,0.014727316],"study_design_scores_gemma":[0.000015479152,0.00001183411,0.00010543785,0.000013093995,0.000009592772,0.000023053926,0.000014464099,0.28922713,0.00028531876,0.70812494,0.0021610423,0.00000862207],"about_ca_topic_score_codex":0.0010532226,"about_ca_topic_score_gemma":0.0016354161,"teacher_disagreement_score":0.016720695,"about_ca_system_score_codex":0.0008779224,"about_ca_system_score_gemma":0.0009814436,"threshold_uncertainty_score":0.055936277},"labels":[],"label_agreement":null},{"id":"W1983531885","doi":"10.1198/106186002510","title":"On Markov chain Monte Carlo Algorithms for Computing Conditional Expectations Based on Sufficient Statistics","year":2002,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland; National Science Foundation","keywords":"Mathematics; Markov chain Monte Carlo; Statistic; Monte Carlo method; Statistics; Sufficient statistic; Markov chain; Algorithm; Computer science","score_opus":0.05024182247687973,"score_gpt":0.33716374330664345,"score_spread":0.2869219208297637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983531885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088523334,0.00019249499,0.99698097,0.000082636616,0.00003561492,0.00010606703,0.00006834449,0.0006561331,0.0009925391],"genre_scores_gemma":[0.036879852,0.00043565934,0.958098,0.0002818599,0.00013285922,0.0009397874,0.0006830087,0.0005989417,0.0019500222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472564,0.0030248722,0.0003438166,0.0006334248,0.00097313547,0.00029907562],"domain_scores_gemma":[0.9469042,0.0466546,0.0015810702,0.0019638117,0.002417272,0.00047896532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012000829,0.002906453,0.0033328878,0.0042223753,0.0016055745,0.0035843945,0.0038025028,0.0024278725,0.014375178],"category_scores_gemma":[0.052478574,0.0020082882,0.0028485493,0.004843099,0.0031762815,0.0044593657,0.004518797,0.006637314,0.0037896784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020787456,0.00019219772,0.0019064914,0.00038199668,0.00021636675,0.00020585833,0.00029927245,0.6440355,0.00072648964,0.21872367,0.0058737285,0.12723061],"study_design_scores_gemma":[0.000054809545,0.000030465228,0.0001237908,0.000082608545,0.000019493116,0.000037202713,0.000024890618,0.85700154,0.00030945474,0.1404032,0.0018848208,0.000027732372],"about_ca_topic_score_codex":0.015846893,"about_ca_topic_score_gemma":0.018852564,"teacher_disagreement_score":0.015846893,"about_ca_system_score_codex":0.0030577006,"about_ca_system_score_gemma":0.0064631286,"threshold_uncertainty_score":0.063467205},"labels":[],"label_agreement":null},{"id":"W1983905545","doi":"10.1023/b:stco.0000021411.12404.e4","title":"Achieving limiting distributions for Markov chains using back buttons","year":2004,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Limiting; State space; Convolution (computer science); State (computer science); Mathematics; Finite state; Markov chain Monte Carlo; Computer science; Space (punctuation); Markov model; Distribution (mathematics); Algorithm; Simple (philosophy); Mathematical optimization; Applied mathematics; Artificial intelligence; Statistics; Mathematical analysis; Bayesian probability; Engineering","score_opus":0.08300248767759894,"score_gpt":0.3712972235936922,"score_spread":0.2882947359160933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983905545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00519248,0.00005942101,0.99100846,0.00018178253,0.000021475307,0.00002882728,0.000030252246,0.00059853,0.0028788256],"genre_scores_gemma":[0.4401355,0.0006574639,0.54416895,0.0005653182,0.00023953615,0.00095164345,0.00043957218,0.0016002426,0.011241778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99276745,0.004116227,0.00032698753,0.00080865616,0.0013961815,0.0005845667],"domain_scores_gemma":[0.95027363,0.040484473,0.0012666084,0.0047748135,0.0020747676,0.0011257206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0117131565,0.0018044921,0.0018284121,0.0023001244,0.0017687558,0.00442162,0.0031027042,0.002210443,0.011672699],"category_scores_gemma":[0.06743261,0.0013791122,0.0019893046,0.0014659831,0.005026444,0.010148598,0.0071341335,0.005122062,0.0030727293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002209581,0.00015063406,0.0005328374,0.00012431442,0.000036566886,0.00013939985,0.00033770065,0.054298017,0.0015924976,0.8975613,0.0027514803,0.04225425],"study_design_scores_gemma":[0.000026806818,0.000018207827,0.00004224626,0.00002745388,0.000009669736,0.00003685101,0.000025061921,0.2783161,0.0017386636,0.71853805,0.0012031634,0.0000177153],"about_ca_topic_score_codex":0.0020820582,"about_ca_topic_score_gemma":0.0012243651,"teacher_disagreement_score":0.0117131565,"about_ca_system_score_codex":0.0021681923,"about_ca_system_score_gemma":0.001956923,"threshold_uncertainty_score":0.061945856},"labels":[],"label_agreement":null},{"id":"W1984181342","doi":"10.1016/j.laa.2009.02.012","title":"Preface to the Proceedings of the 16th International Workshop on Matrices and Statistics, Windsor 2007","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Windsor","funders":"","keywords":"Windsor; Mathematics; Statistics; Environmental science","score_opus":0.02887967267936756,"score_gpt":0.33263241757810774,"score_spread":0.30375274489874016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984181342","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014564372,0.088863485,0.045427654,0.06278239,0.67555785,0.000346218,0.0052019875,0.0008931098,0.11947086],"genre_scores_gemma":[0.009669085,0.03682748,0.012896232,0.009206051,0.22743864,0.00024098711,0.0059319753,0.0014675998,0.69632196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880314,0.00029148033,0.00008222411,0.00023335978,0.0005008238,0.000089000045],"domain_scores_gemma":[0.9931224,0.0016210884,0.00022534835,0.00038624616,0.0036116997,0.001033289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025041003,0.0022242968,0.0022070517,0.0034143687,0.0013866165,0.0041914606,0.0013890351,0.0018880311,0.14160123],"category_scores_gemma":[0.008099432,0.0005475007,0.0014540394,0.002452525,0.0006868934,0.0032816867,0.0016761825,0.0035982465,0.07000086],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003394526,0.00003161217,0.00005894845,0.000082541315,0.000010348069,0.000025845675,0.00001969636,0.0002225886,0.00014639612,0.0020503644,0.97368455,0.023633037],"study_design_scores_gemma":[0.00002794951,0.000064022235,0.000826461,0.00028915383,0.000021739757,0.00011463079,0.000056522054,0.0010602985,0.0002895827,0.0106574,0.98656267,0.0000295469],"about_ca_topic_score_codex":0.0054045874,"about_ca_topic_score_gemma":0.009177463,"teacher_disagreement_score":0.14160123,"about_ca_system_score_codex":0.00251347,"about_ca_system_score_gemma":0.0017127327,"threshold_uncertainty_score":0.47370332},"labels":[],"label_agreement":null},{"id":"W1986100098","doi":"10.1007/s11009-013-9326-y","title":"Scaling Analysis of Delayed Rejection MCMC Methods","year":2013,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Metropolis–Hastings algorithm; Dimension (graph theory); Scaling; Algorithm; Mathematical optimization; Markov chain Monte Carlo; Monte Carlo method; Statistics; Combinatorics","score_opus":0.1787283233040759,"score_gpt":0.42744347780688297,"score_spread":0.24871515450280707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986100098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020668486,0.0009605672,0.97103655,0.00047819974,0.00016590253,0.00007421623,0.00008516069,0.00023203138,0.006298845],"genre_scores_gemma":[0.64198345,0.0013934859,0.3418947,0.0005917277,0.00070991204,0.0006318263,0.00047287994,0.0009002331,0.011421836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967512,0.0018196686,0.00012026576,0.00032725808,0.00078763405,0.00019396152],"domain_scores_gemma":[0.95761645,0.0323949,0.0016658199,0.0031197537,0.0043063215,0.0008968377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008662745,0.0009901074,0.0011592375,0.0019399177,0.0012926876,0.0019376066,0.002558151,0.0014832944,0.009725761],"category_scores_gemma":[0.06260675,0.00076289417,0.0009957778,0.001463627,0.0019690646,0.0027164347,0.0024812697,0.0025748156,0.00083850336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015983745,0.000095006864,0.0023476153,0.00027425925,0.00008529242,0.00013389607,0.00026772203,0.23376189,0.0021510297,0.70725495,0.0044331746,0.049035333],"study_design_scores_gemma":[0.000014980847,0.000021831765,0.0004219461,0.00003741265,0.000014844559,0.000031615313,0.000021670487,0.8932827,0.0004331498,0.10372344,0.0019809979,0.000015386355],"about_ca_topic_score_codex":0.0030189466,"about_ca_topic_score_gemma":0.0020929947,"teacher_disagreement_score":0.009725761,"about_ca_system_score_codex":0.0015569496,"about_ca_system_score_gemma":0.0015673132,"threshold_uncertainty_score":0.0458135},"labels":[],"label_agreement":null},{"id":"W1990908957","doi":"10.1081/stm-120004467","title":"The polar slice sampler","year":2002,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Polar; Dimension (graph theory); Markov chain Monte Carlo; Convergence (economics); Monte Carlo method; Total variation; Markov chain; Algorithm; Asymmetry; Point (geometry); Combinatorics; Applied mathematics; Mathematical analysis; Geometry; Statistics","score_opus":0.17427194911959126,"score_gpt":0.3330786718142957,"score_spread":0.15880672269470442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990908957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073508183,0.00023998905,0.989602,0.00012805495,0.000055446762,0.00006780314,0.00007953965,0.0001788661,0.0022974703],"genre_scores_gemma":[0.34925744,0.0009911901,0.6424214,0.00043135695,0.00018130688,0.00052898895,0.000703688,0.00028409745,0.0052004503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982436,0.0011516197,0.000039569473,0.00022077913,0.00023734669,0.00010696074],"domain_scores_gemma":[0.9908886,0.0069366046,0.00035290048,0.0008439919,0.00073342887,0.00024440134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004245379,0.000753969,0.0010918712,0.0008397415,0.00081119157,0.0013588837,0.0014165605,0.00092912023,0.0059277527],"category_scores_gemma":[0.019842729,0.0005454838,0.0007587044,0.0009485576,0.0018784684,0.0022353237,0.0018142305,0.0017519639,0.0011926662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005018068,0.000078293175,0.004335652,0.00016666455,0.00011187387,0.00016598677,0.00021539508,0.24491139,0.0020086365,0.6541766,0.0052472027,0.0880805],"study_design_scores_gemma":[0.000059806076,0.00007353902,0.00021965461,0.000042768876,0.000021912098,0.00011150403,0.000034399334,0.83490217,0.0016024403,0.15817168,0.0047407155,0.000019328361],"about_ca_topic_score_codex":0.0031399154,"about_ca_topic_score_gemma":0.003033389,"teacher_disagreement_score":0.0059277527,"about_ca_system_score_codex":0.0007785874,"about_ca_system_score_gemma":0.002431034,"threshold_uncertainty_score":0.022451997},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Poisson distribution; Mathematics; Library science; Statistics; Computer science","score_opus":0.06901214203725027,"score_gpt":0.33499392125358884,"score_spread":0.2659817792163386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992601594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012425044,0.0002115837,0.9835692,0.0004907594,0.00010384607,0.000115753784,0.00092372077,0.00037618892,0.0017838548],"genre_scores_gemma":[0.34821936,0.00073212734,0.61485994,0.0005702971,0.00033677323,0.0012218104,0.003922768,0.00062233757,0.029514574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858046,0.0006415468,0.00007464812,0.00032229463,0.00024771024,0.00013339601],"domain_scores_gemma":[0.99554646,0.0029103854,0.00047238232,0.0005526023,0.0003446567,0.00017350668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00463906,0.00083110324,0.0013275096,0.0013893328,0.00074525375,0.0020886608,0.003598607,0.0024151672,0.011107495],"category_scores_gemma":[0.012793264,0.0007010057,0.001673691,0.0018604066,0.0012512989,0.0026605232,0.0020723734,0.0030537564,0.0021215857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014738689,0.00008279688,0.002649293,0.0001051859,0.00007662551,0.00030161178,0.00014886222,0.73621917,0.00075213955,0.20384118,0.010716982,0.044958733],"study_design_scores_gemma":[0.0000112024645,0.000012715537,0.00016702987,0.00000967801,0.0000064432816,0.00003215008,0.0000122844485,0.9607851,0.00017008951,0.036572203,0.0022086697,0.000012429253],"about_ca_topic_score_codex":0.0069876406,"about_ca_topic_score_gemma":0.0081014745,"teacher_disagreement_score":0.011107495,"about_ca_system_score_codex":0.0011178326,"about_ca_system_score_gemma":0.001690318,"threshold_uncertainty_score":0.03715831},"labels":[],"label_agreement":null},{"id":"W1996168307","doi":"10.1002/1098-2418(200103)18:2<101::aid-rsa1000>3.0.co;2-d","title":"Very rapidly mixing Markov chains for 2?-colorings and for independent sets in a graph with maximum degree 4","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Markov chain; Degree (music); Combinatorics; Mixing (physics); Mathematics; Markov chain mixing time; Discrete mathematics; Graph; Markov model; Variable-order Markov model; Statistics; Physics","score_opus":0.050283589901445325,"score_gpt":0.32036737159289536,"score_spread":0.27008378169145003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996168307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15039015,0.00047399863,0.8428118,0.0010647225,0.000053947868,0.00014759507,0.00015859501,0.00038834536,0.004510846],"genre_scores_gemma":[0.7853365,0.0007263295,0.20361209,0.0005066986,0.00017494593,0.0009666309,0.0005540002,0.00034023618,0.0077824816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979122,0.00089917757,0.000084858075,0.0004371078,0.00038080674,0.00028581894],"domain_scores_gemma":[0.977958,0.016272608,0.0022510628,0.0017211582,0.00079036085,0.0010068641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00438029,0.0010470154,0.0011334831,0.0020089084,0.0018001787,0.002842361,0.0019828575,0.002236631,0.0041871998],"category_scores_gemma":[0.023690414,0.0012596636,0.0021664,0.0009100556,0.0035403515,0.0058268285,0.0031732982,0.004013933,0.00087327365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024867928,0.000081715545,0.0032470368,0.00008889353,0.00006993034,0.00021852828,0.0006676951,0.1103531,0.004881585,0.8677556,0.0014560559,0.010931136],"study_design_scores_gemma":[0.000039297443,0.000028672095,0.00043155186,0.000021966955,0.000019050978,0.00009893217,0.000051955754,0.601771,0.0018844246,0.39451954,0.0010949973,0.00003861506],"about_ca_topic_score_codex":0.0019396612,"about_ca_topic_score_gemma":0.0021949376,"teacher_disagreement_score":0.00438029,"about_ca_system_score_codex":0.0024135022,"about_ca_system_score_gemma":0.0009829557,"threshold_uncertainty_score":0.023165464},"labels":[],"label_agreement":null},{"id":"W2001736102","doi":"10.1016/s0304-4149(99)00101-5","title":"Applications of geometric bounds to the convergence rate of Markov chains on Rn","year":2000,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Mathematics; Examples of Markov chains; Spectral gap; Rate of convergence; Bounded function; Convergence (economics); Markov process; Markov kernel; Markov model; Applied mathematics; Markov chain mixing time; Markov property; Combinatorics; Variable-order Markov model; Mathematical analysis; Statistics; Computer science; Key (lock)","score_opus":0.023635363142000012,"score_gpt":0.3045898784417239,"score_spread":0.28095451529972393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001736102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014128031,0.006643589,0.95738935,0.00254526,0.0004928858,0.000058556405,0.00012817186,0.00023351904,0.01838076],"genre_scores_gemma":[0.6428291,0.02651364,0.28805608,0.0027254343,0.0044419733,0.0011918799,0.00086305285,0.0015066428,0.031872254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954744,0.0026400066,0.0001844343,0.00046512706,0.00093509676,0.00030096027],"domain_scores_gemma":[0.93087685,0.058824465,0.0028073485,0.0020225008,0.003828575,0.001640291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013208825,0.0032798843,0.0026548705,0.0067580556,0.001627804,0.003640751,0.0035570948,0.0035394835,0.008180401],"category_scores_gemma":[0.07053693,0.001742145,0.0024871957,0.0038187765,0.0078612985,0.008181461,0.0074327965,0.008527397,0.0010063818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003515764,0.000032141586,0.000340904,0.00012775465,0.000039856495,0.000054965043,0.0001619886,0.06719769,0.00046455706,0.9231886,0.0013479278,0.007008481],"study_design_scores_gemma":[0.000014847076,0.00001730018,0.00018047397,0.000086142805,0.00002008771,0.000050253504,0.00003622981,0.35864478,0.00037706003,0.63831073,0.002230992,0.00003117774],"about_ca_topic_score_codex":0.0035557651,"about_ca_topic_score_gemma":0.0024942623,"teacher_disagreement_score":0.013208825,"about_ca_system_score_codex":0.0042719143,"about_ca_system_score_gemma":0.0024816522,"threshold_uncertainty_score":0.06985575},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05514559893675608,"score_gpt":0.31967634724247374,"score_spread":0.26453074830571766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006582998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051528465,0.00016914228,0.94374514,0.00028979982,0.00002324213,0.00005539647,0.000036696496,0.00013548697,0.0040166215],"genre_scores_gemma":[0.92022306,0.00032545027,0.0765617,0.00020184265,0.000082518294,0.00024982565,0.000118290074,0.00015412274,0.0020831765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963313,0.0017825572,0.00018950456,0.00051574473,0.00084970315,0.0003312484],"domain_scores_gemma":[0.9683355,0.024085378,0.0021298197,0.002310489,0.0018475524,0.0012913392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007942821,0.00095398334,0.001364857,0.0015701604,0.0011763715,0.0020811716,0.0021366896,0.0013740002,0.002344527],"category_scores_gemma":[0.044299744,0.00065832713,0.0012598832,0.00094976526,0.0034520712,0.0035332362,0.004465282,0.0027167005,0.00037593374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001221527,0.00007776385,0.0019233591,0.00009992306,0.00009929382,0.00011646704,0.0002728541,0.20492895,0.0041410304,0.77753633,0.00043679102,0.010245069],"study_design_scores_gemma":[0.00002780908,0.00007181094,0.00036989187,0.000024382163,0.000023540835,0.000045685654,0.000027594033,0.7986093,0.0017072689,0.19839837,0.00067424885,0.000020087691],"about_ca_topic_score_codex":0.0014076662,"about_ca_topic_score_gemma":0.00073671,"teacher_disagreement_score":0.007942821,"about_ca_system_score_codex":0.0013962128,"about_ca_system_score_gemma":0.001294108,"threshold_uncertainty_score":0.042006195},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14374293496381518,"score_gpt":0.35435258394785096,"score_spread":0.21060964898403578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011918585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105344154,0.0005607823,0.88506323,0.0006633872,0.00007841478,0.00007583482,0.000112984504,0.0002016571,0.007899525],"genre_scores_gemma":[0.9051636,0.0011342065,0.07327466,0.00044869175,0.00025874435,0.0003104904,0.00029218977,0.00025295746,0.018864568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687105,0.0011304141,0.00013365073,0.00077981764,0.00070519483,0.00037990042],"domain_scores_gemma":[0.97237253,0.021325128,0.0025640829,0.0009728626,0.0011950665,0.001570379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005946915,0.0017830067,0.0027114437,0.0025602935,0.0017478149,0.003424624,0.0035090947,0.004603304,0.005283634],"category_scores_gemma":[0.032534886,0.0018765554,0.0022141773,0.0016768537,0.0059192255,0.005984819,0.0041683675,0.0041218773,0.00049424457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053037445,0.00005480486,0.00046969962,0.00007118866,0.000054076245,0.0001865852,0.0002790649,0.057155736,0.0012971561,0.93654495,0.00043183114,0.003401855],"study_design_scores_gemma":[0.00002238704,0.000025269132,0.0003284507,0.000022630915,0.000030900686,0.00009908005,0.00005449031,0.58079094,0.0004339392,0.4177095,0.0004333284,0.00004909413],"about_ca_topic_score_codex":0.0052665896,"about_ca_topic_score_gemma":0.0041085887,"teacher_disagreement_score":0.005946915,"about_ca_system_score_codex":0.0035422307,"about_ca_system_score_gemma":0.001960967,"threshold_uncertainty_score":0.03145069},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06900419749926845,"score_gpt":0.3476320010813868,"score_spread":0.27862780358211836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012518296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029721041,0.00085538084,0.9932473,0.00043857627,0.00006617701,0.000034333752,0.000024262834,0.00015903695,0.0022028512],"genre_scores_gemma":[0.25704098,0.002438681,0.7306809,0.0005747249,0.00028415045,0.0005157267,0.00026809698,0.00059991545,0.00759682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957646,0.0026386855,0.00021257221,0.0004508932,0.0007771279,0.00015606255],"domain_scores_gemma":[0.96584564,0.029167907,0.001410503,0.0013127765,0.0016496335,0.0006135535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010246865,0.0014808367,0.0012210581,0.0019050046,0.0011712093,0.0017662883,0.0018036282,0.002496628,0.0047348477],"category_scores_gemma":[0.054237228,0.000932532,0.0013315597,0.0014305245,0.0038760442,0.004833057,0.0030985652,0.0042635715,0.00091183407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008722806,0.00004390212,0.00094320206,0.00019524961,0.0000739059,0.00012251102,0.00020468132,0.3362816,0.001235821,0.62883896,0.0015503573,0.03042257],"study_design_scores_gemma":[0.0000069268494,0.000024534638,0.000106057836,0.000028988905,0.000008386078,0.000044253797,0.000011936788,0.81308776,0.0005246042,0.18450122,0.0016376514,0.000017660584],"about_ca_topic_score_codex":0.006271177,"about_ca_topic_score_gemma":0.005092933,"teacher_disagreement_score":0.010246865,"about_ca_system_score_codex":0.0033782627,"about_ca_system_score_gemma":0.001818536,"threshold_uncertainty_score":0.05419123},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02706464160399145,"score_gpt":0.2703303037262976,"score_spread":0.2432656621223062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013770427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0860515,0.0017926643,0.8904985,0.0031149858,0.0004279211,0.000093162475,0.00025032586,0.0011070875,0.016663894],"genre_scores_gemma":[0.78346276,0.001368747,0.181376,0.0015845189,0.001015569,0.0005389024,0.00055006845,0.0018341972,0.028269244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995695,0.00218044,0.00012356161,0.000943307,0.00064904115,0.0004086752],"domain_scores_gemma":[0.9444541,0.04311928,0.0020086658,0.006362024,0.0019026136,0.0021533098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009170493,0.001651739,0.0034175536,0.0031362367,0.002272802,0.003933475,0.0039335405,0.004559991,0.01645975],"category_scores_gemma":[0.06145965,0.001860026,0.0015893431,0.0016604521,0.004640456,0.01832209,0.0061379173,0.007756138,0.0016614437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018599659,0.00009959952,0.0004835852,0.00014523772,0.000048940405,0.00008351523,0.0002718962,0.026775567,0.0017467955,0.9572149,0.0032005701,0.009743386],"study_design_scores_gemma":[0.000037299964,0.000022253082,0.00019867161,0.000019292334,0.000018808836,0.000056614546,0.000030624673,0.17006628,0.0008192766,0.8271203,0.0015872213,0.000023310555],"about_ca_topic_score_codex":0.0014560221,"about_ca_topic_score_gemma":0.0010265519,"teacher_disagreement_score":0.01645975,"about_ca_system_score_codex":0.0022278342,"about_ca_system_score_gemma":0.001230408,"threshold_uncertainty_score":0.055063367},"labels":[],"label_agreement":null},{"id":"W2016843307","doi":"10.1016/j.jctb.2008.07.007","title":"Weighted enumeration of spanning subgraphs with degree constraints","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Degree (music); Combinatorics; Computer science; Mathematics; Physics","score_opus":0.0532364939173922,"score_gpt":0.2951162094085187,"score_spread":0.24187971549112647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016843307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16642047,0.0003281515,0.8212839,0.0005256651,0.00004543564,0.00011884849,0.0007151917,0.0003073091,0.010255044],"genre_scores_gemma":[0.5870494,0.00064635684,0.39674482,0.0003424403,0.000120684555,0.0005149632,0.0023805324,0.00050474383,0.011696061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983381,0.00082205073,0.00007927415,0.00028843325,0.00030365595,0.00016851861],"domain_scores_gemma":[0.98587036,0.011092717,0.0007517413,0.0011169715,0.00073392916,0.00043429242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209965,0.00082845875,0.0013279477,0.0019066209,0.0010099934,0.0019936117,0.0026548216,0.001908591,0.0061850273],"category_scores_gemma":[0.017979784,0.001361162,0.0010775925,0.0030460723,0.0011386388,0.004266968,0.0020200277,0.0016517336,0.0005545132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023031002,0.00018824912,0.0025130818,0.00029498705,0.000110822366,0.00021652055,0.00028941312,0.38557428,0.0029565557,0.54243785,0.0050237984,0.06016422],"study_design_scores_gemma":[0.000018655535,0.000011517041,0.00022734799,0.000023325312,0.000024878611,0.000057405683,0.000029293378,0.59771836,0.00059068925,0.40047497,0.00081550656,0.000008093033],"about_ca_topic_score_codex":0.0016416695,"about_ca_topic_score_gemma":0.0033620177,"teacher_disagreement_score":0.0061850273,"about_ca_system_score_codex":0.00095871184,"about_ca_system_score_gemma":0.0008633573,"threshold_uncertainty_score":0.020690978},"labels":[],"label_agreement":null},{"id":"W2017893815","doi":"10.5430/air.v4n1p53","title":"An effect of initial distribution covariance for annealing Gaussian restricted Boltzmann machines","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Covariance; Mathematics; Estimation of covariance matrices; Covariance matrix; Gaussian; Rational quadratic covariance function; CMA-ES; Law of total covariance; Covariance intersection; Applied mathematics; Matérn covariance function; Statistics; Statistical physics; Physics","score_opus":0.4103755150543119,"score_gpt":0.5721556670266622,"score_spread":0.1617801519723503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017893815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19282307,0.0005097422,0.80420303,0.0004127022,0.00007026299,0.00008698127,0.000064738626,0.00051462016,0.0013149339],"genre_scores_gemma":[0.89361537,0.00022548872,0.10524166,0.00013976033,0.000029790195,0.00009148346,0.00013430293,0.00016717585,0.00035478923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959927,0.0017671622,0.00022912797,0.00070923765,0.0010259866,0.00027585708],"domain_scores_gemma":[0.93671113,0.050573125,0.0032579121,0.004436968,0.004425271,0.0005955775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010061622,0.00089137634,0.00093119446,0.00056690973,0.0010523259,0.0014157998,0.0013159235,0.0011892873,0.001130807],"category_scores_gemma":[0.07170928,0.00062927144,0.00052933744,0.00038874795,0.001565203,0.003029243,0.0014097831,0.0020566364,0.00021312456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011075973,0.00039060647,0.019631194,0.00037390465,0.00025281793,0.00029173703,0.0005545726,0.8072168,0.035692576,0.05830285,0.0011580463,0.075027235],"study_design_scores_gemma":[0.000040588533,0.0002032363,0.0024931682,0.000040784944,0.000049253682,0.00008777672,0.0000490684,0.9618001,0.02550428,0.009278571,0.00040874488,0.00004444356],"about_ca_topic_score_codex":0.0034831876,"about_ca_topic_score_gemma":0.0037856807,"teacher_disagreement_score":0.010061622,"about_ca_system_score_codex":0.0013630573,"about_ca_system_score_gemma":0.001790414,"threshold_uncertainty_score":0.05321157},"labels":[],"label_agreement":null},{"id":"W2019783744","doi":"10.1023/b:stco.0000009413.87656.ef","title":"On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms","year":2003,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Children's & Women's Health Centre of British Columbia; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Random walk; Markov chain; Algorithm; Metropolis–Hastings algorithm; Univariate; Monte Carlo method; Computer science; Multivariate statistics; Mathematics; Statistics; Machine learning","score_opus":0.03947410229074172,"score_gpt":0.3532025686948865,"score_spread":0.31372846640414476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019783744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018114854,0.002314193,0.9690401,0.0015845444,0.00029258255,0.000073806914,0.000033436943,0.00029725017,0.008249247],"genre_scores_gemma":[0.5894444,0.002707844,0.39547604,0.0013476696,0.0008936397,0.00040225542,0.00016759963,0.001331544,0.008229067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988052,0.009087689,0.00031828857,0.00055494136,0.0015803326,0.0004067426],"domain_scores_gemma":[0.8266593,0.15982369,0.0019776237,0.0048276354,0.0045703207,0.002141427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028099509,0.002119495,0.003228913,0.0023314618,0.0019207579,0.0037219014,0.0036956419,0.0041421526,0.004113903],"category_scores_gemma":[0.14696918,0.0015756477,0.0014708969,0.0020721664,0.008408265,0.010306948,0.0056930874,0.0075323447,0.0006215243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005988353,0.00018060466,0.0009518059,0.00028753633,0.00010399718,0.00014569999,0.0003217858,0.22751194,0.0011227872,0.72912115,0.0027001083,0.036953766],"study_design_scores_gemma":[0.000042011667,0.000048646347,0.00009040927,0.00006630178,0.000026614138,0.000032550935,0.000016435366,0.75522137,0.00063559925,0.24311742,0.0006840991,0.000018508197],"about_ca_topic_score_codex":0.0017192357,"about_ca_topic_score_gemma":0.0017183062,"teacher_disagreement_score":0.028099509,"about_ca_system_score_codex":0.0022085086,"about_ca_system_score_gemma":0.002830689,"threshold_uncertainty_score":0.14860618},"labels":[],"label_agreement":null},{"id":"W2022761710","doi":"10.1239/aap/1269611144","title":"Translation-Equivariant Matchings of Coin Flips on ℤ<sup><i>d</i></sup>","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivariant map; Mathematics; Combinatorics; Translation (biology); Matching (statistics); Lattice (music); Discrete mathematics; Function (biology); Pure mathematics; Statistics; Physics","score_opus":0.040562191084970674,"score_gpt":0.33544956017336125,"score_spread":0.2948873690883906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022761710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54026204,0.00045370957,0.43639737,0.0009657815,0.00017648675,0.0001703802,0.0004108319,0.00042520108,0.020738175],"genre_scores_gemma":[0.9440389,0.0002510752,0.04681417,0.0001899259,0.000072755814,0.00016375618,0.00021236841,0.00008233094,0.008174779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784875,0.0006660935,0.0001505978,0.00043233964,0.00044542423,0.00045680153],"domain_scores_gemma":[0.99593425,0.0017446287,0.00065360905,0.00074980396,0.00038228315,0.0005354418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002263722,0.00053008675,0.001063325,0.001173967,0.0012687322,0.0022988794,0.0016511912,0.0012697967,0.006409828],"category_scores_gemma":[0.011560111,0.00053554465,0.0010938628,0.0010176349,0.0031320208,0.0034985463,0.0020799213,0.0013162681,0.0008590213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027496088,0.000061608815,0.0013525184,0.000052558444,0.000031619307,0.00026953264,0.00023792252,0.03221289,0.002722853,0.9523771,0.0007343113,0.009672105],"study_design_scores_gemma":[0.000055605247,0.00007528306,0.00035939008,0.000014931079,0.000013150343,0.00011276671,0.000080842685,0.15081172,0.0027095207,0.84452665,0.0012058363,0.000034275374],"about_ca_topic_score_codex":0.0017095496,"about_ca_topic_score_gemma":0.0014021264,"teacher_disagreement_score":0.006409828,"about_ca_system_score_codex":0.0014578049,"about_ca_system_score_gemma":0.00093469495,"threshold_uncertainty_score":0.02144301},"labels":[],"label_agreement":null},{"id":"W2028208450","doi":"10.1214/08-aap549","title":"Rate of relaxation for a mean-field zero-range process","year":2009,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; University of Cambridge","keywords":"Process (computing); Markov chain; Limit (mathematics); Markov process; Relaxation (psychology)","score_opus":0.17296257398631126,"score_gpt":0.40704535103484235,"score_spread":0.2340827770485311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028208450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6780754,0.0010842326,0.30192673,0.0017000638,0.00010134964,0.0000976393,0.00019095726,0.000566273,0.01625744],"genre_scores_gemma":[0.9825801,0.0003857945,0.012742642,0.00012642422,0.000059712427,0.00008378355,0.00011191021,0.00011864118,0.003790901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954695,0.00016370216,0.0000142324525,0.00008600614,0.00008629839,0.000102846876],"domain_scores_gemma":[0.9936373,0.0042129597,0.0006795074,0.00043280626,0.00041058482,0.0006268456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023786044,0.00035971435,0.00075090444,0.0010701815,0.0009443806,0.0012039251,0.0014723312,0.0009779936,0.0052609425],"category_scores_gemma":[0.010891586,0.0004385731,0.00059793744,0.00033549467,0.0024033582,0.0028331762,0.001673052,0.0019775557,0.00045886546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002757224,0.00013736285,0.002530543,0.00019809396,0.000042978034,0.00048553137,0.00095406466,0.12718394,0.020353958,0.8365005,0.001972879,0.009364313],"study_design_scores_gemma":[0.00005363472,0.00007446457,0.001217956,0.000038058475,0.000023414432,0.00023920876,0.0001378311,0.82849413,0.0042277277,0.1643813,0.0010389056,0.00007334158],"about_ca_topic_score_codex":0.0020413732,"about_ca_topic_score_gemma":0.000792254,"teacher_disagreement_score":0.0052609425,"about_ca_system_score_codex":0.001099086,"about_ca_system_score_gemma":0.000520887,"threshold_uncertainty_score":0.017599583},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2082485533330793,"score_gpt":0.43738322836301124,"score_spread":0.22913467502993196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032916024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008714172,0.017302638,0.9406816,0.0071533453,0.0006879052,0.00007677075,0.00009397345,0.00018739968,0.025102181],"genre_scores_gemma":[0.35664946,0.032485697,0.58338326,0.0047479854,0.004208121,0.0009387376,0.00039724074,0.0011412043,0.016048271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9768538,0.014645575,0.0013846977,0.0022918307,0.004153055,0.00067102065],"domain_scores_gemma":[0.852068,0.12384921,0.00546203,0.006569994,0.010123836,0.0019268398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03748922,0.002487902,0.0027040949,0.005411425,0.0023285686,0.00501334,0.0026818453,0.0037655227,0.00474393],"category_scores_gemma":[0.12732422,0.00099219,0.0019305483,0.0041677877,0.009642236,0.017724058,0.0060597244,0.010377094,0.0019039206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021144233,0.00001363462,0.00040582698,0.00021363577,0.000025367997,0.00013722053,0.00022581224,0.0131682465,0.00043720813,0.9611127,0.003315843,0.020923302],"study_design_scores_gemma":[0.0000032254547,0.000026123207,0.00018283355,0.00018706493,0.000010299763,0.00012534118,0.00005209464,0.024873327,0.00034647522,0.96784157,0.0063279243,0.000023827657],"about_ca_topic_score_codex":0.001564123,"about_ca_topic_score_gemma":0.0009006594,"teacher_disagreement_score":0.03748922,"about_ca_system_score_codex":0.0034323528,"about_ca_system_score_gemma":0.0012171078,"threshold_uncertainty_score":0.1982643},"labels":[],"label_agreement":null},{"id":"W2038583950","doi":"10.1081/stm-120004469","title":"Generalization of discrete-time geometric bounds to convergence rate of Markov processes on R<sup><i>n</i></sup>","year":2002,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Toronto","keywords":"Mathematics; Markov chain; Spectral gap; Limit (mathematics); Discrete time and continuous time; Path (computing); Operator (biology); Markov process; Generalization; Combinatorics; Convergence (economics); Applied mathematics; Mathematical analysis; Statistics","score_opus":0.059876070081977664,"score_gpt":0.30254703445388476,"score_spread":0.2426709643719071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038583950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050751273,0.0037481904,0.9126507,0.0017024453,0.0002776837,0.00011652302,0.00015399943,0.00022844732,0.030370856],"genre_scores_gemma":[0.84662265,0.005424777,0.13363928,0.00072023255,0.000648057,0.0005111102,0.00025989595,0.00039583657,0.011778186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808806,0.00065620674,0.00008912125,0.00038727798,0.000576239,0.00020307895],"domain_scores_gemma":[0.9878808,0.0075332425,0.0014864699,0.0011072942,0.0014124977,0.00057977583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409088,0.0016421112,0.00096398394,0.003099311,0.0009098601,0.002202035,0.002367223,0.0015317898,0.006364188],"category_scores_gemma":[0.02298125,0.0004795678,0.0015857348,0.0016081968,0.0052454732,0.006865963,0.0032591468,0.0042519495,0.00062350626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149965945,0.000017820536,0.0002064916,0.000083601386,0.000012608267,0.000044336677,0.0001250741,0.026188174,0.0010416488,0.9662805,0.0004372557,0.00554735],"study_design_scores_gemma":[0.000008224541,0.000041394356,0.0003382137,0.000051658924,0.000016032549,0.00013836265,0.000053086358,0.27007654,0.0018301044,0.72443473,0.002981431,0.000030241987],"about_ca_topic_score_codex":0.0011605346,"about_ca_topic_score_gemma":0.0006381576,"teacher_disagreement_score":0.006364188,"about_ca_system_score_codex":0.002875552,"about_ca_system_score_gemma":0.0012617962,"threshold_uncertainty_score":0.028606355},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10254336245691324,"score_gpt":0.381014057591398,"score_spread":0.27847069513448475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038604769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012983662,0.001255129,0.9784176,0.0007942807,0.00016115952,0.00006465082,0.00007272818,0.00023963924,0.0060110325],"genre_scores_gemma":[0.5667001,0.0027672986,0.41347998,0.00069887703,0.0010084648,0.00091866625,0.00042536846,0.0012091646,0.012791963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99512106,0.0030428448,0.00016390129,0.0004341637,0.0010017962,0.00023614417],"domain_scores_gemma":[0.94693017,0.042813044,0.0022853594,0.0033198504,0.0036780157,0.00097361754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012815427,0.0014709893,0.0022276063,0.0031732891,0.0021022763,0.0027872836,0.003242725,0.002736584,0.009032047],"category_scores_gemma":[0.07390338,0.0014377965,0.001922534,0.0022395658,0.0036141654,0.0045765876,0.0033417172,0.003834452,0.00082778925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053330892,0.000060875824,0.0011478679,0.00018128309,0.00009077914,0.00009425315,0.0001892725,0.21547446,0.0006540113,0.75978124,0.0027076597,0.019564908],"study_design_scores_gemma":[0.000008894653,0.000008970802,0.00025639523,0.000036028185,0.0000129008295,0.000021383301,0.00001627999,0.844547,0.00016081554,0.15390547,0.0010089031,0.000017061313],"about_ca_topic_score_codex":0.004096642,"about_ca_topic_score_gemma":0.0037102357,"teacher_disagreement_score":0.012815427,"about_ca_system_score_codex":0.0024415222,"about_ca_system_score_gemma":0.0022743726,"threshold_uncertainty_score":0.06777531},"labels":[],"label_agreement":null},{"id":"W2039715268","doi":"10.1186/2195-5832-1-5","title":"Approximating the distributions of runs and patterns","year":2014,"lang":"en","type":"article","venue":"Journal of Statistical Distributions and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Poisson distribution; Markov chain; Mathematics; Sequence (biology); Applied mathematics; Approximation error; Nonparametric statistics; Distribution (mathematics); Compound Poisson distribution; Statistics; Poisson regression; Mathematical analysis","score_opus":0.028252366892358168,"score_gpt":0.33854408057427704,"score_spread":0.3102917136819189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039715268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09081781,0.0005610701,0.9055335,0.00053008297,0.000101019345,0.000069267284,0.00022817552,0.00036890287,0.0017901857],"genre_scores_gemma":[0.777452,0.001161315,0.21328166,0.0001854206,0.0002374913,0.00036617508,0.000998595,0.00034749095,0.0059698564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997658,0.0010330417,0.00012381312,0.00053892663,0.00043592445,0.00021026703],"domain_scores_gemma":[0.9565961,0.035215188,0.0021471651,0.0035299936,0.0017498282,0.0007617692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007554327,0.0009871488,0.0015542575,0.0031113725,0.0008181955,0.00333959,0.0035672095,0.0024661252,0.00390764],"category_scores_gemma":[0.054102637,0.0017456117,0.0014916003,0.002413415,0.0034609411,0.006194,0.0024275503,0.0036763093,0.0007052665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025605704,0.00012716281,0.009076427,0.00014722838,0.00012145536,0.00014139398,0.000272438,0.66837394,0.0010283634,0.28685552,0.0017523105,0.031847704],"study_design_scores_gemma":[0.000018141656,0.000012097562,0.0003609852,0.00002565004,0.000012584226,0.000031453532,0.000027127415,0.8849152,0.00032052447,0.11390743,0.00035603592,0.0000128442925],"about_ca_topic_score_codex":0.0053905593,"about_ca_topic_score_gemma":0.005464289,"teacher_disagreement_score":0.007554327,"about_ca_system_score_codex":0.0020225036,"about_ca_system_score_gemma":0.0020327913,"threshold_uncertainty_score":0.039951563},"labels":[],"label_agreement":null},{"id":"W2039834917","doi":"10.1007/s00362-007-0358-z","title":"Some preservation results of NBUC aging property with applications","year":2007,"lang":"en","type":"article","venue":"Statistical Papers","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"AGE-WELL; Alberta Agricultural Research Institute","keywords":"Property (philosophy); Computer science; Philosophy; Epistemology","score_opus":0.054320659771558595,"score_gpt":0.35623083686800067,"score_spread":0.3019101770964421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039834917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04958235,0.0043553216,0.9191974,0.0018896826,0.0003875745,0.000052880587,0.00037597909,0.00034051665,0.023818357],"genre_scores_gemma":[0.79346025,0.0066519063,0.15931372,0.001296765,0.0014469923,0.00024500967,0.0007093005,0.00073197315,0.03614398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883276,0.00035135978,0.00007261203,0.0003171058,0.00028496783,0.00014118168],"domain_scores_gemma":[0.98819876,0.006035742,0.0011815109,0.0016943839,0.0020563335,0.00083320006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895279,0.0010551664,0.0015222164,0.0027418102,0.0018437279,0.0015974765,0.0024431208,0.0011481931,0.0062979213],"category_scores_gemma":[0.023279997,0.0005897639,0.0019145637,0.0033975323,0.003687557,0.0064988607,0.003240225,0.0037138509,0.0006147523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010206907,0.000049597784,0.002226318,0.00018177686,0.00004292973,0.00015807831,0.00043317856,0.016462715,0.0012723475,0.92657787,0.0047301427,0.04776305],"study_design_scores_gemma":[0.000015119787,0.000045442037,0.001018468,0.000050186383,0.00007554978,0.00024439732,0.00010877529,0.14366376,0.0016856359,0.8459869,0.0070766555,0.00002917441],"about_ca_topic_score_codex":0.004537992,"about_ca_topic_score_gemma":0.0022319462,"teacher_disagreement_score":0.0062979213,"about_ca_system_score_codex":0.0017055381,"about_ca_system_score_gemma":0.0015518412,"threshold_uncertainty_score":0.025889039},"labels":[],"label_agreement":null},{"id":"W2039893990","doi":"10.1007/s11222-014-9501-1","title":"Computing with Fisher geodesics and extended exponential families","year":2014,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Geodesic; Markov chain Monte Carlo; Exponential map (Riemannian geometry); Exponential family; Mathematics; Information geometry; Exponential function; Conjecture; Fisher information; Markov chain; Exponential distribution; Applied mathematics; Geometry; Monte Carlo method; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.023715863725062982,"score_gpt":0.29748041777679507,"score_spread":0.2737645540517321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039893990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01073269,0.00030583833,0.98628855,0.0003283523,0.00004306482,0.000013448789,0.000064459826,0.00026536972,0.001958307],"genre_scores_gemma":[0.33782643,0.0010299674,0.6515049,0.00029923694,0.00029639166,0.00016567833,0.00060294545,0.00075153797,0.0075229774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964837,0.0017447907,0.00020075841,0.0006257531,0.00073624053,0.00020871709],"domain_scores_gemma":[0.9838884,0.011441639,0.0006938893,0.0022542633,0.001209392,0.0005124423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005331937,0.0013744766,0.0019922962,0.0028670933,0.0014342975,0.0030724662,0.002909466,0.0020229975,0.0060324357],"category_scores_gemma":[0.038376424,0.0012514157,0.001638942,0.002905783,0.0041282536,0.009201681,0.0046858215,0.003341671,0.0010474115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006065653,0.000029506398,0.00063351385,0.00007649977,0.00004043406,0.0000385442,0.000108429456,0.14162232,0.00022890442,0.82704157,0.0017869248,0.028332775],"study_design_scores_gemma":[0.0000054948428,0.00000604514,0.00005565797,0.000012800454,0.0000059509593,0.000013858766,0.00001134556,0.3134539,0.00017312847,0.6854496,0.000804693,0.0000074880236],"about_ca_topic_score_codex":0.004779961,"about_ca_topic_score_gemma":0.005320847,"teacher_disagreement_score":0.0060324357,"about_ca_system_score_codex":0.0027858538,"about_ca_system_score_gemma":0.002093429,"threshold_uncertainty_score":0.028198302},"labels":[],"label_agreement":null},{"id":"W2040076368","doi":"10.2307/3316081","title":"On cross‐validation of Bayesian models","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayesian probability; Cross-validation; Computer science; Sample (material); Variable-order Bayesian network; Model validation; Scheme (mathematics); Artificial intelligence; Machine learning; Bayesian inference; Data mining; Mathematics; Data science","score_opus":0.08078842530196748,"score_gpt":0.3431410216912403,"score_spread":0.2623525963892728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040076368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010924008,0.0007464379,0.9859848,0.00045452738,0.00006757986,0.000048203965,0.000052968262,0.00020711844,0.0015143091],"genre_scores_gemma":[0.5751993,0.0013207861,0.41444075,0.0012027132,0.00050427864,0.0005228944,0.0010469988,0.0004497206,0.005312602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.95489335,0.038489703,0.0009945703,0.0018477954,0.0028863726,0.0008882721],"domain_scores_gemma":[0.7737916,0.20283781,0.002870546,0.009771235,0.00954277,0.0011860923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07699727,0.0014773661,0.0025319613,0.0027607542,0.0011964508,0.0026328797,0.004376382,0.0038963843,0.0034758036],"category_scores_gemma":[0.18327354,0.0015994476,0.0014281975,0.0022279625,0.0037758944,0.0036183335,0.006237392,0.0049075405,0.00073245517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004231182,0.00013406851,0.003067032,0.00016544994,0.00044580133,0.00011256224,0.0001531721,0.77948785,0.00056368386,0.13330156,0.0030308,0.07911489],"study_design_scores_gemma":[0.000021256057,0.000037032143,0.00039823598,0.000074721705,0.000021429003,0.000022101602,0.0000104343635,0.9538788,0.00029282586,0.044573367,0.0006536824,0.000016143129],"about_ca_topic_score_codex":0.011788736,"about_ca_topic_score_gemma":0.00768372,"teacher_disagreement_score":0.07699727,"about_ca_system_score_codex":0.0026875036,"about_ca_system_score_gemma":0.0027457138,"threshold_uncertainty_score":0.40720534},"labels":[],"label_agreement":null},{"id":"W2040839837","doi":"10.1007/s10985-014-9310-z","title":"Estimation and assessment of markov multistate models with intermittent observations on individuals","year":2014,"lang":"en","type":"review","venue":"Lifetime Data Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Institutes of Health Research","keywords":"Estimation; Markov chain; Markov model; Computer science; Econometrics; Markov process; Statistics; Mathematics; Machine learning; Economics","score_opus":0.259582130708081,"score_gpt":0.4658113323303397,"score_spread":0.20622920162225872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040839837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051626433,0.3541112,0.6349655,0.0021940668,0.00031199143,0.000045680084,0.00035781323,0.00019973375,0.002651439],"genre_scores_gemma":[0.13423578,0.6319179,0.22476456,0.000611597,0.0027628357,0.00023447043,0.0015181698,0.00015758543,0.003797063],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850583,0.0007111951,0.00010390265,0.0002887016,0.00033501472,0.00005529491],"domain_scores_gemma":[0.9833445,0.014181492,0.00081398856,0.00054990256,0.0009910648,0.00011915659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061605894,0.0015757888,0.0027985133,0.0027001025,0.0003498156,0.002250184,0.003974351,0.002487352,0.0020689662],"category_scores_gemma":[0.020111674,0.0010086338,0.0018394574,0.0034939926,0.001516353,0.0035567821,0.0015870293,0.0021993574,0.0005447787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008181327,0.00011528931,0.00425966,0.0041790735,0.0004991208,0.00010554679,0.00017991685,0.25166294,0.00042102617,0.15747714,0.007690632,0.5733279],"study_design_scores_gemma":[0.000021245944,0.00008156847,0.002878201,0.0016651977,0.00029736743,0.0003297489,0.00012847572,0.5789734,0.0006716397,0.37556747,0.039272692,0.00011303965],"about_ca_topic_score_codex":0.0058218697,"about_ca_topic_score_gemma":0.004285263,"teacher_disagreement_score":0.0061605894,"about_ca_system_score_codex":0.0013414819,"about_ca_system_score_gemma":0.002118275,"threshold_uncertainty_score":0.032580674},"labels":[],"label_agreement":null},{"id":"W2041367761","doi":"10.1016/j.spl.2008.01.021","title":"A regeneration proof of the central limit theorem for uniformly ergodic Markov chains","year":2008,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Ergodic theory; Markov chain; Central limit theorem; Limit (mathematics); Examples of Markov chains; Ergodicity; Pure mathematics; Discrete mathematics; Statistical physics; Combinatorics; Mathematical analysis; Calculus (dental); Markov model; Statistics; Balance equation","score_opus":0.056167971572509065,"score_gpt":0.29328612360385276,"score_spread":0.23711815203134368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041367761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018469758,0.0032612097,0.9351619,0.003227465,0.00090576673,0.00011666579,0.00042108272,0.00063597236,0.037800208],"genre_scores_gemma":[0.6607324,0.0059627555,0.26699707,0.004707816,0.0027777625,0.000955484,0.0008152456,0.0015257818,0.05552571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752563,0.0008930677,0.000111627334,0.0003826963,0.0007972273,0.00028968483],"domain_scores_gemma":[0.97300637,0.018938787,0.0011613069,0.001964403,0.0036885992,0.0012404491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071439994,0.0019936468,0.0022496488,0.0050818203,0.0022104797,0.0027958825,0.0043559684,0.002307403,0.016181564],"category_scores_gemma":[0.039937716,0.0012582055,0.0031255572,0.003673844,0.0052407975,0.0065701073,0.0063840575,0.008433154,0.0027718248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006606933,0.00004778387,0.00036606623,0.00016355311,0.000050322036,0.00014405073,0.00018937206,0.009435972,0.00093640585,0.97125006,0.0047990205,0.0125513235],"study_design_scores_gemma":[0.000036840112,0.000024773697,0.00029638995,0.00007478134,0.000036092366,0.00020599995,0.000038522376,0.10243763,0.00094107905,0.8896001,0.006264695,0.000042985183],"about_ca_topic_score_codex":0.0037884437,"about_ca_topic_score_gemma":0.002481107,"teacher_disagreement_score":0.016181564,"about_ca_system_score_codex":0.002934006,"about_ca_system_score_gemma":0.0032281578,"threshold_uncertainty_score":0.0541327},"labels":[],"label_agreement":null},{"id":"W2041979006","doi":"10.1016/j.jmaa.2010.03.019","title":"Subgeometric ergodicity for continuous-time Markov chains","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Hunan Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Ergodicity; Markov chain; Statistical physics; Pure mathematics; Applied mathematics; Statistics; Physics","score_opus":0.02260390032955687,"score_gpt":0.33178384719544535,"score_spread":0.30917994686588846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041979006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12893344,0.0023971784,0.85415375,0.0017304746,0.00029848792,0.00013387439,0.00036526122,0.00031872353,0.011668924],"genre_scores_gemma":[0.91739583,0.0057256743,0.055815965,0.0007910787,0.0013931199,0.0007192749,0.0008314559,0.0003820884,0.01694544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960651,0.0017691505,0.00022350714,0.00061732315,0.0007727136,0.00055226067],"domain_scores_gemma":[0.9285469,0.05678995,0.0045879246,0.0034178244,0.003648124,0.0030091873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012009851,0.002143037,0.0045501636,0.00698687,0.002121714,0.005707084,0.0031269763,0.0029050992,0.0063108113],"category_scores_gemma":[0.05651515,0.0017167929,0.002807024,0.0032877033,0.009698722,0.0085824095,0.0045146095,0.0055968976,0.0008108984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038794195,0.00003917841,0.0007185087,0.000085672895,0.00006735826,0.00010817877,0.00017347695,0.026647242,0.00041036308,0.96879894,0.000600684,0.002311683],"study_design_scores_gemma":[0.000017260956,0.000017432243,0.00035014225,0.000034702654,0.000029155282,0.000060755036,0.00004482133,0.260602,0.00019398365,0.7381633,0.00045182192,0.000034680223],"about_ca_topic_score_codex":0.0047329376,"about_ca_topic_score_gemma":0.0035341177,"teacher_disagreement_score":0.012009851,"about_ca_system_score_codex":0.0039020476,"about_ca_system_score_gemma":0.002953037,"threshold_uncertainty_score":0.06351489},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.07367654801908341,"score_gpt":0.33068471493845863,"score_spread":0.2570081669193752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042221696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012689816,0.00027869048,0.99698323,0.00016174516,0.00008621621,0.00003623894,0.00002769277,0.00024900096,0.0009082323],"genre_scores_gemma":[0.0788007,0.0007754757,0.90932256,0.00022028417,0.0005006599,0.0005624225,0.00036884993,0.0005878635,0.008861114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283594,0.0043460615,0.00030924985,0.0008659056,0.0013537023,0.00028908974],"domain_scores_gemma":[0.9597855,0.03145439,0.00096320966,0.005342061,0.0018507238,0.0006040646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008678976,0.0023124414,0.0037463885,0.0027021796,0.0020112724,0.0037897774,0.007951246,0.0046386924,0.010631054],"category_scores_gemma":[0.05000261,0.0030979293,0.0021619608,0.005507088,0.0054256646,0.008436452,0.004504739,0.0077633485,0.004698742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023739201,0.00015639323,0.0005741702,0.00025518212,0.0001618788,0.00008707135,0.0002067196,0.21272026,0.0007106597,0.69624215,0.0054526404,0.08319552],"study_design_scores_gemma":[0.000066326065,0.000019219073,0.000058235168,0.000020659485,0.000023521103,0.00003328983,0.000010788729,0.68370116,0.0005705036,0.31267267,0.002793355,0.000030196537],"about_ca_topic_score_codex":0.0033567122,"about_ca_topic_score_gemma":0.0043934523,"teacher_disagreement_score":0.010631054,"about_ca_system_score_codex":0.0019015879,"about_ca_system_score_gemma":0.0030812568,"threshold_uncertainty_score":0.04589933},"labels":[],"label_agreement":null},{"id":"W2043880717","doi":"10.1080/03610910600716753","title":"Perfect Forward Simulation via Simulated Tempering","year":2006,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parallel tempering; Computer science; Markov chain; Context (archaeology); Simple (philosophy); Algorithm; Scheme (mathematics); Mathematical optimization; Tempering; Markov chain Monte Carlo; Simulation; Artificial intelligence; Mathematics; Machine learning; Materials science; Bayesian probability","score_opus":0.16578433052535518,"score_gpt":0.4747663559425992,"score_spread":0.308982025417244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043880717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144516025,0.00010044135,0.9807639,0.00009160364,0.000036671678,0.000030985997,0.000026458694,0.00031346688,0.0041848295],"genre_scores_gemma":[0.55597144,0.00024929503,0.43871257,0.00009229873,0.000045340545,0.00017859283,0.00007439562,0.00017645831,0.0044995924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.0003207125,0.00002924765,0.00007894953,0.00021037532,0.000047621812],"domain_scores_gemma":[0.9984238,0.00089546613,0.00011804246,0.0003733269,0.0001293854,0.00005994871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014841139,0.0004566401,0.0006112981,0.00043538105,0.0005066748,0.0008599771,0.000984082,0.0008137119,0.0027817742],"category_scores_gemma":[0.005545892,0.00037430233,0.0006719012,0.00035918184,0.0016192594,0.0011977941,0.0016102677,0.0009567614,0.0004607763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052802538,0.000018198676,0.00039988707,0.00005237369,0.000034686687,0.000066755216,0.00010612426,0.4988448,0.0025718457,0.48364034,0.000496835,0.013715359],"study_design_scores_gemma":[0.00001353914,0.000017214408,0.000040583018,0.000007866424,0.0000067830347,0.000025008578,0.0000055381265,0.90175563,0.0018679007,0.093974404,0.0022752066,0.000010445588],"about_ca_topic_score_codex":0.001159233,"about_ca_topic_score_gemma":0.000685942,"teacher_disagreement_score":0.0027817742,"about_ca_system_score_codex":0.0006929586,"about_ca_system_score_gemma":0.00054022524,"threshold_uncertainty_score":0.009305954},"labels":[],"label_agreement":null},{"id":"W2045434610","doi":"10.1007/s10687-006-0028-5","title":"Extremal indices, geometric ergodicity of Markov chains, and MCMC","year":2006,"lang":"en","type":"article","venue":"Extremes","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodicity; Mathematics; Markov chain; Markov chain Monte Carlo; Simple (philosophy); Stability (learning theory); Applied mathematics; Statistical physics; Pure mathematics; Statistics; Monte Carlo method; Computer science; Physics","score_opus":0.03880715028102013,"score_gpt":0.3000465905003925,"score_spread":0.2612394402193724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045434610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060640674,0.0038543595,0.92217267,0.0017363749,0.0001679722,0.000044024335,0.00022940342,0.00027464927,0.010879893],"genre_scores_gemma":[0.8465004,0.004446907,0.13871619,0.00050970475,0.00091047626,0.00028389582,0.00058941107,0.0005108464,0.0075321468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682117,0.0019365204,0.000105937026,0.00044967985,0.00043814201,0.00024862637],"domain_scores_gemma":[0.96654207,0.026435973,0.002598945,0.0017697298,0.0013446436,0.0013087348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009616829,0.0012597175,0.002603116,0.005464852,0.0018830444,0.0038984078,0.0028435858,0.0026630017,0.0048991996],"category_scores_gemma":[0.049745556,0.0012172352,0.001427939,0.0031510482,0.0078086182,0.0062374095,0.0038263137,0.005486682,0.0005087613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026105874,0.00001801758,0.00093372056,0.000043801032,0.000035217483,0.00003583128,0.00007373518,0.042618338,0.00013886327,0.9506582,0.0009599136,0.0044582393],"study_design_scores_gemma":[0.000006446404,0.0000060039492,0.00025646816,0.00002800954,0.000008155968,0.00002382095,0.000017768598,0.15005088,0.000077537545,0.8490348,0.00047181366,0.000018390894],"about_ca_topic_score_codex":0.0027299204,"about_ca_topic_score_gemma":0.0027293738,"teacher_disagreement_score":0.009616829,"about_ca_system_score_codex":0.0030198453,"about_ca_system_score_gemma":0.0014933583,"threshold_uncertainty_score":0.050859332},"labels":[],"label_agreement":null},{"id":"W2046461052","doi":"10.1007/s10687-009-0099-1","title":"Erratum to: Extremal indices, geometric ergodicity of Markov chains, and MCMC","year":2010,"lang":"en","type":"erratum","venue":"Extremes","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Université de Paris; Université Paris-Sud","keywords":"Mathematics; Ergodicity; Markov chain; Markov chain Monte Carlo; Applied mathematics; Statistical physics; Statistics; Monte Carlo method; Physics","score_opus":0.047407076048826075,"score_gpt":0.32625534523776667,"score_spread":0.27884826918894057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046461052","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076658715,0.008173257,0.017856667,0.07815359,0.8458391,0.000087281354,0.00358892,0.0010418165,0.044492763],"genre_scores_gemma":[0.025752963,0.025033241,0.05897607,0.067033924,0.19141805,0.00042680543,0.007338028,0.0040823235,0.61993855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99690276,0.0006874772,0.00048396867,0.00044795955,0.0013473069,0.00013057305],"domain_scores_gemma":[0.9816441,0.008038034,0.0007729431,0.0015142651,0.0075062676,0.0005243941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033146492,0.002416666,0.0021062763,0.0053275106,0.0027169099,0.0040670405,0.002741896,0.0048588673,0.05539696],"category_scores_gemma":[0.05563715,0.0009875091,0.0012090869,0.004992537,0.0026691584,0.0047868798,0.0014177455,0.007922793,0.031248111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028690392,0.000012734466,0.000070781345,0.00010187286,0.000007902275,0.000077036326,0.000018966899,0.00033225876,0.000030612468,0.0146117415,0.9730489,0.011658471],"study_design_scores_gemma":[0.00005261658,0.000044811673,0.0012050713,0.00066693797,0.00004892604,0.00090781134,0.00011398993,0.0052381465,0.00049818686,0.095511384,0.8956002,0.00011194852],"about_ca_topic_score_codex":0.009597284,"about_ca_topic_score_gemma":0.015833164,"teacher_disagreement_score":0.05539696,"about_ca_system_score_codex":0.004271776,"about_ca_system_score_gemma":0.0030680818,"threshold_uncertainty_score":0.18532127},"labels":[],"label_agreement":null},{"id":"W2046783929","doi":"10.1088/1751-8113/40/27/f09","title":"No-compromise reptation quantum Monte Carlo","year":2007,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reptation; Compromise; Statistical physics; Monte Carlo method; Quantum Monte Carlo; Quantum; Physics; Mathematics; Statistics; Quantum mechanics; Sociology","score_opus":0.030788346658624326,"score_gpt":0.33282356934804214,"score_spread":0.3020352226894178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046783929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03131652,0.00019938675,0.96039975,0.00039155968,0.0000996477,0.00011976646,0.000066047476,0.0004556984,0.0069515705],"genre_scores_gemma":[0.7027022,0.00019667437,0.28386104,0.00040743774,0.00012070438,0.00033812632,0.00019947952,0.00028726022,0.01188713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979266,0.00069240166,0.00008375572,0.00046784963,0.0006233455,0.00020597214],"domain_scores_gemma":[0.99531156,0.0021394272,0.00036152193,0.0014081256,0.0005781226,0.00020133395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026496865,0.00056388596,0.001143942,0.0005705269,0.0010132823,0.0012459921,0.003154408,0.0018495788,0.0055043725],"category_scores_gemma":[0.012648771,0.0005130549,0.00075500045,0.000618957,0.0022321683,0.0029368375,0.0034691538,0.0022228602,0.0012032143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005950027,0.000116623974,0.0011826848,0.00010195851,0.00011316516,0.00023916362,0.0003884012,0.38475668,0.006316757,0.5570475,0.003278819,0.045863286],"study_design_scores_gemma":[0.000030194156,0.000056231096,0.00013130449,0.0000095522455,0.000013319193,0.00003920531,0.000012310724,0.9251211,0.0025568756,0.07009019,0.0019180352,0.000021621949],"about_ca_topic_score_codex":0.001232699,"about_ca_topic_score_gemma":0.001311887,"teacher_disagreement_score":0.0055043725,"about_ca_system_score_codex":0.0011036594,"about_ca_system_score_gemma":0.0007599095,"threshold_uncertainty_score":0.018413961},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08652925242123094,"score_gpt":0.31206761388875665,"score_spread":0.2255383614675257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047000577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072607666,0.00079401286,0.91724455,0.0005984231,0.00006756347,0.00009089353,0.00013312395,0.0003881208,0.008075651],"genre_scores_gemma":[0.90154725,0.0007947817,0.09056907,0.00034099782,0.00023514415,0.0003717563,0.00039385242,0.00039222438,0.005354797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963605,0.0018747901,0.00014431545,0.0005615433,0.00063169916,0.00042719187],"domain_scores_gemma":[0.9668387,0.025347464,0.0020517171,0.002678382,0.0021406345,0.00094309304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008784991,0.0010116406,0.0014342511,0.0021708906,0.0013070562,0.00238876,0.0025130194,0.0014145983,0.004842856],"category_scores_gemma":[0.042908512,0.0008073747,0.0012460101,0.0010016618,0.006145479,0.004786107,0.004552644,0.0023849495,0.0006967982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008510137,0.000022183702,0.0011735351,0.00006517249,0.0000489985,0.00009389996,0.00011645419,0.10151656,0.00075796875,0.8899831,0.0004968122,0.005640247],"study_design_scores_gemma":[0.000030678577,0.000047055983,0.00025528678,0.000030624033,0.000015878253,0.000055781275,0.000029253108,0.66743636,0.000795039,0.33056155,0.00072028826,0.00002212025],"about_ca_topic_score_codex":0.0020817688,"about_ca_topic_score_gemma":0.0016359657,"teacher_disagreement_score":0.008784991,"about_ca_system_score_codex":0.0020222948,"about_ca_system_score_gemma":0.001447016,"threshold_uncertainty_score":0.046460032},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.058553184144160234,"score_gpt":0.34562072589299764,"score_spread":0.2870675417488374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047978125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061215875,0.0015271798,0.97899276,0.0004458851,0.00012900982,0.00009562868,0.00024664972,0.0008795855,0.011561746],"genre_scores_gemma":[0.17410153,0.002163192,0.81350625,0.000489378,0.00019631661,0.00043041902,0.00076289295,0.0007683732,0.007581601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971016,0.0015003486,0.00014139834,0.00040115244,0.00070391083,0.00015151265],"domain_scores_gemma":[0.9899816,0.006667371,0.0003400539,0.0017977506,0.0010429673,0.00017027903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036957753,0.0009190395,0.00082314375,0.0012715607,0.001235595,0.0013115786,0.0028349955,0.0024379047,0.008912517],"category_scores_gemma":[0.023915138,0.0006975124,0.0011220301,0.0030437547,0.0015640998,0.0015111013,0.001832315,0.0024973953,0.0018618664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016422127,0.000112071866,0.0036671683,0.00053199776,0.00022654225,0.0003998415,0.0003796455,0.27342215,0.002098305,0.536166,0.016849112,0.16598292],"study_design_scores_gemma":[0.000071210205,0.00003193084,0.000715571,0.000072680385,0.000049550763,0.0002894248,0.00004256489,0.65749747,0.0019562715,0.3049339,0.034281667,0.000057764657],"about_ca_topic_score_codex":0.005269811,"about_ca_topic_score_gemma":0.0062957015,"teacher_disagreement_score":0.008912517,"about_ca_system_score_codex":0.0009961292,"about_ca_system_score_gemma":0.0010751633,"threshold_uncertainty_score":0.029815316},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07685186113986163,"score_gpt":0.3136031688352385,"score_spread":0.23675130769537683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048759201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22578768,0.0053068236,0.68920106,0.025213933,0.0005598674,0.00019188978,0.0012520569,0.00079031254,0.051696416],"genre_scores_gemma":[0.9073522,0.003178857,0.070063315,0.0037706199,0.00186189,0.0004938669,0.0010419558,0.00064928725,0.011588045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923011,0.0038163613,0.00029088344,0.0010420226,0.0017582882,0.0007913859],"domain_scores_gemma":[0.76458424,0.22077619,0.0033778958,0.0064873816,0.0022118224,0.002562492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012437892,0.0011771859,0.0046546506,0.0028262252,0.0036733677,0.005702367,0.0050552404,0.005809138,0.008957727],"category_scores_gemma":[0.111745715,0.002009594,0.002658565,0.0032294209,0.011005595,0.020416187,0.0071438677,0.012947087,0.00084460696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000218362,0.00008618148,0.001094746,0.00018942765,0.000049185666,0.00011989443,0.000407787,0.037513733,0.0003391659,0.9482026,0.004581645,0.0071973302],"study_design_scores_gemma":[0.00003914686,0.000011682519,0.00021220614,0.000029443912,0.0000120511095,0.000037599875,0.000030742962,0.08428614,0.000101327576,0.9147867,0.000438395,0.0000144732785],"about_ca_topic_score_codex":0.0043318495,"about_ca_topic_score_gemma":0.0025812935,"teacher_disagreement_score":0.012437892,"about_ca_system_score_codex":0.004151356,"about_ca_system_score_gemma":0.0029237736,"threshold_uncertainty_score":0.06577867},"labels":[],"label_agreement":null},{"id":"W2049303865","doi":"10.1007/s10958-014-1928-6","title":"Uniform Ergodicity and Strong Stability Estimates of Homogeneous Markov Chains*","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep Edouard Montpetit","funders":"","keywords":"Ergodicity; Mathematics; Markov chain; Homogeneous; Stability (learning theory); Applied mathematics; Markov process; Norm (philosophy); Statistical physics; Statistics; Combinatorics; Computer science","score_opus":0.07938583851797484,"score_gpt":0.3541832379651958,"score_spread":0.2747973994472209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049303865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13767144,0.0015662735,0.84048456,0.0017017993,0.00023613119,0.00011877046,0.00034825335,0.00028672026,0.017585998],"genre_scores_gemma":[0.92878944,0.001755542,0.053405385,0.0005352314,0.00069367967,0.00037388946,0.00050563656,0.00038849816,0.013552697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981822,0.00079993624,0.00009766114,0.00036197796,0.00028606973,0.00027214954],"domain_scores_gemma":[0.9608288,0.028616449,0.0030603127,0.0016778392,0.003798417,0.0020182729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007552972,0.0016770748,0.0016855403,0.0049918382,0.0019339131,0.002600009,0.0023146272,0.0014413518,0.0066176057],"category_scores_gemma":[0.040696677,0.0009930804,0.0019741566,0.0015335754,0.0052564545,0.006341409,0.005071602,0.0041164923,0.00059911713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001093012,0.000068712965,0.0014000244,0.00016232167,0.00009104647,0.00010906661,0.00029237074,0.03787634,0.0025877664,0.9502488,0.0014154976,0.005638734],"study_design_scores_gemma":[0.000019514919,0.00006266382,0.0010520129,0.00006029638,0.000051121508,0.00008535724,0.0000951873,0.42791602,0.0020490263,0.567499,0.001055112,0.000054710334],"about_ca_topic_score_codex":0.0025577876,"about_ca_topic_score_gemma":0.0019202234,"teacher_disagreement_score":0.007552972,"about_ca_system_score_codex":0.0020857211,"about_ca_system_score_gemma":0.0016781858,"threshold_uncertainty_score":0.03994441},"labels":[],"label_agreement":null},{"id":"W2050062126","doi":"10.1109/ciss.2012.6310851","title":"Impact of MCMC convergence behavior on MMC parallelization","year":2012,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Markov chain Monte Carlo; Supercomputer; Monte Carlo method; Parallel computing; Embarrassingly parallel; Convergence (economics); Scalability; Computational science; Algorithm; Parallel algorithm; Bayesian probability; Artificial intelligence; Mathematics","score_opus":0.15006021821003987,"score_gpt":0.45681294957560636,"score_spread":0.30675273136556647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050062126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53789294,0.0044954075,0.3733386,0.010497779,0.0007881643,0.0006415563,0.0011432195,0.008814719,0.06238762],"genre_scores_gemma":[0.86746424,0.0008064338,0.12625353,0.00075259607,0.00009123567,0.00033992616,0.0006550626,0.0014126425,0.0022242996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918132,0.0042105927,0.00051785714,0.0008225371,0.0019594582,0.00067637314],"domain_scores_gemma":[0.9146798,0.06270538,0.002177313,0.010141207,0.009114718,0.0011816454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015041196,0.0012006464,0.0010185699,0.0009949963,0.0020007638,0.0019945977,0.0016802745,0.0014302935,0.005995054],"category_scores_gemma":[0.13522525,0.00069740845,0.0006768507,0.0021029175,0.0015995116,0.002372298,0.0014320653,0.0024114912,0.0015404843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017842846,0.00032368017,0.023713054,0.00054483063,0.00024984198,0.00057125784,0.00083416136,0.7421402,0.011397406,0.057361826,0.014369994,0.14670937],"study_design_scores_gemma":[0.00018203992,0.00011146922,0.0033636114,0.00011947263,0.000053417807,0.00015155606,0.00023558347,0.9652187,0.010169395,0.016701961,0.0036550048,0.00003775635],"about_ca_topic_score_codex":0.017834809,"about_ca_topic_score_gemma":0.015700053,"teacher_disagreement_score":0.017834809,"about_ca_system_score_codex":0.0022121936,"about_ca_system_score_gemma":0.0038721913,"threshold_uncertainty_score":0.07954645},"labels":[],"label_agreement":null},{"id":"W2050588875","doi":"10.1145/2767386.2767413","title":"Improved Analysis of Deterministic Load-Balancing Schemes","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Load balancing (electrical power); Computer science; Markov chain; Algorithm; Markov process; Set (abstract data type); Graph; Stochastic matrix; Parallel computing; Theoretical computer science; Mathematics","score_opus":0.10314086738370959,"score_gpt":0.39663744166354836,"score_spread":0.2934965742798388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050588875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070938066,0.0015655285,0.9072201,0.0011156071,0.00016198645,0.00010265462,0.00015138375,0.00034542446,0.018399302],"genre_scores_gemma":[0.9159573,0.000905067,0.0750364,0.00020721131,0.00015789985,0.00015096308,0.00016311642,0.00012353451,0.007298539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810886,0.000534205,0.00007418028,0.00024246675,0.0007892637,0.00025105616],"domain_scores_gemma":[0.9959319,0.0021471821,0.00046199438,0.0006856015,0.00057900674,0.00019430822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026984827,0.0007475117,0.0010135985,0.00095475395,0.0006800849,0.0015056654,0.002147602,0.0013601214,0.0048698084],"category_scores_gemma":[0.013864482,0.0004673405,0.0007207299,0.0008432444,0.0013946746,0.0024176054,0.002119602,0.0016325729,0.0005439337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012652794,0.0000331648,0.0003693707,0.000103670594,0.000026323785,0.000044465025,0.00009421949,0.7300549,0.002394553,0.2532063,0.001347159,0.012199306],"study_design_scores_gemma":[0.000008111797,0.0000100435245,0.00004854576,0.0000067222163,0.000003193185,0.000007246052,0.000003530087,0.97525895,0.00016232896,0.023992898,0.0004946518,0.0000037909272],"about_ca_topic_score_codex":0.002786882,"about_ca_topic_score_gemma":0.0013212841,"teacher_disagreement_score":0.0048698084,"about_ca_system_score_codex":0.0028837852,"about_ca_system_score_gemma":0.0015569163,"threshold_uncertainty_score":0.020923495},"labels":[],"label_agreement":null},{"id":"W2051326462","doi":"10.1016/s0304-4149(02)00232-6","title":"On swapping and simulated tempering algorithms","year":2003,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Algorithm; Tempering; Applied mathematics","score_opus":0.038691439272325885,"score_gpt":0.318842896316924,"score_spread":0.2801514570445981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051326462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038214733,0.0014047674,0.99070084,0.000409413,0.00017264801,0.000027780156,0.000029904033,0.00010079625,0.003332435],"genre_scores_gemma":[0.27114588,0.005030254,0.705861,0.000876303,0.0012340294,0.00058793696,0.00038330499,0.00090317277,0.013978145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448663,0.0038675405,0.00022788435,0.0005038832,0.0007164121,0.00019766543],"domain_scores_gemma":[0.9631928,0.03178401,0.0009939311,0.0022301197,0.0012576977,0.00054137857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011372367,0.0021903994,0.0032793323,0.0028702656,0.0018142988,0.0033512355,0.004000394,0.004612161,0.006126383],"category_scores_gemma":[0.053433016,0.001979343,0.002548629,0.004221078,0.0074024783,0.0073268665,0.005484307,0.006382288,0.0009837549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006209399,0.000037554313,0.0003048832,0.00009246915,0.00006168391,0.000039556315,0.00010010607,0.20616265,0.0002520923,0.7762395,0.0013722349,0.0152751235],"study_design_scores_gemma":[0.000014307012,0.0000100260295,0.000054445714,0.000022598619,0.000012644317,0.00001702172,0.000008050466,0.4798078,0.00011628918,0.5183939,0.0015299926,0.000012992613],"about_ca_topic_score_codex":0.0026787196,"about_ca_topic_score_gemma":0.002055654,"teacher_disagreement_score":0.011372367,"about_ca_system_score_codex":0.002558407,"about_ca_system_score_gemma":0.001903735,"threshold_uncertainty_score":0.06014359},"labels":[],"label_agreement":null},{"id":"W2058886342","doi":"10.1016/j.crma.2009.11.006","title":"A new class of interacting Markov chain Monte Carlo methods","year":2009,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Markov chain; Applied mathematics; Convergence (economics); Markov chain Monte Carlo; Monte Carlo method; Context (archaeology); Statistical physics; Feynman diagram; Combinatorics; Discrete mathematics; Calculus (dental); Mathematical physics; Statistics; Physics","score_opus":0.04905551202526282,"score_gpt":0.38242982906623346,"score_spread":0.33337431704097065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058886342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041007935,0.000281615,0.992396,0.00017971045,0.00009630783,0.000047833586,0.000039054452,0.00012646972,0.0027322215],"genre_scores_gemma":[0.23758806,0.0010652532,0.7494719,0.0005421007,0.00049937965,0.0007304626,0.0002692988,0.000370025,0.009463551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794775,0.0009691294,0.00009027854,0.00022937113,0.00065249694,0.00011099484],"domain_scores_gemma":[0.9961188,0.00249365,0.00023271951,0.0004349637,0.0004973824,0.00022245315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035056018,0.0007837199,0.0010308636,0.0012091092,0.0007519948,0.0014654744,0.0026002564,0.001704049,0.0036672088],"category_scores_gemma":[0.008680166,0.0005631829,0.0014275074,0.00071996514,0.0016078937,0.002431225,0.0018197829,0.002539811,0.00066274195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004484873,0.000085958636,0.0010805978,0.00011209558,0.0000916562,0.00012755881,0.0001435748,0.23875147,0.0021368575,0.72610384,0.0017262634,0.029595245],"study_design_scores_gemma":[0.000014547219,0.000014219451,0.00007445537,0.000016043092,0.000008634425,0.000038650556,0.0000052272935,0.9331631,0.00037478594,0.06279211,0.0034842477,0.000014009951],"about_ca_topic_score_codex":0.002017077,"about_ca_topic_score_gemma":0.0016304478,"teacher_disagreement_score":0.0036672088,"about_ca_system_score_codex":0.000835534,"about_ca_system_score_gemma":0.0013368509,"threshold_uncertainty_score":0.018539608},"labels":[],"label_agreement":null},{"id":"W2064378620","doi":"10.1145/509907.509924","title":"The Glauber dynamics on colourings of a graph with high girth and maximum degree","year":2002,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Combinatorics; Mathematics; Degree (music); Graph; Girth (graph theory); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.04672105461241819,"score_gpt":0.26784005207935374,"score_spread":0.22111899746693556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064378620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7507215,0.0012355538,0.21596022,0.003764008,0.00018120452,0.00010196022,0.00031066022,0.00052865804,0.027196173],"genre_scores_gemma":[0.97654086,0.00055446493,0.015614894,0.00044105365,0.0001082467,0.00013173716,0.00012284501,0.00012025568,0.006365629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946946,0.00017492502,0.000013235848,0.00010719774,0.00009654529,0.0001386652],"domain_scores_gemma":[0.9950812,0.0027189462,0.0007850129,0.00044925962,0.0002610853,0.000704472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011790375,0.00067541463,0.00079482957,0.001599373,0.0016294911,0.0016874205,0.0011676863,0.0012220651,0.0060866424],"category_scores_gemma":[0.0099017,0.0006146254,0.0009928033,0.0007466609,0.004049302,0.0041078357,0.002634622,0.0024247551,0.0006579847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018203404,0.000040425843,0.0027440854,0.00010045477,0.000030568972,0.00018560489,0.0005219304,0.044482704,0.0069206688,0.9344219,0.0032501782,0.0071193916],"study_design_scores_gemma":[0.00004024503,0.000071473005,0.0014498151,0.000032507607,0.000017192826,0.00017596019,0.00011039402,0.270815,0.0024009487,0.72261053,0.0022402673,0.000035606667],"about_ca_topic_score_codex":0.003464324,"about_ca_topic_score_gemma":0.0026736187,"teacher_disagreement_score":0.0060866424,"about_ca_system_score_codex":0.0023682746,"about_ca_system_score_gemma":0.00085339847,"threshold_uncertainty_score":0.02036184},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.24450909635132478,"score_gpt":0.3829196259814799,"score_spread":0.1384105296301551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066357294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01770634,0.00064683217,0.9684379,0.0006632926,0.00013184085,0.000050282437,0.00015846785,0.00025598143,0.011949068],"genre_scores_gemma":[0.8083825,0.0017834202,0.16974986,0.0011485065,0.00068951043,0.00051227066,0.000552379,0.00048762804,0.01669389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715924,0.00090972165,0.00011445139,0.0006672644,0.0007909974,0.00035834222],"domain_scores_gemma":[0.9883385,0.007619728,0.0010578784,0.0015206987,0.0010878956,0.00037518173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029724527,0.00084856816,0.001075029,0.0012519611,0.0010447671,0.0018979838,0.0015840967,0.0015676991,0.0062982645],"category_scores_gemma":[0.018084178,0.00053591613,0.0010447695,0.0009688797,0.0032207433,0.0036352559,0.002406306,0.003129824,0.0009721613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001826217,0.000018107616,0.0005452943,0.000050953808,0.00002832817,0.00009065515,0.00010619443,0.03338938,0.0017213583,0.9568312,0.0010302769,0.006169902],"study_design_scores_gemma":[0.000012624179,0.00002699154,0.00023457623,0.00003453403,0.000014204132,0.00007291581,0.000019574743,0.2925362,0.0014159331,0.70172775,0.0038785615,0.000026119666],"about_ca_topic_score_codex":0.0014070234,"about_ca_topic_score_gemma":0.0011331668,"teacher_disagreement_score":0.0062982645,"about_ca_system_score_codex":0.0013422825,"about_ca_system_score_gemma":0.001340856,"threshold_uncertainty_score":0.021069825},"labels":[],"label_agreement":null},{"id":"W2068828332","doi":"10.1016/s0167-7152(99)00134-0","title":"Slow hit-and-run sampling","year":2000,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Distribution (mathematics); Rate of convergence; Convergence (economics); Statistics; Sampling (signal processing); Econometrics; Computer science; Mathematical analysis; Key (lock)","score_opus":0.07282506604029688,"score_gpt":0.3395339931364096,"score_spread":0.2667089270961127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068828332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030379182,0.00070720643,0.9624518,0.00074502267,0.00021518547,0.0002284224,0.00021483567,0.0018807084,0.003177704],"genre_scores_gemma":[0.5567773,0.0005272848,0.4229664,0.0010448302,0.0003983187,0.0013555,0.0011660159,0.0014166622,0.01434779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98832697,0.007616708,0.0003604527,0.0014710418,0.0014449444,0.0007799984],"domain_scores_gemma":[0.9106134,0.067913026,0.0013767629,0.015322604,0.0027844138,0.0019897458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018248396,0.0020932716,0.0057503665,0.0025179281,0.0027777902,0.0033616307,0.007645704,0.004618744,0.011164673],"category_scores_gemma":[0.07854942,0.0026430641,0.0028821374,0.0027358711,0.0040229005,0.008587207,0.008335081,0.0068817926,0.0026289057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002799244,0.00048638353,0.009366795,0.00067856733,0.0009897165,0.0006970701,0.0011240199,0.4194781,0.0028301158,0.43201637,0.018120665,0.111412995],"study_design_scores_gemma":[0.00013001011,0.000079742495,0.00032913455,0.000023056074,0.00008705446,0.00010671875,0.000047030488,0.84318423,0.00060021144,0.1539753,0.0014065276,0.00003101966],"about_ca_topic_score_codex":0.003635693,"about_ca_topic_score_gemma":0.006442774,"teacher_disagreement_score":0.018248396,"about_ca_system_score_codex":0.001754566,"about_ca_system_score_gemma":0.003620968,"threshold_uncertainty_score":0.09650791},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14300595252504816,"score_gpt":0.3894167694051828,"score_spread":0.24641081688013466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071768380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108129784,0.00084061845,0.88186395,0.0007292646,0.00007801898,0.00004449913,0.00009784438,0.00015123998,0.008064836],"genre_scores_gemma":[0.81588745,0.00098463,0.16952868,0.00020830121,0.00019783272,0.00012232953,0.0001623361,0.00012962907,0.0127787925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994192,0.00021643913,0.00002117194,0.00014187198,0.0001308133,0.00007043348],"domain_scores_gemma":[0.99844295,0.00083083636,0.00025297597,0.00017598142,0.00010269781,0.00019456717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012798681,0.00040196453,0.0006752367,0.00094780367,0.00070630433,0.0014090193,0.0012751101,0.0012178986,0.0032508888],"category_scores_gemma":[0.004280151,0.00035848925,0.0011503454,0.00073777226,0.0032303005,0.0020100905,0.0014333902,0.002009879,0.0005578793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002221553,0.000015019001,0.00038018948,0.00003070791,0.000010305185,0.00022069333,0.00019816168,0.030755965,0.001993131,0.96052384,0.00034200988,0.0055078175],"study_design_scores_gemma":[0.000014873564,0.000027520844,0.0002529819,0.000018122535,0.0000104804685,0.0001872101,0.000048342106,0.35129362,0.0013076348,0.6436841,0.0031226452,0.000032385542],"about_ca_topic_score_codex":0.0011916091,"about_ca_topic_score_gemma":0.0010615936,"teacher_disagreement_score":0.0032508888,"about_ca_system_score_codex":0.0009518679,"about_ca_system_score_gemma":0.0005764686,"threshold_uncertainty_score":0.010875344},"labels":[],"label_agreement":null},{"id":"W2072670053","doi":"10.1090/s0002-9947-2014-06183-7","title":"Functions preserving positive definiteness for sparse matrices","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Mathematics; Positive definiteness; Positive-definite matrix; Diagonal; Combinatorics; Monotonic function; Matrix (chemical analysis); Definiteness; Discrete mathematics; Markov chain; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.046902367017161606,"score_gpt":0.327708740291265,"score_spread":0.2808063732741034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072670053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09168741,0.0003583327,0.90201813,0.0003097279,0.000046180012,0.000035925743,0.000106416555,0.00020439022,0.0052334378],"genre_scores_gemma":[0.828159,0.0012038756,0.15975551,0.00039746694,0.0002625345,0.00019340996,0.0004253759,0.00046121044,0.009141704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907047,0.0003617218,0.00003790539,0.00019612812,0.00020698413,0.00012682138],"domain_scores_gemma":[0.99135345,0.005653007,0.0010174165,0.0005257213,0.0009836886,0.00046667957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025086782,0.0015718418,0.0006812,0.0013774263,0.00044021624,0.0015740492,0.0009000478,0.0010432091,0.0023357891],"category_scores_gemma":[0.013025921,0.00036924766,0.00065703905,0.0008118551,0.0027769182,0.0026615923,0.0011899875,0.0020542,0.00067690125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019461362,0.00012882781,0.0014759409,0.00026530607,0.000044367418,0.00034920813,0.00046220535,0.17767845,0.029076694,0.73737514,0.0027827884,0.05016642],"study_design_scores_gemma":[0.0000126960385,0.00023619989,0.00042314312,0.00004356996,0.000013778173,0.00018108917,0.00009501664,0.66134864,0.008542141,0.32747668,0.0015833933,0.00004361278],"about_ca_topic_score_codex":0.000975898,"about_ca_topic_score_gemma":0.00061978993,"teacher_disagreement_score":0.0025086782,"about_ca_system_score_codex":0.00081644196,"about_ca_system_score_gemma":0.0006232475,"threshold_uncertainty_score":0.013267338},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.13484095240486849,"score_gpt":0.35714579678991587,"score_spread":0.22230484438504738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075954168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002716752,0.000101698904,0.9955837,0.00012197551,0.000117862146,0.00004201903,0.000029807776,0.00012321421,0.0011629565],"genre_scores_gemma":[0.09800042,0.00033407964,0.89022994,0.0002569821,0.00024621768,0.00040673485,0.00022593881,0.00048526502,0.009814452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986318,0.00054773304,0.000077079414,0.00019940552,0.0004470077,0.000097013224],"domain_scores_gemma":[0.9968202,0.0016273672,0.00014489128,0.00049199065,0.0007297306,0.00018581394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032742429,0.00082223123,0.0013079727,0.0008082345,0.00074180734,0.0013524771,0.0039668987,0.002262232,0.007986627],"category_scores_gemma":[0.011827107,0.0006498629,0.0012899787,0.0011309993,0.0016654562,0.002802832,0.0024856522,0.0034064874,0.0019647616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023714748,0.00015572764,0.00085340446,0.00018278536,0.00014996446,0.00016857387,0.00016532456,0.3978527,0.0054101986,0.4894509,0.0050288844,0.100344405],"study_design_scores_gemma":[0.000023471848,0.000020489364,0.00006520946,0.000010346407,0.000010503038,0.000025669391,0.000004686903,0.9631226,0.00038394376,0.03462885,0.0016864117,0.000017882427],"about_ca_topic_score_codex":0.0040246756,"about_ca_topic_score_gemma":0.0038138907,"teacher_disagreement_score":0.007986627,"about_ca_system_score_codex":0.0010510035,"about_ca_system_score_gemma":0.0028712116,"threshold_uncertainty_score":0.02671796},"labels":[],"label_agreement":null},{"id":"W2077881077","doi":"10.2478/v10170-011-0039-6","title":"Discrete homing problems","year":2013,"lang":"en","type":"article","venue":"Archives of Control Sciences","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Markov chain; Discrete time and continuous time; Homing (biology); Mathematical optimization; Markov process; Bellman equation; Computer science; Optimal control; Continuation; Markov decision process; Function (biology); Control theory (sociology); Mathematics; Control (management); Artificial intelligence","score_opus":0.04259494689686676,"score_gpt":0.3248989994468989,"score_spread":0.2823040525500321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077881077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16229588,0.0007963392,0.80425155,0.0017536278,0.00022181265,0.00012011972,0.00020425982,0.00021392899,0.030142609],"genre_scores_gemma":[0.92386913,0.000405953,0.059404887,0.000208481,0.00013244848,0.00019150003,0.00019563118,0.00008708578,0.015504878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988753,0.00049291755,0.000055755165,0.00025066783,0.000172576,0.00015279604],"domain_scores_gemma":[0.9966695,0.0022100944,0.00026885752,0.00024686626,0.00021687656,0.00038787402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020309223,0.00057586207,0.0009236865,0.00083030737,0.001006869,0.0018326149,0.0010892962,0.0022524837,0.009011439],"category_scores_gemma":[0.0067532044,0.00034008018,0.00095371023,0.000482027,0.0026230735,0.002527958,0.0024299014,0.0020816023,0.0004118642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008974781,0.000076152945,0.0007112593,0.000108442095,0.00004342885,0.00021881604,0.00022288869,0.16499127,0.00084591267,0.8174587,0.0015864054,0.013647086],"study_design_scores_gemma":[0.00003831468,0.00006009234,0.00016403386,0.000028181614,0.000010616006,0.00004894581,0.00008718696,0.4556084,0.0005159544,0.54132426,0.0020999617,0.000014153332],"about_ca_topic_score_codex":0.00120486,"about_ca_topic_score_gemma":0.000571876,"teacher_disagreement_score":0.009011439,"about_ca_system_score_codex":0.0013593826,"about_ca_system_score_gemma":0.0008213206,"threshold_uncertainty_score":0.0301463},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2503156941519951,"score_gpt":0.42029359838798686,"score_spread":0.16997790423599174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078014848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012486163,0.000901325,0.9940585,0.0004173595,0.00009077317,0.000047034777,0.00006369865,0.0001664109,0.003006307],"genre_scores_gemma":[0.1288522,0.0035848035,0.8566266,0.0008654153,0.0007551685,0.00059326,0.0003677238,0.00046045615,0.007894409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958034,0.0024605233,0.00015419214,0.0005701373,0.00083081913,0.00018088607],"domain_scores_gemma":[0.98581403,0.011570622,0.0004852966,0.0010336112,0.00083864364,0.0002577779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070243436,0.0010948647,0.001234565,0.0018959858,0.0012967582,0.002167565,0.0035116218,0.002773349,0.007068131],"category_scores_gemma":[0.033361513,0.0009529782,0.0012351178,0.0026815303,0.0038148218,0.002999916,0.0025173668,0.0047874525,0.0014402342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031839332,0.000023854067,0.0005200743,0.00012465057,0.000057488433,0.000056907826,0.0001306212,0.11797359,0.00027037997,0.8458793,0.0024130796,0.032518137],"study_design_scores_gemma":[0.000027257385,0.000011441732,0.00014113495,0.00005291077,0.000018685727,0.000048151876,0.000017094235,0.4040077,0.0002870366,0.5860567,0.009306929,0.000024935734],"about_ca_topic_score_codex":0.0065184897,"about_ca_topic_score_gemma":0.005629699,"teacher_disagreement_score":0.007068131,"about_ca_system_score_codex":0.0018478172,"about_ca_system_score_gemma":0.0022835908,"threshold_uncertainty_score":0.037148774},"labels":[],"label_agreement":null},{"id":"W2081642070","doi":"10.1239/aap/1077134472","title":"Conductance bounds on the<i>L</i><sup>2</sup>convergence rate of Metropolis algorithms on unbounded state spaces","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Conductance; Mathematics; Spectral gap; Bounded function; Monotone polygon; Upper and lower bounds; Domain (mathematical analysis); Combinatorics; Markov chain; Measure (data warehouse); State (computer science); Discrete mathematics; Convergence (economics); Probability measure; Algorithm; Mathematical analysis; Geometry; Statistics","score_opus":0.05054963403755571,"score_gpt":0.3343913620863614,"score_spread":0.2838417280488057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081642070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0940543,0.0020570024,0.8730867,0.0027890757,0.00015154046,0.00013503169,0.00018605695,0.0008043898,0.026735894],"genre_scores_gemma":[0.8980182,0.0015800913,0.0931078,0.00090817513,0.00020513752,0.00047845425,0.00023997374,0.0008995313,0.004562685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978542,0.00078848004,0.000081213504,0.00036755114,0.00053541246,0.00037316285],"domain_scores_gemma":[0.96112275,0.0330307,0.0012859458,0.0017183125,0.0016466439,0.0011956431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004651618,0.0015826109,0.0015245425,0.0015227144,0.0012477731,0.0023689498,0.0025732033,0.0021842197,0.0044731554],"category_scores_gemma":[0.0410338,0.0006633145,0.0011139882,0.00079938624,0.0039407546,0.00624646,0.0036629029,0.0050068647,0.0010450025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003067628,0.00012165592,0.0013631022,0.00032324946,0.000050735307,0.00018589379,0.0005480662,0.19238973,0.011863202,0.771935,0.0022007895,0.01871184],"study_design_scores_gemma":[0.000018452274,0.00006502768,0.00032813067,0.000078151184,0.000017268521,0.00016852876,0.00007801848,0.649957,0.005018087,0.3429473,0.0012920636,0.000031924686],"about_ca_topic_score_codex":0.0006555489,"about_ca_topic_score_gemma":0.00050614215,"teacher_disagreement_score":0.004651618,"about_ca_system_score_codex":0.0029620852,"about_ca_system_score_gemma":0.001448507,"threshold_uncertainty_score":0.024600446},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04884437887349389,"score_gpt":0.35359135518041324,"score_spread":0.3047469763069193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084668838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145501485,0.001264034,0.9763415,0.0011596805,0.00017170707,0.00009937709,0.000072919705,0.00030133603,0.0060392204],"genre_scores_gemma":[0.4858315,0.0030266896,0.48911747,0.0010409552,0.0008932082,0.0009878107,0.00040275507,0.0009018077,0.017797861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993064,0.0043263617,0.00024325043,0.0007802065,0.0010190894,0.00056709995],"domain_scores_gemma":[0.91662306,0.07343544,0.0014866833,0.0038939742,0.0033045693,0.0012562879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016056282,0.0014812816,0.0025505703,0.0017791637,0.0016024153,0.0035286793,0.003845279,0.0026129507,0.008900256],"category_scores_gemma":[0.08676199,0.0013722386,0.0014047961,0.0016177779,0.004040934,0.008412846,0.0035587177,0.00683081,0.0018516629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023987898,0.00013803087,0.0007413942,0.0001756015,0.00006605245,0.00004242227,0.0001947379,0.14820182,0.00065357646,0.81214166,0.0042087166,0.033196118],"study_design_scores_gemma":[0.000049842736,0.000040967698,0.00014539181,0.000053453972,0.000025664405,0.000027182008,0.000026698697,0.6159455,0.0006248625,0.38136682,0.001664349,0.000029304414],"about_ca_topic_score_codex":0.003503657,"about_ca_topic_score_gemma":0.0027813523,"teacher_disagreement_score":0.016056282,"about_ca_system_score_codex":0.0030822044,"about_ca_system_score_gemma":0.0037230349,"threshold_uncertainty_score":0.084914744},"labels":[],"label_agreement":null},{"id":"W2087011720","doi":"10.1016/j.spa.2003.10.013","title":"Markov chain approximations to filtering equations for reflecting diffusion processes","year":2004,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Markov chain; Mathematics; Filtering problem; Particle filter; Applied mathematics; Filter (signal processing); Bounded function; State space; Markov process; Mathematical optimization; Algorithm; Kalman filter; Computer science; Mathematical analysis; Statistics; Extended Kalman filter","score_opus":0.07408544714624346,"score_gpt":0.3663065619957586,"score_spread":0.2922211148495152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087011720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009443885,0.0014563914,0.9856323,0.0007098314,0.00016813996,0.000026430806,0.000065019434,0.00009863693,0.0023994287],"genre_scores_gemma":[0.5864594,0.010232168,0.36026323,0.0009553806,0.0013598887,0.00059340877,0.0010808483,0.0005508132,0.03850493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834883,0.00086403295,0.00008612675,0.00020882695,0.00034548977,0.0001466505],"domain_scores_gemma":[0.9841076,0.01316944,0.00081489375,0.0004781745,0.0010441479,0.00038582843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054842164,0.0017669963,0.0027337566,0.0027123739,0.0012558169,0.0036260965,0.0028060328,0.0045432537,0.0038644061],"category_scores_gemma":[0.026634514,0.0019189744,0.002071356,0.0025072515,0.004093216,0.005832681,0.0024058793,0.004909865,0.00062306336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039734336,0.000038908875,0.000382033,0.00008542033,0.000049299266,0.000062473395,0.00012753934,0.2674705,0.00049055624,0.72420955,0.0011903795,0.0058536115],"study_design_scores_gemma":[0.0000118394555,0.0000045071456,0.00005180003,0.000015754695,0.000008827863,0.0000109721595,0.000009521575,0.80228096,0.000090027876,0.196937,0.00056466536,0.00001404192],"about_ca_topic_score_codex":0.01985183,"about_ca_topic_score_gemma":0.012424037,"teacher_disagreement_score":0.01985183,"about_ca_system_score_codex":0.0038822815,"about_ca_system_score_gemma":0.002809759,"threshold_uncertainty_score":0.03947258},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.036227202114213604,"score_gpt":0.32963675568475,"score_spread":0.2934095535705364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088606685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1469903,0.0023901875,0.78806317,0.008281117,0.00048623854,0.00008190277,0.00049008586,0.00030125247,0.05291568],"genre_scores_gemma":[0.913458,0.0030940704,0.05882294,0.0014631872,0.001803943,0.00024621506,0.000719184,0.00032497567,0.02006757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966934,0.0018161937,0.00017436747,0.00038275536,0.00064913207,0.00028421023],"domain_scores_gemma":[0.97651696,0.016356153,0.0022271206,0.0018052395,0.0014326556,0.0016618042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006380683,0.0007881544,0.0016077559,0.0022014282,0.0018984899,0.0025910162,0.0021088587,0.0019111589,0.0066075227],"category_scores_gemma":[0.032814596,0.00083271123,0.001583308,0.0015226267,0.0066920742,0.006701682,0.0040097544,0.004929621,0.0007452634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013362569,0.000014719672,0.0001781557,0.000019733347,0.0000068114596,0.000036701873,0.0000703626,0.0046144743,0.000077541445,0.99335974,0.00052633806,0.0010821065],"study_design_scores_gemma":[0.0000064799638,0.0000050600656,0.00010731225,0.000012170436,0.0000033581466,0.000025533513,0.000016245527,0.039195232,0.000036732967,0.96006036,0.00052233296,0.000009279748],"about_ca_topic_score_codex":0.0062668105,"about_ca_topic_score_gemma":0.0040821624,"teacher_disagreement_score":0.0066075227,"about_ca_system_score_codex":0.0022723123,"about_ca_system_score_gemma":0.0026496537,"threshold_uncertainty_score":0.033744633},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04613108094967818,"score_gpt":0.316571938793911,"score_spread":0.27044085784423283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089048182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029089125,0.0015363314,0.9656262,0.0007674989,0.00013169386,0.000026054688,0.000102264305,0.00016906454,0.0025518276],"genre_scores_gemma":[0.8510577,0.0071872533,0.12216204,0.0008357575,0.0012252002,0.00037145556,0.0007799312,0.0004607566,0.015919983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970099,0.0011990805,0.00019827734,0.00067078887,0.00052515,0.0003969321],"domain_scores_gemma":[0.95877355,0.033120975,0.0026554645,0.0023364723,0.0021043527,0.0010092087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010656376,0.0023576522,0.0038948245,0.0028494678,0.0015311948,0.0040437044,0.0039038125,0.0041161287,0.0034797615],"category_scores_gemma":[0.047486935,0.0019304362,0.0030949204,0.002408992,0.007385613,0.008326091,0.0034866948,0.0056877676,0.00047226815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005795561,0.000046027548,0.0005730491,0.00013132565,0.00009720662,0.00011701149,0.00017531865,0.15488799,0.0005372451,0.8357477,0.0008095898,0.006819634],"study_design_scores_gemma":[0.000013616838,0.00001595951,0.00020422794,0.00002795553,0.000034364122,0.00003267323,0.000019301966,0.5639058,0.00023944984,0.4351023,0.00036657052,0.000037885413],"about_ca_topic_score_codex":0.008001616,"about_ca_topic_score_gemma":0.0065328744,"teacher_disagreement_score":0.010656376,"about_ca_system_score_codex":0.0032516134,"about_ca_system_score_gemma":0.0026227364,"threshold_uncertainty_score":0.056356966},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.16979081864427756,"score_gpt":0.38092674440062785,"score_spread":0.2111359257563503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090251478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07584141,0.00033231848,0.9182591,0.00063556334,0.000052742336,0.00017042377,0.00012173983,0.00034377238,0.0042429282],"genre_scores_gemma":[0.8425357,0.0004922438,0.1441205,0.00036604077,0.00012314947,0.00049405795,0.00044224376,0.00038004038,0.011046035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979582,0.00087386166,0.000080549486,0.00028665486,0.00057806115,0.00022266869],"domain_scores_gemma":[0.9769052,0.017797984,0.0014162832,0.0012513677,0.0017091278,0.00091995223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007338976,0.000782844,0.0014102088,0.0013916065,0.00089845754,0.0016148138,0.0027434248,0.0018692075,0.0075976644],"category_scores_gemma":[0.028529426,0.00090049516,0.00093247247,0.00064869184,0.0030361372,0.0026390085,0.0023378069,0.0023074797,0.0007754239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015531262,0.00011285879,0.0018645576,0.00018305064,0.000073674106,0.00027834697,0.00027414187,0.4475165,0.0040524704,0.5355446,0.0012899798,0.008654555],"study_design_scores_gemma":[0.000014068503,0.000016718444,0.000083295075,0.000009088361,0.0000049371956,0.000019137506,0.000008019318,0.9653899,0.0003488245,0.033889163,0.00020985864,0.000007007239],"about_ca_topic_score_codex":0.0030176812,"about_ca_topic_score_gemma":0.002275418,"teacher_disagreement_score":0.0075976644,"about_ca_system_score_codex":0.0020952837,"about_ca_system_score_gemma":0.00256095,"threshold_uncertainty_score":0.038812637},"labels":[],"label_agreement":null},{"id":"W2091692049","doi":"10.5402/2011/346503","title":"First Hitting Problems for Markov Chains That Converge to a Geometric Brownian Motion","year":2011,"lang":"lv","type":"article","venue":"ISRN Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Algorithm; Computer science","score_opus":0.1190463357537561,"score_gpt":0.3097455484445746,"score_spread":0.19069921269081846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091692049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22922781,0.001954625,0.7378212,0.005008867,0.00031879434,0.00027611776,0.0008316112,0.00074859324,0.023812432],"genre_scores_gemma":[0.8748452,0.0015183532,0.07558742,0.00068073475,0.00026022675,0.0007606043,0.0018626226,0.0004141925,0.044070687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971552,0.0011184857,0.00013953878,0.00058279827,0.00044429,0.0005596251],"domain_scores_gemma":[0.96189266,0.030673053,0.002390534,0.0008084185,0.0015898503,0.0026454492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006309564,0.0021837947,0.002513966,0.0030921341,0.002009245,0.004241057,0.003039833,0.0047099995,0.013791253],"category_scores_gemma":[0.03469369,0.0015514998,0.0027433436,0.0017368427,0.0038520303,0.0050664674,0.004525071,0.0044784225,0.0012446578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025865046,0.00010902813,0.0025565708,0.00024617318,0.00018465181,0.0005343875,0.0005668266,0.3752353,0.00063059625,0.6078583,0.0035682921,0.008251198],"study_design_scores_gemma":[0.000054006476,0.00004588478,0.00024931197,0.000037282436,0.00002269599,0.000050362043,0.00007491616,0.78861475,0.00017985512,0.20992593,0.000711897,0.000033088323],"about_ca_topic_score_codex":0.010511019,"about_ca_topic_score_gemma":0.00668584,"teacher_disagreement_score":0.013791253,"about_ca_system_score_codex":0.0038963177,"about_ca_system_score_gemma":0.0023842347,"threshold_uncertainty_score":0.04613638},"labels":[],"label_agreement":null},{"id":"W2093614514","doi":"10.1239/jap/1421763335","title":"The Containment Condition and Adapfail Algorithms","year":2014,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Containment (computer programming); Mathematics; Markov chain Monte Carlo; Markov chain; Convergence (economics); Ergodic theory; Algorithm; Focus (optics); Mathematical optimization; Monte Carlo method; Computer science; Statistics","score_opus":0.035078706583015276,"score_gpt":0.31290436596615073,"score_spread":0.27782565938313547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093614514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757256,0.0005954352,0.96993655,0.000961939,0.00012557104,0.00010418528,0.00010954832,0.00062744645,0.009966752],"genre_scores_gemma":[0.63469714,0.0009512995,0.34976548,0.0015964402,0.0005403627,0.0007838168,0.000638278,0.0008001026,0.010227024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99141896,0.0042540636,0.00041955677,0.0010807518,0.002345178,0.0004814937],"domain_scores_gemma":[0.9368843,0.04603238,0.00286243,0.008543902,0.004573958,0.0011031147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009628472,0.0008862781,0.0015886871,0.0011692223,0.001104686,0.002301301,0.0030228198,0.0027697906,0.008708584],"category_scores_gemma":[0.073404886,0.0006678079,0.0008351544,0.0010604222,0.0037123268,0.005556748,0.0049138106,0.004437412,0.0021716128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045163976,0.00013592535,0.003085169,0.00024677865,0.00007655426,0.0002045508,0.00029225438,0.14788143,0.0025383367,0.7174537,0.00869707,0.118936524],"study_design_scores_gemma":[0.00005405046,0.00017091428,0.00033239077,0.00006498772,0.000016876793,0.0002218915,0.000039829534,0.7075333,0.0031537323,0.28262016,0.005766358,0.000025488955],"about_ca_topic_score_codex":0.0011168193,"about_ca_topic_score_gemma":0.0006823312,"teacher_disagreement_score":0.009628472,"about_ca_system_score_codex":0.0012908618,"about_ca_system_score_gemma":0.0018410935,"threshold_uncertainty_score":0.050920844},"labels":[],"label_agreement":null},{"id":"W2104397519","doi":"10.37236/2921","title":"The Capture Time of the Hypercube","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.011257930311298856,"score_gpt":0.25731674485433814,"score_spread":0.2460588145430393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104397519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4179986,0.0017790745,0.52859443,0.0021663967,0.00017940022,0.00027370296,0.00052401004,0.0006052431,0.047879115],"genre_scores_gemma":[0.95470566,0.0008702418,0.026941177,0.0004604189,0.00007430051,0.0003830863,0.00041354282,0.0002777362,0.015873792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850225,0.00041644266,0.000047497077,0.00031258486,0.00027090329,0.0004502969],"domain_scores_gemma":[0.9933263,0.0042821015,0.00064419117,0.00062387006,0.0003151084,0.0008084912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018508548,0.00078229886,0.0007930562,0.00081977353,0.0011955496,0.0022518656,0.0019891274,0.0015359356,0.009645889],"category_scores_gemma":[0.010907851,0.0007975115,0.0011283315,0.0006418781,0.0021965695,0.004481806,0.0023744782,0.0026419105,0.0009142151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008034261,0.00017344844,0.0018709366,0.00027091193,0.00013347201,0.00027345103,0.000608951,0.25220087,0.014001631,0.7069406,0.005906126,0.016816145],"study_design_scores_gemma":[0.000088739755,0.00024082795,0.0009431709,0.00008209245,0.0000531072,0.00022081625,0.00021774428,0.6877646,0.0062392405,0.29968932,0.0043884055,0.000071926785],"about_ca_topic_score_codex":0.0027158791,"about_ca_topic_score_gemma":0.0022958608,"teacher_disagreement_score":0.009645889,"about_ca_system_score_codex":0.002304305,"about_ca_system_score_gemma":0.0018028602,"threshold_uncertainty_score":0.032268703},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03489857493065025,"score_gpt":0.3465355127841554,"score_spread":0.31163693785350516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108293203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017144978,0.0034846955,0.9683903,0.0019793042,0.00031413292,0.000041037467,0.000109532026,0.00010451339,0.008431576],"genre_scores_gemma":[0.6343929,0.009247062,0.32137817,0.0012987414,0.0013447544,0.00041677107,0.00045956837,0.00048612224,0.030975869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997623,0.0012740938,0.0001496881,0.0003023399,0.00047933366,0.00017147214],"domain_scores_gemma":[0.97704405,0.017331066,0.001643001,0.000895075,0.0018793246,0.0012075776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007951054,0.0017987501,0.0023380516,0.0031167783,0.0014110357,0.0036170545,0.0019794633,0.002577049,0.0042073973],"category_scores_gemma":[0.030533377,0.0011344813,0.0016176684,0.0026374338,0.0061725713,0.0061341687,0.0035760046,0.00501953,0.00051223225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109468265,0.000014991189,0.00018830756,0.000051486557,0.000020820074,0.000034767883,0.000096139665,0.015963223,0.00019952068,0.97938687,0.0005891892,0.0034437575],"study_design_scores_gemma":[0.0000074515215,0.0000064612072,0.00008097684,0.000026457697,0.0000067979704,0.000023314724,0.000015603491,0.13781688,0.000056472265,0.86099017,0.000958491,0.000010974272],"about_ca_topic_score_codex":0.0055222893,"about_ca_topic_score_gemma":0.0046267854,"teacher_disagreement_score":0.007951054,"about_ca_system_score_codex":0.005148076,"about_ca_system_score_gemma":0.003257123,"threshold_uncertainty_score":0.042049706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06591323379604168,"score_gpt":0.32683886001267554,"score_spread":0.26092562621663384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113328396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082827825,0.00016445674,0.9892229,0.00033796247,0.00005495718,0.000066044784,0.000023074232,0.0003181823,0.0015295657],"genre_scores_gemma":[0.21368705,0.00030726613,0.7767188,0.00040396806,0.00018698802,0.00084173627,0.00022099366,0.00052492577,0.00710831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880569,0.007524984,0.0004822511,0.0013678554,0.0019310439,0.00063698564],"domain_scores_gemma":[0.9113769,0.07297184,0.0021889328,0.00902294,0.0028091248,0.0016302153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01666936,0.001796044,0.0033970643,0.0022883595,0.0020786556,0.005102267,0.008678746,0.006210232,0.008640292],"category_scores_gemma":[0.07240778,0.001964367,0.0026134804,0.0031706672,0.0046042455,0.011042366,0.0075445096,0.0057735313,0.0020973834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001022701,0.00040280574,0.0029878397,0.0002867392,0.0003864563,0.0001754965,0.0005511859,0.4577723,0.0013125554,0.45028928,0.0029898747,0.08182274],"study_design_scores_gemma":[0.0000958676,0.000037313388,0.0001307172,0.000018210918,0.000039929695,0.000062157706,0.000027591152,0.8645544,0.00068852294,0.13371702,0.0005906438,0.000037687252],"about_ca_topic_score_codex":0.0014314544,"about_ca_topic_score_gemma":0.0024581228,"teacher_disagreement_score":0.01666936,"about_ca_system_score_codex":0.002345896,"about_ca_system_score_gemma":0.0029437966,"threshold_uncertainty_score":0.08815706},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11771996281821873,"score_gpt":0.40188560915867516,"score_spread":0.28416564634045643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114493774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027961745,0.00024455122,0.99552613,0.0000957188,0.000036040157,0.000018542332,0.000017513721,0.00013802106,0.0011273151],"genre_scores_gemma":[0.106755085,0.0005172136,0.8889603,0.00014090692,0.00007799794,0.00027446685,0.000066592926,0.00029088397,0.00291658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973613,0.0001021828,0.000009783719,0.000035646342,0.00009721901,0.000019006196],"domain_scores_gemma":[0.99967253,0.00018133917,0.000025639552,0.00003608274,0.000060045095,0.000024335422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007929014,0.0006392042,0.00084724964,0.0005458736,0.00042650188,0.0005564741,0.0009988595,0.00096393615,0.0024923969],"category_scores_gemma":[0.0012404994,0.00035105535,0.000500639,0.00060905557,0.0007700359,0.0009439789,0.00096152065,0.001024181,0.00046390647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042759406,0.00004314873,0.00033736834,0.00016029864,0.00006447378,0.000057303052,0.000087532186,0.7970597,0.0057093045,0.08569587,0.0025079816,0.10823429],"study_design_scores_gemma":[0.000008452152,0.000017217904,0.000041797135,0.000007108355,0.0000037734299,0.000016766266,0.0000036233253,0.98586243,0.00039951797,0.011524591,0.0021064417,0.000008259452],"about_ca_topic_score_codex":0.0015304565,"about_ca_topic_score_gemma":0.0017252472,"teacher_disagreement_score":0.0024923969,"about_ca_system_score_codex":0.00035931764,"about_ca_system_score_gemma":0.0007393756,"threshold_uncertainty_score":0.008337915},"labels":[],"label_agreement":null},{"id":"W2115684092","doi":"10.1109/cdc.2001.981010","title":"Law of the iterated logarithm for a constant-gain linear stochastic gradient algorithm","year":2003,"lang":"en","type":"article","venue":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Law of the iterated logarithm; Logarithm; Constant (computer programming); Iterated logarithm; Iterated function; Mathematics; Applied mathematics; Limiting; Zero (linguistics); Natural logarithm; Stochastic process; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.05293776873898644,"score_gpt":0.31457152708230657,"score_spread":0.26163375834332014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115684092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02692356,0.0003070322,0.9660719,0.00056723284,0.00004542324,0.00005807438,0.000049926122,0.00025129115,0.005725437],"genre_scores_gemma":[0.8997014,0.0008231966,0.08824834,0.00036653396,0.00012524155,0.00037768387,0.000113845315,0.00020939458,0.010034266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986362,0.0004952235,0.00007350886,0.00023800522,0.00040469412,0.00015245136],"domain_scores_gemma":[0.98738307,0.009141061,0.0009900692,0.0005631147,0.0014233406,0.00049949944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004891042,0.0010074808,0.0011991822,0.0010168591,0.0005707578,0.002321045,0.0018806171,0.001838717,0.004608301],"category_scores_gemma":[0.031038811,0.000412472,0.0007519642,0.0005705783,0.0034134893,0.0035329994,0.0017068962,0.0026108304,0.00066374324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011807764,0.000084340594,0.0012732893,0.00025237532,0.000060599534,0.00029271079,0.00033247902,0.3549647,0.0051649557,0.6152369,0.0016580444,0.020561561],"study_design_scores_gemma":[0.000014588827,0.000046486584,0.00015292014,0.000025512127,0.00000911544,0.00006818238,0.000016670354,0.93619365,0.00068646367,0.062372793,0.000396123,0.000017495026],"about_ca_topic_score_codex":0.0027917097,"about_ca_topic_score_gemma":0.0014723754,"teacher_disagreement_score":0.004891042,"about_ca_system_score_codex":0.0016844904,"about_ca_system_score_gemma":0.0017808498,"threshold_uncertainty_score":0.025866568},"labels":[],"label_agreement":null},{"id":"W2117032256","doi":"10.1002/rsa.10020","title":"Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs","year":2001,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Glauber; Mathematics; Combinatorics; Degree (music); Mixing (physics); Constant (computer programming); Graph; Bounded function; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.051178455649638334,"score_gpt":0.3076444219577712,"score_spread":0.25646596630813284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117032256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.624688,0.00031296504,0.36405867,0.0010674265,0.000057775287,0.00010189161,0.00011889376,0.00064376666,0.008950529],"genre_scores_gemma":[0.9701413,0.000108564884,0.02691773,0.000103124636,0.000022365588,0.000116338015,0.00009545577,0.000105585976,0.002389651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991135,0.00036152595,0.000032206604,0.00017826245,0.00013955706,0.00017489675],"domain_scores_gemma":[0.99394196,0.0037625798,0.00067266525,0.0005900049,0.0002829792,0.00074982207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019288615,0.0005484288,0.0008068048,0.0010682936,0.0013310519,0.0018819879,0.00085186266,0.0011978945,0.0040131854],"category_scores_gemma":[0.01199551,0.0006933883,0.00071256654,0.00037740418,0.0025415341,0.0031535702,0.0019407517,0.0014946694,0.00043862764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004904773,0.00010117344,0.0026166749,0.000078401186,0.000051816958,0.00019796033,0.0006062914,0.17521128,0.013557491,0.7943847,0.0018352284,0.010868564],"study_design_scores_gemma":[0.00005423575,0.00004266491,0.00036808033,0.00000991909,0.000009694176,0.00003996116,0.00005477092,0.6530799,0.0027556627,0.3429246,0.00063779793,0.000022704631],"about_ca_topic_score_codex":0.0022489694,"about_ca_topic_score_gemma":0.0020109422,"teacher_disagreement_score":0.0040131854,"about_ca_system_score_codex":0.0020331328,"about_ca_system_score_gemma":0.0007864168,"threshold_uncertainty_score":0.014751434},"labels":[],"label_agreement":null},{"id":"W2119871732","doi":"10.1007/s11009-009-9157-z","title":"Quantitative Non-Geometric Convergence Bounds for Independence Samplers","year":2009,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodic theory; Mathematics; Independence (probability theory); Convergence (economics); Markov chain; Upper and lower bounds; Simple (philosophy); Applied mathematics; Markov chain Monte Carlo; Pure mathematics; Mathematical analysis; Statistics; Monte Carlo method","score_opus":0.2742685808816141,"score_gpt":0.43441141607632755,"score_spread":0.16014283519471345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119871732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075812424,0.00133021,0.9805283,0.0013874676,0.00015706525,0.00006884379,0.00013131756,0.00023735061,0.008578179],"genre_scores_gemma":[0.49922106,0.0049705897,0.46036878,0.0028083392,0.0020224343,0.0015371633,0.0012682579,0.0024244897,0.025378851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9820451,0.009579903,0.00066063204,0.0022968508,0.004309204,0.0011083295],"domain_scores_gemma":[0.7737642,0.19296533,0.005566202,0.010871718,0.012351769,0.004480815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.037023768,0.0035400705,0.0038362718,0.0073331883,0.0026498807,0.0067435717,0.0078050843,0.004439435,0.012334752],"category_scores_gemma":[0.17796077,0.00238076,0.0032834497,0.0035536552,0.013355161,0.018484935,0.01199572,0.013835214,0.0016413563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040097046,0.000033382163,0.00038989555,0.00014141147,0.00003291867,0.000029733155,0.0001434537,0.025673363,0.0002694869,0.96744967,0.0011223397,0.004674322],"study_design_scores_gemma":[0.000013248045,0.00002310952,0.00023768007,0.00007924622,0.000023668334,0.000060138846,0.000032706655,0.2305857,0.000422938,0.7670473,0.001445937,0.000028340311],"about_ca_topic_score_codex":0.0019789047,"about_ca_topic_score_gemma":0.0016711575,"teacher_disagreement_score":0.037023768,"about_ca_system_score_codex":0.0061769984,"about_ca_system_score_gemma":0.003322385,"threshold_uncertainty_score":0.19580275},"labels":[],"label_agreement":null},{"id":"W2125781122","doi":"10.1109/qest.2005.4","title":"An approximation algorithm for labelled Markov processes: towards realistic approximation","year":2005,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Scheme (mathematics); Computer science; Approximation algorithm; Kernel (algebra); Stochastic approximation; Markov process; Approximation theory; Markov chain; State space; Algorithm; Markov chain Monte Carlo; Monte Carlo method; Mathematical optimization; Theoretical computer science; Mathematics; Bayesian probability; Artificial intelligence; Discrete mathematics; Machine learning; Statistics","score_opus":0.05964424766372872,"score_gpt":0.3672619673111026,"score_spread":0.3076177196473739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125781122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014272222,0.00004384259,0.99791616,0.000071738854,0.000010804475,0.000014245812,0.000011940682,0.000111951485,0.00039219653],"genre_scores_gemma":[0.14127053,0.0002453207,0.85535294,0.00016426649,0.000066432985,0.00027937608,0.0001963629,0.00022511248,0.0021996142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687433,0.0015994479,0.00013470609,0.00033504466,0.0008340928,0.00022230344],"domain_scores_gemma":[0.9887605,0.008674226,0.00048178036,0.00092760834,0.0009007201,0.00025524586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056371754,0.00089594297,0.0013326114,0.0012732064,0.00085417106,0.0020394179,0.0027098777,0.002437302,0.0037343183],"category_scores_gemma":[0.025108619,0.00081371743,0.0012649659,0.0015107939,0.001743607,0.0032050828,0.0031209488,0.004161898,0.0012026901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343681,0.000056079847,0.0007538682,0.000103108054,0.0000420733,0.00009071995,0.00017900424,0.67209625,0.0010374995,0.27309355,0.0014649888,0.050979428],"study_design_scores_gemma":[0.000005343663,0.000005848366,0.000017103766,0.0000070730553,0.0000023148864,0.000009907834,0.00000464122,0.96496457,0.0001324721,0.03439314,0.00045375046,0.0000037464574],"about_ca_topic_score_codex":0.0041328967,"about_ca_topic_score_gemma":0.0038258648,"teacher_disagreement_score":0.0056371754,"about_ca_system_score_codex":0.0022875844,"about_ca_system_score_gemma":0.0020538012,"threshold_uncertainty_score":0.029812574},"labels":[],"label_agreement":null},{"id":"W2126518975","doi":"10.1017/s1446181108000114","title":"COMPUTABLE STRONGLY ERGODIC RATES OF CONVERGENCE FOR CONTINUOUS-TIME MARKOV CHAINS","year":2008,"lang":"en","type":"article","venue":"The ANZIAM Journal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China","keywords":"Ergodic theory; Markov chain; Mathematics; Stationary distribution; Monotone polygon; Hitting time; Stationary ergodic process; Markov process; Rate of convergence; Markov chain mixing time; Continuous-time Markov chain; Applied mathematics; Markov property; Markov model; Discrete mathematics; Computer science; Mathematical analysis; Statistics; Invariant measure","score_opus":0.08440882997900719,"score_gpt":0.34835826973149553,"score_spread":0.26394943975248836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126518975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14580344,0.001780977,0.8362416,0.0018262293,0.00014283658,0.00013316322,0.0001998561,0.000697585,0.013174274],"genre_scores_gemma":[0.9253322,0.0010556146,0.06770202,0.00036194196,0.0002340658,0.00037976148,0.00024253354,0.00037868985,0.0043131285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99148655,0.004057709,0.00042301542,0.0011347415,0.0019447447,0.00095316896],"domain_scores_gemma":[0.8288072,0.14668827,0.0062521407,0.0063536717,0.0076580043,0.004240692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020057112,0.0022380892,0.0028831407,0.0043522352,0.0019406289,0.0055207,0.003824298,0.0025949639,0.004744076],"category_scores_gemma":[0.117327176,0.0011402994,0.0025459055,0.0017862958,0.007825079,0.008713579,0.00512877,0.007484197,0.0006247325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002325463,0.0000877001,0.0017680193,0.00020536117,0.00009692705,0.00020448021,0.00039225892,0.17769848,0.0023533406,0.80868214,0.0007495584,0.007529149],"study_design_scores_gemma":[0.00002815093,0.00006107142,0.00036419468,0.00007527949,0.000028059372,0.00007372952,0.000045666984,0.7271569,0.0021957448,0.26929614,0.00063464063,0.00004047453],"about_ca_topic_score_codex":0.0020377773,"about_ca_topic_score_gemma":0.0014380648,"teacher_disagreement_score":0.020057112,"about_ca_system_score_codex":0.0067798677,"about_ca_system_score_gemma":0.0035116554,"threshold_uncertainty_score":0.10607344},"labels":[],"label_agreement":null},{"id":"W2128286686","doi":"10.1137/s105262340343470x","title":"Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; Nuffield Foundation; City University of Hong Kong","keywords":"Mathematics; Conic section; Combinatorics; Moment (physics); Distribution (mathematics); Gaussian; Upper and lower bounds; Second moment of area; Mathematical analysis; Geometry; Physics","score_opus":0.03820894580035558,"score_gpt":0.36075720784139065,"score_spread":0.32254826204103504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128286686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058639865,0.0013860074,0.92707014,0.0013428726,0.000099989826,0.000112346446,0.00028818595,0.0007130341,0.010347482],"genre_scores_gemma":[0.88623875,0.0024896218,0.0950172,0.0007912103,0.0004653706,0.0007450841,0.0009536007,0.0008472135,0.012451826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978124,0.00059421075,0.000081244194,0.0003967787,0.0007356855,0.0003795959],"domain_scores_gemma":[0.93913645,0.04492926,0.006119644,0.003671469,0.004538714,0.001604526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062525044,0.0015489756,0.0014528822,0.002897464,0.0012816149,0.0024343599,0.0022627574,0.001824137,0.009598839],"category_scores_gemma":[0.062665716,0.00091505476,0.0009600958,0.0015281251,0.0043103574,0.0072970553,0.002336126,0.005086727,0.0013217448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035294273,0.0001568235,0.0038961922,0.00043208653,0.00007961933,0.0002514934,0.0006356584,0.2967748,0.009952749,0.6596459,0.0050497013,0.022772066],"study_design_scores_gemma":[0.000015208915,0.00005930587,0.0009039397,0.00008073755,0.000018881701,0.00010881036,0.00006075275,0.898529,0.003039649,0.09589197,0.0012322789,0.00005952118],"about_ca_topic_score_codex":0.0021273345,"about_ca_topic_score_gemma":0.0016169955,"teacher_disagreement_score":0.009598839,"about_ca_system_score_codex":0.003574744,"about_ca_system_score_gemma":0.0018731101,"threshold_uncertainty_score":0.03306675},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.061895689959410645,"score_gpt":0.3586947562524259,"score_spread":0.2967990662930153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128598176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025179455,0.0011148026,0.9603215,0.0007821882,0.00010795267,0.000070134156,0.0001747912,0.00011599959,0.012133141],"genre_scores_gemma":[0.7115876,0.003687825,0.26853573,0.0008151939,0.00039589626,0.0005797827,0.0007991705,0.00019733641,0.013401501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975229,0.0009020409,0.00015333985,0.00053641817,0.0005362964,0.00034891852],"domain_scores_gemma":[0.98895615,0.006820348,0.0012630261,0.00092076097,0.0014578854,0.0005818695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039180135,0.0011826482,0.0007825091,0.0020120898,0.001192346,0.0023271479,0.0013459001,0.0014588604,0.004168684],"category_scores_gemma":[0.014018982,0.0006193645,0.0010329826,0.0018153145,0.0044795577,0.0037128383,0.0032868986,0.0045064543,0.0005766104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013954162,0.0000132376035,0.0003749871,0.000029485851,0.000012413528,0.00006196208,0.00017429244,0.018909944,0.00058264047,0.9761223,0.00031231946,0.0033924694],"study_design_scores_gemma":[0.000011688895,0.000028566232,0.00033134918,0.00005223643,0.00001455803,0.000077856406,0.00006549624,0.116195686,0.0010588283,0.87609154,0.0060501634,0.000022061966],"about_ca_topic_score_codex":0.0027468253,"about_ca_topic_score_gemma":0.0013941447,"teacher_disagreement_score":0.004168684,"about_ca_system_score_codex":0.0020391315,"about_ca_system_score_gemma":0.0015946606,"threshold_uncertainty_score":0.02072066},"labels":[],"label_agreement":null},{"id":"W2137218177","doi":"10.1109/cdc.2014.7040041","title":"Poisson's Equation in Nonlinear Filtering","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Divergence (linguistics); Gradient descent; Nonlinear system; Mathematics; Filter (signal processing); Nonlinear filter; Applied mathematics; Balanced flow; Kullback–Leibler divergence; Particle filter; Space (punctuation); Minification; Mathematical optimization; Mathematical analysis; Filter design; Computer science; Kalman filter; Artificial neural network; Physics; Statistics","score_opus":0.1603307097872285,"score_gpt":0.3956732700174821,"score_spread":0.2353425602302536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137218177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020936545,0.0063784686,0.912371,0.0056510717,0.0010932831,0.000099731275,0.0006422138,0.0002080742,0.052619573],"genre_scores_gemma":[0.70212287,0.011079623,0.15362388,0.0030536116,0.0022212043,0.00064980774,0.000996093,0.00032734987,0.1259256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993691,0.00016936082,0.000030812553,0.0001258068,0.00024008114,0.00006486436],"domain_scores_gemma":[0.9991079,0.0004846212,0.00010276651,0.0000444058,0.00020083955,0.00005950682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608693,0.00060839014,0.0011528927,0.0009506163,0.0005811141,0.001425687,0.0010693193,0.0024098791,0.0040350985],"category_scores_gemma":[0.0042220987,0.0004229356,0.00094186456,0.00094036077,0.0016754079,0.0017246052,0.0014206615,0.001705233,0.0007171158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001417981,0.000011055038,0.0003738379,0.00008911172,0.000019886966,0.00012825726,0.00013506997,0.0726947,0.0011299881,0.9154062,0.0033513012,0.006646432],"study_design_scores_gemma":[0.00001574863,0.0000114545865,0.00033167697,0.000024763793,0.000009562992,0.00009356753,0.00003382037,0.5567499,0.00025015528,0.43483576,0.007617582,0.00002609593],"about_ca_topic_score_codex":0.01107905,"about_ca_topic_score_gemma":0.0048240344,"teacher_disagreement_score":0.01107905,"about_ca_system_score_codex":0.0021744093,"about_ca_system_score_gemma":0.0011834984,"threshold_uncertainty_score":0.022029102},"labels":[],"label_agreement":null},{"id":"W2139757085","doi":"10.48550/arxiv.1205.2643","title":"New inference strategies for solving Markov Decision Processes using reversible jump MCMC","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Markov chain Monte Carlo; Parameterized complexity; Computer science; Inference; Markov decision process; Reversible-jump Markov chain Monte Carlo; Markov chain; Jump; Sample (material); Order (exchange); Mathematical optimization; Markov process; Artificial intelligence; Machine learning; Algorithm; Mathematics; Bayesian probability; Statistics; Economics","score_opus":0.2767804058753422,"score_gpt":0.31301531364953294,"score_spread":0.03623490777419075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139757085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008258271,0.000089610796,0.998408,0.000096241834,0.000015448482,0.00001957264,0.000019618237,0.00008126107,0.00044442777],"genre_scores_gemma":[0.10015785,0.0005541308,0.89591795,0.000228461,0.00014388545,0.00037796175,0.00020103896,0.0002594227,0.0021593957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977192,0.0010826023,0.00012752043,0.00040352976,0.00056376203,0.000103315484],"domain_scores_gemma":[0.99008185,0.008416127,0.00044835143,0.00045623354,0.00042393917,0.00017348191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051412573,0.0012364468,0.0014771165,0.0013786409,0.00077698426,0.0015770857,0.003481761,0.0018879637,0.004992179],"category_scores_gemma":[0.020379746,0.0011347546,0.0014546105,0.0011360234,0.0019915549,0.0030442914,0.0023593835,0.004334925,0.0007431754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004722506,0.000092322356,0.00056873134,0.00018342832,0.00011434337,0.0001185533,0.00016212615,0.6470878,0.0011589822,0.29041278,0.001263304,0.05879043],"study_design_scores_gemma":[0.00001664888,0.000008513104,0.00003996115,0.000014735413,0.000009524955,0.000012355372,0.000005673666,0.93976676,0.00031893398,0.058926005,0.0008698315,0.000011134357],"about_ca_topic_score_codex":0.004742352,"about_ca_topic_score_gemma":0.0059968014,"teacher_disagreement_score":0.0051412573,"about_ca_system_score_codex":0.0015900695,"about_ca_system_score_gemma":0.0022334005,"threshold_uncertainty_score":0.02718991},"labels":[],"label_agreement":null},{"id":"W2139831589","doi":"10.1239/aap/1401369701","title":"Convergence of Conditional Metropolis-Hastings Samplers","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Metropolis–Hastings algorithm; Markov chain Monte Carlo; Mathematics; Gibbs sampling; Markov chain; Convergence (economics); Bayesian probability; Ergodic theory; Algorithm; Statistics; Mathematical analysis","score_opus":0.044681408336678184,"score_gpt":0.3493056804692662,"score_spread":0.304624272132588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139831589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059358235,0.0003240202,0.99154973,0.00018821078,0.000042139363,0.000054945263,0.000061240185,0.00020392888,0.0016399722],"genre_scores_gemma":[0.4245325,0.001307761,0.5651277,0.0003475415,0.0002980607,0.0007751375,0.0006388762,0.00048399434,0.0064884857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935482,0.0035903133,0.00027325738,0.00091487565,0.0012737047,0.00039966626],"domain_scores_gemma":[0.95304894,0.03989776,0.0013275612,0.0021458992,0.0028319955,0.0007478732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0141487485,0.0013762016,0.0020946127,0.0023791704,0.001267539,0.002512853,0.0036841615,0.0019445061,0.007061438],"category_scores_gemma":[0.06732424,0.0012503136,0.0018296682,0.0018590948,0.004529859,0.004546524,0.0037992478,0.0040627318,0.0011651437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658411,0.000059188624,0.0017552128,0.00017216192,0.000107657404,0.00010753202,0.00021207868,0.30454794,0.0008519663,0.6682728,0.0013053128,0.022481535],"study_design_scores_gemma":[0.000019894056,0.000018735205,0.00013461371,0.000032259075,0.000013616068,0.000028367718,0.000011732234,0.86400616,0.0004674045,0.1343512,0.000897551,0.000018459823],"about_ca_topic_score_codex":0.0064344737,"about_ca_topic_score_gemma":0.0059853154,"teacher_disagreement_score":0.0141487485,"about_ca_system_score_codex":0.0025925867,"about_ca_system_score_gemma":0.0031572222,"threshold_uncertainty_score":0.0748266},"labels":[],"label_agreement":null},{"id":"W2145324741","doi":"10.1017/s0269964804184040","title":"MONOTONICITY IN LAG FOR NONMONOTONE MARKOV CHAINS","year":2004,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Markov chain; Monotonic function; Monotone polygon; Mathematics; Markov property; Property (philosophy); Applied mathematics; Function (biology); Markov chain mixing time; Chain (unit); Examples of Markov chains; Markov process; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Markov model; Statistics; Mathematical analysis; Physics","score_opus":0.05515545292777608,"score_gpt":0.32198993564073974,"score_spread":0.26683448271296367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145324741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516376,0.0015672029,0.7217971,0.0011344035,0.00011245074,0.00012768796,0.00062954327,0.0002491968,0.022744833],"genre_scores_gemma":[0.9491346,0.0011357296,0.041804936,0.000393775,0.0001953595,0.00021695506,0.0004384716,0.000100559766,0.0065796147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983109,0.00049535546,0.00010898018,0.00044947577,0.00035297795,0.00028222566],"domain_scores_gemma":[0.9826172,0.012669625,0.0018272004,0.0010967363,0.0010941961,0.0006950082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017663,0.0005716959,0.0009505353,0.0009949896,0.0007944832,0.0020141609,0.0011242802,0.0009744606,0.0057937694],"category_scores_gemma":[0.019764362,0.00042341807,0.00082666206,0.0007378957,0.0024810445,0.0049855257,0.0014185895,0.0021189968,0.0005391057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088627035,0.000038078844,0.003457589,0.00013430278,0.000026046462,0.00028275582,0.00028800507,0.018834865,0.0029704394,0.9652633,0.00063907204,0.007977009],"study_design_scores_gemma":[0.00002999416,0.00006514897,0.0018149818,0.00005278018,0.000016983135,0.00037367907,0.00008625216,0.27631906,0.0015757356,0.7167619,0.0028724754,0.000031105876],"about_ca_topic_score_codex":0.0011779122,"about_ca_topic_score_gemma":0.0014925437,"teacher_disagreement_score":0.0057937694,"about_ca_system_score_codex":0.0011268981,"about_ca_system_score_gemma":0.0010901183,"threshold_uncertainty_score":0.021247685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025396995124400443,"score_gpt":0.334028828772443,"score_spread":0.30863183364804253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146960149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012461797,0.0007893984,0.97903514,0.0006184093,0.0002291178,0.0000876635,0.00007149792,0.0005270777,0.0061798007],"genre_scores_gemma":[0.47284228,0.001614899,0.51307595,0.00083512306,0.0006704575,0.0008148266,0.00042653183,0.0017861604,0.007933748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942555,0.0034542975,0.0002495206,0.0005217446,0.0011677945,0.00035111487],"domain_scores_gemma":[0.9713859,0.020605363,0.00092086074,0.0032847815,0.0026288854,0.0011742138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010843302,0.0018077708,0.0037215583,0.0028338418,0.0017590801,0.0034202829,0.004266121,0.0027427673,0.0063416795],"category_scores_gemma":[0.05847458,0.002238675,0.001694885,0.001889876,0.0048430557,0.0062700366,0.0067671617,0.005121316,0.0012122234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014878214,0.00014201942,0.00065887923,0.00020500453,0.00008081056,0.000067860594,0.00019060184,0.32929856,0.001011283,0.6449445,0.002924315,0.020327417],"study_design_scores_gemma":[0.0000086348045,0.000007066595,0.000039585513,0.000015373867,0.000005941387,0.000005260104,0.000008256764,0.8633922,0.00013502869,0.1358809,0.00049304875,0.000008713963],"about_ca_topic_score_codex":0.006374404,"about_ca_topic_score_gemma":0.0053911703,"teacher_disagreement_score":0.010843302,"about_ca_system_score_codex":0.0033704753,"about_ca_system_score_gemma":0.0036103756,"threshold_uncertainty_score":0.05734557},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05701441502884771,"score_gpt":0.3422949579532089,"score_spread":0.2852805429243612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152650468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013242409,0.00071177824,0.9805695,0.00063308567,0.000053501277,0.000023161008,0.00006883906,0.000093488525,0.004604314],"genre_scores_gemma":[0.67916214,0.0031444156,0.3090352,0.0007250159,0.0004964003,0.0002458812,0.00022855797,0.0003219467,0.006640433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681467,0.001193124,0.00014988836,0.0005932827,0.00090227777,0.0003468808],"domain_scores_gemma":[0.9850662,0.0116541535,0.0012409054,0.0006722491,0.0009682613,0.0003981769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007310138,0.00094686635,0.001452912,0.0018873743,0.0011745838,0.0021618046,0.0022970398,0.001713062,0.00600786],"category_scores_gemma":[0.023391038,0.0008218791,0.0015116113,0.0021055408,0.0041096755,0.0054391823,0.0029861364,0.0039929114,0.0006318312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002601992,0.000018876226,0.00041399524,0.00006162172,0.00003775305,0.000037592523,0.00006995747,0.10509305,0.0005529146,0.88493603,0.00056071195,0.008191378],"study_design_scores_gemma":[0.0000065002628,0.00002368254,0.000236078,0.00003197663,0.000014320704,0.000031262294,0.000010321694,0.30550984,0.0003598246,0.69284534,0.0009093358,0.000021431477],"about_ca_topic_score_codex":0.0024618113,"about_ca_topic_score_gemma":0.0021092761,"teacher_disagreement_score":0.007310138,"about_ca_system_score_codex":0.0032578474,"about_ca_system_score_gemma":0.0018209863,"threshold_uncertainty_score":0.03866017},"labels":[],"label_agreement":null},{"id":"W2152980722","doi":"10.1145/2414416.2414790","title":"Self-Avoiding Random Dynamics on Integer Complex Systems","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; D-Wave Systems (Canada)","funders":"","keywords":"Ising model; Computer science; Gibbs sampling; Monte Carlo algorithm; Monte Carlo method; Statistical physics; Algorithm; State space; Sampling (signal processing); Theoretical computer science; Mathematics; Bayesian probability; Artificial intelligence; Physics","score_opus":0.0834318275074199,"score_gpt":0.3251388237474979,"score_spread":0.24170699624007802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152980722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12749648,0.00020059822,0.867327,0.000257488,0.000028112794,0.00004947472,0.00004008102,0.0002749124,0.0043257917],"genre_scores_gemma":[0.7783745,0.00020259623,0.21827136,0.00012510849,0.000023920153,0.00014607886,0.0000952597,0.00013168562,0.0026294473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995265,0.00022502236,0.00002269905,0.00006943273,0.00011534622,0.000040917486],"domain_scores_gemma":[0.99893945,0.0006504373,0.000114264825,0.00013734512,0.00007459794,0.00008388159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009326058,0.0003060519,0.00048385226,0.00047759796,0.00040057788,0.0008833315,0.0007082901,0.0006404842,0.0016854247],"category_scores_gemma":[0.0036606446,0.0003122018,0.00038840197,0.00029595033,0.00117972,0.0013678826,0.000910639,0.000882643,0.00024541953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007401634,0.000050267,0.00084037235,0.00005182042,0.000020859377,0.000113834314,0.00013627873,0.51966625,0.0049720574,0.457276,0.00061984616,0.01617837],"study_design_scores_gemma":[0.00000874105,0.0000073103533,0.000047548678,0.0000028593379,0.0000012569807,0.000014274756,0.000004716949,0.9597673,0.00046586755,0.03931815,0.00035778302,0.0000041882017],"about_ca_topic_score_codex":0.0011078392,"about_ca_topic_score_gemma":0.0009634147,"teacher_disagreement_score":0.0016854247,"about_ca_system_score_codex":0.00078862655,"about_ca_system_score_gemma":0.00048098923,"threshold_uncertainty_score":0.0057219267},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1757608270161161,"score_gpt":0.43261363365051825,"score_spread":0.25685280663440213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153811005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12907863,0.0020871724,0.8196063,0.0031595652,0.00031992287,0.00019108279,0.00013574671,0.0012099872,0.044211674],"genre_scores_gemma":[0.91561335,0.0009574697,0.07264598,0.0006539191,0.00036583858,0.000714917,0.00017354601,0.00071160437,0.008163328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965539,0.0016423241,0.00019072389,0.0004347387,0.00083151984,0.0003468645],"domain_scores_gemma":[0.95269054,0.035942916,0.002412526,0.003585156,0.003472328,0.00189657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00917729,0.00069716584,0.0012764679,0.0017864396,0.0019215443,0.0035447343,0.0023201515,0.0017255379,0.008131994],"category_scores_gemma":[0.08022448,0.00064948277,0.0013298398,0.0009402247,0.00505923,0.0066509284,0.003040998,0.0041638114,0.0011358524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057323927,0.000045645556,0.00050975545,0.00007309243,0.000019909354,0.00008844277,0.00021527175,0.025144385,0.0008101037,0.96647334,0.001531601,0.005031164],"study_design_scores_gemma":[0.000030585186,0.00004772227,0.00031541006,0.000056826815,0.000014851428,0.00005221689,0.00006518582,0.38245276,0.0009873443,0.6142119,0.0017364422,0.00002869253],"about_ca_topic_score_codex":0.0017717304,"about_ca_topic_score_gemma":0.00089299545,"teacher_disagreement_score":0.00917729,"about_ca_system_score_codex":0.0023984532,"about_ca_system_score_gemma":0.001416937,"threshold_uncertainty_score":0.04853469},"labels":[],"label_agreement":null},{"id":"W2157933827","doi":"10.7551/mitpress/7503.003.0030","title":"Conditional mean field","year":2007,"lang":"en","type":"article","venue":"The MIT Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Belief propagation; USable; Approximate inference; Product (mathematics); Applied mathematics; Graphical model; Probabilistic logic; Inference; Monte Carlo method; Set (abstract data type); Mean field theory; Mathematical optimization; Computer science; Field (mathematics); Mathematics; Ising model; Algorithm; Statistical physics; Artificial intelligence; Statistics; Physics","score_opus":0.11322784579097067,"score_gpt":0.3708950790139609,"score_spread":0.25766723322299023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157933827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029360168,0.00030371748,0.99295956,0.00042433792,0.00006343284,0.00002449197,0.000122055164,0.00018302043,0.0029833615],"genre_scores_gemma":[0.36623952,0.0015986884,0.612095,0.00085285254,0.00041453575,0.00039923112,0.0008308797,0.00038691488,0.01718228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848086,0.0006582787,0.000053726806,0.0003270459,0.00036674648,0.00011345062],"domain_scores_gemma":[0.9954282,0.0031901302,0.00023062101,0.0005482116,0.00045404804,0.00014890665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032325813,0.00087034504,0.0014001156,0.0011632683,0.00072148023,0.0014313156,0.0025881715,0.0019172435,0.005946924],"category_scores_gemma":[0.011648009,0.00058121874,0.0012090466,0.0012760716,0.0020548904,0.0031044467,0.0016957611,0.002691242,0.0012104927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068630216,0.000037454465,0.0004568753,0.00013616818,0.00007544509,0.00005058728,0.00008767598,0.29525757,0.0010206508,0.6570049,0.0044510146,0.041353103],"study_design_scores_gemma":[0.000010116273,0.000014732796,0.00008907428,0.000016171309,0.00001220742,0.00002637625,0.0000064626197,0.78693455,0.0004084081,0.21022576,0.0022399735,0.000016204469],"about_ca_topic_score_codex":0.0048603825,"about_ca_topic_score_gemma":0.0038004192,"teacher_disagreement_score":0.005946924,"about_ca_system_score_codex":0.00170588,"about_ca_system_score_gemma":0.0018611772,"threshold_uncertainty_score":0.01989448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07906550605768099,"score_gpt":0.41141425082771976,"score_spread":0.3323487447700388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160639001","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0594651,0.0036217754,0.8964708,0.0038671694,0.00051145797,0.00018828402,0.000550102,0.0005940818,0.034731165],"genre_scores_gemma":[0.8685822,0.005279382,0.10312656,0.0023894939,0.0021806601,0.0011450538,0.0010757317,0.0011048106,0.015116121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99281186,0.0032833712,0.00040882366,0.0010391884,0.0015284165,0.00092839485],"domain_scores_gemma":[0.840564,0.1333043,0.0069650677,0.004363224,0.011577176,0.003226162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019413423,0.0015463643,0.0028722768,0.005415138,0.002019552,0.005025232,0.004078837,0.0034000166,0.014316426],"category_scores_gemma":[0.12468792,0.0012722695,0.00243872,0.0032503726,0.006602204,0.009531557,0.00481236,0.007569163,0.0016755747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004174808,0.00003364613,0.0004755785,0.000119321834,0.000029656552,0.00018526049,0.00016502617,0.013323812,0.00061134127,0.9803979,0.001328882,0.0032878695],"study_design_scores_gemma":[0.000032902317,0.000032575015,0.00032553592,0.00012829293,0.000016642929,0.00013812342,0.00007805052,0.14961691,0.0004740096,0.8480245,0.0010830659,0.000049480343],"about_ca_topic_score_codex":0.0018059526,"about_ca_topic_score_gemma":0.0014467604,"teacher_disagreement_score":0.019413423,"about_ca_system_score_codex":0.0032499076,"about_ca_system_score_gemma":0.0027624562,"threshold_uncertainty_score":0.10266924},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03818152078787884,"score_gpt":0.33171437632028944,"score_spread":0.2935328555324106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162340617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016550843,0.0002776636,0.9796666,0.00024104124,0.000059142014,0.000082423125,0.00007877916,0.00068039366,0.002363029],"genre_scores_gemma":[0.32954606,0.00024854235,0.6646644,0.00025118302,0.00009181853,0.0002640177,0.0003570412,0.00042256832,0.0041544572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868315,0.00064436573,0.000044324235,0.0003053403,0.00024327768,0.00007966054],"domain_scores_gemma":[0.99456906,0.003167807,0.00027798594,0.0011633473,0.0006442563,0.00017748716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003695254,0.00062672375,0.0011259768,0.00083999924,0.0008075682,0.0010833524,0.002686438,0.0012280863,0.004461195],"category_scores_gemma":[0.016321339,0.0006238932,0.0007064096,0.0010394161,0.001223316,0.00192794,0.0018171639,0.00198809,0.0009446613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024540344,0.0001014904,0.0026264421,0.00007625726,0.0001209672,0.00007677865,0.00015161619,0.7839401,0.00074569986,0.075815015,0.0032136324,0.1328866],"study_design_scores_gemma":[0.000011688395,0.000006338014,0.00008639668,0.0000034131237,0.0000052112264,0.000008888085,0.00000531772,0.98532724,0.00020064224,0.013906203,0.0004331837,0.0000055554533],"about_ca_topic_score_codex":0.0134863695,"about_ca_topic_score_gemma":0.019555222,"teacher_disagreement_score":0.0134863695,"about_ca_system_score_codex":0.0012606472,"about_ca_system_score_gemma":0.0017973258,"threshold_uncertainty_score":0.026815712},"labels":[],"label_agreement":null},{"id":"W2162567282","doi":"10.1109/isit.2006.261683","title":"Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)","year":2006,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Entropy (arrow of time); Radius of convergence; Mathematics; Taylor series; Maximum-entropy Markov model; Applied mathematics; Markov process; Rate of convergence; Statistical physics; Hidden Markov model; Entropy rate; Convergence (economics); Markov property; Pure mathematics; Markov model; Binary entropy function; Principle of maximum entropy; Computer science; Mathematical analysis; Physics; Statistics; Artificial intelligence; Thermodynamics","score_opus":0.031414168249249766,"score_gpt":0.31131744106185283,"score_spread":0.2799032728126031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162567282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15202677,0.0010919159,0.82765377,0.0012299609,0.00013411307,0.00008544166,0.0002698154,0.00033963224,0.017168576],"genre_scores_gemma":[0.9361492,0.0010207408,0.057633344,0.00033247875,0.00020582054,0.00021021893,0.00022562535,0.0002135245,0.0040091705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.0005088246,0.000084307525,0.00017361288,0.00024228213,0.00016385657],"domain_scores_gemma":[0.9897995,0.0067472905,0.0010921753,0.0008205087,0.0010023052,0.00053825614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034050324,0.0008089804,0.000823722,0.0014815603,0.0006595455,0.0014798357,0.0009854311,0.0010023768,0.004714454],"category_scores_gemma":[0.019638307,0.00040366894,0.001637981,0.0004168222,0.0023963158,0.0030265597,0.0019350924,0.0021466957,0.000564612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003359579,0.000010842273,0.0005247247,0.000085525826,0.000018342764,0.00018091043,0.000271168,0.019681536,0.0030254542,0.97265977,0.00083106256,0.0026770367],"study_design_scores_gemma":[0.000015553156,0.00003416691,0.0004283979,0.00006360765,0.000018660121,0.00023186859,0.00007008181,0.36030853,0.0018949459,0.6350487,0.001857164,0.000028351984],"about_ca_topic_score_codex":0.0007574564,"about_ca_topic_score_gemma":0.00025924895,"teacher_disagreement_score":0.004714454,"about_ca_system_score_codex":0.0012009545,"about_ca_system_score_gemma":0.00069793203,"threshold_uncertainty_score":0.018007755},"labels":[],"label_agreement":null},{"id":"W2164968235","doi":"","title":"Regularized Greedy Importance Sampling","year":2002,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Minimum-variance unbiased estimator; Sampling (signal processing); Greedy algorithm; Mathematical optimization; Markov chain Monte Carlo; Importance sampling; Variance (accounting); Mathematics; Computer science; Bias of an estimator; Algorithm; Statistics; Monte Carlo method","score_opus":0.26843066026817813,"score_gpt":0.3778559020172681,"score_spread":0.10942524174908996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164968235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003697917,0.000116915464,0.9950035,0.000059434933,0.000027747963,0.000055512155,0.000036000358,0.00017274603,0.00083015766],"genre_scores_gemma":[0.33125225,0.0003537517,0.6630737,0.00035859042,0.00018363497,0.00052126433,0.0005094666,0.00017957209,0.0035678016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704736,0.0015209485,0.00009734296,0.00037854523,0.00073446904,0.00022140634],"domain_scores_gemma":[0.9952283,0.0029644223,0.0002863373,0.00068971136,0.0006890599,0.00014228343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033598647,0.00082658086,0.0015583007,0.00096089975,0.00048915466,0.0010474924,0.0016323172,0.0010044269,0.0022888125],"category_scores_gemma":[0.013739238,0.0005783392,0.0006612218,0.0009805729,0.0012499666,0.0011438401,0.001635669,0.0011194678,0.0006083307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039865638,0.00014971329,0.002309191,0.00028281967,0.00022830586,0.0002176377,0.00013271201,0.6240075,0.0053417445,0.1650798,0.008087506,0.19376436],"study_design_scores_gemma":[0.000035628596,0.000036414247,0.00014920074,0.000012847363,0.00001620734,0.000044038305,0.0000073751226,0.9657236,0.000978768,0.031417303,0.001570276,0.000008460742],"about_ca_topic_score_codex":0.0019877562,"about_ca_topic_score_gemma":0.002536975,"teacher_disagreement_score":0.0033598647,"about_ca_system_score_codex":0.0008325113,"about_ca_system_score_gemma":0.0017162217,"threshold_uncertainty_score":0.01776892},"labels":[],"label_agreement":null},{"id":"W2168123988","doi":"10.1142/s0219025703001316","title":"THE LAW OF LARGE NUMBERS AND THE LAW OF THE ITERATED LOGARITHM FOR INFINITE DIMENSIONAL INTERACTING DIFFUSION PROCESSES","year":2003,"lang":"en","type":"article","venue":"Infinite Dimensional Analysis Quantum Probability and Related Topics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dirichlet form; Mathematics; Law of the iterated logarithm; Iterated logarithm; Law of large numbers; Logarithm; Dirichlet process; Dirichlet distribution; Statistical physics; Markov process; Markov chain; Measure (data warehouse); Diffusion; Law; Mathematical analysis; Random variable; Physics; Computer science; Statistics","score_opus":0.026395939056512777,"score_gpt":0.3012819865083622,"score_spread":0.2748860474518494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168123988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31095058,0.004430677,0.6377,0.004601188,0.00022262159,0.000060216124,0.00014747867,0.0002462775,0.041640952],"genre_scores_gemma":[0.9586481,0.0014175554,0.0333898,0.00027131825,0.00031707375,0.00014649006,0.00010043564,0.000069670925,0.0056394446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986237,0.0006244332,0.000063747975,0.00015414442,0.00040335942,0.00013066606],"domain_scores_gemma":[0.9931946,0.0047729174,0.000731257,0.00041409233,0.00041745816,0.0004697475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045031,0.0005396285,0.00094632513,0.0014635163,0.001190495,0.0030390555,0.0013278327,0.0015889723,0.0021729118],"category_scores_gemma":[0.017722879,0.00039971902,0.00087607355,0.0008170654,0.00558732,0.0038858089,0.0017895518,0.0023152826,0.0003010563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009069776,0.000007702353,0.00024589174,0.000017650244,0.0000065445374,0.000067185385,0.00010650023,0.0052645872,0.00028261213,0.99266124,0.00022584554,0.0011051442],"study_design_scores_gemma":[0.000009925426,0.0000087460685,0.0002535597,0.00001663701,0.0000045304655,0.000074321804,0.000024470453,0.0882734,0.0001503349,0.910571,0.00059891987,0.00001412335],"about_ca_topic_score_codex":0.001293692,"about_ca_topic_score_gemma":0.0007232336,"teacher_disagreement_score":0.003045031,"about_ca_system_score_codex":0.0018413389,"about_ca_system_score_gemma":0.0009076967,"threshold_uncertainty_score":0.016103864},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04046938814774089,"score_gpt":0.3395489419876489,"score_spread":0.29907955383990803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168173277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029423116,0.00004323458,0.99496895,0.00011891171,0.000018549354,0.000042485164,0.000029909272,0.00021970469,0.0016159236],"genre_scores_gemma":[0.17224123,0.0002243512,0.8216298,0.0003823242,0.00012334756,0.00031724095,0.0002273784,0.00026352695,0.004590862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965127,0.0014913863,0.00018125262,0.0004694478,0.0010718362,0.00027333063],"domain_scores_gemma":[0.98976314,0.0060168803,0.00044490575,0.0023513774,0.0010915062,0.00033214918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007727746,0.00067453564,0.0013227339,0.001418052,0.00086837227,0.0016894323,0.0029660591,0.0018221751,0.0048698382],"category_scores_gemma":[0.028174646,0.00065129774,0.0014133777,0.001373836,0.0023946124,0.0031888993,0.004807571,0.002711489,0.0010775359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002469296,0.00010398256,0.0013998348,0.00014345007,0.0000740508,0.00019173422,0.000305658,0.17628953,0.00223692,0.6427599,0.003929606,0.17231853],"study_design_scores_gemma":[0.00004367485,0.000061001174,0.00015497595,0.000021496395,0.000015457439,0.00011469289,0.00001859464,0.78101885,0.0013827968,0.21154653,0.0055970354,0.00002488724],"about_ca_topic_score_codex":0.0017969718,"about_ca_topic_score_gemma":0.0016365172,"teacher_disagreement_score":0.007727746,"about_ca_system_score_codex":0.0010515703,"about_ca_system_score_gemma":0.0020141131,"threshold_uncertainty_score":0.0408687},"labels":[],"label_agreement":null},{"id":"W2169354347","doi":"10.1214/105051606000000024","title":"Learning nonsingular phylogenies and hidden Markov models","year":2006,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Emerging Frontiers; Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Hidden Markov model; Invertible matrix; Markov chain; Bounded function; Markov model; Maximum-entropy Markov model; Variable-order Markov model; Markov process","score_opus":0.11793291077157779,"score_gpt":0.3360329304513031,"score_spread":0.2181000196797253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169354347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06827687,0.0006281265,0.92814714,0.0013240823,0.000038958617,0.000026202817,0.00014148421,0.00027355878,0.0011435052],"genre_scores_gemma":[0.8375293,0.0010470098,0.15687396,0.0003715278,0.00029869986,0.00009374578,0.00071421993,0.00012753365,0.002944013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972651,0.0012250762,0.00010997883,0.0008183809,0.0003797316,0.00020181495],"domain_scores_gemma":[0.9640808,0.03127316,0.0019316251,0.0014978333,0.0006860989,0.0005305178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004800725,0.0007985591,0.0014172271,0.00094766193,0.0008850178,0.0017298771,0.0015958871,0.0022032985,0.0017834548],"category_scores_gemma":[0.029440505,0.00079667754,0.00074177835,0.00093092973,0.0035119387,0.00616848,0.0024189823,0.0036720084,0.00034317386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021457452,0.000119452176,0.0030970643,0.00022708804,0.00008732567,0.00031981178,0.0003076471,0.5769339,0.0014164163,0.37769112,0.0013654486,0.038220137],"study_design_scores_gemma":[0.000010533809,0.000017375613,0.00014377708,0.000007346633,0.0000054427883,0.000026161364,0.000016270844,0.6426328,0.00032846985,0.35649878,0.00030465983,0.0000083409905],"about_ca_topic_score_codex":0.0021942474,"about_ca_topic_score_gemma":0.0017076455,"teacher_disagreement_score":0.004800725,"about_ca_system_score_codex":0.0013886198,"about_ca_system_score_gemma":0.0013195197,"threshold_uncertainty_score":0.025388956},"labels":[],"label_agreement":null},{"id":"W2184070031","doi":"","title":"Comparison of Disjoint Decomposition Theorems for Metropolis Algorithms onR.","year":2006,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Disjoint sets; Decomposition; Markov chain; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Statistics","score_opus":0.09943261300254634,"score_gpt":0.4707577356878502,"score_spread":0.3713251226853038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184070031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056111133,0.0030462712,0.97865915,0.00059691723,0.0002481921,0.00015190413,0.00016708227,0.00055027765,0.010969151],"genre_scores_gemma":[0.23131463,0.0061118426,0.7407599,0.0016704643,0.0012341264,0.0010546845,0.0016681008,0.002907615,0.013278642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98564494,0.007465496,0.00062382984,0.0015577803,0.0036075364,0.0011004201],"domain_scores_gemma":[0.9058652,0.06995775,0.003294848,0.012465699,0.005877181,0.0025393718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028181808,0.0036045173,0.003013601,0.0036062798,0.0017907097,0.004967057,0.007152365,0.0040106894,0.016624533],"category_scores_gemma":[0.108558185,0.0015899243,0.0034216926,0.0029196467,0.004655618,0.013149854,0.009471986,0.0076415734,0.004186949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034403542,0.00022481463,0.00083032605,0.0005283731,0.00023954955,0.00006415801,0.00024521205,0.050630867,0.0011255168,0.8741965,0.0067715077,0.064799055],"study_design_scores_gemma":[0.0000823118,0.00013580982,0.00040474892,0.0001903005,0.000102597274,0.000252018,0.00006794899,0.5555126,0.0024029252,0.432873,0.007927196,0.00004849112],"about_ca_topic_score_codex":0.001351135,"about_ca_topic_score_gemma":0.0019355917,"teacher_disagreement_score":0.028181808,"about_ca_system_score_codex":0.004638842,"about_ca_system_score_gemma":0.0043188385,"threshold_uncertainty_score":0.14904141},"labels":[],"label_agreement":null},{"id":"W2189117730","doi":"10.1214/ecp.v20-4528","title":"Spectral bounds for certain two-factor non-reversible MCMC algorithms","year":2015,"lang":"en","type":"article","venue":"Electronic Communications in Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Mathematics; Gibbs sampling; Markov chain; Extension (predicate logic); Spectrum (functional analysis); Algorithm; Factor (programming language); Operator (biology); Applied mathematics; Computer science; Statistics; Bayesian probability","score_opus":0.17679330583369587,"score_gpt":0.42031936135085957,"score_spread":0.2435260555171637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189117730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038581036,0.0004904635,0.9480193,0.0006886447,0.00006668901,0.000093793635,0.00013931617,0.00038882258,0.011531881],"genre_scores_gemma":[0.69977605,0.0010308258,0.28925532,0.0006059646,0.00031102265,0.00061840966,0.00044016977,0.00066894793,0.0072934353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623436,0.0014745707,0.00020292091,0.00054046715,0.0011308843,0.0004167902],"domain_scores_gemma":[0.94939196,0.04139629,0.0022651032,0.0028223288,0.0027227444,0.001401546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066001774,0.0014870677,0.0013517728,0.0022876542,0.0014854125,0.003033092,0.0028761374,0.0023943265,0.010654793],"category_scores_gemma":[0.0512509,0.00072020944,0.0014745264,0.0014514433,0.0049685473,0.0045347796,0.0032689823,0.0036420636,0.0013440114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092644346,0.00008809887,0.00059116306,0.00014982492,0.000034683795,0.00009096098,0.00020831524,0.07122817,0.001652262,0.9103043,0.0012121922,0.014347395],"study_design_scores_gemma":[0.000023707262,0.000023395092,0.00016722517,0.0000439239,0.0000112201005,0.000060407583,0.00003111014,0.5542768,0.0007858415,0.44394016,0.00061425875,0.000022036673],"about_ca_topic_score_codex":0.0013314341,"about_ca_topic_score_gemma":0.0015915191,"teacher_disagreement_score":0.010654793,"about_ca_system_score_codex":0.002258725,"about_ca_system_score_gemma":0.001954687,"threshold_uncertainty_score":0.035643876},"labels":[],"label_agreement":null},{"id":"W2194799463","doi":"10.5539/ijsp.v5n1p51","title":"Surprising Convergence Properties of Some Simple Gibbs Samplers under Various Scans","year":2015,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Convergence (economics); Simple (philosophy); Gibbs sampling; Mathematics; Applied mathematics; Simple random sample; Statistical physics; Mathematical optimization; Statistics; Bayesian probability; Physics; Economics","score_opus":0.14219178961886497,"score_gpt":0.36169720349958345,"score_spread":0.21950541388071848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2194799463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22359578,0.0011694374,0.7633258,0.0019312665,0.00013221022,0.00019698551,0.00048472406,0.00082351983,0.008340243],"genre_scores_gemma":[0.7601369,0.0006627271,0.23294899,0.0005028744,0.00020648929,0.00045993057,0.0007358489,0.00038616077,0.003960062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969854,0.0014911847,0.00016193319,0.00059529697,0.0005131831,0.00025296948],"domain_scores_gemma":[0.9578526,0.0350928,0.0013884197,0.002624716,0.0020885984,0.00095287914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009873229,0.0007790078,0.0015622318,0.0017898601,0.0017190522,0.0017166245,0.0021873824,0.0024992812,0.004249891],"category_scores_gemma":[0.057875324,0.000809086,0.001641955,0.0014462529,0.0045152744,0.004327095,0.002209012,0.0031522692,0.00046176405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004518039,0.00010992758,0.0066644577,0.00036088,0.00021012456,0.0007074378,0.00073664775,0.16653632,0.0052117817,0.7952509,0.004152834,0.019606939],"study_design_scores_gemma":[0.00011381102,0.00004108528,0.00094282447,0.000036689187,0.00004235754,0.0003097007,0.00006769968,0.58680576,0.0023877902,0.4079272,0.0012738421,0.000051243835],"about_ca_topic_score_codex":0.0025111313,"about_ca_topic_score_gemma":0.002948797,"teacher_disagreement_score":0.009873229,"about_ca_system_score_codex":0.0015231117,"about_ca_system_score_gemma":0.0011324331,"threshold_uncertainty_score":0.05221522},"labels":[],"label_agreement":null},{"id":"W2202617390","doi":"10.1016/j.csda.2015.09.007","title":"A nonlinear population Monte Carlo scheme for the Bayesian estimation of parameters of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>α</mml:mi></mml:math>-stable distributions","year":2015,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Office of Naval Research Global; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Ministerio de Economía y Competitividad; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Scroll; Mathematics; Applied mathematics; Monte Carlo method; Nonlinear system; Population; Bayesian probability; Computer science; Algorithm; Statistics; Physics; Engineering","score_opus":0.05707409057324636,"score_gpt":0.33114665828665957,"score_spread":0.2740725677134132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202617390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005463983,0.000021767308,0.9987852,0.000053093554,0.00000992919,0.000032236483,0.000045227214,0.00008352996,0.00042256867],"genre_scores_gemma":[0.025595175,0.00009837398,0.97069854,0.00006929346,0.00003821548,0.00038718738,0.00026966055,0.0001331467,0.0027103282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976936,0.0013997521,0.000095986776,0.000341264,0.00039599588,0.00007332645],"domain_scores_gemma":[0.9939169,0.0040396675,0.00034491735,0.00082013855,0.0006874393,0.00019088815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068432787,0.0007787666,0.00093437,0.0011497856,0.0012286432,0.0015990387,0.0031138181,0.0019066944,0.010197044],"category_scores_gemma":[0.0229115,0.0007422886,0.0011991308,0.001582617,0.0017424554,0.0020395769,0.0027867828,0.0035850843,0.0030480162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012774908,0.00007163553,0.0012001517,0.00014448173,0.0000794534,0.00014028659,0.00041526,0.3793298,0.0022398233,0.47944766,0.0064254506,0.13037828],"study_design_scores_gemma":[0.000035935664,0.000017554079,0.00017568155,0.000028864682,0.000016206915,0.00007283016,0.000013474101,0.8859295,0.00064528163,0.108364515,0.0046674134,0.00003268926],"about_ca_topic_score_codex":0.0111467885,"about_ca_topic_score_gemma":0.017941836,"teacher_disagreement_score":0.0111467885,"about_ca_system_score_codex":0.002068455,"about_ca_system_score_gemma":0.0044627604,"threshold_uncertainty_score":0.036191165},"labels":[],"label_agreement":null},{"id":"W2256665692","doi":"10.1080/10618600.2012.723569","title":"An Adaptive Interacting Wang–Landau Algorithm for Automatic Density Exploration","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Artificial intelligence; Statistical physics; Physics","score_opus":0.07624063086788722,"score_gpt":0.3818334136523043,"score_spread":0.30559278278441704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256665692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032212192,0.000031678068,0.99570847,0.000046986497,0.000010653959,0.000029646673,0.000010857916,0.0003148692,0.0006256716],"genre_scores_gemma":[0.08223187,0.000047777223,0.91544,0.00006684082,0.000018231172,0.00020956605,0.000065536755,0.00015778947,0.0017622878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.00029538517,0.00004780624,0.00012939273,0.00024939817,0.000060240847],"domain_scores_gemma":[0.9978503,0.0013374492,0.00015444809,0.00026296815,0.00029419264,0.00010073964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022387796,0.000691916,0.0008437282,0.001200528,0.00086622813,0.0010551785,0.0019710793,0.0011889633,0.0044086752],"category_scores_gemma":[0.0076442175,0.0004967023,0.00071324257,0.0010043364,0.001178465,0.0014092172,0.0018595151,0.0012755212,0.0010278231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024214265,0.00011656741,0.0021907112,0.00012950682,0.000090302274,0.00023249551,0.00034943406,0.53284705,0.008673608,0.1736545,0.003327565,0.2781461],"study_design_scores_gemma":[0.000017717293,0.000014540391,0.000063902415,0.000005150291,0.000004594673,0.00002457826,0.000007062806,0.97948265,0.0009187278,0.018591775,0.0008607194,0.000008493161],"about_ca_topic_score_codex":0.0031109583,"about_ca_topic_score_gemma":0.0055326824,"teacher_disagreement_score":0.0044086752,"about_ca_system_score_codex":0.0009059544,"about_ca_system_score_gemma":0.002039743,"threshold_uncertainty_score":0.014748514},"labels":[],"label_agreement":null},{"id":"W2286176076","doi":"10.1007/978-1-4615-4493-7_46","title":"Weak Differentiation and Gradient Estimation for Discrete Event Driven Processes","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Perturbation (astronomy); Mathematics; Event (particle physics); Estimation; Applied mathematics; Function (biology); Computer science; Algorithm; Statistics; Physics; Engineering","score_opus":0.04468547911291154,"score_gpt":0.32422540386046983,"score_spread":0.2795399247475583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286176076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014697764,0.006347052,0.97994643,0.00050647336,0.000312164,0.000013735372,0.000054334145,0.0001916968,0.011158312],"genre_scores_gemma":[0.14035608,0.018038064,0.72707033,0.00072188146,0.0013235018,0.0002125993,0.00046949112,0.0007498835,0.111058205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966586,0.00012400151,0.000019512649,0.0000612361,0.000114295035,0.0000150447395],"domain_scores_gemma":[0.9989329,0.0008035668,0.000036297413,0.00008416735,0.00011795778,0.000024995308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011389187,0.0010274486,0.0012072443,0.00084193563,0.0002982563,0.0013599958,0.0011012554,0.0013216163,0.00392852],"category_scores_gemma":[0.0040792013,0.0006886048,0.00062075,0.0014296385,0.0014497883,0.0020740544,0.0008650082,0.0023696485,0.0016239247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018562463,0.000030682822,0.00022185015,0.00023621184,0.00003415257,0.000054985703,0.0000972431,0.049176175,0.0013400019,0.83383584,0.012548361,0.10240597],"study_design_scores_gemma":[0.00000542124,0.000010775667,0.00021379358,0.000034614255,0.000011717598,0.000053618303,0.000011138206,0.22073084,0.0005630402,0.76055324,0.017795986,0.00001585961],"about_ca_topic_score_codex":0.0020502477,"about_ca_topic_score_gemma":0.0019435671,"teacher_disagreement_score":0.00392852,"about_ca_system_score_codex":0.0010119351,"about_ca_system_score_gemma":0.00073547853,"threshold_uncertainty_score":0.0131421685},"labels":[],"label_agreement":null},{"id":"W2288839612","doi":"10.1109/cdc.2015.7403015","title":"Finite-state approximation of Markov decision processes with unbounded costs and Borel spaces","year":2015,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Markov decision process; Finite state; Action (physics); Mathematical optimization; State (computer science); Average cost; Markov process; Mathematics; Optimal control; Applied mathematics; Markov chain; Partially observable Markov decision process; Computer science; Algorithm","score_opus":0.05933922541352744,"score_gpt":0.3310549640366347,"score_spread":0.2717157386231073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288839612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08196815,0.00070433994,0.91371655,0.00042063594,0.000035987938,0.000026980184,0.00007912233,0.000158364,0.0028898155],"genre_scores_gemma":[0.9325778,0.00060205447,0.064427465,0.00006183538,0.000032780663,0.000093736584,0.0001599054,0.000040571937,0.0020038476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986646,0.0006495661,0.00006224536,0.00016732299,0.00031503872,0.00014117555],"domain_scores_gemma":[0.98970044,0.008739074,0.0006914445,0.00031596737,0.0003533842,0.00019964334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027525641,0.0008738309,0.0013113231,0.000692574,0.0005045855,0.0016606704,0.0012656817,0.0012287896,0.0012934691],"category_scores_gemma":[0.014426758,0.00066849875,0.00092648546,0.0006728643,0.0022114252,0.0019733103,0.0011045455,0.0021561843,0.00013986982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002783553,0.000015885835,0.00028422716,0.000028679435,0.000018142831,0.000036064885,0.000036517682,0.91724867,0.0002383217,0.079638414,0.000077720055,0.0023495269],"study_design_scores_gemma":[0.0000028638412,0.000005301175,0.00003429055,0.0000051220527,0.0000020938649,0.0000034173272,0.000003266582,0.97821575,0.000084418374,0.021569863,0.000070807895,0.0000028273284],"about_ca_topic_score_codex":0.011439118,"about_ca_topic_score_gemma":0.0068368064,"teacher_disagreement_score":0.011439118,"about_ca_system_score_codex":0.0026307981,"about_ca_system_score_gemma":0.0020857768,"threshold_uncertainty_score":0.022745073},"labels":[],"label_agreement":null},{"id":"W2295830829","doi":"","title":"Correspondence with B.A. Griffith (University of Toronto, Department of Mathematics)","year":2011,"lang":"en","type":"article","venue":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematics education","score_opus":0.20437803783781333,"score_gpt":0.353662248995309,"score_spread":0.14928421115749568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295830829","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013674335,0.06730914,0.016793802,0.24325505,0.047130547,0.00030349355,0.011635107,0.001880552,0.598018],"genre_scores_gemma":[0.0572333,0.024480782,0.007737954,0.005950396,0.0058863712,0.000104363746,0.0017439835,0.00037870623,0.89648414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994079,0.00009864049,0.00003131046,0.00018531781,0.00021193243,0.00006485847],"domain_scores_gemma":[0.99604106,0.0014170905,0.00019769439,0.00024457695,0.00094063795,0.0011589342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010913621,0.00077861117,0.0014869721,0.0015126806,0.0019340079,0.0015987738,0.0007590949,0.0012721883,0.4386093],"category_scores_gemma":[0.0067328513,0.00042960327,0.00046189528,0.0016443877,0.0010311592,0.0018113841,0.001654402,0.0016731332,0.14479382],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014956099,0.00004020101,0.0009631446,0.00034769793,0.000027118633,0.00021840501,0.00055905146,0.00037990237,0.0007117703,0.021045947,0.9170933,0.05846381],"study_design_scores_gemma":[0.000023377452,0.00004377211,0.002118936,0.00008558811,0.000018951832,0.00023952348,0.00026789054,0.00029642828,0.00035078908,0.0067673167,0.98976237,0.000025057918],"about_ca_topic_score_codex":0.017411368,"about_ca_topic_score_gemma":0.040622983,"teacher_disagreement_score":0.4386093,"about_ca_system_score_codex":0.0025117574,"about_ca_system_score_gemma":0.001970916,"threshold_uncertainty_score":0.8007557},"labels":[],"label_agreement":null},{"id":"W2297082043","doi":"10.1080/10618600.2018.1513365","title":"Adaptive Component-Wise Multiple-Try Metropolis Sampling","year":2018,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metropolis–Hastings algorithm; Markov chain; Ergodicity; Markov chain Monte Carlo; Component (thermodynamics); Algorithm; Computer science; Mathematics; Set (abstract data type); Additive Markov chain; Mathematical optimization; Distribution (mathematics); Variable-order Markov model; Markov model; Artificial intelligence; Machine learning; Statistics; Bayesian probability","score_opus":0.08135597292753999,"score_gpt":0.36876271864346916,"score_spread":0.28740674571592917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297082043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010193307,0.0002166968,0.9871114,0.00011766678,0.000056215962,0.00014662914,0.000074869204,0.00067792035,0.0014052214],"genre_scores_gemma":[0.3892712,0.0003408031,0.6011272,0.00028784908,0.00013498287,0.0010005274,0.0006121523,0.00047519224,0.0067501413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804926,0.0009762318,0.000070356655,0.00041144152,0.00034756487,0.00014520434],"domain_scores_gemma":[0.9936573,0.00432587,0.00027201563,0.0009951807,0.00057930604,0.00017027838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263375,0.00097487005,0.0019896282,0.00083167007,0.00071065105,0.0015975754,0.0035357703,0.0016810161,0.0062533463],"category_scores_gemma":[0.013772314,0.00075560116,0.0010875175,0.0012731731,0.0016485191,0.0019172545,0.001759389,0.0026314538,0.0017768558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005632002,0.00021635996,0.0033782264,0.00033490037,0.00020743019,0.00038843157,0.00031044477,0.6241641,0.0063876486,0.2369486,0.0072464254,0.11985428],"study_design_scores_gemma":[0.000034399836,0.000025457255,0.00012029749,0.000010479488,0.000013950781,0.000053863874,0.000009941595,0.9693003,0.0014920702,0.027617354,0.0013025242,0.00001929772],"about_ca_topic_score_codex":0.002987014,"about_ca_topic_score_gemma":0.0041493736,"teacher_disagreement_score":0.0062533463,"about_ca_system_score_codex":0.00084999774,"about_ca_system_score_gemma":0.0015260841,"threshold_uncertainty_score":0.020919502},"labels":[],"label_agreement":null},{"id":"W2314273363","doi":"10.1109/mnano.2014.2328178","title":"Moving Toward Added Functionality and Lower Cost [The Editor's Desk]","year":2014,"lang":"en","type":"article","venue":"IEEE Nanotechnology Magazine","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Desk; Computer science; Nanotechnology; Materials science; Operating system","score_opus":0.03926683023428966,"score_gpt":0.304999368931039,"score_spread":0.26573253869674934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314273363","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085162086,0.006741015,0.0013511867,0.13158044,0.85666984,0.000014814231,0.00005681345,0.0001297704,0.0033709595],"genre_scores_gemma":[0.002088871,0.015425258,0.002046872,0.11452958,0.83714366,0.000037041038,0.000058249403,0.00019028592,0.028480213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99574983,0.00053820066,0.00047790466,0.0005267616,0.0024298858,0.0002774576],"domain_scores_gemma":[0.9775883,0.009327033,0.001019296,0.0005802497,0.009594687,0.0018904802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005164964,0.0013701179,0.0015340217,0.0009664904,0.0023855974,0.0076249363,0.003688515,0.015215948,0.0129986685],"category_scores_gemma":[0.030703166,0.0007894668,0.0014469181,0.0010259574,0.0020657256,0.004822833,0.0010284098,0.022102207,0.008940557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011595962,0.000010358256,0.000030689094,0.000097445045,0.000011154823,0.00004869593,0.0000068804848,0.000083352104,0.00007866611,0.0025297303,0.9867301,0.010361354],"study_design_scores_gemma":[0.000017124514,0.000021481228,0.00016280262,0.00014651754,0.000019891591,0.00010411292,0.000022008937,0.00060561154,0.00017783267,0.005317122,0.99337876,0.000026683334],"about_ca_topic_score_codex":0.002599507,"about_ca_topic_score_gemma":0.0075908178,"teacher_disagreement_score":0.015215948,"about_ca_system_score_codex":0.0016743691,"about_ca_system_score_gemma":0.004417074,"threshold_uncertainty_score":0.043484867},"labels":[],"label_agreement":null},{"id":"W2343666936","doi":"10.6084/m9.figshare.7910549.v3","title":"Adaptive Incremental Mixture Markov Chain Monte Carlo","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Markov chain; Computer science; Statistical physics; Mathematics; Statistics; Machine learning; Physics","score_opus":0.10291954188426523,"score_gpt":0.3343484373503098,"score_spread":0.23142889546604456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343666936","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082754325,0.0005710021,0.9825639,0.0004044091,0.00008632636,0.00018245807,0.0027857698,0.0032744708,0.001856274],"genre_scores_gemma":[0.1772144,0.00055833004,0.80185777,0.00045081295,0.00014613647,0.00090524624,0.014828849,0.0008265904,0.0032117877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983783,0.00080789963,0.00007512459,0.00034598136,0.000288013,0.000104673636],"domain_scores_gemma":[0.99478596,0.003440684,0.00025700027,0.00083853165,0.00052578864,0.00015203604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003735619,0.0010045164,0.0016083546,0.0015015168,0.00070361566,0.0016580146,0.0043057576,0.0016325807,0.005383125],"category_scores_gemma":[0.015464874,0.0008473477,0.0015014332,0.0017666783,0.0009308556,0.0019791762,0.0020440181,0.002792788,0.002282069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038265914,0.0001781014,0.006108278,0.0002835073,0.00026614434,0.0002220676,0.00016459847,0.7618812,0.0012142501,0.07843128,0.028458435,0.12240951],"study_design_scores_gemma":[0.000038865932,0.000007814021,0.00015574094,0.000012908871,0.00001135478,0.00002673439,0.0000051760394,0.970051,0.00032037162,0.026130535,0.0032274073,0.000012066555],"about_ca_topic_score_codex":0.009467272,"about_ca_topic_score_gemma":0.023289423,"teacher_disagreement_score":0.009467272,"about_ca_system_score_codex":0.0013415719,"about_ca_system_score_gemma":0.0022763037,"threshold_uncertainty_score":0.019756079},"labels":[],"label_agreement":null},{"id":"W2364341470","doi":"10.1002/cjs.11343","title":"Likelihood inflating sampling algorithm","year":2017,"lang":"en","type":"preprint","venue":"Canadian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Sampling (signal processing); Algorithm; Computer science; Bayesian probability; Posterior probability; Gibbs sampling; Likelihood function; Importance sampling; Set (abstract data type); Monte Carlo method; Statistics; Mathematics; Artificial intelligence; Estimation theory","score_opus":0.13265934546974262,"score_gpt":0.3720022831719525,"score_spread":0.23934293770220988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364341470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043874932,0.00009835788,0.9928336,0.00016121147,0.000038989674,0.000068867776,0.000097740085,0.00044872754,0.0018650759],"genre_scores_gemma":[0.13143067,0.00013343067,0.86329037,0.00027176825,0.00014627921,0.00049745524,0.0007448389,0.00034003053,0.0031451015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516934,0.0027579404,0.00021944319,0.00066601444,0.00092683523,0.00026037288],"domain_scores_gemma":[0.98464,0.010211224,0.00070655026,0.0021792015,0.0019627588,0.00030025592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006829014,0.0008419758,0.0015359399,0.0019014946,0.0010549211,0.0019300651,0.003137619,0.0014402226,0.009398369],"category_scores_gemma":[0.03318185,0.00069994695,0.0013226111,0.002169665,0.0018583526,0.0019881222,0.0032144177,0.0028197782,0.0022517124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040817706,0.00014943322,0.0071426015,0.00023116646,0.00018344,0.00028549656,0.00036766197,0.3449739,0.002521194,0.33271787,0.012432845,0.29858625],"study_design_scores_gemma":[0.000049338265,0.00002305715,0.00035138664,0.000025309995,0.000015456986,0.000095042786,0.000016209833,0.89777285,0.0008239305,0.09688985,0.003920667,0.000016812437],"about_ca_topic_score_codex":0.0035118472,"about_ca_topic_score_gemma":0.0024630409,"teacher_disagreement_score":0.009398369,"about_ca_system_score_codex":0.0016487059,"about_ca_system_score_gemma":0.0022938247,"threshold_uncertainty_score":0.036115706},"labels":[],"label_agreement":null},{"id":"W2396538619","doi":"10.1214/17-aop1230","title":"On the mixing time of Kac’s walk and other high-dimensional Gibbs samplers with constraints","year":2018,"lang":"en","type":"preprint","venue":"The Annals of Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mixing (physics); Mathematics; Matrix (chemical analysis); Random walk; Random matrix; Eigenvalues and eigenvectors; Combinatorics; Singular value; Bounding overwatch; Markov chain; Coupling (piping); Statistical physics; Discrete mathematics; Pure mathematics; Statistics; Physics; Computer science; Quantum mechanics; Chemistry","score_opus":0.21321228302943693,"score_gpt":0.37468643846074534,"score_spread":0.1614741554313084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396538619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0812293,0.0009686904,0.9082263,0.0016002214,0.0000977866,0.00013350442,0.00023818828,0.00032288325,0.0071831197],"genre_scores_gemma":[0.7677064,0.0011189682,0.21490626,0.001379661,0.00035186773,0.0009454415,0.0009866614,0.00076107227,0.011843648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967384,0.0017138727,0.00010334265,0.0006962204,0.0004367117,0.0003115141],"domain_scores_gemma":[0.9680195,0.024958085,0.002127523,0.0018038319,0.0010766751,0.00201436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930072,0.0019510922,0.0021009652,0.0024799164,0.0019716497,0.002598617,0.0032286213,0.0032822294,0.0052821105],"category_scores_gemma":[0.042871144,0.0013253683,0.0019584508,0.0014111948,0.006508628,0.0059376345,0.004855793,0.0058377935,0.00077907386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015632306,0.000059499565,0.0016907625,0.00012386673,0.000098373064,0.000115550014,0.00026723594,0.13917159,0.002277566,0.848754,0.0013217209,0.0059635653],"study_design_scores_gemma":[0.000022979886,0.00003124409,0.00038325242,0.000029498064,0.000017452425,0.00003164934,0.000025580477,0.78152233,0.00058380555,0.21663886,0.0006742014,0.00003920606],"about_ca_topic_score_codex":0.0042162044,"about_ca_topic_score_gemma":0.004541671,"teacher_disagreement_score":0.008930072,"about_ca_system_score_codex":0.0031017722,"about_ca_system_score_gemma":0.001851313,"threshold_uncertainty_score":0.047227323},"labels":[],"label_agreement":null},{"id":"W2406329108","doi":"","title":"Why L1 view and what is next","year":2011,"lang":"en","type":"article","venue":"Czech digital mathematics library","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Session (web analytics); Task (project management); Computer science; Work (physics); Estimation; Library science; Management; World Wide Web; Engineering; Economics","score_opus":0.10826771206369036,"score_gpt":0.29201745497831194,"score_spread":0.1837497429146216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406329108","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010573291,0.019693758,0.012134072,0.7980878,0.017300723,0.00002352968,0.000496475,0.000344873,0.15086146],"genre_scores_gemma":[0.25470638,0.036262732,0.018754035,0.42485055,0.03126347,0.0003170179,0.0015293086,0.0033468409,0.2289697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939985,0.0027177902,0.00024608406,0.0011787763,0.0011734646,0.0006854017],"domain_scores_gemma":[0.987783,0.0041784886,0.0006638459,0.0012207539,0.0046043955,0.0015494567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006775872,0.00064082496,0.0008439027,0.0015602695,0.005384218,0.015069287,0.0026636512,0.005538754,0.043594413],"category_scores_gemma":[0.027696231,0.00042841505,0.00087394327,0.0012798017,0.010754403,0.02243426,0.004272277,0.014621233,0.028609874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029849027,0.000015788968,0.00028387,0.00017727577,0.000012756249,0.00006812458,0.002137522,0.00009665368,0.000082313454,0.50913984,0.45748878,0.030467235],"study_design_scores_gemma":[0.000009176168,0.000009890853,0.00034444744,0.00068889,0.000009799311,0.00013333629,0.0024774568,0.0002457944,0.00015910077,0.23328608,0.7625969,0.000039119084],"about_ca_topic_score_codex":0.017478725,"about_ca_topic_score_gemma":0.011631645,"teacher_disagreement_score":0.043594413,"about_ca_system_score_codex":0.011082539,"about_ca_system_score_gemma":0.0063698688,"threshold_uncertainty_score":0.14583784},"labels":[],"label_agreement":null},{"id":"W2413813901","doi":"10.1016/j.spa.2017.03.021","title":"A Dirichlet form approach to MCMC optimal scaling","year":2017,"lang":"en","type":"preprint","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Dirichlet distribution; Markov chain Monte Carlo; Scaling; Mathematical proof; Context (archaeology); Random walk; Convergence (economics); Mathematics; Applied mathematics; Infinitesimal; Markov chain; Mathematical optimization; Monte Carlo method; Computer science; Statistical physics; Mathematical analysis; Statistics; Geometry; Physics; Boundary value problem","score_opus":0.0767904285741193,"score_gpt":0.35793319666292356,"score_spread":0.28114276808880423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413813901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028555363,0.00020422306,0.9927235,0.00052043464,0.00007840127,0.000028563776,0.000043411328,0.00011257657,0.0034332771],"genre_scores_gemma":[0.3266606,0.0014054803,0.65511,0.001122572,0.00084693276,0.000683198,0.00033766913,0.0007113413,0.013122268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617565,0.0023119499,0.00015084997,0.00043382213,0.00072787877,0.00019995851],"domain_scores_gemma":[0.989861,0.007113838,0.00044121753,0.0013212936,0.0008994689,0.0003631522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061184703,0.001257782,0.0015454855,0.0018900711,0.0014270425,0.0027176219,0.0024805558,0.002209672,0.006830289],"category_scores_gemma":[0.034906916,0.001288966,0.0015355861,0.0016080277,0.0048655905,0.004093301,0.0050747423,0.0050200396,0.0013368038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018377441,0.000019616264,0.0002072095,0.000044439603,0.000019602763,0.000049389837,0.00008748328,0.06830688,0.0004185679,0.9214505,0.0009548887,0.008423011],"study_design_scores_gemma":[0.000009668727,0.000010816108,0.000048936177,0.000022491917,0.0000059278295,0.000025984504,0.0000121997555,0.40689912,0.00036906518,0.59044415,0.0021363012,0.000015307469],"about_ca_topic_score_codex":0.0018105333,"about_ca_topic_score_gemma":0.0017990652,"teacher_disagreement_score":0.006830289,"about_ca_system_score_codex":0.0019959859,"about_ca_system_score_gemma":0.0020816836,"threshold_uncertainty_score":0.03235799},"labels":[],"label_agreement":null},{"id":"W2427484745","doi":"10.1017/jpr.2016.9","title":"Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain Monte Carlo; Mathematics; Markov chain; Random walk; Algorithm; Limit (mathematics); Markov chain mixing time; Monte Carlo method; Metropolis–Hastings algorithm; Markov process; Metric (unit); Diffusion; Statistical physics; Applied mathematics; Markov model; Markov property; Statistics; Mathematical analysis","score_opus":0.09945098880932278,"score_gpt":0.33675091092752785,"score_spread":0.23729992211820505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2427484745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059292514,0.0018303716,0.9215137,0.002680714,0.00016057769,0.0001706469,0.00021317726,0.0004624763,0.013675847],"genre_scores_gemma":[0.7974388,0.0019754919,0.19177811,0.0010721786,0.00046861588,0.00075017556,0.00045524625,0.0006194322,0.0054419297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931658,0.0024791567,0.0003577997,0.000938557,0.0025413341,0.0005173892],"domain_scores_gemma":[0.89655703,0.08978485,0.0034443496,0.004153241,0.0039244094,0.0021361117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009228512,0.0013748365,0.0017659949,0.0027706993,0.0015847816,0.0041261036,0.0030410832,0.0024311845,0.0051399088],"category_scores_gemma":[0.073632695,0.0009479355,0.0018428146,0.0018151987,0.0052224416,0.0093374485,0.006004808,0.0064072106,0.0006039209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002106118,0.000113094626,0.0017735927,0.00027280653,0.000103247585,0.00011533313,0.00027743206,0.29082093,0.002931523,0.68669856,0.0016268892,0.015055919],"study_design_scores_gemma":[0.00001882712,0.000030478928,0.00019940636,0.000037040165,0.000012611442,0.000037578564,0.000016666769,0.7365854,0.00081787247,0.26153907,0.0006834607,0.000021554195],"about_ca_topic_score_codex":0.0023898317,"about_ca_topic_score_gemma":0.0016839948,"teacher_disagreement_score":0.009228512,"about_ca_system_score_codex":0.004605483,"about_ca_system_score_gemma":0.0028145649,"threshold_uncertainty_score":0.048805594},"labels":[],"label_agreement":null},{"id":"W2441960450","doi":"10.1002/mats.201600009","title":"Model Discrimination in Copolymerization Using the Sequential Bayesian Monte Carlo Method","year":2016,"lang":"en","type":"article","venue":"Macromolecular Theory and Simulations","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Bayesian probability; Copolymer; Computer science; Hybrid Monte Carlo; Algorithm; Monte Carlo molecular modeling; Bayesian inference; Statistical physics; Artificial intelligence; Mathematics; Statistics; Materials science; Physics","score_opus":0.06552740942212978,"score_gpt":0.38336985025508796,"score_spread":0.3178424408329582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2441960450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017139735,0.000083804356,0.98167384,0.000065989094,0.0000144229325,0.00005294222,0.000029002696,0.00022911612,0.0007112044],"genre_scores_gemma":[0.39690956,0.00018466784,0.60100865,0.0001236784,0.000026396943,0.00030677475,0.00017212624,0.00013061822,0.001137499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998285,0.00094934006,0.000060626575,0.000187961,0.00043978306,0.00007728138],"domain_scores_gemma":[0.993775,0.0050858343,0.00028905537,0.000387217,0.00035150672,0.00011132277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044426755,0.000574032,0.00087687536,0.0009106381,0.00048320953,0.00065240974,0.0012345891,0.0009415218,0.001777679],"category_scores_gemma":[0.0122136995,0.0005116969,0.0007259899,0.000671649,0.00076070504,0.0012767974,0.00091644377,0.0014607273,0.00030378587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029539032,0.00017178904,0.002292273,0.00012418434,0.00007315175,0.00009026336,0.00010351094,0.85522914,0.00883651,0.057736754,0.0006711956,0.074375756],"study_design_scores_gemma":[0.000008065664,0.000014224549,0.00008618945,0.0000025447234,0.0000028476322,0.0000096981075,0.0000017859379,0.99355054,0.0010826804,0.0050295736,0.00020556472,0.0000062427152],"about_ca_topic_score_codex":0.0036582174,"about_ca_topic_score_gemma":0.0032474787,"teacher_disagreement_score":0.0044426755,"about_ca_system_score_codex":0.0008657929,"about_ca_system_score_gemma":0.0013343431,"threshold_uncertainty_score":0.023495376},"labels":[],"label_agreement":null},{"id":"W2484967480","doi":"10.1090/fim/016/04","title":"Markov chain Monte Carlo","year":2001,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Statistical physics; Markov chain; Computer science; Mathematics; Physics; Statistics; Machine learning","score_opus":0.04328882303817426,"score_gpt":0.30972615215342375,"score_spread":0.2664373291152495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484967480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015369841,0.0039768666,0.8525275,0.0012084412,0.0005749066,0.00007303633,0.00028961472,0.001011265,0.13880137],"genre_scores_gemma":[0.15969375,0.010502257,0.48839402,0.001528244,0.0010519396,0.0006777446,0.0014202099,0.0016645364,0.33506733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873227,0.0005438758,0.00003509619,0.00017085193,0.00045635307,0.000061512255],"domain_scores_gemma":[0.99729985,0.0018251745,0.00006514766,0.00038891184,0.00034876168,0.00007210061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013887984,0.0010167083,0.0012509592,0.00126808,0.0008122714,0.0021739244,0.0011882065,0.0019807818,0.030983044],"category_scores_gemma":[0.0076531754,0.0008427134,0.0006959325,0.0016759384,0.001401549,0.0026345241,0.0014195809,0.002857906,0.009213669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017044465,0.00004867223,0.00016872204,0.000109827124,0.0000271413,0.00004009082,0.00008621137,0.043612972,0.000241881,0.81017226,0.037560023,0.10791512],"study_design_scores_gemma":[0.000014028118,0.000011083743,0.000120080826,0.000092766764,0.000015855423,0.00006365262,0.000016775597,0.13734406,0.00047102632,0.77113324,0.09069666,0.000020737454],"about_ca_topic_score_codex":0.0025969455,"about_ca_topic_score_gemma":0.0032477952,"teacher_disagreement_score":0.030983044,"about_ca_system_score_codex":0.0012991602,"about_ca_system_score_gemma":0.0017466614,"threshold_uncertainty_score":0.10364854},"labels":[],"label_agreement":null},{"id":"W2488750347","doi":"10.1007/978-1-4757-3925-1","title":"Counting and Configurations","year":2003,"lang":"en","type":"book","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.08279439391900525,"score_gpt":0.347418915641982,"score_spread":0.2646245217229768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488750347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021634276,0.01372657,0.3233331,0.0040384666,0.0015270744,0.00013688639,0.0005681309,0.0011291351,0.6533772],"genre_scores_gemma":[0.09978391,0.014342414,0.15043107,0.0023029132,0.0026640038,0.0007209539,0.0015184283,0.001522047,0.72671425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876237,0.00036690495,0.000049504117,0.00021438576,0.0005394419,0.00006741085],"domain_scores_gemma":[0.9986425,0.00069226325,0.000059722548,0.00030713537,0.00024256491,0.000055711025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012419766,0.0015432958,0.0018786498,0.0029756355,0.0020397895,0.0039448803,0.0018717421,0.0015089938,0.034465466],"category_scores_gemma":[0.005635652,0.0011352326,0.00076334574,0.0036477158,0.004353833,0.0072099958,0.0017751362,0.003491611,0.011914061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041360768,0.000011897704,0.000049659742,0.00004137811,0.0000044826056,0.000012399955,0.00007561102,0.0012041756,0.000047487716,0.9224068,0.040663186,0.03547886],"study_design_scores_gemma":[0.000002602463,0.0000029600276,0.000049733764,0.000035205292,0.0000035954424,0.000044057517,0.000019006218,0.0029112147,0.00008954938,0.92085004,0.075984575,0.000007462715],"about_ca_topic_score_codex":0.0036776052,"about_ca_topic_score_gemma":0.004549423,"teacher_disagreement_score":0.034465466,"about_ca_system_score_codex":0.002965777,"about_ca_system_score_gemma":0.0022715048,"threshold_uncertainty_score":0.11529845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.049332569674732686,"score_gpt":0.25648528312907154,"score_spread":0.20715271345433886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496191157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023921097,0.0033760108,0.9545604,0.0011289169,0.00046220198,0.00019231647,0.0005523591,0.00086390314,0.036471818],"genre_scores_gemma":[0.14273521,0.010364344,0.78518295,0.0013188804,0.0007418242,0.0012737728,0.0020884713,0.0008069285,0.055487648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979488,0.0010058816,0.00009674682,0.0003283971,0.00047798036,0.00014217757],"domain_scores_gemma":[0.9941765,0.0044458564,0.00021025125,0.00046349753,0.00056799635,0.00013587625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025957366,0.0012641985,0.0017173364,0.0014998863,0.0013956717,0.0030075596,0.002404743,0.0023266366,0.027294524],"category_scores_gemma":[0.012188391,0.00084127643,0.001619285,0.0020684977,0.0018047823,0.0032547908,0.0020243179,0.0031290492,0.005885355],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049866987,0.000071617644,0.00077131524,0.00031608017,0.000091174355,0.00015437578,0.00020753156,0.16995725,0.0003953324,0.7477075,0.013758019,0.06652006],"study_design_scores_gemma":[0.000042004547,0.000025847517,0.00017530276,0.00017485746,0.00003455009,0.00010243426,0.0000388536,0.387499,0.00058833114,0.5599227,0.051342335,0.000053902408],"about_ca_topic_score_codex":0.0040083244,"about_ca_topic_score_gemma":0.005515702,"teacher_disagreement_score":0.027294524,"about_ca_system_score_codex":0.0018300052,"about_ca_system_score_gemma":0.0021737402,"threshold_uncertainty_score":0.09130925},"labels":[],"label_agreement":null},{"id":"W2497858047","doi":"10.1017/cbo9781316091548.002","title":"Introduction to on-shell functions and diagrams","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Shell (structure); Content (measure theory); Computer science; Information retrieval; Mathematics; Engineering; Mechanical engineering; Mathematical analysis","score_opus":0.041921944582960405,"score_gpt":0.24573491580456458,"score_spread":0.2038129712216042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497858047","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014145218,0.027816469,0.26102054,0.0025230697,0.0032278553,0.00008432913,0.0019035977,0.0035954735,0.69841415],"genre_scores_gemma":[0.03787379,0.039161358,0.123891465,0.001877733,0.0030085375,0.0002799127,0.0033399176,0.005799871,0.7847675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962723,0.00007357857,0.000022202992,0.00007742057,0.0001672967,0.0000322889],"domain_scores_gemma":[0.99931145,0.0003370677,0.00002393471,0.00013417087,0.00014730293,0.00004598465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181449,0.0014112083,0.0010266365,0.0023235271,0.0009842485,0.0026657563,0.0012726142,0.0010039964,0.11432521],"category_scores_gemma":[0.0023241309,0.00067873683,0.0010927463,0.0023987347,0.0018695483,0.004529797,0.0012680165,0.0030212526,0.059963576],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019797806,0.000029315148,0.0000833549,0.00039152583,0.000009052512,0.0000798022,0.00022013133,0.0015367607,0.00075949007,0.6923974,0.16109303,0.14338028],"study_design_scores_gemma":[0.0000027541173,0.000009276806,0.00010526902,0.00014294879,0.0000034046843,0.00017658067,0.000022695245,0.0009113667,0.0003078476,0.39596125,0.6023449,0.0000116428255],"about_ca_topic_score_codex":0.0010590395,"about_ca_topic_score_gemma":0.0012560441,"teacher_disagreement_score":0.11432521,"about_ca_system_score_codex":0.0011207531,"about_ca_system_score_gemma":0.0009732553,"threshold_uncertainty_score":0.38245595},"labels":[],"label_agreement":null},{"id":"W2500625161","doi":"10.1007/978-3-662-49529-2_39","title":"Generating Random Spanning Trees via Fast Matrix Multiplication","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Matrix multiplication; Computer science; Random graph; Laplacian matrix; Minimum spanning tree; Kruskal's algorithm; Algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science","score_opus":0.03671713926362286,"score_gpt":0.3227779818664565,"score_spread":0.28606084260283365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500625161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007329564,0.00009345407,0.9890149,0.00009599124,0.000043395572,0.0000523438,0.00007333937,0.0005994283,0.0026975097],"genre_scores_gemma":[0.23940477,0.0002426163,0.7518435,0.000120283636,0.000116257586,0.00039540074,0.00041890627,0.00045281678,0.007005458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987676,0.00050313893,0.000048222442,0.00019653913,0.00039993544,0.000084551466],"domain_scores_gemma":[0.9951036,0.0035589526,0.00016601206,0.0006274647,0.00040727336,0.00013677154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866237,0.0007720359,0.0009568553,0.0009572,0.0006135894,0.0011513124,0.001517093,0.0013046203,0.009146158],"category_scores_gemma":[0.008860871,0.0007748987,0.00077262544,0.0013653297,0.0008087823,0.0021233098,0.0021958987,0.0016107032,0.0022730983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014495819,0.000112062124,0.00036593506,0.00019668246,0.000054508,0.00015430762,0.00022952008,0.41071728,0.00622902,0.37578318,0.00828198,0.19773056],"study_design_scores_gemma":[0.0000216268,0.0000149426205,0.000036848433,0.000008802133,0.000005939265,0.00005520348,0.000010233358,0.8435899,0.00090747216,0.1536428,0.0016978018,0.000008407276],"about_ca_topic_score_codex":0.0008848487,"about_ca_topic_score_gemma":0.0014506861,"teacher_disagreement_score":0.009146158,"about_ca_system_score_codex":0.0006630531,"about_ca_system_score_gemma":0.00062173285,"threshold_uncertainty_score":0.030596912},"labels":[],"label_agreement":null},{"id":"W2505519777","doi":"10.48550/arxiv.1411.0712","title":"Complexity Bounds for MCMC via Diffusion Limits","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Limit (mathematics); Random walk; Markov chain; Metric (unit); Mathematics; Mathematical optimization; Applied mathematics; Metropolis–Hastings algorithm; Markov process; Diffusion; Algorithm; Monte Carlo method; Computer science; Statistical physics; Statistics; Physics; Mathematical analysis; Economics","score_opus":0.2926510276963673,"score_gpt":0.2792149404831748,"score_spread":0.013436087213192505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505519777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01595721,0.0016614874,0.9682083,0.0023333027,0.00015820969,0.00012929099,0.00027960856,0.0004868366,0.01078577],"genre_scores_gemma":[0.5549922,0.003642078,0.4252099,0.0018754033,0.000993498,0.0015106656,0.001132097,0.0013362956,0.009307772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931512,0.0023182463,0.0003535181,0.0011922978,0.002488935,0.0004957337],"domain_scores_gemma":[0.9152943,0.07053965,0.003260788,0.0058933124,0.0034176938,0.001594293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008709618,0.002080328,0.0019787936,0.0032423725,0.0021768422,0.004420527,0.0039932337,0.0033127486,0.008144322],"category_scores_gemma":[0.07984432,0.0013239268,0.0027141322,0.0025879005,0.0055103875,0.010458081,0.0068382155,0.009360201,0.0012176556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111740825,0.00007518569,0.0014112734,0.00027148557,0.00011307719,0.000125004,0.00025310955,0.20092358,0.0017835649,0.7739162,0.0025713188,0.018444484],"study_design_scores_gemma":[0.000017261169,0.000019613786,0.00017226348,0.00004799825,0.000018521747,0.000054777884,0.000017214317,0.57021743,0.0009022523,0.42700163,0.0015059588,0.000024981273],"about_ca_topic_score_codex":0.003992094,"about_ca_topic_score_gemma":0.003553794,"teacher_disagreement_score":0.008709618,"about_ca_system_score_codex":0.005777559,"about_ca_system_score_gemma":0.0030875937,"threshold_uncertainty_score":0.046061456},"labels":[],"label_agreement":null},{"id":"W251035930","doi":"","title":"The Geometry Of Markov Chain Limit Theorems","year":2013,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Limit (mathematics); Markov chain; Mathematics; Geometry; Chain (unit); Mathematical analysis; Physics; Statistics","score_opus":0.027854834727270798,"score_gpt":0.26117330112265597,"score_spread":0.23331846639538517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251035930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07247596,0.0025291375,0.87222433,0.0034081268,0.00024391874,0.00006183675,0.00025062423,0.00028587374,0.048520207],"genre_scores_gemma":[0.90806234,0.0023906815,0.0800956,0.0006024476,0.0005291275,0.00023642412,0.00021054184,0.00019513987,0.0076777204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972452,0.0011717266,0.00010973043,0.00036257348,0.00087702804,0.000233775],"domain_scores_gemma":[0.9913464,0.0057136137,0.0008029376,0.0005820123,0.001140735,0.00041428313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042517497,0.00068295444,0.00079612696,0.0025122496,0.0016977167,0.0026675721,0.0016440103,0.0010403348,0.004190979],"category_scores_gemma":[0.014492067,0.0003777045,0.0009533315,0.0010374815,0.0058346703,0.0059644324,0.0027666735,0.002746927,0.0006295822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019430795,0.0000024652802,0.000047148624,0.000008029652,0.0000024200358,0.00001680958,0.000042328575,0.0019837283,0.000064964835,0.99697304,0.00013291392,0.00072416756],"study_design_scores_gemma":[0.000004520251,0.000007124808,0.00005318628,0.000009187042,0.0000019055494,0.000024450675,0.000017987975,0.018686846,0.00012005595,0.9797244,0.0013446232,0.000005836483],"about_ca_topic_score_codex":0.001632646,"about_ca_topic_score_gemma":0.00067348697,"teacher_disagreement_score":0.0042517497,"about_ca_system_score_codex":0.0028589363,"about_ca_system_score_gemma":0.0011848335,"threshold_uncertainty_score":0.022485673},"labels":[],"label_agreement":null},{"id":"W2520716379","doi":"10.4171/jfg/35","title":"Conformal graph directed Markov systems: beyond finite irreducibility","year":2016,"lang":"en","type":"article","venue":"Journal of Fractal Geometry Mathematics of Fractals and Related Topics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Irreducibility; Mathematics; Graph; Markov chain; Conformal map; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.022964993057360918,"score_gpt":0.29384486922003383,"score_spread":0.2708798761626729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520716379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295598,0.0009561308,0.14489317,0.001148086,0.000081737795,0.000055188273,0.00014872964,0.00020455575,0.022952562],"genre_scores_gemma":[0.9929093,0.00015485987,0.005815356,0.000054760174,0.000031825173,0.000019856856,0.00004213811,0.000014519774,0.0009574387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995808,0.00011646806,0.000021337006,0.00007162317,0.00010324523,0.00010664404],"domain_scores_gemma":[0.99801874,0.00094314717,0.0003095855,0.00026290803,0.00014544312,0.00032020523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080214854,0.00030480154,0.0006272057,0.0008577237,0.0010412143,0.001746416,0.00056219415,0.0007605865,0.001937232],"category_scores_gemma":[0.0042455667,0.00027562605,0.0006616722,0.00031116948,0.0032422368,0.0018870671,0.0016776968,0.0012963446,0.00011056362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001577357,0.00001693132,0.0011139007,0.00003526368,0.000009715387,0.00018734376,0.00015434186,0.011338763,0.00095475995,0.98445326,0.0001647344,0.0015553652],"study_design_scores_gemma":[0.000015494352,0.00002414479,0.00059913227,0.000018413637,0.000009928905,0.000113861344,0.000098859,0.106990315,0.00056204933,0.89071476,0.00084117387,0.000012040057],"about_ca_topic_score_codex":0.0013177396,"about_ca_topic_score_gemma":0.001011952,"teacher_disagreement_score":0.001937232,"about_ca_system_score_codex":0.00090363884,"about_ca_system_score_gemma":0.00067796104,"threshold_uncertainty_score":0.0065563917},"labels":[],"label_agreement":null},{"id":"W2521822742","doi":"10.1007/s00180-016-0682-2","title":"Automatically tuned general-purpose MCMC via new adaptive diagnostics","year":2016,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Convergence (economics); Computer science; Markov chain; Mathematical optimization; Algorithm; Markov process; Machine learning; Artificial intelligence; Mathematics; Bayesian probability; Statistics","score_opus":0.06490603595468068,"score_gpt":0.34839561926455065,"score_spread":0.28348958330986995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521822742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050284257,0.0001003205,0.99165,0.00009293822,0.000040225048,0.000031714204,0.000060187856,0.002289489,0.0007067583],"genre_scores_gemma":[0.21158455,0.00008611152,0.7849478,0.00022843834,0.00007158175,0.00019380916,0.00040565216,0.001187883,0.0012941852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982844,0.0008009816,0.00009873278,0.00028278853,0.00041850985,0.00011454284],"domain_scores_gemma":[0.9878494,0.008947134,0.0004878877,0.0012934427,0.0010839293,0.0003382532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003358088,0.0011655393,0.0015441056,0.0014692709,0.00078283245,0.0017115055,0.0031980155,0.002234002,0.007417018],"category_scores_gemma":[0.033475775,0.001104464,0.0007546185,0.0010240772,0.0011447655,0.0018042636,0.0022852577,0.0033208905,0.002104916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067853293,0.00018167449,0.0029684075,0.00022641278,0.00014603439,0.0001729214,0.00016486338,0.658799,0.007603537,0.04906931,0.0074355225,0.27255377],"study_design_scores_gemma":[0.00002158899,0.000006426871,0.00008202439,0.00000786353,0.000005480611,0.000015944475,0.0000024686985,0.9911664,0.00070856774,0.0075366497,0.0004383337,0.000008157477],"about_ca_topic_score_codex":0.0048703514,"about_ca_topic_score_gemma":0.00894035,"teacher_disagreement_score":0.007417018,"about_ca_system_score_codex":0.0012029187,"about_ca_system_score_gemma":0.0031420474,"threshold_uncertainty_score":0.0248124},"labels":[],"label_agreement":null},{"id":"W2523622633","doi":"","title":"Hot coupling: a particle approach to inference and normalization on pairwise undirected graphs of arbitrary topology","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Graphical model; Pairwise comparison; Inference; Markov chain Monte Carlo; Algorithm; Mathematics; Computer science; Normalization (sociology); Approximate inference; Monte Carlo method; Gibbs sampling; Theoretical computer science; Bayesian probability; Artificial intelligence","score_opus":0.07081159558708214,"score_gpt":0.33669400411421,"score_spread":0.26588240852712786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523622633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017350531,0.00002830973,0.9978436,0.000034648914,0.000010447516,0.000014188241,0.0000104351575,0.00014037281,0.00018277501],"genre_scores_gemma":[0.13852346,0.00020434066,0.8577656,0.00017446591,0.000108069864,0.000278513,0.0002071911,0.0003898205,0.0023484973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983234,0.0007560043,0.000051988984,0.00039164792,0.00036699037,0.00010989853],"domain_scores_gemma":[0.9949877,0.0034097505,0.00031500662,0.00079588336,0.00030023052,0.00019139657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964267,0.0011570867,0.0018514488,0.0015355246,0.0011569286,0.0016064009,0.0040033855,0.0018309793,0.0027292427],"category_scores_gemma":[0.015253749,0.0014369888,0.0014448584,0.0016224827,0.0025886477,0.0044112275,0.002950309,0.0030844235,0.0006582381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015457215,0.00009086291,0.0013642916,0.000090084126,0.00014517856,0.0001267152,0.0002778357,0.63340056,0.0021959885,0.26908836,0.0018479603,0.091217555],"study_design_scores_gemma":[0.000010045075,0.000013089572,0.00008015591,0.000004985156,0.000007606771,0.000019735375,0.000007173212,0.9404212,0.00039540243,0.058452357,0.0005794167,0.000008825136],"about_ca_topic_score_codex":0.0045382055,"about_ca_topic_score_gemma":0.0046273936,"teacher_disagreement_score":0.0045382055,"about_ca_system_score_codex":0.0017285042,"about_ca_system_score_gemma":0.0015279368,"threshold_uncertainty_score":0.020965278},"labels":[],"label_agreement":null},{"id":"W2562692326","doi":"10.1016/j.csda.2016.12.007","title":"Hierarchical models: Local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs","year":2016,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gibbs sampling; Mathematics; Scaling; Covariance matrix; Applied mathematics; Gaussian; Covariance; Diagonal; Hierarchical database model; Statistics; Mathematical optimization; Statistical physics; Computer science; Physics; Bayesian probability","score_opus":0.1201307406555452,"score_gpt":0.3834520396904838,"score_spread":0.2633212990349386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562692326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016684803,0.00020238677,0.9968342,0.00019636867,0.00005705767,0.000051327002,0.000108896005,0.00047405798,0.00040722114],"genre_scores_gemma":[0.083206676,0.00044122944,0.90777314,0.00055845716,0.00036223652,0.0010111224,0.0010900665,0.0019066192,0.0036504944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986615,0.0093683675,0.00047451362,0.0018306277,0.0012455689,0.000465891],"domain_scores_gemma":[0.9562819,0.030704722,0.0015470482,0.0082243895,0.0021746808,0.001067248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022944922,0.0018199543,0.0027921228,0.0024996984,0.0018831482,0.0041382005,0.008910668,0.0042107585,0.009543714],"category_scores_gemma":[0.10521088,0.0020642332,0.0035254366,0.0030223285,0.0036032572,0.008276751,0.007384239,0.009738513,0.0038293316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003247926,0.00016564834,0.0017086169,0.00022885406,0.00028882752,0.0001269859,0.0006316356,0.11897457,0.0011532184,0.7445012,0.010148013,0.12174774],"study_design_scores_gemma":[0.00004051498,0.00002721056,0.0002586907,0.000040856583,0.000051510073,0.00004788052,0.000041585114,0.63197964,0.0005418611,0.36391485,0.0030070157,0.00004833011],"about_ca_topic_score_codex":0.005832557,"about_ca_topic_score_gemma":0.011940131,"teacher_disagreement_score":0.022944922,"about_ca_system_score_codex":0.0026732502,"about_ca_system_score_gemma":0.0049174074,"threshold_uncertainty_score":0.12134582},"labels":[],"label_agreement":null},{"id":"W2568997022","doi":"10.1137/120885498","title":"Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Glauber; Omega; Combinatorics; Mathematics; Lambda; Vertex (graph theory); Inverse; Boundary (topology); Tree (set theory); Spectral gap; Markov chain; Discrete mathematics; Physics; Mathematical analysis; Geometry; Graph; Scattering; Quantum mechanics; Statistics","score_opus":0.04782450638894484,"score_gpt":0.37313923629183865,"score_spread":0.3253147299028938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568997022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159477,0.0010265209,0.1627493,0.0018747278,0.00012667313,0.000088001274,0.00017964933,0.0005715487,0.017435888],"genre_scores_gemma":[0.9838463,0.0002653311,0.012977082,0.00023225436,0.000044160108,0.000117557516,0.00013699506,0.00017356951,0.0022067393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996933,0.00008341515,0.00000911184,0.000052723444,0.000052448126,0.000109126086],"domain_scores_gemma":[0.99675506,0.0018605005,0.0005277834,0.00012995399,0.00016613316,0.00056055887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086762913,0.0005693085,0.0007232781,0.0011187275,0.0012072357,0.0014672315,0.0009778716,0.0013508166,0.0043374714],"category_scores_gemma":[0.007301482,0.00037478365,0.0008550036,0.00034708166,0.002438284,0.0022924556,0.0013442783,0.002075738,0.0003848752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019570248,0.00018263722,0.0014545488,0.00014675902,0.00003728961,0.0002723086,0.0006590691,0.13743572,0.016745664,0.83663696,0.002236627,0.0039967704],"study_design_scores_gemma":[0.00006859224,0.00006265374,0.00066180964,0.00003299165,0.000013816065,0.000058633865,0.00015431018,0.7981549,0.0021872486,0.19779631,0.0007740656,0.000034674937],"about_ca_topic_score_codex":0.0028219111,"about_ca_topic_score_gemma":0.0018423954,"teacher_disagreement_score":0.0043374714,"about_ca_system_score_codex":0.0019685212,"about_ca_system_score_gemma":0.0009959068,"threshold_uncertainty_score":0.014510274},"labels":[],"label_agreement":null},{"id":"W2571496458","doi":"10.1002/rsa.20341","title":"Smoothed analysis of balancing networks","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Security token; Combinatorics; Upper and lower bounds; Computer science; Binary logarithm; Mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.016492966255816654,"score_gpt":0.3117600488426788,"score_spread":0.2952670825868622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571496458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17851189,0.00078159047,0.79833996,0.0012364628,0.00014296902,0.000077246434,0.00022092115,0.0006675024,0.020021593],"genre_scores_gemma":[0.9625055,0.00037280933,0.028318865,0.00026590886,0.00015419167,0.00012704368,0.00022690833,0.00019890294,0.007829914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.00047980304,0.000034463028,0.00021729393,0.00029887122,0.00016776382],"domain_scores_gemma":[0.9931825,0.003795071,0.0011033202,0.00078184233,0.00073724554,0.00040002944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023414986,0.0006623189,0.0007684423,0.0017866895,0.0009807542,0.0015351373,0.0016523643,0.0012934192,0.0070548947],"category_scores_gemma":[0.015867662,0.0005000458,0.0007276422,0.00087890326,0.0019351073,0.0032950225,0.0014437311,0.0016349934,0.00061933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014089904,0.00003303271,0.00095281616,0.00008831888,0.00003519051,0.00009210374,0.00014062933,0.3860965,0.0033052391,0.5936523,0.003045845,0.012417138],"study_design_scores_gemma":[0.000011492647,0.000029965826,0.0002960535,0.000012313429,0.0000094770085,0.00003661622,0.000020630065,0.8005862,0.0005328017,0.19663404,0.0018189526,0.000011474523],"about_ca_topic_score_codex":0.0027796822,"about_ca_topic_score_gemma":0.0013162261,"teacher_disagreement_score":0.0070548947,"about_ca_system_score_codex":0.0026636918,"about_ca_system_score_gemma":0.0006967862,"threshold_uncertainty_score":0.023600996},"labels":[],"label_agreement":null},{"id":"W2586089681","doi":"10.1101/106450","title":"Approximate Bayesian Computation Algorithms for Estimating Network Model Parameters","year":2017,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Approximate Bayesian computation; Markov chain Monte Carlo; Computer science; Algorithm; Monte Carlo method; Inference; Computation; Bayesian inference; Markov chain; Particle filter; Bayesian probability; Population; Bayesian network; Mathematics; Artificial intelligence; Statistics; Machine learning; Kalman filter","score_opus":0.08021053571853137,"score_gpt":0.32883451318211127,"score_spread":0.2486239774635799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586089681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006567027,0.00021880862,0.99174666,0.00018267905,0.000014994539,0.00003754708,0.00006625168,0.00025198222,0.0009140955],"genre_scores_gemma":[0.26501116,0.0004718084,0.73070633,0.00018842888,0.00008687593,0.0003943778,0.0004956005,0.00024669143,0.0023986597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980737,0.0011278758,0.00007767832,0.00024199343,0.0003865897,0.00009218522],"domain_scores_gemma":[0.9867308,0.010865508,0.00050500926,0.00073969027,0.0009704814,0.00018854951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00421589,0.00081556453,0.001229917,0.0017527179,0.0007950527,0.0017778802,0.0019895658,0.0014800266,0.0043474897],"category_scores_gemma":[0.02891021,0.0008076248,0.0007028908,0.0018117841,0.0015652045,0.002251722,0.0017188126,0.002146711,0.00086787145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008293882,0.000042356158,0.0011642624,0.000090166366,0.00005183125,0.000039077593,0.00008760027,0.8559282,0.00046854198,0.081382655,0.0014307663,0.05923162],"study_design_scores_gemma":[0.0000072547423,0.0000034901773,0.00006436415,0.000007630783,0.0000027417218,0.0000073287592,0.000005216681,0.9701909,0.000099895464,0.029294737,0.00031325308,0.0000031940126],"about_ca_topic_score_codex":0.012543373,"about_ca_topic_score_gemma":0.01104058,"teacher_disagreement_score":0.012543373,"about_ca_system_score_codex":0.001970435,"about_ca_system_score_gemma":0.0025350715,"threshold_uncertainty_score":0.02494073},"labels":[],"label_agreement":null},{"id":"W2593065375","doi":"10.1080/14697688.2019.1588469","title":"Estimation of risk contributions with MCMC","year":2019,"lang":"en","type":"article","venue":"Quantitative Finance","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science London","keywords":"Estimator; Markov chain Monte Carlo; Value at risk; Monte Carlo method; Econometrics; Mean squared error; Consistency (knowledge bases); Mathematics; Asymptotic distribution; Statistics; Computer science; Risk management; Economics; Finance","score_opus":0.035237854013127685,"score_gpt":0.3697633568256244,"score_spread":0.3345255028124967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593065375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018904552,0.0002725712,0.9784652,0.00018217132,0.00004643373,0.00008708899,0.00019448061,0.00062081806,0.0012267616],"genre_scores_gemma":[0.45479223,0.0005058276,0.5388158,0.00029687083,0.00015765548,0.00047549233,0.0012629115,0.00030600748,0.0033871701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857426,0.00060827873,0.000088176144,0.00022055485,0.00038815674,0.00012053513],"domain_scores_gemma":[0.98725766,0.009649153,0.00082853955,0.0010093899,0.000993791,0.00026146686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004240854,0.0010991389,0.0014165377,0.0023699743,0.0008679413,0.0013610253,0.0021679343,0.0016499911,0.0047641853],"category_scores_gemma":[0.024223603,0.0011731605,0.0011333951,0.0018391651,0.0011771522,0.0016358286,0.0015731743,0.0025773973,0.0007701552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010111799,0.00005223746,0.0033749903,0.0000857181,0.000100514095,0.000099075325,0.00006406777,0.923275,0.00077484763,0.031124858,0.0012640586,0.03968355],"study_design_scores_gemma":[0.0000073733236,0.000004326793,0.00019616076,0.000009374187,0.000005357571,0.000010318108,0.0000034887457,0.9918909,0.00021787483,0.0073932335,0.00025500756,0.0000066057746],"about_ca_topic_score_codex":0.016754001,"about_ca_topic_score_gemma":0.017931102,"teacher_disagreement_score":0.016754001,"about_ca_system_score_codex":0.0015612459,"about_ca_system_score_gemma":0.0029833736,"threshold_uncertainty_score":0.033312976},"labels":[],"label_agreement":null},{"id":"W2600390700","doi":"10.46298/dmtcs.3087","title":"Computing Tutte Polynomials","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Humanities; Tutte polynomial; Combinatorics; Maple; Mathematics; Graph; Art; Botany; Line graph","score_opus":0.03727354755222738,"score_gpt":0.33609643840926046,"score_spread":0.29882289085703306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600390700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12028324,0.00009422381,0.86921763,0.00009407763,0.000039017694,0.00003983311,0.00024810608,0.0012889743,0.00869501],"genre_scores_gemma":[0.6418748,0.00020712678,0.34923258,0.00008561443,0.000032693923,0.000114699564,0.0008902454,0.0006716446,0.0068906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968016,0.000046307923,0.000010592385,0.000057129673,0.0001121142,0.0000937289],"domain_scores_gemma":[0.9988927,0.00052732776,0.00007842431,0.00021965192,0.00021633954,0.00006548767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002650066,0.00042826007,0.0004986359,0.00097439747,0.000564432,0.000872444,0.0006191936,0.0004865505,0.005936337],"category_scores_gemma":[0.003453537,0.00030915695,0.0008502578,0.0009222984,0.0006002454,0.0013958586,0.0008201833,0.0008465625,0.0010206797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003145575,0.000090189635,0.00484735,0.00023513455,0.00008091728,0.00028713123,0.000355657,0.5552472,0.02783714,0.19603097,0.006063315,0.20861042],"study_design_scores_gemma":[0.000017944349,0.000048846738,0.0006118909,0.000015000473,0.000011060634,0.00009186503,0.000061908446,0.92378116,0.008414909,0.0629925,0.003933403,0.000019520283],"about_ca_topic_score_codex":0.005624595,"about_ca_topic_score_gemma":0.011766937,"teacher_disagreement_score":0.005936337,"about_ca_system_score_codex":0.00068240205,"about_ca_system_score_gemma":0.00096505263,"threshold_uncertainty_score":0.019858956},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.17580875560416445,"score_gpt":0.5287679271883436,"score_spread":0.3529591715841792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613020357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003475015,0.002157538,0.9916345,0.00052281725,0.000050991293,0.00006447532,0.000034602905,0.00011980538,0.0019402644],"genre_scores_gemma":[0.099501275,0.005777823,0.8908291,0.00026768752,0.00028037312,0.00058981613,0.00016141831,0.0003142455,0.0022781754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9832023,0.0122662755,0.00046806654,0.0007391984,0.0030337179,0.00029043187],"domain_scores_gemma":[0.85680145,0.13207734,0.0019639318,0.0037231045,0.004758582,0.0006756259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03081771,0.001164098,0.0022645323,0.0038784954,0.0011391486,0.0031067124,0.0029893294,0.002205348,0.007101514],"category_scores_gemma":[0.1209163,0.0009165508,0.0015419245,0.0034631353,0.0023308273,0.0056571825,0.003129699,0.0029325278,0.0009412698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001951244,0.00013429261,0.001963187,0.00037126508,0.00016259652,0.000075256,0.00038470377,0.17500016,0.00035950376,0.6746099,0.0027071836,0.1440368],"study_design_scores_gemma":[0.000050977,0.000053805026,0.00077802694,0.0001467346,0.000054356777,0.000093045775,0.00008476634,0.76118684,0.00030682757,0.23273307,0.0044652494,0.000046285044],"about_ca_topic_score_codex":0.00570733,"about_ca_topic_score_gemma":0.0062686787,"teacher_disagreement_score":0.03081771,"about_ca_system_score_codex":0.0031335126,"about_ca_system_score_gemma":0.0044311243,"threshold_uncertainty_score":0.16298151},"labels":[],"label_agreement":null},{"id":"W2620671288","doi":"10.1080/03610918.2017.1335405","title":"Stochastic simulation of sequential game-theory voting models","year":2017,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Java applet; Computer science; Voting; Java; Nash equilibrium; Mathematical economics; Game theory; Mathematical optimization; Theoretical computer science; Programming language; Mathematics; Law","score_opus":0.350832845956529,"score_gpt":0.5187519709405946,"score_spread":0.16791912498406553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620671288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10418847,0.00012834455,0.8876631,0.0005641329,0.00004134099,0.00008547585,0.0001539471,0.00031042192,0.0068648383],"genre_scores_gemma":[0.94407177,0.00012126582,0.052702345,0.000103805105,0.000026653051,0.00018158658,0.00014860377,0.00006793469,0.0025760694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808264,0.0011293998,0.00007043487,0.00023301537,0.0003043151,0.00018013504],"domain_scores_gemma":[0.990253,0.007719694,0.00071273145,0.0006174954,0.00038304523,0.00031407864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026352047,0.000574379,0.0009443685,0.00066569535,0.00048005694,0.0013456905,0.0015062174,0.0011486044,0.0037070327],"category_scores_gemma":[0.016602097,0.00040280537,0.0008445615,0.0005667517,0.0017041676,0.0016197106,0.0014029753,0.0013860473,0.00033028872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064454674,0.000028983946,0.0008123878,0.00002374411,0.000022881313,0.00005494881,0.000058567835,0.78599834,0.0006047691,0.20934881,0.00032927463,0.0026528465],"study_design_scores_gemma":[0.000009222599,0.000007546305,0.000044156524,0.0000027608673,0.0000020222085,0.000006067404,0.0000036390036,0.9588382,0.00013136907,0.04079512,0.00015603188,0.0000038205776],"about_ca_topic_score_codex":0.0039257477,"about_ca_topic_score_gemma":0.0031224682,"teacher_disagreement_score":0.0039257477,"about_ca_system_score_codex":0.0014034658,"about_ca_system_score_gemma":0.00092708674,"threshold_uncertainty_score":0.01393652},"labels":[],"label_agreement":null},{"id":"W2747388682","doi":"","title":"線形条件付きGauss Bayesネットワークを用いた短期交通流予測【Powered by NICT】","year":2016,"lang":"ja","type":"article","venue":"Journal of Advanced Transportation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bayes' theorem; Gauss; Aerospace engineering; Computer science; Aeronautics; Engineering; Bayesian probability; Physics; Artificial intelligence","score_opus":0.018519696918828744,"score_gpt":0.3093846146350784,"score_spread":0.2908649177162496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747388682","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030002555,0.0018923641,0.45332566,0.008029703,0.002894457,0.00018434918,0.0009575148,0.0009755126,0.50173783],"genre_scores_gemma":[0.58379346,0.0034311453,0.08883915,0.0012582663,0.0013811418,0.0005028706,0.00069760956,0.0008389509,0.31925732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944633,0.00011828794,0.00002410731,0.00011892362,0.000223258,0.00006915128],"domain_scores_gemma":[0.9985624,0.00032657955,0.00016523058,0.0002318494,0.0005646266,0.00014939415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006939883,0.00048946735,0.00072924094,0.0011692885,0.0012771891,0.0033182919,0.0010756775,0.00095164625,0.040052217],"category_scores_gemma":[0.005650976,0.00030127628,0.00052570034,0.0010630311,0.00213137,0.0025337094,0.0019257007,0.0024861086,0.0066362675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031616117,0.000030961204,0.0006365022,0.00006733551,0.000015817686,0.00007268841,0.00013239568,0.017750133,0.0012196915,0.93528557,0.012073714,0.032683562],"study_design_scores_gemma":[0.000016180846,0.00002384128,0.0012582735,0.000112816946,0.000024725912,0.000336423,0.00020262925,0.314964,0.0034098763,0.5849586,0.09463969,0.000052967993],"about_ca_topic_score_codex":0.0057605472,"about_ca_topic_score_gemma":0.0036605105,"teacher_disagreement_score":0.040052217,"about_ca_system_score_codex":0.0021950472,"about_ca_system_score_gemma":0.0028866988,"threshold_uncertainty_score":0.13398796},"labels":[],"label_agreement":null},{"id":"W2752311959","doi":"10.48550/arxiv.1709.02311","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","year":2017,"lang":"en","type":"preprint","venue":"TU/e Research Portal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Omega; Upper and lower bounds; Parameterized complexity; Mathematics; Hamiltonian (control theory); Modulo; Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.21430724278065522,"score_gpt":0.5094347241514807,"score_spread":0.2951274813708255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752311959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09059012,0.0031482934,0.80566114,0.008141293,0.0006826763,0.00038323825,0.0037615905,0.0042626644,0.0833689],"genre_scores_gemma":[0.64594036,0.0021505433,0.3158179,0.0030320971,0.0014783231,0.0008643862,0.0033363425,0.0018473085,0.0255328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503434,0.0008577146,0.00020821324,0.0013417201,0.0015343967,0.0010236893],"domain_scores_gemma":[0.98104286,0.011830096,0.0010464215,0.0040385392,0.0012647316,0.0007773623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029554553,0.0027565525,0.0018639314,0.003052189,0.002123626,0.0054605743,0.0041282396,0.0023621887,0.017874427],"category_scores_gemma":[0.028699161,0.001179901,0.0018142281,0.0037882908,0.0032084407,0.0163662,0.004141594,0.0068926467,0.0054457537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080869126,0.00039299528,0.0044359453,0.00085650064,0.00015718694,0.00029268052,0.00074911927,0.038032744,0.021169076,0.7555138,0.032949187,0.14464206],"study_design_scores_gemma":[0.00007089476,0.00015208987,0.00092109817,0.00011618963,0.000095292664,0.0002579592,0.00011197636,0.18086344,0.0087782275,0.7972898,0.011240075,0.000102929465],"about_ca_topic_score_codex":0.0023168647,"about_ca_topic_score_gemma":0.004205965,"teacher_disagreement_score":0.017874427,"about_ca_system_score_codex":0.0031258066,"about_ca_system_score_gemma":0.0025844013,"threshold_uncertainty_score":0.059795916},"labels":[],"label_agreement":null},{"id":"W2760764316","doi":"10.3390/e19100524","title":"On the Limiting Behaviour of the Fundamental Geodesics of Information Geometry","year":2017,"lang":"en","type":"article","venue":"Entropy","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Information geometry; Geodesic; Variety (cybernetics); Exponential family; Limiting; Mathematics; Exponential function; Categorical variable; Geometry; Exponential map (Riemannian geometry); Computer science; Theoretical computer science; Calculus (dental); Applied mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.05687508976505291,"score_gpt":0.3289244262521153,"score_spread":0.2720493364870624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760764316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2467026,0.0034800987,0.6933619,0.006972894,0.00014450817,0.00010337623,0.000604334,0.00035936004,0.048270985],"genre_scores_gemma":[0.91567403,0.0033583564,0.06981899,0.0007565027,0.00045094907,0.00022028219,0.00055216986,0.00029478475,0.008873987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745315,0.0014669546,0.00011913451,0.00033346206,0.00042882797,0.0001985417],"domain_scores_gemma":[0.97556794,0.017247984,0.001932058,0.0016263123,0.0018699764,0.0017558712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006721735,0.0008786995,0.00096138276,0.0028754072,0.0016428971,0.0033715148,0.0015725549,0.001968819,0.005362261],"category_scores_gemma":[0.037626658,0.0005278008,0.001177934,0.0012524113,0.0065422086,0.007632611,0.0039150654,0.0030423007,0.000718703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152549255,0.000008083407,0.00046449192,0.000035992354,0.000006914229,0.000062529616,0.00017821492,0.005350358,0.00023679047,0.99021435,0.00064814667,0.0027789231],"study_design_scores_gemma":[0.000005972463,0.000023944822,0.00057088456,0.000031874573,0.0000053151193,0.00009559541,0.00006795319,0.05352361,0.00014610116,0.9439687,0.0015419367,0.000018042054],"about_ca_topic_score_codex":0.0023460991,"about_ca_topic_score_gemma":0.00124425,"teacher_disagreement_score":0.006721735,"about_ca_system_score_codex":0.0024111278,"about_ca_system_score_gemma":0.00089961523,"threshold_uncertainty_score":0.03554833},"labels":[],"label_agreement":null},{"id":"W2771530456","doi":"","title":"An Auxiliary Variable Method for MCMC Algorithms in High Dimension","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Dimension (graph theory); Variable (mathematics); Algorithm; Markov chain Monte Carlo; Computer science; Mathematics; Artificial intelligence; Bayesian probability; Mathematical analysis; Combinatorics","score_opus":0.045602973276011045,"score_gpt":0.3436116000301522,"score_spread":0.29800862675414114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771530456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045856356,0.0001424199,0.9987255,0.000058583388,0.000027815897,0.000019148276,0.000018061111,0.00014658165,0.00040339184],"genre_scores_gemma":[0.05789855,0.000526185,0.9370693,0.00018746164,0.0001354839,0.0006700199,0.00023315632,0.00042846132,0.002851401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985422,0.0008693377,0.000048337384,0.00011513015,0.00036268533,0.00006229771],"domain_scores_gemma":[0.99614716,0.0028166526,0.00019563483,0.00034157996,0.00038517473,0.00011376094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031662483,0.0011013944,0.0011039586,0.0012996874,0.00085033476,0.0010581813,0.0022951958,0.0016756648,0.0052466253],"category_scores_gemma":[0.010522551,0.00086813193,0.00091934344,0.0017827149,0.0018360496,0.0010952052,0.0020209749,0.0037320533,0.0016409827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015543766,0.00008834328,0.0011010588,0.0002972676,0.00014540694,0.00015786091,0.00019402325,0.58023036,0.0037553106,0.2912828,0.0054838336,0.1171082],"study_design_scores_gemma":[0.000014721076,0.000013709269,0.000057956462,0.000020469419,0.0000072376415,0.000018928427,0.0000053819763,0.9650118,0.0004566276,0.030258028,0.004125074,0.000010154516],"about_ca_topic_score_codex":0.0046272315,"about_ca_topic_score_gemma":0.0059931586,"teacher_disagreement_score":0.0052466253,"about_ca_system_score_codex":0.0010063977,"about_ca_system_score_gemma":0.0020677694,"threshold_uncertainty_score":0.01755178},"labels":[],"label_agreement":null},{"id":"W2775655892","doi":"","title":"Fast spatial inference in the homogeneous Ising model","year":2017,"lang":"en","type":"preprint","venue":"Iowa State University Digital Repository (Iowa State University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Ising model; Inference; Markov chain Monte Carlo; Bayesian inference; Statistical physics; Statistical inference; Computer science; Monte Carlo method; Approximate inference; Homogeneous; Bayesian probability; Algorithm; Fraction (chemistry); Markov chain; Mathematics; Artificial intelligence; Physics; Machine learning; Statistics","score_opus":0.0503084491495291,"score_gpt":0.2737708450040077,"score_spread":0.22346239585447863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775655892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023932863,0.00023160173,0.9735482,0.00030860314,0.00002682074,0.000025177644,0.00012700196,0.00033338345,0.0014664424],"genre_scores_gemma":[0.6118767,0.0007205042,0.38086033,0.00024203697,0.00015793159,0.00014992044,0.00054749363,0.0002280646,0.005216969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998787,0.00061518245,0.00005481843,0.00019342423,0.00024747715,0.00010210837],"domain_scores_gemma":[0.987693,0.010265436,0.00050166494,0.0007386892,0.00058959273,0.00021169937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034351319,0.00055671914,0.0011799178,0.001207372,0.00090230134,0.0011434016,0.0019798204,0.0012261576,0.0027859544],"category_scores_gemma":[0.018651845,0.0006976786,0.00069573516,0.001335062,0.0017758565,0.002560732,0.0013883733,0.0016611471,0.00043953297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012825226,0.000037382208,0.0010153367,0.00007025554,0.00003390154,0.00012276937,0.00006943968,0.7365865,0.0012556874,0.23641533,0.0013157729,0.022949364],"study_design_scores_gemma":[0.00000824381,0.0000034687168,0.00007520509,0.0000036646559,0.000003209792,0.000009696533,0.0000040069904,0.92731035,0.00025584962,0.07213529,0.00018622758,0.0000048654765],"about_ca_topic_score_codex":0.015854748,"about_ca_topic_score_gemma":0.012497171,"teacher_disagreement_score":0.015854748,"about_ca_system_score_codex":0.0016189729,"about_ca_system_score_gemma":0.0022409097,"threshold_uncertainty_score":0.031524897},"labels":[],"label_agreement":null},{"id":"W2783091491","doi":"10.1109/cdc.2017.8264116","title":"A certainty equivalence result in team-optimal control of mean-field coupled Markov chains","year":2017,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Mathematical optimization; Markov decision process; Markov chain; Markov process; Rate of convergence; Uncountable set; Convergence (economics); Applied mathematics; Computer science; Discrete mathematics","score_opus":0.05954839183542278,"score_gpt":0.3669235920915725,"score_spread":0.3073752002561497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783091491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037804972,0.00048607698,0.9514536,0.00062815513,0.00005482946,0.000059192356,0.00008400015,0.00008685981,0.009342314],"genre_scores_gemma":[0.93524915,0.0007339292,0.05769003,0.0002268213,0.00015001412,0.00027413253,0.00012592017,0.000078165634,0.0054717893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721044,0.0011236679,0.00012533825,0.00060798787,0.0005806298,0.00035207203],"domain_scores_gemma":[0.9906522,0.007083116,0.0009041154,0.00038963027,0.00051902985,0.00045185297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051951637,0.0012023515,0.0027957244,0.0009128785,0.0009486687,0.0022749668,0.0019725573,0.0018637505,0.0038187471],"category_scores_gemma":[0.017859934,0.00074957963,0.0015341004,0.0008336532,0.00317681,0.0034784784,0.0031359594,0.0027369238,0.00024870626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007457624,0.000038986473,0.00033695425,0.00014202893,0.00008542098,0.000096224576,0.00013623977,0.5386228,0.0006720541,0.45205528,0.0006434637,0.007095927],"study_design_scores_gemma":[0.000018125344,0.00003393126,0.00010701335,0.000016099935,0.000013600796,0.000014352515,0.000015210106,0.85473233,0.00013550544,0.14451613,0.00038544482,0.000012242743],"about_ca_topic_score_codex":0.0044864975,"about_ca_topic_score_gemma":0.0016224734,"teacher_disagreement_score":0.0051951637,"about_ca_system_score_codex":0.0024387687,"about_ca_system_score_gemma":0.001840603,"threshold_uncertainty_score":0.027475},"labels":[],"label_agreement":null},{"id":"W2784647367","doi":"10.2172/1417145","title":"Metis: A Pure Metropolis Markov Chain Monte Carlo Bayesian Inference Library","year":2018,"lang":"en","type":"report","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Los Alamos National Laboratory; National Nuclear Security Administration; U.S. Department of Energy","keywords":"Markov chain Monte Carlo; Python (programming language); Computer science; Monte Carlo method; Bayesian probability; Metropolis–Hastings algorithm; Inference; Bayesian inference; Hybrid Monte Carlo; Markov chain; Data mining; Programming language; Machine learning; Artificial intelligence; Mathematics; Statistics","score_opus":0.0829649898829235,"score_gpt":0.3817781791954628,"score_spread":0.2988131893125393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784647367","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046531527,0.00021678396,0.9536363,0.00022997132,0.00009003136,0.00015247376,0.0038520796,0.036847867,0.0045091924],"genre_scores_gemma":[0.015322435,0.00051229616,0.95470566,0.0003952588,0.00016083276,0.0009765035,0.007829555,0.012025089,0.008072416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694854,0.0010331807,0.00019293732,0.00032527655,0.0013431127,0.00015711864],"domain_scores_gemma":[0.99484515,0.002877816,0.00038086475,0.0008576055,0.0008018783,0.00023681787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039506555,0.0017897919,0.001648724,0.0023998797,0.0010393298,0.0034433345,0.004564142,0.0020262096,0.060106017],"category_scores_gemma":[0.016910458,0.0016765089,0.0018351218,0.0020093399,0.0011270607,0.002728324,0.0033575357,0.003594371,0.034544207],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005166921,0.0003682486,0.003462178,0.0014145448,0.00060163863,0.00047356315,0.00030636828,0.13267489,0.005969376,0.18067376,0.29341984,0.38011885],"study_design_scores_gemma":[0.00023652424,0.000052416803,0.0006037405,0.00025257008,0.00006830614,0.00031120636,0.000028226468,0.61562395,0.008740409,0.1821468,0.19181418,0.000121770594],"about_ca_topic_score_codex":0.004764199,"about_ca_topic_score_gemma":0.009029645,"teacher_disagreement_score":0.060106017,"about_ca_system_score_codex":0.0011528844,"about_ca_system_score_gemma":0.0041894573,"threshold_uncertainty_score":0.20107466},"labels":[],"label_agreement":null},{"id":"W2788878495","doi":"10.1101/252650","title":"Exploring Approximate Bayesian Computation for inferring recent demographic history with genomic markers in non-model species","year":2018,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximate Bayesian computation; Biology; Genotyping; Population; Bayesian probability; Demographic history; Computational biology; Sample size determination; Haplotype; DNA sequencing; Genetics; Statistics; Computer science; Inference; Mathematics; Artificial intelligence; Genetic variation; Genotype; Gene","score_opus":0.10573574131724832,"score_gpt":0.2747991441725535,"score_spread":0.1690634028553052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788878495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05444625,0.00024265723,0.9432964,0.0003122545,0.00001968282,0.000042516836,0.00029177414,0.00077907334,0.0005694031],"genre_scores_gemma":[0.33329308,0.00023382498,0.6642275,0.00021178568,0.000039629023,0.00022874828,0.0009911372,0.00028429384,0.00049003545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976457,0.0015668075,0.00010472499,0.00030217122,0.00030779094,0.00007273922],"domain_scores_gemma":[0.98300683,0.013936098,0.0007782117,0.0009962491,0.0009834319,0.00029922725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074408287,0.0006569351,0.0014342285,0.0019883183,0.00078302715,0.0022155747,0.0022900694,0.0014295711,0.0021967564],"category_scores_gemma":[0.028889013,0.00096448197,0.0010074932,0.0022718776,0.0015040289,0.0022512537,0.0014066558,0.0015397986,0.00038507173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001387688,0.00006410351,0.007376488,0.00018216528,0.00015289395,0.00009338619,0.00017703309,0.9217148,0.0032855535,0.023505528,0.00093183585,0.042377446],"study_design_scores_gemma":[0.000008812327,0.0000049223245,0.00034473953,0.0000058635396,0.000004663671,0.000009540418,0.0000083209525,0.9894716,0.00024579337,0.009651434,0.000238518,0.0000058260925],"about_ca_topic_score_codex":0.018713407,"about_ca_topic_score_gemma":0.017112132,"teacher_disagreement_score":0.018713407,"about_ca_system_score_codex":0.0019516225,"about_ca_system_score_gemma":0.0017461486,"threshold_uncertainty_score":0.039351344},"labels":[],"label_agreement":null},{"id":"W2789150830","doi":"10.1142/9789811206092_0003","title":"The Algebraic Approach to Duality: An Introduction","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes series, Institute For Mathematical Sciences","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Algebraic number; Algebra over a field; Mathematics; Dual (grammatical number); Product (mathematics); Pure mathematics; Representation theory; Representation (politics); Lie algebra","score_opus":0.15755430127646547,"score_gpt":0.38175730246982875,"score_spread":0.22420300119336328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789150830","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008902777,0.33437103,0.308299,0.021295045,0.011175299,0.00013165477,0.00063699926,0.0003691385,0.314819],"genre_scores_gemma":[0.23575246,0.4618472,0.15960158,0.016234273,0.047868602,0.0006345594,0.00096176413,0.0007363342,0.076363266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893564,0.00042817305,0.00006688077,0.00018749412,0.00028582517,0.000095966505],"domain_scores_gemma":[0.9983864,0.001176585,0.00006906721,0.00008676992,0.00018529655,0.00009593972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306306,0.0008436212,0.0012250917,0.0036503584,0.001919337,0.0038683563,0.0011693761,0.0022146506,0.01136413],"category_scores_gemma":[0.0025555757,0.00075364724,0.0011387038,0.004024708,0.004096852,0.008339729,0.0024435925,0.0061203004,0.0027694602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054952993,0.000025369716,0.0001443782,0.0002137152,0.000006001988,0.000049516544,0.00015466522,0.00037774837,0.00014712306,0.97733134,0.0063645784,0.0151800215],"study_design_scores_gemma":[0.0000038432677,0.00002775123,0.00022513779,0.0002458516,0.0000060921852,0.00032184395,0.000105383086,0.0014781543,0.00009909706,0.789893,0.20757547,0.000018341114],"about_ca_topic_score_codex":0.0009941383,"about_ca_topic_score_gemma":0.00072884804,"teacher_disagreement_score":0.01136413,"about_ca_system_score_codex":0.0021656146,"about_ca_system_score_gemma":0.0010768637,"threshold_uncertainty_score":0.038016796},"labels":[],"label_agreement":null},{"id":"W2792333427","doi":"10.5539/ijsp.v7n3p1","title":"On Estimating Non-standard Discrete Distributions Using Adaptive MCMC Methods","year":2018,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Estimator; Metropolis–Hastings algorithm; Context (archaeology); Markov chain Monte Carlo; Bayesian probability; Algorithm; Computer science; Mathematics; Mathematical optimization; Statistics","score_opus":0.08588770118554405,"score_gpt":0.4478601738561669,"score_spread":0.3619724726706228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792333427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03318982,0.0006229459,0.964586,0.00018083949,0.0000303367,0.00010159299,0.00005843984,0.0003159891,0.0009140536],"genre_scores_gemma":[0.3444439,0.00090143766,0.65283436,0.0001702092,0.000073835414,0.00028382568,0.0003830092,0.00019759379,0.00071191863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99032253,0.007104552,0.0002708745,0.00061574724,0.0014849183,0.00020147681],"domain_scores_gemma":[0.85170716,0.1373662,0.002515637,0.0049549323,0.003014846,0.00044111707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01873737,0.0012069109,0.0011491358,0.0021678128,0.0009034894,0.0014709255,0.0020701764,0.0020408547,0.0018940857],"category_scores_gemma":[0.104350775,0.00054206117,0.0006361612,0.0020071121,0.002086836,0.0027424896,0.0017500794,0.0022861962,0.0004061493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033685094,0.00014220722,0.005406006,0.00023400794,0.00019763883,0.000098496734,0.00017317127,0.8669368,0.0015779472,0.044792045,0.00059964217,0.079505324],"study_design_scores_gemma":[0.00003206997,0.000047990216,0.0007745394,0.000024641906,0.000015568454,0.0000399442,0.000019755624,0.98346704,0.00083842984,0.014423872,0.00029219498,0.000023975563],"about_ca_topic_score_codex":0.010384785,"about_ca_topic_score_gemma":0.0068052756,"teacher_disagreement_score":0.01873737,"about_ca_system_score_codex":0.0010932471,"about_ca_system_score_gemma":0.0022223282,"threshold_uncertainty_score":0.099093914},"labels":[],"label_agreement":null},{"id":"W2796386963","doi":"10.1214/24-ejs2256","title":"Computationally efficient inference for latent position network models","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Vienna Science and Technology Fund; Insight SFI Research Centre for Data Analytics; Science Foundation Ireland","keywords":"Inference; Computer science; Markov chain Monte Carlo; Computational complexity theory; Algorithm; Markov chain; Likelihood function; Mathematical optimization; Statistical inference; Mathematics; Monte Carlo method; Theoretical computer science; Machine learning; Artificial intelligence; Estimation theory; Statistics","score_opus":0.044219087322420254,"score_gpt":0.35783005411772345,"score_spread":0.3136109667953032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796386963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00804892,0.00010996481,0.9904129,0.00024829776,0.000015207964,0.00002748609,0.000109088876,0.00029192498,0.0007362235],"genre_scores_gemma":[0.40466887,0.0004266848,0.5890748,0.00025328697,0.00019273101,0.00039393196,0.0012040922,0.00037786644,0.003407694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978421,0.0012561594,0.00007872949,0.00034435015,0.0003284509,0.00015018831],"domain_scores_gemma":[0.97898906,0.018394228,0.0007781133,0.0011062975,0.00043559214,0.00029675863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036358142,0.00085134775,0.0015706643,0.0018583321,0.0010626084,0.0019266971,0.0029418054,0.0019914678,0.004990209],"category_scores_gemma":[0.029273037,0.0010808624,0.0011248051,0.0020005323,0.0018172979,0.0037328145,0.0023710693,0.0032467598,0.0010601509],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012652697,0.00009735182,0.0021047506,0.00013162421,0.00006941495,0.00018238781,0.00020294564,0.7958161,0.0007346655,0.16329929,0.0019395713,0.035295345],"study_design_scores_gemma":[0.000011481695,0.0000038576995,0.00008782847,0.000006710409,0.000004157807,0.000015376563,0.0000120144,0.93068516,0.00011964451,0.068782054,0.00026697002,0.000004726169],"about_ca_topic_score_codex":0.0064992886,"about_ca_topic_score_gemma":0.011704108,"teacher_disagreement_score":0.0064992886,"about_ca_system_score_codex":0.0018702976,"about_ca_system_score_gemma":0.0021202858,"threshold_uncertainty_score":0.01922822},"labels":[],"label_agreement":null},{"id":"W2800446008","doi":"10.1007/978-3-319-79033-6_3","title":"Finite-Action Approximation of Markov Decision Processes","year":2018,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Markov decision process; Control theory (sociology); Controller (irrigation); Actuator; Computer science; Markov chain; Partially observable Markov decision process; Optimal control; Discretization; Quantization (signal processing); Markov process; Transmission (telecommunications); Mathematical optimization; Mathematics; Markov model; Control (management); Algorithm; Artificial intelligence; Telecommunications","score_opus":0.07599065223292019,"score_gpt":0.3337092000526165,"score_spread":0.25771854781969633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800446008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035132263,0.0029639767,0.97471046,0.00058808876,0.00018439264,0.000015942847,0.00014935304,0.00020531248,0.01766931],"genre_scores_gemma":[0.5240186,0.012872237,0.40297595,0.00047558945,0.0009464988,0.00034199213,0.0013539823,0.0004334576,0.0565817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993351,0.00027288464,0.00002452355,0.00008767058,0.00023200424,0.000047786467],"domain_scores_gemma":[0.99696666,0.0025355879,0.0001015715,0.00016182564,0.00017010869,0.00006420615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012043873,0.0009662736,0.0014365161,0.0006335531,0.00034400978,0.0015589299,0.0015795586,0.0011312492,0.006449401],"category_scores_gemma":[0.0054440494,0.00068434677,0.0010060506,0.0010100593,0.001470247,0.0016966542,0.0009265154,0.0029610165,0.0012561459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020874242,0.000029958659,0.00018172293,0.000100713696,0.000029463325,0.000028995395,0.000055894237,0.2126117,0.0002223543,0.75709635,0.0036667667,0.025955176],"study_design_scores_gemma":[0.0000058084806,0.0000053433732,0.00006339295,0.000032301432,0.000005351145,0.000012410618,0.000005984294,0.53737324,0.00008317658,0.4592999,0.0031057943,0.0000072632665],"about_ca_topic_score_codex":0.0059665553,"about_ca_topic_score_gemma":0.0039689434,"teacher_disagreement_score":0.006449401,"about_ca_system_score_codex":0.0018599409,"about_ca_system_score_gemma":0.0013355542,"threshold_uncertainty_score":0.021575391},"labels":[],"label_agreement":null},{"id":"W2804308277","doi":"10.1016/j.epidem.2018.05.009","title":"Kernel-density estimation and approximate Bayesian computation for flexible epidemiological model fitting in Python","year":2018,"lang":"en","type":"article","venue":"Epidemics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Approximate Bayesian computation; Computer science; Python (programming language); Computation; Bayesian probability; Data mining; Metric (unit); Kernel (algebra); Machine learning; Algorithm; Artificial intelligence; Inference; Mathematics","score_opus":0.15282722089521425,"score_gpt":0.4247517064203,"score_spread":0.27192448552508575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804308277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008243851,0.000037909038,0.97353053,0.00009893121,0.000025771495,0.000048287144,0.00042437084,0.023850398,0.0011593004],"genre_scores_gemma":[0.03758929,0.00015775574,0.9486226,0.00017973043,0.00004039843,0.00050973083,0.0013946407,0.008345844,0.0031599586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980812,0.000609905,0.00023406539,0.00025626985,0.00065547234,0.00016307006],"domain_scores_gemma":[0.99278873,0.0045305854,0.00038250434,0.0012575452,0.0008206667,0.00021999126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046773297,0.0014845576,0.0013218512,0.0013363021,0.0010068623,0.00282919,0.0047622165,0.0019161461,0.04567745],"category_scores_gemma":[0.027245117,0.0014847182,0.002180878,0.002003115,0.001403852,0.0039801826,0.0037219543,0.0035438032,0.014420304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092664,0.0003758637,0.0046560224,0.0011812827,0.000273059,0.00069742557,0.0010261978,0.23758762,0.004672474,0.29771814,0.08007224,0.3712305],"study_design_scores_gemma":[0.0000915184,0.000017511442,0.0003408792,0.00007018632,0.000015548641,0.00010936774,0.00003395993,0.8559147,0.0019403828,0.11962984,0.02179501,0.000041045143],"about_ca_topic_score_codex":0.0075252005,"about_ca_topic_score_gemma":0.011740888,"teacher_disagreement_score":0.04567745,"about_ca_system_score_codex":0.0016833986,"about_ca_system_score_gemma":0.0035807127,"threshold_uncertainty_score":0.15280628},"labels":[],"label_agreement":null},{"id":"W2807944195","doi":"10.1016/j.laa.2018.06.008","title":"Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Upper and lower bounds; Matrix (chemical analysis); Combinatorics; Lattice (music); Statistical mechanics; Transfer matrix; Linear algebra; Exponential function; Discrete mathematics; Geometry; Mathematical analysis; Statistical physics","score_opus":0.04425466867808875,"score_gpt":0.35572356940501565,"score_spread":0.3114689007269269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807944195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09033471,0.004650789,0.856873,0.00293428,0.00038143882,0.00018766116,0.00070945546,0.0007371403,0.043191615],"genre_scores_gemma":[0.83108115,0.0061147027,0.13476083,0.0012335305,0.0011802635,0.0010704821,0.0011297459,0.00086196477,0.022567332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958039,0.0016202822,0.00016161114,0.00059784844,0.0010714289,0.0007450118],"domain_scores_gemma":[0.914907,0.06948421,0.003761526,0.004563016,0.0038680197,0.0034162425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00792581,0.0032279291,0.0033153852,0.005098149,0.002527394,0.0049044723,0.0057286387,0.0038354357,0.011511275],"category_scores_gemma":[0.05632253,0.0023263344,0.0024691678,0.003766446,0.008114102,0.010428618,0.0076050023,0.009453706,0.0017793737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013368813,0.000094301155,0.000747811,0.00024908126,0.000058703605,0.00011252913,0.00033820933,0.1058234,0.0018524234,0.8784716,0.0034266894,0.008691656],"study_design_scores_gemma":[0.000017697444,0.000022831146,0.00034408687,0.00009075572,0.000026127254,0.00006324198,0.00006299687,0.51529753,0.0010735374,0.48184407,0.0010984518,0.000058744292],"about_ca_topic_score_codex":0.0030685852,"about_ca_topic_score_gemma":0.0028741646,"teacher_disagreement_score":0.011511275,"about_ca_system_score_codex":0.0038112823,"about_ca_system_score_gemma":0.0025689637,"threshold_uncertainty_score":0.04191619},"labels":[],"label_agreement":null},{"id":"W2834583499","doi":"10.1109/tsp.2019.2905816","title":"Invertible Particle-Flow-Based Sequential MCMC With Extension to Gaussian Mixture Noise Models","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Markov chain Monte Carlo; Extension (predicate logic); Gaussian noise; Noise (video); Computer science; Flow (mathematics); Mixture model; Algorithm; Gaussian; Mathematics; Applied mathematics; Artificial intelligence; Bayesian probability; Physics","score_opus":0.0627742192309373,"score_gpt":0.3122832249035105,"score_spread":0.24950900567257323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2834583499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023580925,0.000046689132,0.9969892,0.000041881616,0.000015474327,0.000019134684,0.000016788159,0.00018214333,0.00033065508],"genre_scores_gemma":[0.34824207,0.00031750713,0.64686584,0.00017920934,0.000108224194,0.00030809923,0.0003580666,0.00022565993,0.0033953644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991673,0.00023214101,0.000046627163,0.00018645798,0.00028739223,0.00008007276],"domain_scores_gemma":[0.997544,0.0015789195,0.00016964908,0.00023216559,0.00038814955,0.00008702674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018001246,0.0008247886,0.0012381903,0.0007720422,0.00056004204,0.00069520995,0.0018596451,0.0011422461,0.0025708533],"category_scores_gemma":[0.006828759,0.00068161334,0.0011145974,0.00090863724,0.0010130844,0.0011590094,0.001423538,0.0018758435,0.0005440911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010064477,0.000056245557,0.0008720327,0.000091204616,0.000053962223,0.000090646354,0.0001197821,0.8755828,0.0020870625,0.03712255,0.000997616,0.08282545],"study_design_scores_gemma":[0.000004001275,0.000004222547,0.000030002242,0.0000015449243,0.0000027257379,0.0000062868503,0.0000012670602,0.9968612,0.00023763272,0.0026394797,0.00020852951,0.0000031402806],"about_ca_topic_score_codex":0.0143769365,"about_ca_topic_score_gemma":0.011187758,"teacher_disagreement_score":0.0143769365,"about_ca_system_score_codex":0.00082260853,"about_ca_system_score_gemma":0.0023392953,"threshold_uncertainty_score":0.028586507},"labels":[],"label_agreement":null},{"id":"W2884671012","doi":"10.1016/j.gde.2018.06.016","title":"Fine-tuning of Approximate Bayesian Computation for human population genomics","year":2018,"lang":"en","type":"review","venue":"Current Opinion in Genetics & Development","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Trinity College Dublin; Wellcome Trust","keywords":"Approximate Bayesian computation; Inference; Genomics; Biology; Bayesian probability; Population; Adaptation (eye); Set (abstract data type); Bayesian inference; Variety (cybernetics); Computer science; Evolutionary biology; Computational biology; Machine learning; Artificial intelligence; Genome; Genetics","score_opus":0.29157481377522565,"score_gpt":0.48182327365431504,"score_spread":0.1902484598790894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884671012","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020733783,0.017114582,0.9764034,0.0007481094,0.00015478843,0.000023358127,0.000100304525,0.0007456776,0.0026363842],"genre_scores_gemma":[0.12573314,0.036112547,0.8304236,0.00092363555,0.0007121515,0.0002621831,0.00070538814,0.0009485683,0.004178791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869883,0.000683834,0.000058178124,0.00022034626,0.00029072587,0.000047973772],"domain_scores_gemma":[0.99137384,0.0072265766,0.00021293135,0.000518619,0.000556752,0.00011122316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039609172,0.0009069346,0.0019987081,0.0011644003,0.00037909838,0.0014721889,0.0030094234,0.0017399647,0.0060223886],"category_scores_gemma":[0.018528251,0.00066992454,0.000996367,0.0013232221,0.0013101652,0.0020220638,0.0020109506,0.0026322172,0.0017996123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108089676,0.00006418097,0.0012012706,0.0011738973,0.00023584349,0.00006949432,0.00012386186,0.2394103,0.002554869,0.16682512,0.008176201,0.5800569],"study_design_scores_gemma":[0.000050554547,0.000044271725,0.00077647145,0.00032593822,0.0000826783,0.00021162958,0.000035153185,0.67493457,0.0019920603,0.28742343,0.034065265,0.000057933987],"about_ca_topic_score_codex":0.0041467124,"about_ca_topic_score_gemma":0.0042225174,"teacher_disagreement_score":0.0060223886,"about_ca_system_score_codex":0.0011691927,"about_ca_system_score_gemma":0.0016717304,"threshold_uncertainty_score":0.020947635},"labels":[],"label_agreement":null},{"id":"W2885453894","doi":"10.1017/jpr.2020.83","title":"Simple conditions for metastability of continuous Markov chains","year":2021,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Metastability; Spectral gap; Markov chain; Mixing (physics); Statistical physics; BETA (programming language); Random walk; Hamiltonian (control theory); Mathematics; Combinatorics; Markov chain Monte Carlo; Physics; Monte Carlo method; Discrete mathematics; Mathematical analysis; Quantum mechanics; Computer science; Statistics; Mathematical optimization","score_opus":0.06662939110306687,"score_gpt":0.3574985404471397,"score_spread":0.2908691493440728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885453894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58073133,0.00055993383,0.39294994,0.0023505522,0.00014391259,0.00021405134,0.0007665671,0.0011544512,0.021129167],"genre_scores_gemma":[0.99021006,0.000055510627,0.008213948,0.00015623,0.00005505868,0.00010296239,0.0001638729,0.00007063913,0.00097186124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974727,0.0006329715,0.00020451625,0.00059240573,0.0005597222,0.00053762156],"domain_scores_gemma":[0.9769952,0.014049604,0.0023537544,0.0014921603,0.002147321,0.0029619592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030769184,0.0006453146,0.0011150467,0.0018730377,0.0017730827,0.0017694487,0.0014688231,0.002120526,0.008131629],"category_scores_gemma":[0.029636811,0.0006493788,0.0010427878,0.00059926964,0.0029216101,0.0034442309,0.002618823,0.0026853406,0.0006025709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033261726,0.00015045992,0.0057243425,0.00013461323,0.00007096339,0.0012376612,0.00075400615,0.036333498,0.015492677,0.93426263,0.00163427,0.0038721703],"study_design_scores_gemma":[0.000085023545,0.00013903619,0.0017234945,0.00005215548,0.000022142392,0.00045852392,0.00021225978,0.3928498,0.005032806,0.5980934,0.001266021,0.00006534816],"about_ca_topic_score_codex":0.0016881452,"about_ca_topic_score_gemma":0.0013917409,"teacher_disagreement_score":0.008131629,"about_ca_system_score_codex":0.0017815551,"about_ca_system_score_gemma":0.0010574134,"threshold_uncertainty_score":0.027202964},"labels":[],"label_agreement":null},{"id":"W2886379631","doi":"10.1007/s11222-019-09863-3","title":"Weight-preserving simulated tempering","year":2019,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Tempering; Parallel tempering; Limit (mathematics); Inverse; Mode (computer interface); Algorithm; Computer science; Mathematical optimization; Inverse problem; Mathematics; Artificial intelligence; Markov chain Monte Carlo; Bayesian probability; Materials science; Mathematical analysis","score_opus":0.03143586418334571,"score_gpt":0.3309175520846992,"score_spread":0.2994816879013535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886379631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010007933,0.000055206525,0.98759556,0.0000798112,0.00002925522,0.00005059855,0.0000283264,0.0003432609,0.001810021],"genre_scores_gemma":[0.40747905,0.00015870422,0.58693707,0.00018771812,0.000065040906,0.0003517733,0.00020172485,0.0004460038,0.0041729044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988814,0.0004500943,0.00006427256,0.00023007276,0.0002900161,0.00008411616],"domain_scores_gemma":[0.9963246,0.001777173,0.00031882015,0.0009873324,0.0004155051,0.00017658663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020384388,0.00074052607,0.00092551054,0.00061080913,0.00085550686,0.00124247,0.0019446355,0.0012265671,0.0031785064],"category_scores_gemma":[0.011914843,0.0005919357,0.0009818943,0.00064616546,0.0018528935,0.0016719605,0.0018853176,0.001858863,0.00083893735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010650599,0.000044526147,0.0012862062,0.00008147816,0.00007932822,0.000106499894,0.00017495347,0.79181767,0.0055918624,0.16505839,0.0014084927,0.03424409],"study_design_scores_gemma":[0.000011894717,0.000016730433,0.00006230948,0.0000075264984,0.000006466947,0.000023204571,0.000006386438,0.965886,0.001569207,0.03105614,0.0013460775,0.000008041234],"about_ca_topic_score_codex":0.001866944,"about_ca_topic_score_gemma":0.0014895032,"teacher_disagreement_score":0.0031785064,"about_ca_system_score_codex":0.0011417097,"about_ca_system_score_gemma":0.0009321234,"threshold_uncertainty_score":0.010780394},"labels":[],"label_agreement":null},{"id":"W2886985140","doi":"10.1007/s00222-022-01164-3","title":"Rigidity of proper colorings of $${\\mathbb {Z}}^{d}$$","year":2022,"lang":"la","type":"article","venue":"Inventiones mathematicae","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Lattice (music); Mathematical physics; Physics; Graph","score_opus":0.10491512876691357,"score_gpt":0.3403689980321439,"score_spread":0.23545386926523032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886985140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39964008,0.0007507555,0.44654593,0.0038149331,0.00074193924,0.00016446023,0.0022941392,0.0013562926,0.14469144],"genre_scores_gemma":[0.8781555,0.00055909064,0.06906624,0.0015820769,0.0004064051,0.00034150007,0.002225841,0.001346702,0.04631662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969388,0.000737397,0.00013192398,0.00087908865,0.0005869898,0.0007257896],"domain_scores_gemma":[0.9897752,0.005728452,0.0009255278,0.0014087496,0.00073069456,0.0014313688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017555502,0.0014688218,0.001746033,0.0026994208,0.0048593306,0.0060952273,0.0031792556,0.0022757775,0.017226301],"category_scores_gemma":[0.009301304,0.00237964,0.0021302223,0.002261664,0.0057820007,0.005401907,0.0043188934,0.0065517086,0.0025799714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082592494,0.000029493976,0.0001786112,0.000026692358,0.000009121946,0.000043284468,0.00021899915,0.0019558526,0.00051391707,0.9928867,0.0019477854,0.0021069793],"study_design_scores_gemma":[0.000023433016,0.000009305307,0.0002225159,0.000012925819,0.000009181569,0.000034550798,0.000058177582,0.006528219,0.0003865338,0.99104625,0.0016524211,0.000016595102],"about_ca_topic_score_codex":0.003927048,"about_ca_topic_score_gemma":0.0040088077,"teacher_disagreement_score":0.017226301,"about_ca_system_score_codex":0.0027324348,"about_ca_system_score_gemma":0.0017073635,"threshold_uncertainty_score":0.057627738},"labels":[],"label_agreement":null},{"id":"W2891909641","doi":"10.1093/molbev/msy173","title":"Conditional Approximate Bayesian Computation: A New Approach for Across-Site Dependency in High-Dimensional Mutation–Selection Models","year":2018,"lang":"en","type":"article","venue":"Molecular Biology and Evolution","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Compute Canada","keywords":"Biology; Selection (genetic algorithm); Approximate Bayesian computation; Dependency (UML); Mutation; Computation; Bayesian probability; Computational biology; Evolutionary biology; Genetics; Machine learning; Artificial intelligence; Computer science; Algorithm; Gene","score_opus":0.035501109519433235,"score_gpt":0.3584862081407111,"score_spread":0.32298509862127783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891909641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010625059,0.00011258601,0.9980374,0.00014799094,0.000017159746,0.000022627157,0.000050605857,0.00016183281,0.00038731293],"genre_scores_gemma":[0.09233352,0.0005793849,0.9020768,0.00037166348,0.00022463361,0.0004600384,0.00057089655,0.0006077029,0.0027753182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719524,0.0015927838,0.0001318725,0.0003102755,0.0006252705,0.00014461443],"domain_scores_gemma":[0.98790526,0.008955071,0.0005989282,0.0010360663,0.001193327,0.00031128546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005461631,0.0014074409,0.0021507016,0.002165046,0.0012863587,0.0022878947,0.0042726607,0.0022049334,0.005170757],"category_scores_gemma":[0.026648339,0.0015729121,0.0020274327,0.002696229,0.0021509123,0.0024148696,0.003561309,0.0043142927,0.0011113326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077454206,0.000056629382,0.0014531336,0.00019874962,0.00016653095,0.00016738409,0.0001942119,0.6522381,0.0011362454,0.26166233,0.00397417,0.07867513],"study_design_scores_gemma":[0.000009203063,0.0000062729587,0.00007494611,0.000015102073,0.000009736926,0.00002202735,0.000007400627,0.9203966,0.00013490197,0.07776444,0.0015476939,0.000011532499],"about_ca_topic_score_codex":0.017443195,"about_ca_topic_score_gemma":0.017735418,"teacher_disagreement_score":0.017443195,"about_ca_system_score_codex":0.002291652,"about_ca_system_score_gemma":0.0042606373,"threshold_uncertainty_score":0.034683287},"labels":[],"label_agreement":null},{"id":"W2896218014","doi":"10.1007/s11856-023-2555-z","title":"Mixing times and hitting times for general Markov processes","year":2023,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Mathematics; Mixing (physics); Hitting time; Markov property; Multiplicative function; Markov chain mixing time; Equivalence (formal languages); Markov process; Markov renewal process; Examples of Markov chains; Pure mathematics; Statistical physics; Discrete mathematics; Applied mathematics; Markov model; Mathematical analysis; Statistics","score_opus":0.07111708762488761,"score_gpt":0.36669253606165164,"score_spread":0.29557544843676403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896218014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30019516,0.0016429174,0.68535644,0.0011072626,0.00010654662,0.00012075017,0.0003242837,0.00036493418,0.010781736],"genre_scores_gemma":[0.9569313,0.0006909895,0.03749607,0.00018088738,0.00015975529,0.00020596394,0.00033475307,0.00013947692,0.003860898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651176,0.0011630928,0.00021386657,0.0009211318,0.00078323716,0.00040696596],"domain_scores_gemma":[0.9661252,0.025893891,0.0031521148,0.0017327433,0.0016050034,0.0014909898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008453049,0.0011685836,0.0013135199,0.002765541,0.0013398419,0.002780276,0.0022398864,0.002368109,0.006675878],"category_scores_gemma":[0.05095945,0.0008264537,0.0012540885,0.0014228249,0.0046035615,0.005304858,0.0023651877,0.0036737865,0.00044704904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080963626,0.000025725389,0.0014674473,0.000084262014,0.000045151828,0.00018852632,0.00028195523,0.04017678,0.0017671175,0.9520362,0.00029484672,0.003550972],"study_design_scores_gemma":[0.000021618398,0.000027857814,0.0006680213,0.00003185992,0.000020364267,0.000100149584,0.000047108188,0.34018487,0.0008353965,0.6574132,0.0006203219,0.000029304167],"about_ca_topic_score_codex":0.0016558053,"about_ca_topic_score_gemma":0.00097483344,"teacher_disagreement_score":0.008453049,"about_ca_system_score_codex":0.0025310367,"about_ca_system_score_gemma":0.00090576493,"threshold_uncertainty_score":0.044704556},"labels":[],"label_agreement":null},{"id":"W2898624802","doi":"10.1137/1.9781611975482.134","title":"Improved Bounds for Randomly Sampling Colorings via Linear Programming","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Glauber; Mathematics; Combinatorics; Mixing (physics); Discrete mathematics; Conjecture; Constant (computer programming); Graph coloring; Graph; Computer science; Physics","score_opus":0.15463733064271867,"score_gpt":0.3309351898011887,"score_spread":0.17629785915847002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898624802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030149743,0.003951839,0.8956593,0.004145704,0.0005180638,0.00026341714,0.0008705554,0.0023580615,0.06208336],"genre_scores_gemma":[0.55180144,0.004117796,0.38975957,0.0038096611,0.0017183955,0.0016045813,0.0024131672,0.0028025976,0.041972842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99149865,0.0032676933,0.00020590497,0.0016613908,0.0018051484,0.0015611206],"domain_scores_gemma":[0.9337979,0.054727558,0.0018339742,0.005294779,0.0026856414,0.0016602313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009359975,0.0040495233,0.003685385,0.0025661478,0.0023133217,0.0056799226,0.0070631164,0.0029361951,0.017362334],"category_scores_gemma":[0.051576428,0.0017860543,0.0025841922,0.0033016345,0.0050068554,0.011884823,0.0065121166,0.013176792,0.004007892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067449047,0.00046870467,0.0017394169,0.0006461596,0.00016471694,0.00018212953,0.00040674943,0.33139595,0.003163629,0.590247,0.01788279,0.0530283],"study_design_scores_gemma":[0.000032707067,0.00006811123,0.00021968677,0.0000735298,0.00003161208,0.00004360761,0.000037472702,0.7265778,0.0008047687,0.2696642,0.0024173476,0.000029163739],"about_ca_topic_score_codex":0.0036559016,"about_ca_topic_score_gemma":0.0052907034,"teacher_disagreement_score":0.017362334,"about_ca_system_score_codex":0.006957451,"about_ca_system_score_gemma":0.0040744212,"threshold_uncertainty_score":0.05808276},"labels":[],"label_agreement":null},{"id":"W2905049628","doi":"10.48550/arxiv.1812.03250","title":"The $k$-conversion number of regular graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Maximal independent set; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.11877216851909231,"score_gpt":0.25572453740876533,"score_spread":0.13695236888967302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905049628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87811047,0.00070766144,0.07066192,0.0008373675,0.000063572406,0.00016134602,0.0012591606,0.0010166018,0.047181804],"genre_scores_gemma":[0.96908957,0.00044767652,0.021535538,0.00019921074,0.00004616867,0.00016424694,0.0010312297,0.00016179647,0.007324537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876946,0.00016950634,0.000104275976,0.00042361818,0.00029965947,0.00023340977],"domain_scores_gemma":[0.99542314,0.0022644023,0.0005932961,0.0007954264,0.00037197268,0.000551725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058538903,0.00048732565,0.00057144585,0.0015244277,0.0011195281,0.0020026108,0.0013920864,0.000740379,0.005075927],"category_scores_gemma":[0.004568674,0.0005339997,0.0007164682,0.0011786614,0.0022621858,0.0027745347,0.0012161232,0.001212485,0.00067395024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010484383,0.0003434133,0.011786273,0.0007710267,0.00012447432,0.0011374549,0.0019146296,0.06717605,0.041154,0.7462085,0.01077684,0.11755883],"study_design_scores_gemma":[0.00019358081,0.00038816573,0.011164534,0.00018066392,0.00014220383,0.0034847918,0.0009084001,0.22101146,0.03466059,0.7038615,0.023845524,0.00015854803],"about_ca_topic_score_codex":0.0012072283,"about_ca_topic_score_gemma":0.0011051139,"teacher_disagreement_score":0.005075927,"about_ca_system_score_codex":0.0012755624,"about_ca_system_score_gemma":0.00061090256,"threshold_uncertainty_score":0.016980708},"labels":[],"label_agreement":null},{"id":"W2911264190","doi":"10.1109/wsc.2018.8632237","title":"EXACT POSTERIOR SIMULATION FROM THE LINEAR LASSO REGRESSION","year":2018,"lang":"en","type":"article","venue":"2018 Winter Simulation Conference (WSC)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Lasso (programming language); Computer science; Linear regression; Artificial intelligence; Statistics; Mathematics; Machine learning; World Wide Web","score_opus":0.15595235777935326,"score_gpt":0.4135504450014543,"score_spread":0.2575980872221011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911264190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015410895,0.00016611654,0.98040664,0.00033677169,0.000044150194,0.00006603377,0.00020687502,0.00036837277,0.00299414],"genre_scores_gemma":[0.59515643,0.0005425892,0.394551,0.00044952633,0.00015134859,0.00079683267,0.0017388323,0.00040537416,0.006207988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969728,0.0017513834,0.00010578544,0.00042590185,0.00052845024,0.00021568993],"domain_scores_gemma":[0.986133,0.011114231,0.00055957836,0.0011715431,0.0007767869,0.00024485798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060686483,0.0007992153,0.0015599226,0.00081054453,0.000747324,0.0018471903,0.0017561184,0.0016190166,0.007515374],"category_scores_gemma":[0.029567353,0.0007500963,0.0010971657,0.0010073963,0.0018045754,0.0022601848,0.0023205832,0.00275709,0.0010764411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001410065,0.00004030491,0.00196703,0.00008326185,0.000037943566,0.00008612816,0.00011233209,0.8577195,0.00042355905,0.118514314,0.0016267676,0.01924786],"study_design_scores_gemma":[0.000017603497,0.000010946324,0.00012352041,0.000016021013,0.000004496464,0.00001401932,0.0000097817065,0.9645688,0.00020837007,0.03445668,0.00056120486,0.000008633133],"about_ca_topic_score_codex":0.0055834954,"about_ca_topic_score_gemma":0.0046112943,"teacher_disagreement_score":0.007515374,"about_ca_system_score_codex":0.0011885858,"about_ca_system_score_gemma":0.002161058,"threshold_uncertainty_score":0.03209448},"labels":[],"label_agreement":null},{"id":"W2912059657","doi":"10.1214/22-aap1847","title":"Modified log-Sobolev inequalities for strong-Rayleigh measures","year":2023,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Markov chain; Lipschitz continuity; Sobolev inequality; Combinatorics; Sobolev space; Invariant (physics); Pure mathematics; Discrete mathematics; Applied mathematics; Mathematical physics; Statistics","score_opus":0.48510575401184464,"score_gpt":0.435439609094404,"score_spread":0.04966614491744065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912059657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15147372,0.0028115162,0.81709343,0.002043733,0.0002182251,0.00011564585,0.0005152589,0.00036399876,0.025364451],"genre_scores_gemma":[0.9238369,0.0017587146,0.06308157,0.0006538117,0.00035658525,0.0002878724,0.00033790027,0.0002498073,0.009436903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980228,0.0006873453,0.00010141607,0.00033122525,0.0005242522,0.00033303737],"domain_scores_gemma":[0.9806497,0.013410072,0.0019688993,0.0011315623,0.001457358,0.001382511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004077259,0.001335626,0.0010440318,0.0018815886,0.00079829164,0.0017977818,0.0020856943,0.0013442168,0.005899424],"category_scores_gemma":[0.02628776,0.0007153974,0.001395321,0.0007920325,0.0033456201,0.0049227956,0.0033539778,0.0038450486,0.0006235939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011366343,0.00004064879,0.0015490063,0.0001883913,0.000046653116,0.0002848063,0.00023330205,0.034976926,0.00644313,0.94546086,0.0009337896,0.009728711],"study_design_scores_gemma":[0.000019175468,0.000062951694,0.0009777847,0.000059910686,0.000028180926,0.00018931754,0.0000507775,0.56095487,0.0030479042,0.43244317,0.0021232164,0.000042799864],"about_ca_topic_score_codex":0.0017430916,"about_ca_topic_score_gemma":0.0016492263,"teacher_disagreement_score":0.005899424,"about_ca_system_score_codex":0.0023173366,"about_ca_system_score_gemma":0.0010731239,"threshold_uncertainty_score":0.021562874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05178645719083579,"score_gpt":0.3178471076443546,"score_spread":0.2660606504535188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913888525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28481543,0.0014174626,0.62884384,0.0014361413,0.00017387405,0.00017678879,0.0010507631,0.0006505529,0.08143511],"genre_scores_gemma":[0.9171931,0.00090525416,0.055193856,0.00039407835,0.00033805013,0.00016228131,0.00059310044,0.00009894925,0.025121303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933016,0.00012292157,0.00003853723,0.00016645805,0.00021359474,0.00012837097],"domain_scores_gemma":[0.9985959,0.0004611299,0.00030375057,0.00020505492,0.00028968055,0.00014444541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365456,0.0005378233,0.00050588895,0.0007643208,0.00070090115,0.0016698176,0.0007785915,0.00061996246,0.007164749],"category_scores_gemma":[0.0019674422,0.00030683607,0.000513425,0.00057307835,0.0010570639,0.0026033684,0.0012372071,0.0010723701,0.0011335555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008128049,0.00002858219,0.0009663114,0.00009179279,0.00002207677,0.00018828982,0.00019493191,0.015533667,0.00790301,0.9496801,0.0027828587,0.022527065],"study_design_scores_gemma":[0.000030828778,0.000113561066,0.0013639953,0.00003664033,0.000023570501,0.0009983849,0.00023159343,0.14152323,0.007112643,0.8218814,0.026648508,0.000035662117],"about_ca_topic_score_codex":0.00062211754,"about_ca_topic_score_gemma":0.0006169715,"teacher_disagreement_score":0.007164749,"about_ca_system_score_codex":0.00060291355,"about_ca_system_score_gemma":0.00028381328,"threshold_uncertainty_score":0.023968458},"labels":[],"label_agreement":null},{"id":"W2914481316","doi":"10.1002/9781118014967.ch6","title":"Markov Chain Monte Carlo","year":2011,"lang":"en","type":"other","venue":"Wiley series in probability and statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Gibbs sampling; Metropolis–Hastings algorithm; Rejection sampling; Markov chain; Parallel tempering; Monte Carlo method; Hybrid Monte Carlo; Slice sampling; Mathematics; Algorithm; Computer science; Bayesian probability; Reversible-jump Markov chain Monte Carlo; Statistics; Statistical physics; Physics","score_opus":0.04932931468122399,"score_gpt":0.3006980059787642,"score_spread":0.25136869129754025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914481316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021201822,0.0023757587,0.9577857,0.0009460584,0.0003429533,0.0003811441,0.0013169539,0.0016546092,0.0330767],"genre_scores_gemma":[0.13202299,0.008184303,0.82207024,0.001018977,0.0008698757,0.0020676688,0.0037386126,0.0011346969,0.028892638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99363023,0.0032946677,0.00031985788,0.001067108,0.001337386,0.00035081574],"domain_scores_gemma":[0.986566,0.009579407,0.00067564583,0.0013802688,0.001491006,0.0003076426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049652574,0.0017121775,0.0024544308,0.0022704394,0.001753489,0.00506572,0.0034595698,0.0030175564,0.029362418],"category_scores_gemma":[0.025520023,0.0010287934,0.0018797303,0.0032968724,0.0028118761,0.004073526,0.0029610558,0.0034259472,0.009629645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007554698,0.00009959314,0.0015419457,0.0006800412,0.00016995089,0.00020792538,0.00027510195,0.17431383,0.00055005355,0.7036706,0.019374952,0.09904051],"study_design_scores_gemma":[0.000060206337,0.0000380121,0.000272138,0.00031425746,0.000060527407,0.00012328905,0.0000651605,0.35989118,0.00081310584,0.5591058,0.07918299,0.000073339026],"about_ca_topic_score_codex":0.006682667,"about_ca_topic_score_gemma":0.005677209,"teacher_disagreement_score":0.029362418,"about_ca_system_score_codex":0.0025789163,"about_ca_system_score_gemma":0.0050461274,"threshold_uncertainty_score":0.098227024},"labels":[],"label_agreement":null},{"id":"W2914852071","doi":"","title":"Subsampled Stochastic Variance-Reduced Gradient Langevin Dynamics.","year":2018,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Langevin dynamics; Variance (accounting); Dynamics (music); Statistical physics; Computer science; Stochastic process; Langevin equation; Stochastic dynamics; Physics; Mathematics; Statistics; Economics","score_opus":0.12525668512547758,"score_gpt":0.38339916574281296,"score_spread":0.25814248061733536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914852071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041990016,0.0011868648,0.94531465,0.0011627893,0.00030701913,0.000065451044,0.00031948648,0.00038445165,0.009269261],"genre_scores_gemma":[0.8637325,0.00060394144,0.12448985,0.0003287566,0.00014907385,0.00021040633,0.00048549447,0.0002451819,0.009754793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951386,0.00019791504,0.000017960225,0.000072324234,0.00014626766,0.000051542782],"domain_scores_gemma":[0.9980896,0.0012287204,0.00017082831,0.00019356847,0.0002088964,0.000108296124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672254,0.0005421837,0.0010659081,0.00054025074,0.00035624072,0.00095097005,0.001500978,0.0013523259,0.0028292574],"category_scores_gemma":[0.007852943,0.00047755515,0.0006574619,0.00043947413,0.0012924592,0.0018791452,0.0013427614,0.0017413417,0.00037335505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011373982,0.00005878827,0.0007320279,0.000107888896,0.00007821915,0.00008147432,0.00008702333,0.6139422,0.0013160153,0.36821178,0.0029614128,0.0123094255],"study_design_scores_gemma":[0.000006306149,0.000006749232,0.000079713434,0.0000054893585,0.0000042508095,0.00000796018,0.0000043167242,0.95841324,0.0001413559,0.04087219,0.00045208825,0.0000062735717],"about_ca_topic_score_codex":0.004875422,"about_ca_topic_score_gemma":0.004856917,"teacher_disagreement_score":0.004875422,"about_ca_system_score_codex":0.0009499146,"about_ca_system_score_gemma":0.0010432563,"threshold_uncertainty_score":0.009694099},"labels":[],"label_agreement":null},{"id":"W2919958094","doi":"10.1214/20-aap1646","title":"Entropy dissipation estimates for inhomogeneous zero-range processes","year":2021,"lang":"en","type":"preprint","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Martingale (probability theory); Sobolev space; Entropy (arrow of time); Statistical physics; Sobolev inequality; Pure mathematics; Dissipation; Applied mathematics; Physics; Quantum mechanics","score_opus":0.19989157020222864,"score_gpt":0.40169603609122334,"score_spread":0.2018044658889947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919958094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27007985,0.003669005,0.70345914,0.0016894814,0.00016818085,0.000048265796,0.00015683731,0.00011451679,0.02061481],"genre_scores_gemma":[0.9726008,0.0013315761,0.016902281,0.00022550671,0.00024383087,0.00007443596,0.00013860932,0.00007633127,0.008406708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957186,0.00016119849,0.000019392703,0.000071452996,0.000114670336,0.00006147397],"domain_scores_gemma":[0.9971004,0.0016886768,0.00047165577,0.00023667526,0.000243241,0.00025931615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018064075,0.0006024658,0.0006227707,0.0015691611,0.00041596976,0.0010604812,0.0008620314,0.00047600557,0.0015573516],"category_scores_gemma":[0.0058841608,0.0002791167,0.0006789594,0.00042963048,0.0020164887,0.0021896046,0.0019272922,0.001477732,0.00017385022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042149182,0.000017226954,0.0016149593,0.0000884383,0.000031630992,0.00010528421,0.00019604847,0.036645483,0.0036697143,0.9520641,0.00081525603,0.0047096186],"study_design_scores_gemma":[0.000008891956,0.000027758531,0.0018682866,0.000025433046,0.0000160731,0.000047770354,0.00003166178,0.39419967,0.0014425006,0.60061973,0.0016900097,0.000022271744],"about_ca_topic_score_codex":0.0009531866,"about_ca_topic_score_gemma":0.000604423,"teacher_disagreement_score":0.0018064075,"about_ca_system_score_codex":0.0010893823,"about_ca_system_score_gemma":0.00040436833,"threshold_uncertainty_score":0.009553313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04196391283684291,"score_gpt":0.3385584988034436,"score_spread":0.29659458596660065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920804790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005639922,0.000506986,0.9917001,0.00033058395,0.000040674135,0.000057642854,0.000059191356,0.00075924105,0.0009054999],"genre_scores_gemma":[0.16628732,0.0005077009,0.8299476,0.00045149217,0.00012419283,0.00032349947,0.00017880576,0.0008715082,0.0013080161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9778306,0.016694473,0.00086534896,0.0016188732,0.0024419127,0.00054877653],"domain_scores_gemma":[0.91688836,0.054857276,0.006993495,0.01314356,0.0072531207,0.00086419925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035696108,0.0015319744,0.0019765405,0.004980119,0.0011197606,0.0029916,0.002569912,0.0028170124,0.0046563693],"category_scores_gemma":[0.14435151,0.0008272609,0.001616429,0.0042568864,0.0044778143,0.0047869254,0.0032373646,0.0037218714,0.0015850615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039333274,0.00012679142,0.018167421,0.00052576844,0.00023775028,0.00049268163,0.0009171144,0.20356518,0.0064766197,0.34293318,0.010093641,0.4160705],"study_design_scores_gemma":[0.00006767938,0.00027243904,0.004609091,0.00022015686,0.00009654148,0.00060699316,0.00017023714,0.7658701,0.009321979,0.20780718,0.01074566,0.00021184639],"about_ca_topic_score_codex":0.0035343105,"about_ca_topic_score_gemma":0.0030105407,"teacher_disagreement_score":0.035696108,"about_ca_system_score_codex":0.0015528603,"about_ca_system_score_gemma":0.0026062874,"threshold_uncertainty_score":0.18878132},"labels":[],"label_agreement":null},{"id":"W2921550668","doi":"10.3390/e21030276","title":"A Monotone Path Proof of an Extremal Result for Long Markov Chains","year":2019,"lang":"en","type":"article","venue":"Entropy","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Markov chain; Monotone polygon; Path (computing); Mathematics; Examples of Markov chains; Argument (complex analysis); Work (physics); Discrete mathematics; Combinatorics; Pure mathematics; Mathematical economics; Markov model; Variable-order Markov model; Computer science; Statistics; Physics","score_opus":0.039831944424557,"score_gpt":0.33874561489257626,"score_spread":0.29891367046801925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921550668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025803883,0.0017796216,0.9247453,0.0044044,0.0004990536,0.000091092414,0.00030793634,0.0003054814,0.042063273],"genre_scores_gemma":[0.6924742,0.0038757983,0.27704108,0.0039619594,0.0020004818,0.00065046735,0.00043851184,0.000727884,0.018829573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977652,0.00084240997,0.000070074704,0.00037667845,0.0006353473,0.0003103022],"domain_scores_gemma":[0.9819532,0.013506273,0.001149181,0.0010954535,0.0013784348,0.00091749104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045904894,0.0014456786,0.0014152351,0.0024664819,0.0021123376,0.0018054552,0.003156073,0.0030773862,0.01290232],"category_scores_gemma":[0.023699928,0.0008521106,0.0027299772,0.0017311967,0.0042990143,0.00720961,0.005554295,0.007149068,0.0011033487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022334269,0.000026749694,0.00024637982,0.000121570745,0.000026749134,0.00010823352,0.00008397974,0.0058732214,0.0010053888,0.98505104,0.0022087344,0.005225612],"study_design_scores_gemma":[0.00001826665,0.000047724872,0.0002898374,0.000078100165,0.00002736099,0.00018376458,0.00002412509,0.06631198,0.0010494178,0.92825544,0.0036824225,0.00003161285],"about_ca_topic_score_codex":0.00077282573,"about_ca_topic_score_gemma":0.0007952251,"teacher_disagreement_score":0.01290232,"about_ca_system_score_codex":0.0019864861,"about_ca_system_score_gemma":0.001535271,"threshold_uncertainty_score":0.043162584},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04610510541183537,"score_gpt":0.4599356051944695,"score_spread":0.41383049978263414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941443959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041531054,0.0001799306,0.99375474,0.00019145277,0.000045423694,0.00004009935,0.000040185867,0.00013948888,0.0014555682],"genre_scores_gemma":[0.36771253,0.0010148222,0.6210917,0.0003576005,0.0002872509,0.0007610997,0.00032306515,0.00042075833,0.008031163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914575,0.0004975487,0.000030213636,0.000083155166,0.00018622771,0.000057000656],"domain_scores_gemma":[0.99640733,0.002672899,0.00018245292,0.00034324202,0.00024066475,0.00015344351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029979155,0.0006451083,0.0010301635,0.0010743036,0.0008501905,0.0013795492,0.0024462687,0.0016183577,0.0037908508],"category_scores_gemma":[0.008367992,0.00065130583,0.0011601024,0.0009731914,0.0024750012,0.0023703,0.001387925,0.002791195,0.0007793189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023163184,0.00003227956,0.000313326,0.00004402275,0.00001577391,0.00003722604,0.00008435709,0.4053113,0.000523636,0.57917833,0.0009813814,0.0134551255],"study_design_scores_gemma":[0.0000047058757,0.000005729003,0.000023812503,0.000007841941,0.0000022651332,0.000008259983,0.0000030490935,0.9122315,0.00012773057,0.08702154,0.0005566547,0.0000067856695],"about_ca_topic_score_codex":0.0048751147,"about_ca_topic_score_gemma":0.0045566177,"teacher_disagreement_score":0.0048751147,"about_ca_system_score_codex":0.0024992751,"about_ca_system_score_gemma":0.001441144,"threshold_uncertainty_score":0.01813364},"labels":[],"label_agreement":null},{"id":"W2946686544","doi":"10.1214/20-ba1250","title":"Finding our Way in the Dark: Approximate MCMC for Approximate Bayesian Methods","year":2020,"lang":"en","type":"preprint","venue":"Bayesian Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximate Bayesian computation; Markov chain Monte Carlo; Computer science; Computation; Bayesian probability; Scope (computer science); Limiting; Sampling (signal processing); Algorithm; Machine learning; Artificial intelligence; Engineering","score_opus":0.12612885205295937,"score_gpt":0.4261759453315928,"score_spread":0.30004709327863344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946686544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015435369,0.00026035603,0.997134,0.0002565551,0.000023063856,0.00001559848,0.00001562428,0.00010103243,0.00065022684],"genre_scores_gemma":[0.1335327,0.00079376367,0.8628613,0.00044454314,0.00011405745,0.0002562133,0.00011034309,0.00030097674,0.0015860398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959103,0.002638031,0.000118653385,0.0003066458,0.0009179335,0.00010854531],"domain_scores_gemma":[0.9868895,0.0100355875,0.00054673356,0.0014777498,0.00078219833,0.00026826226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005172006,0.00094710995,0.0011650204,0.0010269568,0.0010813382,0.0023947558,0.0019413603,0.0019718374,0.003053967],"category_scores_gemma":[0.040670138,0.0009059246,0.0006988711,0.0015515382,0.003046857,0.0026693475,0.0027069282,0.00407565,0.0010318122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001552437,0.00007375366,0.0012875693,0.00018231467,0.00009316075,0.00014755088,0.0002673198,0.48210514,0.0021181493,0.43471852,0.0034197601,0.07543159],"study_design_scores_gemma":[0.00001676861,0.0000105000945,0.000052652955,0.000028390325,0.0000078912235,0.000022215561,0.000013397666,0.8440095,0.0005369784,0.15282483,0.0024656502,0.000011174064],"about_ca_topic_score_codex":0.0045213886,"about_ca_topic_score_gemma":0.004528277,"teacher_disagreement_score":0.005172006,"about_ca_system_score_codex":0.0016285705,"about_ca_system_score_gemma":0.0021840471,"threshold_uncertainty_score":0.027352452},"labels":[],"label_agreement":null},{"id":"W2947036735","doi":"10.1214/21-aihp1157","title":"On testing for parameters in Ising models","year":2022,"lang":"fr","type":"preprint","venue":"Annales de l Institut Henri Poincaré Probabilités et Statistiques","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ising model; Minimax; Mathematics; Statistical physics; Random graph; Upper and lower bounds; Percolation (cognitive psychology); k-nearest neighbors algorithm; Matching (statistics); Percolation threshold; Graph; Combinatorics; Physics; Computer science; Statistics; Mathematical analysis; Mathematical optimization; Quantum mechanics","score_opus":0.2013180281848555,"score_gpt":0.410793561662763,"score_spread":0.20947553347790748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947036735","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475227,0.0011659698,0.33434936,0.0040062023,0.00021821959,0.00014296609,0.0011595753,0.001187084,0.010247929],"genre_scores_gemma":[0.969887,0.0002321832,0.027438175,0.00029468784,0.000121552366,0.00013777643,0.00074971316,0.0002192469,0.00091966434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97691923,0.014642492,0.001033851,0.003533624,0.0024298152,0.0014410457],"domain_scores_gemma":[0.49735907,0.4583805,0.011741283,0.023124712,0.006275232,0.0031192573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030404542,0.0016865628,0.0028828897,0.0028387804,0.0018940091,0.004391694,0.0044641886,0.0042121527,0.0052353516],"category_scores_gemma":[0.29841995,0.0009471091,0.0029607785,0.002555803,0.0065935594,0.01150848,0.0034471487,0.006088166,0.0003928411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026856489,0.00041358965,0.08994474,0.0007749442,0.0015403869,0.0015225143,0.0021965476,0.32200015,0.004978188,0.52013636,0.0028722258,0.05093467],"study_design_scores_gemma":[0.000148926,0.00034258253,0.0046382593,0.00016630668,0.00012506345,0.00019714462,0.0004909052,0.34879032,0.0020922897,0.6417598,0.0011568465,0.00009157136],"about_ca_topic_score_codex":0.004012833,"about_ca_topic_score_gemma":0.0021495332,"teacher_disagreement_score":0.030404542,"about_ca_system_score_codex":0.002090371,"about_ca_system_score_gemma":0.0025249706,"threshold_uncertainty_score":0.16079646},"labels":[],"label_agreement":null},{"id":"W2949187221","doi":"10.48550/arxiv.1106.5941","title":"Split Hamiltonian Monte Carlo","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hamiltonian (control theory); Monte Carlo method; Gaussian; Statistical physics; Quadratic equation; Applied mathematics; Hybrid Monte Carlo; Computation; Hamiltonian mechanics; Mathematics; Mathematical optimization; Computer science; Algorithm; Physics; Quantum mechanics; Markov chain Monte Carlo; Statistics; Geometry","score_opus":0.2643779961420824,"score_gpt":0.2460433192093614,"score_spread":0.018334676932721006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949187221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022453828,0.00026365631,0.9607544,0.00047465402,0.00016343978,0.00012987801,0.00021933738,0.00084920187,0.0146916555],"genre_scores_gemma":[0.43158013,0.00025160838,0.5513527,0.0004839393,0.00010063735,0.00063193444,0.00064229255,0.00079007854,0.014166765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989813,0.00047309085,0.000038874903,0.0001321828,0.00026780207,0.000106705884],"domain_scores_gemma":[0.99480927,0.0033929523,0.00015327093,0.0009227958,0.0004998364,0.00022184462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202457,0.00065873103,0.0009481573,0.0007504423,0.0010020813,0.0012361364,0.0021141085,0.0014289756,0.017105533],"category_scores_gemma":[0.011054678,0.0006086395,0.0007872532,0.0008387839,0.0013741114,0.0020497767,0.002125478,0.0019010097,0.0019209399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020233663,0.000115215385,0.0012826707,0.00013226476,0.000091376205,0.00024216904,0.00022834087,0.50759244,0.0018620534,0.42633128,0.0063898005,0.055530008],"study_design_scores_gemma":[0.000028662706,0.00001455467,0.00008671474,0.000010563302,0.000008583744,0.000024244844,0.000013620062,0.90092576,0.00049254793,0.09609859,0.002287557,0.000008539213],"about_ca_topic_score_codex":0.0042096633,"about_ca_topic_score_gemma":0.0061389445,"teacher_disagreement_score":0.017105533,"about_ca_system_score_codex":0.0012000134,"about_ca_system_score_gemma":0.0013732152,"threshold_uncertainty_score":0.057223678},"labels":[],"label_agreement":null},{"id":"W2949914592","doi":"10.48550/arxiv.1702.03098","title":"Estimation of Risk Contributions with MCMC","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Eidgenössische Technische Hochschule Zürich; Japan Society for the Promotion of Science; Keio University","keywords":"Estimator; Markov chain Monte Carlo; Value at risk; Econometrics; Monte Carlo method; Mean squared error; Consistency (knowledge bases); Statistics; Asymptotic distribution; Mathematics; Computer science; Risk management; Economics; Finance; Artificial intelligence","score_opus":0.12011666659046338,"score_gpt":0.2678759514799738,"score_spread":0.1477592848895104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949914592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017961077,0.00026265543,0.9795344,0.00018414603,0.000045246983,0.00008482313,0.00018292936,0.0005780423,0.0011666007],"genre_scores_gemma":[0.43126884,0.00048602128,0.56229144,0.00029828,0.00015902873,0.00048585795,0.0012804174,0.00031832771,0.0034117284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984932,0.00065305625,0.00009507972,0.0002467342,0.00038928163,0.00012265603],"domain_scores_gemma":[0.985718,0.01091404,0.0008878854,0.0011410556,0.0010602853,0.00027871795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004395822,0.0011441818,0.0014797893,0.002357172,0.0009125237,0.0014554454,0.002270393,0.0017257811,0.004824444],"category_scores_gemma":[0.026192602,0.0012322735,0.0011892515,0.001861373,0.0012676115,0.0017366416,0.0016740646,0.0027338255,0.00079281826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010596036,0.000056964494,0.003740049,0.00009326486,0.00010736491,0.000105907624,0.000074141826,0.9191146,0.00079645007,0.034347985,0.001330501,0.040126838],"study_design_scores_gemma":[0.0000072507983,0.0000045149577,0.00019388077,0.000009802875,0.00000576983,0.000010983602,0.0000040391924,0.9901821,0.00022979228,0.009081109,0.00026391732,0.0000068983422],"about_ca_topic_score_codex":0.015389825,"about_ca_topic_score_gemma":0.01720356,"teacher_disagreement_score":0.015389825,"about_ca_system_score_codex":0.0016084267,"about_ca_system_score_gemma":0.002960241,"threshold_uncertainty_score":0.030600488},"labels":[],"label_agreement":null},{"id":"W2950988416","doi":"10.1111/1755-0998.12758","title":"Exploring Approximate Bayesian Computation for inferring recent demographic history with genomic markers in nonmodel species","year":2018,"lang":"en","type":"article","venue":"Molecular Ecology Resources","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Biology; Approximate Bayesian computation; Bayesian probability; Demographic history; Evolutionary biology; Computational biology; Statistics; Genetics; Artificial intelligence; Inference; Genetic variation; Computer science; Gene; Mathematics","score_opus":0.11061951703509337,"score_gpt":0.29043774598002126,"score_spread":0.17981822894492788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950988416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030966667,0.00019172698,0.9677893,0.00016801871,0.000010281621,0.000032174572,0.00008729449,0.0003339326,0.00042047503],"genre_scores_gemma":[0.2717779,0.0002737292,0.72638535,0.00013388047,0.000031750005,0.00026552944,0.0004578212,0.00022494931,0.0004490852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978531,0.0015179215,0.00008965824,0.0002498636,0.00022669857,0.00006270943],"domain_scores_gemma":[0.9754057,0.021296274,0.0009976967,0.0009756014,0.0009908156,0.00033397556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00646885,0.00063678506,0.0011560852,0.0018195213,0.00089531875,0.0016010108,0.002071076,0.0011835779,0.0020479816],"category_scores_gemma":[0.034934983,0.0009804921,0.0007537226,0.0018598894,0.001667072,0.0024177455,0.0014062927,0.0015232785,0.00035126024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080145735,0.00004699333,0.0062868916,0.00015008078,0.00008674189,0.00007990404,0.00021587408,0.9100362,0.0016649741,0.037651446,0.000501141,0.043199677],"study_design_scores_gemma":[0.0000072032253,0.0000038897974,0.00024834689,0.000006767501,0.0000039888937,0.000009526937,0.0000073612287,0.9846268,0.00015761892,0.014714107,0.00020795462,0.0000065304125],"about_ca_topic_score_codex":0.02160082,"about_ca_topic_score_gemma":0.022360893,"teacher_disagreement_score":0.02160082,"about_ca_system_score_codex":0.0018610972,"about_ca_system_score_gemma":0.0021372642,"threshold_uncertainty_score":0.042950153},"labels":[],"label_agreement":null},{"id":"W2951072873","doi":"10.48550/arxiv.0711.0186","title":"Population-Based Reversible Jump Markov Chain Monte Carlo","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain Monte Carlo; Reversible-jump Markov chain Monte Carlo; Population; Markov chain; Computer science; Algorithm; Ergodicity; Mathematics; Bayesian inference; Bayesian probability; Mathematical optimization; Statistics; Artificial intelligence","score_opus":0.1139446385373316,"score_gpt":0.36319031309554267,"score_spread":0.24924567455821106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951072873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055395775,0.00013960658,0.9926354,0.000084328414,0.000024458397,0.000040944797,0.000031415748,0.0002598266,0.0012445094],"genre_scores_gemma":[0.31107533,0.00049979286,0.68310446,0.0001934306,0.000083219966,0.00044730832,0.0002827391,0.00018895646,0.0041247904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986884,0.00069255166,0.00004098655,0.000220089,0.00028712463,0.00007086177],"domain_scores_gemma":[0.9950872,0.0038357363,0.00021473145,0.00042912536,0.0003459806,0.00008717213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002668747,0.00049101765,0.00105102,0.00084618066,0.0005753192,0.0010060972,0.0019616308,0.0012687693,0.0034856813],"category_scores_gemma":[0.0092403395,0.0004928058,0.0009979174,0.0009297671,0.0012628916,0.0012691782,0.0011501148,0.0021066442,0.0008112299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044701446,0.00006307138,0.0011956017,0.000089181536,0.00007814494,0.000113378956,0.00011321645,0.79902804,0.001284328,0.15387121,0.0009077845,0.043211356],"study_design_scores_gemma":[0.000010988358,0.000009497034,0.00007956032,0.0000054634374,0.0000074734826,0.000020492495,0.0000042147335,0.9780938,0.00034380218,0.020424156,0.0009919725,0.000008536988],"about_ca_topic_score_codex":0.0034882077,"about_ca_topic_score_gemma":0.0030539497,"teacher_disagreement_score":0.0034882077,"about_ca_system_score_codex":0.0009549987,"about_ca_system_score_gemma":0.0010482506,"threshold_uncertainty_score":0.014113903},"labels":[],"label_agreement":null},{"id":"W2951501645","doi":"10.48550/arxiv.1511.02273","title":"The expected bit complexity of the von Neumann rejection algorithm","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Infimum and supremum; Random variate; Mathematics; Von Neumann architecture; Rectangle; Oracle; Extension (predicate logic); Discrete mathematics; Algorithm; Function (biology); Quadtree; Bit (key); Random function; Computer science; Pure mathematics; Random variable","score_opus":0.2744333413684254,"score_gpt":0.26823039993949566,"score_spread":0.006202941428929742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951501645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15880242,0.0006228764,0.82105255,0.00270787,0.00008915797,0.00018539811,0.00050068187,0.0009365488,0.015102478],"genre_scores_gemma":[0.79532206,0.00048106795,0.19573116,0.00053307216,0.00016769933,0.00054168655,0.00062182394,0.00044846817,0.0061529325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937238,0.0025453432,0.00033056556,0.0008652517,0.001756869,0.000778248],"domain_scores_gemma":[0.96535313,0.02758302,0.0011886348,0.0038138833,0.0015279799,0.0005332474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005836706,0.00060485234,0.001079065,0.0007969391,0.0009373208,0.0033191121,0.0025524588,0.0019356709,0.006330808],"category_scores_gemma":[0.045692645,0.0006180745,0.00087297213,0.0009777569,0.0030367088,0.007321112,0.0025232441,0.0029087826,0.0010865332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011239477,0.00012954256,0.0029677243,0.00025718808,0.00007739804,0.0001637876,0.00028179548,0.21350637,0.008463036,0.7207759,0.003800736,0.04845262],"study_design_scores_gemma":[0.000063224776,0.00006086463,0.00030914327,0.000029428595,0.000018801815,0.000073014235,0.00001819417,0.68467015,0.00415779,0.30951723,0.0010553604,0.000026834521],"about_ca_topic_score_codex":0.00092746096,"about_ca_topic_score_gemma":0.00065411313,"teacher_disagreement_score":0.006330808,"about_ca_system_score_codex":0.0024253654,"about_ca_system_score_gemma":0.0021978638,"threshold_uncertainty_score":0.030867815},"labels":[],"label_agreement":null},{"id":"W2951558479","doi":"","title":"Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Mathematics; Radius of convergence; Entropy (arrow of time); Taylor series; Rate of convergence; Applied mathematics; Statistical physics; Markov process; Pure mathematics; Mathematical analysis; Physics; Computer science; Statistics; Thermodynamics","score_opus":0.10060195306386471,"score_gpt":0.2432715400351504,"score_spread":0.14266958697128568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951558479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12863293,0.0006134158,0.8549381,0.0010531619,0.00010268887,0.000076430246,0.00026314784,0.0003110612,0.014009139],"genre_scores_gemma":[0.92349494,0.0007053176,0.07093996,0.00032263025,0.00019465809,0.00025799026,0.0002501319,0.00024546147,0.0035888567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985247,0.0006354825,0.000097977834,0.0002130525,0.00030507156,0.00022375991],"domain_scores_gemma":[0.98733276,0.0082455985,0.0013217995,0.0012418992,0.0012606005,0.00059749576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004296421,0.00088558416,0.00093026867,0.0015136128,0.0006768671,0.0014844467,0.0013416193,0.0011871266,0.0052923122],"category_scores_gemma":[0.024194019,0.00043686962,0.0014088462,0.00046012364,0.0024608886,0.0035511185,0.0020328697,0.0024819637,0.0005482474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003659772,0.000014456683,0.0005030042,0.00008341483,0.000015070638,0.00013420817,0.00022275883,0.024271518,0.0032255515,0.968195,0.0007906831,0.0025078026],"study_design_scores_gemma":[0.000015838139,0.00002918271,0.00035875273,0.00005851788,0.000012696517,0.00014599666,0.00004885106,0.47022107,0.0019289644,0.5256442,0.0015105697,0.000025344996],"about_ca_topic_score_codex":0.0006259725,"about_ca_topic_score_gemma":0.00023952762,"teacher_disagreement_score":0.0052923122,"about_ca_system_score_codex":0.0011662418,"about_ca_system_score_gemma":0.00070925895,"threshold_uncertainty_score":0.022721946},"labels":[],"label_agreement":null},{"id":"W2951753219","doi":"10.1017/s0021900200012055","title":"The Containment Condition and Adapfail Algorithms","year":2014,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Containment (computer programming); Markov chain Monte Carlo; Mathematics; Algorithm; Markov chain; Convergence (economics); Ergodic theory; Focus (optics); Mathematical optimization; Monte Carlo method; Computer science; Statistics","score_opus":0.035078706583015276,"score_gpt":0.31290436596615073,"score_spread":0.27782565938313547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951753219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01757256,0.0005954366,0.96993655,0.0009619405,0.0001255713,0.00010418528,0.00010954841,0.0006274455,0.009966752],"genre_scores_gemma":[0.6346974,0.0009513012,0.34976527,0.0015964445,0.00054036337,0.0007838171,0.00063827884,0.0008001029,0.010227027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99141896,0.0042540655,0.00041955637,0.0010807513,0.0023451757,0.0004814937],"domain_scores_gemma":[0.9368843,0.046032395,0.00286243,0.008543894,0.0045739603,0.0011031138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009628472,0.0008862773,0.0015886879,0.0011692217,0.0011046849,0.0023012978,0.0030228184,0.0027697906,0.008708584],"category_scores_gemma":[0.073404886,0.0006678079,0.0008351535,0.0010604226,0.0037123268,0.005556748,0.0049138083,0.0044374145,0.0021716128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045163938,0.00013592525,0.0030851683,0.00024677895,0.00007655419,0.00020455045,0.00029225415,0.14788131,0.0025383357,0.71745384,0.008697076,0.118936576],"study_design_scores_gemma":[0.000054050513,0.0001709143,0.0003323913,0.00006498785,0.000016876811,0.00022189175,0.00003982954,0.7075327,0.0031537344,0.28262076,0.0057663727,0.000025488982],"about_ca_topic_score_codex":0.0011168193,"about_ca_topic_score_gemma":0.0006823315,"teacher_disagreement_score":0.009628472,"about_ca_system_score_codex":0.0012908618,"about_ca_system_score_gemma":0.0018410927,"threshold_uncertainty_score":0.050920844},"labels":[],"label_agreement":null},{"id":"W2952234885","doi":"10.48550/arxiv.1111.5379","title":"Self-Avoiding Random Dynamics on Integer Complex Systems","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Ising model; Computer science; Gibbs sampling; Monte Carlo algorithm; Monte Carlo method; Statistical physics; Sampling (signal processing); State space; Algorithm; Theoretical computer science; Bayesian probability; Mathematics; Artificial intelligence; Physics","score_opus":0.24149199212284464,"score_gpt":0.25038519058470843,"score_spread":0.008893198461863788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952234885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1301017,0.0002319841,0.8645901,0.00031993157,0.000029312687,0.00004660951,0.000044835688,0.00025682754,0.0043786736],"genre_scores_gemma":[0.80593985,0.00022222487,0.19055201,0.0001285516,0.000029485544,0.00013804666,0.00009791645,0.00012427571,0.00276764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995041,0.00025547142,0.000020809597,0.00007100919,0.00010850651,0.000040037638],"domain_scores_gemma":[0.99887294,0.0007103698,0.00012178959,0.00013959385,0.00007014508,0.00008514115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093864225,0.00032168857,0.0004637493,0.0004630878,0.0003838774,0.00089598267,0.0007381218,0.0006732608,0.0016550615],"category_scores_gemma":[0.003733942,0.0003247388,0.00037199154,0.0003043375,0.0012702668,0.0013917085,0.0008928801,0.0009206781,0.00023875719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007048026,0.000046530084,0.0008289938,0.000050148337,0.000020607527,0.00009973102,0.0001266226,0.4578964,0.0041659963,0.5216931,0.0006442866,0.014357029],"study_design_scores_gemma":[0.000009236034,0.000006200065,0.00005026732,0.0000032283924,0.0000012287262,0.000012450046,0.0000042761294,0.94651634,0.0004436183,0.05259396,0.000355165,0.0000041620665],"about_ca_topic_score_codex":0.0010796953,"about_ca_topic_score_gemma":0.00095285743,"teacher_disagreement_score":0.0016550615,"about_ca_system_score_codex":0.0007928152,"about_ca_system_score_gemma":0.00044226213,"threshold_uncertainty_score":0.005752325},"labels":[],"label_agreement":null},{"id":"W2952623669","doi":"10.48550/arxiv.math/0105252","title":"Extension of Fill's perfect rejection sampling algorithm to general chains","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University","funders":"","keywords":"Extension (predicate logic); Randomness; Bounding overwatch; Sampling (signal processing); Computer science; Algorithm; Rejection sampling; Simple (philosophy); Connection (principal bundle); Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Programming language; Hybrid Monte Carlo","score_opus":0.20523275003082928,"score_gpt":0.4031251803629528,"score_spread":0.19789243033212353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952623669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034151278,0.00004763973,0.9941718,0.00014450331,0.000021390477,0.000048069818,0.000038136503,0.0002064428,0.0019068117],"genre_scores_gemma":[0.20484896,0.0002664785,0.7879184,0.000467884,0.00015749477,0.00036389564,0.00027931435,0.0002952219,0.0054022404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962847,0.0016288268,0.00018285372,0.0005450714,0.00107566,0.0002827347],"domain_scores_gemma":[0.9884216,0.00715181,0.0005060445,0.002462547,0.0010988526,0.00035908952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008466549,0.00071490434,0.0013608775,0.0014420273,0.00095646887,0.0017701564,0.00333836,0.0019584442,0.0054018074],"category_scores_gemma":[0.03304865,0.0006645483,0.0014003549,0.0013853025,0.0024564315,0.0035488482,0.0048933867,0.002977891,0.0010375279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024058095,0.00010390846,0.0014778366,0.00014007157,0.00006592791,0.00019000578,0.00028794387,0.15944763,0.00213987,0.6976871,0.003443185,0.1347759],"study_design_scores_gemma":[0.000043790915,0.00006280691,0.0001706113,0.000023972018,0.000014764874,0.00011069929,0.000019654337,0.7508256,0.0013186436,0.24231027,0.0050734594,0.000025717241],"about_ca_topic_score_codex":0.0019962927,"about_ca_topic_score_gemma":0.0019513152,"teacher_disagreement_score":0.008466549,"about_ca_system_score_codex":0.0011054387,"about_ca_system_score_gemma":0.0021261617,"threshold_uncertainty_score":0.044775963},"labels":[],"label_agreement":null},{"id":"W2952745410","doi":"10.48550/arxiv.1608.02282","title":"Computing the Independence Polynomial: from the Tree Threshold down to the Roots","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polydisc; Mathematics; Combinatorics; Polynomial; Independence (probability theory); Univariate; Uniqueness; Rounding; Lambda; Exponential function; Time complexity; Lemma (botany); Discrete mathematics; Multivariate statistics; Mathematical analysis; Physics; Statistics; Computer science","score_opus":0.13972350400325673,"score_gpt":0.25623282552218296,"score_spread":0.11650932151892623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952745410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059090365,0.00014418138,0.93646854,0.00050409365,0.000030416739,0.000075795724,0.00017429152,0.0015202506,0.0019920755],"genre_scores_gemma":[0.4169132,0.00012938368,0.57846427,0.0002800979,0.00006837393,0.00018099094,0.000675413,0.00044982528,0.0028383415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981858,0.00031112626,0.000104146086,0.0005821962,0.0005235463,0.00029320153],"domain_scores_gemma":[0.99171984,0.0055863718,0.0006059414,0.001275348,0.00053468376,0.0002778552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018778372,0.00086127355,0.0012832291,0.0011444003,0.0010757493,0.0020792433,0.00230099,0.0011894222,0.0043259324],"category_scores_gemma":[0.015995683,0.00062055717,0.0012332475,0.0014063678,0.0016099648,0.0046721534,0.0031792829,0.003653379,0.0013662188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010732342,0.0002780008,0.008291707,0.00030673025,0.00009735321,0.00024627522,0.0006667166,0.4396511,0.01841353,0.18598244,0.010166735,0.33482617],"study_design_scores_gemma":[0.000044390894,0.00006929876,0.00046934804,0.000014584441,0.000017382034,0.0000537465,0.000040912168,0.90193725,0.0048435717,0.09127667,0.0012125437,0.000020350126],"about_ca_topic_score_codex":0.0050265794,"about_ca_topic_score_gemma":0.005898465,"teacher_disagreement_score":0.0050265794,"about_ca_system_score_codex":0.0023844084,"about_ca_system_score_gemma":0.0024586162,"threshold_uncertainty_score":0.017300189},"labels":[],"label_agreement":null},{"id":"W2953135896","doi":"10.48550/arxiv.1611.03141","title":"Hitting Time and Convergence Rate Bounds for Symmetric Langevin Diffusions","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Convergence (economics); Rate of convergence; Langevin equation; Langevin dynamics; Mathematics; Applied mathematics; Statistical physics; Physics; Mathematical physics; Mathematical economics; Economics; Computer science","score_opus":0.14711256589229307,"score_gpt":0.2532622655199033,"score_spread":0.1061496996276102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953135896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08198565,0.001962485,0.884324,0.0035378963,0.00040097986,0.00013570013,0.00045318913,0.00057216757,0.026627976],"genre_scores_gemma":[0.87839663,0.003605121,0.0944497,0.0011894552,0.0008507055,0.00071504543,0.0007712191,0.000983739,0.01903838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567825,0.0015111936,0.00018515026,0.00073251437,0.0013463348,0.0005465912],"domain_scores_gemma":[0.9375041,0.04291291,0.0052960664,0.003574209,0.0067188637,0.0039938036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013278611,0.0031106258,0.0022056345,0.00547204,0.002004592,0.0041379943,0.0054008,0.0036087725,0.010417114],"category_scores_gemma":[0.07864791,0.0011752151,0.0028098659,0.002445845,0.007768843,0.0089686895,0.006042454,0.008515847,0.0013394725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004696701,0.000039595438,0.0004460332,0.000109993314,0.000038562157,0.00009599379,0.00018011301,0.03480942,0.0017813676,0.95907795,0.00092695985,0.002447068],"study_design_scores_gemma":[0.000018224182,0.00004010049,0.0002780158,0.00007334372,0.000028412842,0.00009924162,0.000054829165,0.402947,0.0012615792,0.5941681,0.000978253,0.000052886022],"about_ca_topic_score_codex":0.0022078592,"about_ca_topic_score_gemma":0.0013579406,"teacher_disagreement_score":0.013278611,"about_ca_system_score_codex":0.0042322506,"about_ca_system_score_gemma":0.0027698143,"threshold_uncertainty_score":0.07022488},"labels":[],"label_agreement":null},{"id":"W2953176496","doi":"10.48550/arxiv.1603.03510","title":"Adaptive Component-wise Multiple-Try Metropolis Sampling","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Metropolis–Hastings algorithm; Ergodicity; Markov chain Monte Carlo; Component (thermodynamics); Computer science; State space; Set (abstract data type); Algorithm; Mathematical optimization; Distribution (mathematics); State (computer science); Mathematics; Artificial intelligence; Machine learning; Statistics; Bayesian probability","score_opus":0.28618722771870797,"score_gpt":0.2785279568138975,"score_spread":0.007659270904810445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953176496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01028984,0.00020567399,0.9865675,0.00013236675,0.000057541787,0.00013914128,0.000061301245,0.000700528,0.0018461103],"genre_scores_gemma":[0.37560034,0.00033631964,0.6143879,0.00029310284,0.00013498994,0.0008868358,0.00050858984,0.00043655394,0.007415336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981122,0.0009121555,0.0000665914,0.00041520552,0.00036277677,0.00013097856],"domain_scores_gemma":[0.9945674,0.0036138033,0.00024338922,0.00088938174,0.0005314209,0.00015465937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387707,0.000999504,0.0017982698,0.0007858108,0.0007958062,0.0016454448,0.0036248458,0.0017359846,0.005930021],"category_scores_gemma":[0.012610163,0.0007966609,0.0009935593,0.0012969226,0.0018158416,0.0019373049,0.0018208215,0.0027227676,0.0018097053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005016758,0.00023679198,0.0035712386,0.00032083283,0.00018791684,0.00037762558,0.00035928588,0.5969546,0.006335888,0.25703266,0.0076331035,0.12648837],"study_design_scores_gemma":[0.000031137857,0.000024941068,0.00011834077,0.000010636418,0.0000132066325,0.0000528154,0.000011435527,0.9656981,0.0015578739,0.031000007,0.0014633768,0.000018107432],"about_ca_topic_score_codex":0.0031358954,"about_ca_topic_score_gemma":0.0045682685,"teacher_disagreement_score":0.005930021,"about_ca_system_score_codex":0.0009720868,"about_ca_system_score_gemma":0.0014964958,"threshold_uncertainty_score":0.019837856},"labels":[],"label_agreement":null},{"id":"W2962695226","doi":"10.1214/17-aop1230","title":"On the mixing time of Kac’s walk and other high-dimensional Gibbs samplers with constraints","year":2018,"lang":"en","type":"article","venue":"Project Euclid (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Mixing (physics); Random matrix; Random walk; Matrix (chemical analysis); Combinatorics; Singular value; Eigenvalues and eigenvectors; Concentration of measure; Markov chain; Statistical physics; Coupling (piping); Preprint; Discrete mathematics; Statistics; Physics; Quantum mechanics","score_opus":0.08648435779992523,"score_gpt":0.2598420888683249,"score_spread":0.17335773106839963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962695226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07463201,0.001154218,0.9137268,0.0017170414,0.00010173506,0.0001255708,0.00027668517,0.00032737572,0.007938556],"genre_scores_gemma":[0.7561528,0.0013852438,0.22334328,0.0015567185,0.0004711563,0.0010122384,0.0011714884,0.00086093944,0.014046155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699676,0.0015138565,0.000097234944,0.0006667607,0.00042995907,0.000295431],"domain_scores_gemma":[0.97091514,0.022231653,0.0020807548,0.0016163747,0.0010527524,0.002103212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008662172,0.0020459595,0.0020649238,0.002679237,0.0019193114,0.0027290585,0.0033377635,0.0031891798,0.006075293],"category_scores_gemma":[0.041103262,0.0012714572,0.002012539,0.0015389448,0.006244398,0.006338498,0.005118637,0.006453377,0.00091135636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013696267,0.00005398889,0.0015491358,0.00013549876,0.000090488305,0.00011012715,0.00025612753,0.09428123,0.0023253309,0.8934493,0.0014615986,0.0061501246],"study_design_scores_gemma":[0.000023088764,0.000034731347,0.00049237785,0.00003517146,0.000020607002,0.000038897044,0.000029914065,0.7204346,0.00065982796,0.27728513,0.000900961,0.000044689004],"about_ca_topic_score_codex":0.0038387782,"about_ca_topic_score_gemma":0.0042033093,"teacher_disagreement_score":0.008662172,"about_ca_system_score_codex":0.0031447352,"about_ca_system_score_gemma":0.001791373,"threshold_uncertainty_score":0.04581052},"labels":[],"label_agreement":null},{"id":"W2962703159","doi":"10.1016/j.laa.2012.01.010","title":"Holographic algorithms without matchgates","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Pfaffian; Mathematics; Skew; Computation; Algebraic number; Context (archaeology); Algorithm; Matrix (chemical analysis); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.06242420088524599,"score_gpt":0.36250441985277687,"score_spread":0.3000802189675309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962703159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009703367,0.0002803032,0.9799303,0.0005865702,0.00011180016,0.00005445406,0.000121532816,0.00023404357,0.008977786],"genre_scores_gemma":[0.4688864,0.0010691397,0.4907019,0.0009755785,0.00043573286,0.0005665646,0.00058761926,0.00056645874,0.03621064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968669,0.0014697924,0.00016275457,0.00053804705,0.0007090026,0.00025343316],"domain_scores_gemma":[0.9908697,0.0058922884,0.00040889432,0.0021274548,0.0004390887,0.0002625028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035365312,0.0008215381,0.0018470971,0.0017519973,0.0019230611,0.0033536146,0.0029259806,0.0023947023,0.011473247],"category_scores_gemma":[0.019031173,0.0010820528,0.0011966012,0.0023596527,0.0039930213,0.009012619,0.0054205107,0.0034595185,0.0015334344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037773676,0.000031390853,0.00009591376,0.00003106351,0.000013973901,0.000013635612,0.00003886737,0.017168174,0.00019824936,0.9682797,0.0010523609,0.0130388485],"study_design_scores_gemma":[0.000015430785,0.00001000203,0.000029117495,0.00000992336,0.0000061594983,0.000012457703,0.0000117329455,0.094013266,0.00041467266,0.9042898,0.0011776974,0.000009672155],"about_ca_topic_score_codex":0.0019606582,"about_ca_topic_score_gemma":0.0024176384,"teacher_disagreement_score":0.011473247,"about_ca_system_score_codex":0.0018959246,"about_ca_system_score_gemma":0.0024241195,"threshold_uncertainty_score":0.038381815},"labels":[],"label_agreement":null},{"id":"W2962860063","doi":"","title":"Parallel Markov Chain Monte Carlo via Spectral Clustering","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Monte Carlo method; Cluster analysis; Markov chain; Statistical physics; Hybrid Monte Carlo; Parallel tempering; Markov chain mixing time; Markov model; Markov property; Artificial intelligence; Mathematics; Machine learning; Statistics; Physics; Bayesian probability","score_opus":0.17240422264786448,"score_gpt":0.38940796997489474,"score_spread":0.21700374732703026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962860063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007707395,0.00014950182,0.9878483,0.00022251715,0.00009753844,0.00007659707,0.00007457942,0.00056615274,0.0032574765],"genre_scores_gemma":[0.34949154,0.00029796557,0.6405022,0.00028139513,0.0002357813,0.00060888997,0.0005394152,0.0006752559,0.0073675658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971136,0.0014321945,0.00012526156,0.000377599,0.0007687553,0.00018259304],"domain_scores_gemma":[0.9869091,0.00904566,0.0004842419,0.0019040928,0.0012553573,0.0004015791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045531583,0.0011311802,0.0024726642,0.0019985891,0.0019535683,0.0025007117,0.0029332694,0.0025441502,0.008815766],"category_scores_gemma":[0.0190989,0.0017323904,0.0018209049,0.0025206604,0.0023941828,0.0038152838,0.003824224,0.0026728243,0.0019423965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002027366,0.00013154357,0.0005304007,0.000093678,0.000097126125,0.00007213851,0.00009184551,0.7834888,0.0006049244,0.17953469,0.002188981,0.03296318],"study_design_scores_gemma":[0.000012429997,0.000004983969,0.00002695254,0.0000041343587,0.0000052482,0.0000085461415,0.0000036457518,0.9600933,0.00015616891,0.03933747,0.00034131386,0.000005822717],"about_ca_topic_score_codex":0.006813547,"about_ca_topic_score_gemma":0.0071360767,"teacher_disagreement_score":0.008815766,"about_ca_system_score_codex":0.001866433,"about_ca_system_score_gemma":0.0033315273,"threshold_uncertainty_score":0.029491663},"labels":[],"label_agreement":null},{"id":"W2962861789","doi":"10.1080/10618600.2019.1598872","title":"Adaptive Incremental Mixture Markov Chain Monte Carlo","year":2019,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Eunice Kennedy Shriver National Institute of Child Health and Human Development; Center for Advanced Study in the Behavioral Sciences, Stanford University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Insight SFI Research Centre for Data Analytics; Science Foundation Ireland; National Institutes of Health; National Science Foundation","keywords":"Markov chain Monte Carlo; Computer science; Kernel (algebra); Mixture model; Gaussian process; Mathematics; Bayesian probability; Semiparametric regression; Algorithm; Mathematical optimization; Parametric statistics; Artificial intelligence; Gaussian; Statistics","score_opus":0.021498321762273426,"score_gpt":0.298824804278164,"score_spread":0.27732648251589054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962861789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038948425,0.00015507327,0.9945773,0.00011891797,0.00003189518,0.00005230577,0.00006382021,0.0004285113,0.00067741686],"genre_scores_gemma":[0.2906869,0.00039270072,0.70397705,0.0003436937,0.00015302715,0.0006099304,0.00083398377,0.00035899106,0.00264363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803346,0.00097128114,0.000072631665,0.00032610446,0.00044300026,0.00015366712],"domain_scores_gemma":[0.990137,0.007382311,0.0005664429,0.0008572406,0.0007791409,0.00027786664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042229164,0.0009847685,0.0018624222,0.0013347969,0.0008046984,0.001481338,0.0044123516,0.0016668729,0.0033851068],"category_scores_gemma":[0.01702518,0.0011002923,0.0015069937,0.0014723304,0.0014698845,0.0023203946,0.002362618,0.00297675,0.0009828391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015670573,0.00008235068,0.002205466,0.00012039178,0.00011533333,0.00015633643,0.0001310951,0.85085607,0.00090089126,0.089416616,0.0025114438,0.053347237],"study_design_scores_gemma":[0.0000115756375,0.000007774229,0.000057736506,0.000006865288,0.000007094979,0.000014412009,0.00000305436,0.9829146,0.00017597871,0.016256012,0.00053678744,0.000008127455],"about_ca_topic_score_codex":0.0061029163,"about_ca_topic_score_gemma":0.009020966,"teacher_disagreement_score":0.0061029163,"about_ca_system_score_codex":0.0013185724,"about_ca_system_score_gemma":0.0021143197,"threshold_uncertainty_score":0.022333145},"labels":[],"label_agreement":null},{"id":"W2963165123","doi":"10.5555/3310435.3310569","title":"Improved bounds for randomly sampling colorings via linear programming","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Glauber; Mathematics; Combinatorics; Monomial; Discrete mathematics; Mixing (physics); Conjecture; Graph coloring; Graph; Physics","score_opus":0.14256571009564048,"score_gpt":0.26327407353735727,"score_spread":0.12070836344171679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963165123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04039071,0.002848246,0.90858793,0.0051195137,0.000462079,0.00030244607,0.001009672,0.0024114912,0.038867906],"genre_scores_gemma":[0.63746685,0.0028290895,0.32009453,0.004100781,0.0016474966,0.0016668674,0.0025124557,0.002361346,0.027320556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98896325,0.0046483465,0.00027518003,0.0020373198,0.0021093683,0.0019664888],"domain_scores_gemma":[0.9113013,0.07311336,0.0027181464,0.007279755,0.0031447087,0.0024427031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012199073,0.004091587,0.0040540933,0.0028802839,0.0027016439,0.0053998963,0.0075798267,0.0033747484,0.015579617],"category_scores_gemma":[0.06792682,0.0020240634,0.0030201108,0.0032048041,0.0059450474,0.012529819,0.0074961707,0.014190951,0.0031693983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085591624,0.0005573398,0.0025683662,0.00062620325,0.00021633523,0.00022502182,0.0004884299,0.4159218,0.0029143547,0.5230945,0.014209002,0.038322706],"study_design_scores_gemma":[0.00004116431,0.000067498804,0.00020678363,0.000054643384,0.00003083361,0.000037030833,0.00003462771,0.7923907,0.00061242905,0.2052186,0.0012770735,0.000028602524],"about_ca_topic_score_codex":0.0045066727,"about_ca_topic_score_gemma":0.007038023,"teacher_disagreement_score":0.015579617,"about_ca_system_score_codex":0.0070242337,"about_ca_system_score_gemma":0.0048123323,"threshold_uncertainty_score":0.06451565},"labels":[],"label_agreement":null},{"id":"W2963297472","doi":"10.1016/j.endm.2017.06.062","title":"Exponentially many nowhere-zero <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-, and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-flows","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Planar graph; Zero (linguistics); Graph; Exponential function; Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis; Philosophy","score_opus":0.023983512937305693,"score_gpt":0.26393773454377983,"score_spread":0.23995422160647414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963297472","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09139881,0.010953526,0.31648853,0.06782664,0.008258539,0.0003324825,0.014099845,0.009752551,0.48088902],"genre_scores_gemma":[0.39437047,0.0105921645,0.0716081,0.013337318,0.0027804906,0.0008978466,0.011964564,0.0048067593,0.48964232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960497,0.00073871564,0.0001636742,0.0011370194,0.0012555913,0.0006553914],"domain_scores_gemma":[0.98593605,0.0051730606,0.0008349784,0.0028892986,0.0038115177,0.0013551591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031321114,0.0016625546,0.0023488286,0.0023788773,0.0042099752,0.008443112,0.0033917848,0.00330227,0.11793392],"category_scores_gemma":[0.029275695,0.0012019548,0.002203822,0.002275272,0.0032303343,0.018761128,0.0053579975,0.0062479884,0.05552763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043212058,0.00020460928,0.0045467126,0.0008615095,0.00011466907,0.0004896199,0.0005420955,0.0058396733,0.0029091774,0.6711694,0.20718545,0.10570494],"study_design_scores_gemma":[0.00009505057,0.000097818585,0.0024694586,0.00039575933,0.00011920318,0.0012386728,0.0007991685,0.032298923,0.004625533,0.7782776,0.1794155,0.00016739074],"about_ca_topic_score_codex":0.0046788924,"about_ca_topic_score_gemma":0.0046155443,"teacher_disagreement_score":0.11793392,"about_ca_system_score_codex":0.0037839906,"about_ca_system_score_gemma":0.0033547033,"threshold_uncertainty_score":0.39452827},"labels":[],"label_agreement":null},{"id":"W2963371280","doi":"10.5555/3039686.3039807","title":"Random walks and evolving sets: faster convergences and limitations","year":2017,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random walk; Mathematics; Random graph; Vertex (graph theory); Graph partition; Spectral gap; Graph; Combinatorics; Expander graph; Discrete mathematics","score_opus":0.07027895424714435,"score_gpt":0.34703074391581556,"score_spread":0.2767517896686712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963371280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06414192,0.0015273418,0.9247993,0.0016267681,0.000081429134,0.00014241911,0.00012648538,0.0007735455,0.006780713],"genre_scores_gemma":[0.6313133,0.0016039113,0.36002186,0.00077486143,0.00023142688,0.0005165433,0.00038133454,0.00074646826,0.004410325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345326,0.003139124,0.00028851157,0.0012279911,0.001483482,0.00040770494],"domain_scores_gemma":[0.9125263,0.07026715,0.0032818343,0.009764974,0.0026929574,0.0014667092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012964545,0.0015544803,0.0021715302,0.0026776905,0.0014448074,0.002807414,0.0046547893,0.0031402048,0.00487344],"category_scores_gemma":[0.07248848,0.0010804614,0.0026562714,0.0018024343,0.0044101197,0.011763305,0.0042666295,0.0067800283,0.0011519354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004026489,0.00019363224,0.005129748,0.0005466497,0.00017405933,0.00019511518,0.0008328929,0.27851364,0.00634162,0.63489306,0.0017460248,0.07103086],"study_design_scores_gemma":[0.000027228694,0.00008488717,0.00036585398,0.00006109018,0.00002893806,0.00010767967,0.00005864344,0.8331704,0.0027679757,0.16189219,0.0014096865,0.000025407833],"about_ca_topic_score_codex":0.0018622006,"about_ca_topic_score_gemma":0.0014428631,"teacher_disagreement_score":0.012964545,"about_ca_system_score_codex":0.0018533611,"about_ca_system_score_gemma":0.0010700796,"threshold_uncertainty_score":0.06856388},"labels":[],"label_agreement":null},{"id":"W2963398635","doi":"","title":"Scalable MCMC for Mixed Membership Stochastic Blockmodels","year":2016,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Scalability; Inference; Computer science; Mathematical optimization; Algorithm; Markov chain; Monte Carlo method; Applied mathematics; Mathematics; Artificial intelligence; Machine learning; Bayesian probability; Statistics","score_opus":0.06906443377149273,"score_gpt":0.2839353260507567,"score_spread":0.21487089227926398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963398635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042986553,0.00012128343,0.9943393,0.00012846761,0.000022526123,0.000042791977,0.000097379,0.00044351406,0.000506045],"genre_scores_gemma":[0.22645365,0.000239007,0.76850194,0.00026205945,0.00010733376,0.00047777605,0.0010342668,0.0005005971,0.0024232818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846846,0.0006896741,0.000059768827,0.0003081447,0.00034388155,0.00013012784],"domain_scores_gemma":[0.99342996,0.0047926856,0.0003458022,0.0006189734,0.000530337,0.00028224548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032767553,0.0011691877,0.0016958984,0.0009546043,0.0009791296,0.0012946276,0.0036393225,0.0018480786,0.0046294983],"category_scores_gemma":[0.014822238,0.00095341046,0.0011782886,0.0011955843,0.0014602051,0.002207857,0.0024378316,0.0028511512,0.0010708801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009793321,0.00006105112,0.0009961932,0.000098732,0.00009453907,0.00008907172,0.00008888122,0.86846906,0.0012473285,0.07861505,0.0027046998,0.047437374],"study_design_scores_gemma":[0.000006389754,0.000003046851,0.000024322477,0.0000023780162,0.000002223701,0.0000046359696,0.0000018742161,0.9864689,0.000119444136,0.013124154,0.00023963614,0.0000028580591],"about_ca_topic_score_codex":0.014765763,"about_ca_topic_score_gemma":0.022569614,"teacher_disagreement_score":0.014765763,"about_ca_system_score_codex":0.0016547935,"about_ca_system_score_gemma":0.0034281914,"threshold_uncertainty_score":0.029359639},"labels":[],"label_agreement":null},{"id":"W2963431905","doi":"10.1090/proc/13284","title":"Bratelli Diagrams Where Random Orders are Imperfect","year":2017,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; University of Victoria; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Order (exchange); Diagram; Vertex (graph theory); Homeomorphism (graph theory); Enhanced Data Rates for GSM Evolution; Rank (graph theory); Discrete mathematics; Graph; Statistics; Computer science","score_opus":0.05880376639425772,"score_gpt":0.3335456523888553,"score_spread":0.2747418859945976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963431905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41337624,0.0009602672,0.51753825,0.0013814125,0.00017244904,0.0000990865,0.00056033634,0.00074694055,0.06516513],"genre_scores_gemma":[0.92992294,0.00030305746,0.055740334,0.00020724573,0.00006535976,0.00012253856,0.00023603624,0.00013381925,0.01326866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864155,0.00041564426,0.00006744012,0.00033350388,0.0003140817,0.00022783801],"domain_scores_gemma":[0.9915707,0.0048419815,0.0011263426,0.0015002005,0.00051469554,0.0004460289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015976973,0.00046463072,0.0008357928,0.0016260365,0.0013490841,0.0031390078,0.0010633204,0.0016202573,0.005501669],"category_scores_gemma":[0.011859288,0.00061993586,0.00067808194,0.00089959125,0.0029468548,0.0056078555,0.0013758471,0.0020121175,0.0006669368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019787494,0.000009443358,0.00040940332,0.000022126076,0.000004320846,0.000059266007,0.000072062816,0.0072649284,0.00051627134,0.98962027,0.00034209894,0.0016601017],"study_design_scores_gemma":[0.000014441829,0.0000135450455,0.00024096931,0.000019265715,0.000007897003,0.000116129864,0.000045688856,0.08212664,0.0010286962,0.9134641,0.0029049169,0.000017755165],"about_ca_topic_score_codex":0.0016122198,"about_ca_topic_score_gemma":0.0024841416,"teacher_disagreement_score":0.005501669,"about_ca_system_score_codex":0.0013717768,"about_ca_system_score_gemma":0.00078369485,"threshold_uncertainty_score":0.018404901},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07136927114476796,"score_gpt":0.3376477929546848,"score_spread":0.26627852180991685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963561977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033731132,0.00016770774,0.9946872,0.00009675192,0.000040191284,0.00007462974,0.000067319364,0.00059704506,0.0008959443],"genre_scores_gemma":[0.2038371,0.00037109238,0.78946495,0.00033304945,0.00013733954,0.0005325105,0.0005845038,0.00060064386,0.0041387808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860793,0.00071801763,0.00004495115,0.00019121364,0.00032456877,0.000113300695],"domain_scores_gemma":[0.9936941,0.004799971,0.00024073244,0.0006120112,0.00043696645,0.00021611841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031242382,0.00072691723,0.0015975793,0.0007411908,0.0006557876,0.0013177785,0.004019453,0.0019538733,0.0055266647],"category_scores_gemma":[0.010596228,0.000783266,0.0009980839,0.00092054514,0.001292485,0.0015691776,0.001866353,0.002964455,0.0016243112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003079794,0.00014148642,0.0011930736,0.00022309794,0.00015637687,0.00022031317,0.00014939343,0.7843727,0.0024661142,0.124089114,0.004019865,0.08266052],"study_design_scores_gemma":[0.0000331304,0.0000081499375,0.000042099953,0.00000776632,0.0000070495244,0.000013447116,0.000002950918,0.9878526,0.0003056737,0.010949787,0.000769502,0.000007923061],"about_ca_topic_score_codex":0.0076969443,"about_ca_topic_score_gemma":0.008341713,"teacher_disagreement_score":0.0076969443,"about_ca_system_score_codex":0.000922653,"about_ca_system_score_gemma":0.0029151305,"threshold_uncertainty_score":0.018488526},"labels":[],"label_agreement":null},{"id":"W2963623862","doi":"10.1214/11-ba628","title":"Bayesian Cointegrated Vector Autoregression Models Incorporating alpha-stable Noise for\\n Inter-day Price Movements Via Approximate Bayesian Computation","year":2011,"lang":"en","type":"article","venue":"Project Euclid (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"CVAR; Bayesian probability; Model selection; Econometrics; Mathematics; Gaussian; Computer science; Statistics; Expected shortfall; Economics; Finance","score_opus":0.12845838558214143,"score_gpt":0.28536745123388313,"score_spread":0.1569090656517417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963623862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017958257,0.00016010614,0.97979456,0.0002509716,0.000017426815,0.000020773277,0.00009037297,0.00014390855,0.0015636738],"genre_scores_gemma":[0.6985684,0.0011497902,0.28424975,0.00020338407,0.00015464309,0.00032612082,0.00068088237,0.00027836036,0.014388622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.00041127275,0.00004089068,0.00017817394,0.00025681037,0.00008789466],"domain_scores_gemma":[0.9962984,0.0024949047,0.00046730775,0.0002445338,0.000402447,0.00009232266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002454,0.0006244926,0.0011648744,0.0008376988,0.00044752678,0.0019969845,0.0024764203,0.0014147009,0.0024752403],"category_scores_gemma":[0.0128497435,0.0010354937,0.0010078335,0.0012288182,0.0011320076,0.0024397585,0.0011202354,0.0021475265,0.0006960821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019556503,0.000018586898,0.0009478391,0.000024692587,0.000023936893,0.00004911382,0.0000784648,0.8638014,0.00029717348,0.121837646,0.00053048594,0.012370969],"study_design_scores_gemma":[0.0000014629696,0.000002156503,0.00007951336,0.0000040139976,0.000002046967,0.0000042289817,0.0000035434218,0.9864318,0.000040772888,0.0132013615,0.00022480913,0.0000042246206],"about_ca_topic_score_codex":0.021827737,"about_ca_topic_score_gemma":0.019742541,"teacher_disagreement_score":0.021827737,"about_ca_system_score_codex":0.0015847591,"about_ca_system_score_gemma":0.0018071317,"threshold_uncertainty_score":0.04340136},"labels":[],"label_agreement":null},{"id":"W2963702270","doi":"","title":"Measuring the reliability of MCMC inference with bidirectional Monte Carlo","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Inference; Computer science; Bayesian inference; Monte Carlo method; Posterior probability; Approximate inference; Algorithm; Statistical inference; Artificial intelligence; Bayesian probability; Mathematics; Statistics","score_opus":0.07845018202371808,"score_gpt":0.31350586071201864,"score_spread":0.23505567868830057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963702270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06940558,0.0005710091,0.92551684,0.00063361414,0.000040967727,0.0000771879,0.0002417738,0.001516083,0.0019969721],"genre_scores_gemma":[0.66292256,0.0003445915,0.33427802,0.0002395986,0.00007378625,0.00022342139,0.0006644608,0.00073759974,0.0005159414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9836484,0.010606065,0.00088498206,0.0011890136,0.0032547219,0.00041685157],"domain_scores_gemma":[0.7705974,0.19428195,0.00596775,0.020438366,0.0071640327,0.0015504688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033141054,0.0012489352,0.0015325426,0.002830373,0.0010640003,0.002959346,0.002976733,0.0028428584,0.0020602548],"category_scores_gemma":[0.19714245,0.0012568162,0.0010648175,0.002504816,0.0033996126,0.004819785,0.0042085103,0.0045566023,0.0004428308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037011242,0.00007912009,0.010192652,0.000191409,0.00025151027,0.000107877444,0.00030855543,0.8688243,0.0012910365,0.0782539,0.0012903614,0.038839143],"study_design_scores_gemma":[0.000012510735,0.000016989126,0.00032046167,0.000018669942,0.000010915335,0.000021227175,0.000018931676,0.9693681,0.00071944454,0.02925193,0.0002290472,0.0000117392165],"about_ca_topic_score_codex":0.0070907697,"about_ca_topic_score_gemma":0.006026129,"teacher_disagreement_score":0.033141054,"about_ca_system_score_codex":0.0022736553,"about_ca_system_score_gemma":0.002898885,"threshold_uncertainty_score":0.17526877},"labels":[],"label_agreement":null},{"id":"W2963788285","doi":"10.1016/j.jmaa.2018.01.015","title":"A class of multi-marginal c-cyclically monotone sets with explicit c-splitting potentials","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Monotone polygon; Monotonic function; Converse; Class (philosophy); Regular polygon; Marginal distribution; Set (abstract data type); Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.046448099124116904,"score_gpt":0.3612512779943486,"score_spread":0.3148031788702317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963788285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45609763,0.0014504223,0.47726223,0.0017276481,0.0002506332,0.0001857424,0.0011694736,0.0004942269,0.061361983],"genre_scores_gemma":[0.92472076,0.0005118694,0.06084264,0.0004880393,0.0002811775,0.000236448,0.0007024763,0.00014831519,0.012068258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998606,0.00033377646,0.00007046086,0.00030809428,0.000429673,0.00025204383],"domain_scores_gemma":[0.99314606,0.003838851,0.00076715497,0.00056518684,0.00080631726,0.0008763491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017167495,0.000969243,0.0014931223,0.0026116574,0.0022614626,0.0036080438,0.0026223662,0.002424378,0.0063339593],"category_scores_gemma":[0.009822307,0.0009151363,0.0014507262,0.0017401396,0.0032932488,0.0030219276,0.0030130923,0.002852058,0.0004593059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003934005,0.000022010747,0.000390062,0.000050326864,0.000020421108,0.00017453355,0.00010182228,0.004762272,0.00083706743,0.9895354,0.0008359107,0.0032308022],"study_design_scores_gemma":[0.0000279711,0.000024837142,0.0004102176,0.000028003316,0.000013424648,0.0003988197,0.00006879502,0.07540643,0.00048699815,0.92134696,0.0017617833,0.000025778998],"about_ca_topic_score_codex":0.0013375144,"about_ca_topic_score_gemma":0.0009965568,"teacher_disagreement_score":0.0063339593,"about_ca_system_score_codex":0.0016014887,"about_ca_system_score_gemma":0.0013282557,"threshold_uncertainty_score":0.021189153},"labels":[],"label_agreement":null},{"id":"W2963911891","doi":"","title":"New inference strategies for solving Markov decision processes using reversible jump MCMC","year":2009,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Parameterized complexity; Computer science; Inference; Markov decision process; Markov chain; Markov process; Mathematical optimization; Reversible-jump Markov chain Monte Carlo; Jump; Artificial intelligence; Machine learning; Algorithm; Mathematics; Bayesian probability; Statistics","score_opus":0.12715495443492672,"score_gpt":0.41453365692668614,"score_spread":0.28737870249175945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963911891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007286041,0.00008029303,0.99860007,0.00007500789,0.000013644315,0.000019763387,0.00001764524,0.00009456168,0.00037048955],"genre_scores_gemma":[0.08258748,0.00044988559,0.9142685,0.00018418019,0.00011165565,0.0003488306,0.0001677266,0.00020805029,0.0016737139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768436,0.0010783831,0.00013627391,0.0003944734,0.00060301815,0.00010345346],"domain_scores_gemma":[0.9911026,0.007484855,0.0004142156,0.00042770588,0.00042128217,0.00014928891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005220752,0.0011823693,0.0015181561,0.0012529572,0.00071676396,0.0014547665,0.0032700375,0.0016766111,0.0047562425],"category_scores_gemma":[0.019163007,0.001080168,0.0013712524,0.0010940982,0.0017880208,0.0029190623,0.002076873,0.0039445977,0.00073634007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054675194,0.00010449846,0.0005547356,0.00020465035,0.00013283419,0.00013388241,0.00017214021,0.63422656,0.0013695522,0.2810159,0.0014203235,0.08061038],"study_design_scores_gemma":[0.000019498393,0.00000982068,0.00004395728,0.0000146192415,0.000011935667,0.000014283993,0.0000056809995,0.9465599,0.0003654685,0.052030787,0.0009117068,0.000012366835],"about_ca_topic_score_codex":0.0048163147,"about_ca_topic_score_gemma":0.0061178473,"teacher_disagreement_score":0.005220752,"about_ca_system_score_codex":0.0013958858,"about_ca_system_score_gemma":0.0021463896,"threshold_uncertainty_score":0.027610302},"labels":[],"label_agreement":null},{"id":"W2964270921","doi":"10.48550/arxiv.1511.07304","title":"","year":2015,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Mathematics; Markov chain; Simulated annealing; Kernel (algebra); Algorithm; Convergence (economics); Bounded function; Mathematical optimization; Discrete mathematics; Statistics","score_opus":0.32485831248321023,"score_gpt":0.24456735472649802,"score_spread":0.08029095775671222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964270921","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02054753,0.0007941193,0.94276637,0.001706897,0.0004184936,0.00017092793,0.00055454904,0.0006147315,0.032426458],"genre_scores_gemma":[0.6603885,0.0013739225,0.31177515,0.0020654642,0.0006769662,0.0010319971,0.0013744741,0.0009262539,0.020387156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974256,0.0007714408,0.00015071551,0.0007754308,0.0005453567,0.00033133436],"domain_scores_gemma":[0.9859789,0.008502051,0.001050056,0.002020283,0.0016942899,0.00075441436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039581303,0.001312332,0.0018560402,0.0011229604,0.0016361269,0.002326373,0.002487664,0.0027770689,0.016497163],"category_scores_gemma":[0.03252328,0.00064163405,0.0015456356,0.00079136225,0.0025858963,0.0034189343,0.0037082639,0.0046115112,0.0040406156],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001394134,0.00014247524,0.00084589346,0.00033598708,0.000076999975,0.00010988046,0.00015408098,0.11488254,0.005252753,0.83817464,0.011914776,0.027970474],"study_design_scores_gemma":[0.00003997575,0.00013667201,0.00040879493,0.00012273536,0.000039365368,0.0001487336,0.00006098597,0.55729014,0.004342094,0.4233977,0.013966117,0.0000466718],"about_ca_topic_score_codex":0.0015160159,"about_ca_topic_score_gemma":0.0016627493,"teacher_disagreement_score":0.98350286,"about_ca_system_score_codex":0.0015228622,"about_ca_system_score_gemma":0.0029864302,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2966312692","doi":"","title":"Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLT","year":2019,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Martingale (probability theory); Martingale difference sequence; Central limit theorem; Applied mathematics; Stochastic gradient descent; Rate of convergence; Multivariate random variable; Weak convergence; Mathematical analysis; Random variable; Statistics; Computer science","score_opus":0.05635044454367171,"score_gpt":0.33485420651463577,"score_spread":0.27850376197096405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966312692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01042259,0.0005532646,0.98559904,0.00045360834,0.0000936785,0.000057662102,0.000051526302,0.0002080397,0.0025605457],"genre_scores_gemma":[0.60492086,0.0019709037,0.37637088,0.00088914623,0.00046381744,0.00100657,0.00047152225,0.0007497591,0.013156411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947425,0.0029175368,0.0002316536,0.0005952699,0.0011558536,0.0003570772],"domain_scores_gemma":[0.95530385,0.03328168,0.0023547593,0.0025153963,0.0049310047,0.0016133193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01918491,0.0019715747,0.002046724,0.0033083605,0.0008111699,0.0023400343,0.0030375565,0.0019557832,0.0044854986],"category_scores_gemma":[0.08012067,0.00090180844,0.002311732,0.0014427169,0.00488939,0.004796594,0.004458407,0.0054673143,0.0008278421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119896475,0.00007124269,0.002050213,0.00025939685,0.00008876423,0.00021601483,0.00023960514,0.15387976,0.0020523337,0.8218493,0.0013754664,0.017798109],"study_design_scores_gemma":[0.000013044369,0.000045472567,0.0003290665,0.000042939224,0.000015507614,0.000059203823,0.000015194741,0.85082304,0.0009122188,0.14695169,0.00076654507,0.000026100672],"about_ca_topic_score_codex":0.0036271752,"about_ca_topic_score_gemma":0.0026084387,"teacher_disagreement_score":0.01918491,"about_ca_system_score_codex":0.0032323876,"about_ca_system_score_gemma":0.0024128729,"threshold_uncertainty_score":0.101460695},"labels":[],"label_agreement":null},{"id":"W2970316612","doi":"10.1155/2019/8740426","title":"Hierarchical Models and Tuning of Random Walk Metropolis Algorithms","year":2019,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Mathematics; Algorithm; Convergence (economics); Generator (circuit theory); State space; Gaussian; Metropolis–Hastings algorithm; Position (finance); Markov chain; Bayesian probability; Block (permutation group theory); Markov chain Monte Carlo; Mathematical optimization; Power (physics); Statistics","score_opus":0.07074976541297133,"score_gpt":0.3428458873885179,"score_spread":0.27209612197554656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970316612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02855879,0.00024503,0.9664818,0.000252362,0.0000406006,0.00008163972,0.00004912064,0.0003374945,0.00395318],"genre_scores_gemma":[0.75105363,0.00039497289,0.24066019,0.00025130226,0.00012862208,0.0005554988,0.00019303564,0.00033270285,0.0064300033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706984,0.0014042408,0.00012739806,0.00047591852,0.0006496777,0.00027292612],"domain_scores_gemma":[0.99010766,0.0066719223,0.0010226457,0.0011798608,0.0007184631,0.00029952166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006313422,0.00070827553,0.0012856146,0.0014588507,0.0007719988,0.0015527641,0.0023212468,0.001336462,0.0041485084],"category_scores_gemma":[0.026559196,0.0007224435,0.0009147361,0.0010038008,0.0021944854,0.002627152,0.001761246,0.0018464257,0.0007858988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006704929,0.00006291505,0.0012692373,0.00007339511,0.000046010457,0.00007470108,0.00018022138,0.52644765,0.0022868505,0.44874308,0.0011105537,0.019638432],"study_design_scores_gemma":[0.0000107024935,0.000016765109,0.0001481089,0.000008480932,0.000005920803,0.000012787776,0.000008390251,0.9140273,0.00033072862,0.08492065,0.00049878133,0.000011396907],"about_ca_topic_score_codex":0.002555724,"about_ca_topic_score_gemma":0.0025549848,"teacher_disagreement_score":0.006313422,"about_ca_system_score_codex":0.0017053027,"about_ca_system_score_gemma":0.0010822522,"threshold_uncertainty_score":0.033388972},"labels":[],"label_agreement":null},{"id":"W2971225791","doi":"","title":"Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discretization; Mathematics; Stochastic differential equation; Rate of convergence; Monte Carlo method; Applied mathematics; Runge–Kutta methods; Statistical physics; Mathematical analysis; Differential equation; Physics; Computer science","score_opus":0.10305511738128703,"score_gpt":0.22690292778659468,"score_spread":0.12384781040530765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971225791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02246646,0.00054116006,0.9722419,0.00030052153,0.00006785969,0.000045243632,0.00003381028,0.00044628276,0.0038567048],"genre_scores_gemma":[0.54416144,0.00094312674,0.4484996,0.00020491966,0.000100594996,0.00025651994,0.00012091701,0.00041912025,0.0052937674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991172,0.00040953245,0.00002853605,0.000117865515,0.00026702386,0.000059814218],"domain_scores_gemma":[0.9971841,0.0018740373,0.00018579245,0.00039221483,0.00025402568,0.00010977625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023985226,0.0007068241,0.000828029,0.00047834855,0.00045935911,0.00086516986,0.0011340907,0.0010485442,0.0018406826],"category_scores_gemma":[0.00793894,0.00046861146,0.0008629411,0.00044241178,0.0016794981,0.0013333585,0.0013417739,0.001931972,0.00047133857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008943735,0.000047649723,0.0006558955,0.00010831636,0.000043301778,0.00006553812,0.00013379176,0.72476333,0.003735986,0.2490467,0.0006390593,0.020671017],"study_design_scores_gemma":[0.0000048838265,0.000011340269,0.00004420376,0.000007523476,0.0000027347076,0.000008318435,0.0000028413037,0.9818939,0.00060449,0.016669096,0.0007462658,0.0000044022754],"about_ca_topic_score_codex":0.0042441273,"about_ca_topic_score_gemma":0.0031397943,"teacher_disagreement_score":0.0042441273,"about_ca_system_score_codex":0.0010747709,"about_ca_system_score_gemma":0.0015851839,"threshold_uncertainty_score":0.0126847625},"labels":[],"label_agreement":null},{"id":"W2974112908","doi":"10.1214/22-ejs2001","title":"Minimax confidence intervals for the Sliced Wasserstein distance","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Confidence distribution; Minimax; Frequentist inference; Coverage probability; CDF-based nonparametric confidence interval; Confidence interval; Wasserstein metric; Inference; Statistics; Robust confidence intervals; Probability distribution; Mathematical optimization; Bayesian probability; Applied mathematics; Bayesian inference; Artificial intelligence; Computer science","score_opus":0.047466875198157385,"score_gpt":0.355985738267535,"score_spread":0.3085188630693776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974112908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008840754,0.0005153219,0.98919934,0.00030046538,0.000028990715,0.000028795079,0.00010152237,0.00011867073,0.0008661308],"genre_scores_gemma":[0.58794415,0.0016925079,0.40626332,0.00047107998,0.00037566424,0.00052135694,0.00071808306,0.0003219553,0.0016918664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98913974,0.0052184775,0.0005944677,0.0019644084,0.002697885,0.00038497924],"domain_scores_gemma":[0.76626897,0.20413515,0.00995689,0.010533686,0.007302388,0.0018028807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02056533,0.001413645,0.002154194,0.0031669,0.00088902144,0.0037273492,0.0039494582,0.0025389947,0.0039142007],"category_scores_gemma":[0.19265862,0.0010052046,0.0016330711,0.0021258874,0.00507835,0.007926504,0.005794233,0.0059363963,0.000534256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001926463,0.000054813838,0.0031053843,0.00029932635,0.00012860575,0.0001369922,0.00029971855,0.28648248,0.0014001095,0.67229694,0.0011623978,0.034440625],"study_design_scores_gemma":[0.000025592777,0.00008299481,0.0006324154,0.00014061833,0.000023593904,0.000113841226,0.000034865378,0.6747779,0.0012297702,0.32174447,0.0011458938,0.000048039114],"about_ca_topic_score_codex":0.0012530456,"about_ca_topic_score_gemma":0.0007606721,"teacher_disagreement_score":0.02056533,"about_ca_system_score_codex":0.0022305513,"about_ca_system_score_gemma":0.0015362677,"threshold_uncertainty_score":0.10876119},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09901716239151234,"score_gpt":0.36126583490962355,"score_spread":0.26224867251811124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977245197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012182542,0.000079071746,0.9845418,0.000115788505,0.000032896904,0.0000687022,0.000047203153,0.00059212086,0.0023399245],"genre_scores_gemma":[0.3294675,0.00009087153,0.66724414,0.000099309334,0.000040692463,0.00028032143,0.00012081698,0.00024576517,0.0024105522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937963,0.00023803844,0.000034277746,0.00009235638,0.00019623335,0.00005944007],"domain_scores_gemma":[0.99826765,0.000837835,0.0001247293,0.0004218512,0.00023675489,0.00011121555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016210056,0.0004639974,0.00079886464,0.0003610324,0.0006083093,0.0008093466,0.00203454,0.0009801838,0.004082624],"category_scores_gemma":[0.00480829,0.0004071545,0.00061954866,0.0005883847,0.00093404547,0.00071606453,0.0015041162,0.0014186774,0.0007839888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011082709,0.000049825936,0.0006245375,0.000051965515,0.0000312286,0.00010716119,0.00008259331,0.9032765,0.0045530936,0.047382787,0.0013549546,0.042374447],"study_design_scores_gemma":[0.00001044996,0.0000064551928,0.000025850239,0.0000025072418,0.0000018408214,0.0000058392598,0.0000022573754,0.99486417,0.00037077136,0.0043161768,0.00039095545,0.0000028283496],"about_ca_topic_score_codex":0.0051058633,"about_ca_topic_score_gemma":0.005230067,"teacher_disagreement_score":0.0051058633,"about_ca_system_score_codex":0.0009143601,"about_ca_system_score_gemma":0.0014025338,"threshold_uncertainty_score":0.013657749},"labels":[],"label_agreement":null},{"id":"W2981650987","doi":"10.1017/s0004972719001102","title":"A NOTE ON NORMALISED HEAT DIFFUSION FOR GRAPHS","year":2019,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Monotonic function; Heat equation; Diffusion; Laplace operator; Heat kernel; Combinatorics; Mathematical analysis; Thermodynamics; Physics","score_opus":0.04348557945156247,"score_gpt":0.3252619150649488,"score_spread":0.28177633561338633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981650987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10650592,0.007912134,0.74308074,0.009470317,0.004335287,0.000079143676,0.00033548684,0.00067476515,0.12760621],"genre_scores_gemma":[0.80504596,0.0056237555,0.15385458,0.002885138,0.0029276053,0.0002024769,0.00017136762,0.0006615372,0.028627563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991683,0.00030621028,0.000040380743,0.00015763,0.00025245862,0.00007501372],"domain_scores_gemma":[0.99431205,0.004092997,0.00031951923,0.0005100905,0.00045227035,0.0003129429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022384876,0.00066980417,0.0008796825,0.0013508372,0.0010312585,0.0016852643,0.0013517477,0.0013080904,0.004979467],"category_scores_gemma":[0.015178439,0.0003778792,0.0010454725,0.0012354737,0.0055275243,0.0039335703,0.0019836267,0.0032693413,0.00060875935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000309329,0.000012047046,0.00023050811,0.00009992607,0.0000103430475,0.00011277983,0.00018327845,0.008354517,0.0025259329,0.9793682,0.002679547,0.006392013],"study_design_scores_gemma":[0.0000044659305,0.000019817153,0.00031974938,0.000026692058,0.000006400726,0.00012436096,0.000026607197,0.02891992,0.0006438261,0.96437764,0.0055076005,0.000023026785],"about_ca_topic_score_codex":0.0019473844,"about_ca_topic_score_gemma":0.0018915226,"teacher_disagreement_score":0.004979467,"about_ca_system_score_codex":0.0010973675,"about_ca_system_score_gemma":0.0005084753,"threshold_uncertainty_score":0.016657948},"labels":[],"label_agreement":null},{"id":"W2996445992","doi":"10.1515/ijb-2017-0092","title":"Incorporating Contact Network Uncertainty in Individual Level Models of Infectious Disease using Approximate Bayesian Computation","year":2019,"lang":"en","type":"article","venue":"The International Journal of Biostatistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Markov chain Monte Carlo; Approximate Bayesian computation; Computer science; Computation; Bayesian probability; Particle filter; Population; Bayesian network; Monte Carlo method; Variable-order Bayesian network; Markov chain; Context (archaeology); Bayesian inference; Statistics; Machine learning; Artificial intelligence; Algorithm; Mathematics; Inference; Medicine","score_opus":0.10958220674951051,"score_gpt":0.36164546272418807,"score_spread":0.25206325597467755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996445992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04737578,0.00028754372,0.95005536,0.00039522903,0.00001732517,0.00004242229,0.000102589955,0.00015746558,0.0015662037],"genre_scores_gemma":[0.7766154,0.00055475143,0.2193591,0.0001894537,0.00009621504,0.0002617719,0.00033883718,0.00014993739,0.0024344553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998329,0.0011191571,0.000049735754,0.00015916624,0.0002544765,0.00008845513],"domain_scores_gemma":[0.98119307,0.016911596,0.00073225016,0.0005584484,0.00042591715,0.00017880245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040137707,0.000528324,0.0012004074,0.0012301028,0.0006430513,0.0015498535,0.0016657242,0.0015246731,0.002227016],"category_scores_gemma":[0.031001361,0.0007499819,0.0007725135,0.0013554145,0.0014295616,0.0020296674,0.0014931593,0.0015727788,0.00029675785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013569081,0.000011419491,0.001052593,0.000016620412,0.000015878695,0.00003348919,0.00004460635,0.97587705,0.00006928825,0.017450059,0.0001672262,0.005248157],"study_design_scores_gemma":[0.000002184134,0.000002631144,0.00009071112,0.0000030244362,0.0000019819988,0.0000067483493,0.0000055746436,0.98646754,0.000017120374,0.013296618,0.00010347775,0.0000023691239],"about_ca_topic_score_codex":0.02288003,"about_ca_topic_score_gemma":0.0155037,"teacher_disagreement_score":0.02288003,"about_ca_system_score_codex":0.0014281941,"about_ca_system_score_gemma":0.0015653775,"threshold_uncertainty_score":0.045493662},"labels":[],"label_agreement":null},{"id":"W3000152275","doi":"10.1145/3357713.3384317","title":"Improved analysis of higher order random walks and applications","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Markov chain; Random walk; Mixing (physics); Partition (number theory); Mathematics; Eigenvalues and eigenvectors; Combinatorics; Simplicial complex; Order (exchange); Discrete mathematics; Graph; Statistics; Physics","score_opus":0.06193509587964911,"score_gpt":0.3708162193707265,"score_spread":0.3088811234910774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000152275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08904966,0.0016739403,0.8920666,0.000979166,0.00017247882,0.000054321543,0.00015433383,0.00028689136,0.015562648],"genre_scores_gemma":[0.86071503,0.0016796776,0.11451517,0.00043428454,0.0005134652,0.00018401553,0.00025640996,0.0004110437,0.021291006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762684,0.0010122836,0.00009823875,0.00036425635,0.00069459213,0.00020377373],"domain_scores_gemma":[0.9869675,0.00899549,0.0010089038,0.0010846473,0.0010793167,0.0008641231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003534344,0.0013260437,0.0016302919,0.0031997797,0.0009176111,0.002542424,0.0019216596,0.0019422374,0.006208488],"category_scores_gemma":[0.016722217,0.00079168123,0.002024126,0.0017748086,0.0026776919,0.0044179065,0.00271606,0.004239745,0.00068289915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030367839,0.00005446069,0.00094426895,0.00008850809,0.0000360251,0.00012377754,0.00016464613,0.0937423,0.0025430757,0.89642155,0.00057766173,0.005273311],"study_design_scores_gemma":[0.000005569894,0.000015679108,0.00039559838,0.000016150689,0.000008827712,0.00005055369,0.000023269282,0.63589734,0.0005461353,0.3617171,0.0013035978,0.000020190768],"about_ca_topic_score_codex":0.0027792302,"about_ca_topic_score_gemma":0.002548327,"teacher_disagreement_score":0.006208488,"about_ca_system_score_codex":0.0022637532,"about_ca_system_score_gemma":0.0008471229,"threshold_uncertainty_score":0.020769417},"labels":[],"label_agreement":null},{"id":"W3003466463","doi":"10.48550/arxiv.2001.11950","title":"Non-reversibly updating a uniform [0,1] value for Metropolis accept/reject decisions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Langevin dynamics; Markov chain Monte Carlo; Statistical physics; Gibbs sampling; Hyperparameter; Langevin equation; Computer science; Markov chain; Hybrid Monte Carlo; Sampling (signal processing); Random walk; Monte Carlo method; Bayesian probability; Algorithm; Mathematics; Physics; Statistics; Artificial intelligence; Machine learning","score_opus":0.2616734869321065,"score_gpt":0.3020885920233797,"score_spread":0.04041510509127316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003466463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022130756,0.00039603477,0.9673575,0.001083566,0.00028641603,0.00014743097,0.000103611004,0.0011455374,0.007349157],"genre_scores_gemma":[0.485485,0.00032555131,0.505655,0.00066351244,0.00017093935,0.00039834314,0.00023234251,0.00058335246,0.006486038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530584,0.0026182216,0.00022680126,0.0007580343,0.00079487276,0.00029624585],"domain_scores_gemma":[0.9839733,0.011852213,0.0008352433,0.002104381,0.0009034337,0.0003313636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00625267,0.0011567329,0.0011882047,0.00070999714,0.00095097907,0.0030664778,0.00282328,0.0019167938,0.011335141],"category_scores_gemma":[0.04540697,0.0005972468,0.0007939564,0.00078309985,0.003154009,0.0040505696,0.0020928453,0.004673994,0.0016510818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064417336,0.00022359315,0.002758984,0.0002480138,0.000113212875,0.00021243606,0.00022397301,0.36827898,0.004642892,0.4872264,0.006477794,0.1289494],"study_design_scores_gemma":[0.000044069344,0.00007301295,0.00018799289,0.000036607173,0.000020150725,0.000053832464,0.00002425663,0.8992171,0.0044766497,0.09343004,0.0024006348,0.000035597277],"about_ca_topic_score_codex":0.003134876,"about_ca_topic_score_gemma":0.0037838141,"teacher_disagreement_score":0.011335141,"about_ca_system_score_codex":0.002195815,"about_ca_system_score_gemma":0.0025842316,"threshold_uncertainty_score":0.03791982},"labels":[],"label_agreement":null},{"id":"W3005422976","doi":"","title":"Introduction to the Monte Carlo models session","year":2009,"lang":"en","type":"article","venue":"Lund University Publications (Lund University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Monte Carlo method; Session (web analytics); Computer science; Statistical physics; Mathematics; Statistics; Physics; World Wide Web","score_opus":0.04549912796696998,"score_gpt":0.26926393305261703,"score_spread":0.22376480508564706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005422976","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018288154,0.059150334,0.5711712,0.04351058,0.023230478,0.00029263025,0.0041976096,0.0027972246,0.293821],"genre_scores_gemma":[0.06680874,0.086367905,0.22476676,0.014794069,0.043066934,0.0013453114,0.006501029,0.0042205644,0.55212873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980344,0.0007798876,0.00012039004,0.00038560262,0.00057375425,0.00010602106],"domain_scores_gemma":[0.99373287,0.004028803,0.00018777317,0.00082867267,0.0008783333,0.0003435803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039116805,0.0014566871,0.0016402487,0.0019914554,0.0011473835,0.0048235673,0.0015325127,0.003803636,0.11357474],"category_scores_gemma":[0.010866746,0.0014283321,0.0019027657,0.0022111572,0.0019305779,0.005063882,0.0024085268,0.007344318,0.049290553],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040593317,0.00009736874,0.0002167678,0.0002455411,0.000029647514,0.0000812977,0.00011412711,0.004774168,0.0003395908,0.6205826,0.28784055,0.08563771],"study_design_scores_gemma":[0.000015662925,0.000023385035,0.00024804648,0.0002944869,0.00001170782,0.00018125882,0.000023260569,0.0062770243,0.000235325,0.38242128,0.61022055,0.00004805116],"about_ca_topic_score_codex":0.0023346383,"about_ca_topic_score_gemma":0.0020675706,"teacher_disagreement_score":0.11357474,"about_ca_system_score_codex":0.0025703728,"about_ca_system_score_gemma":0.0032061387,"threshold_uncertainty_score":0.37994534},"labels":[],"label_agreement":null},{"id":"W3011234689","doi":"10.1109/tpds.2020.2972359","title":"Replica Exchange MCMC Hardware With Automatic Temperature Selection and Parallel Trial","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Replica; Computer science; Travelling salesman problem; Simulated annealing; Parallel tempering; Speedup; Markov chain Monte Carlo; Schedule; Parallel computing; Algorithm; Bayesian probability; Hybrid Monte Carlo; Artificial intelligence","score_opus":0.05291072562791479,"score_gpt":0.2919955292406469,"score_spread":0.23908480361273213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011234689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050582826,0.00037231686,0.9294202,0.00015356518,0.000104079976,0.00020299469,0.00020994918,0.009204753,0.009749411],"genre_scores_gemma":[0.41358685,0.00013084595,0.5820509,0.00009707052,0.000024393183,0.0003642497,0.00033319514,0.0003801619,0.0030323288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.00009734436,0.000021069187,0.000069592905,0.00017008095,0.000050548813],"domain_scores_gemma":[0.99944335,0.00019172543,0.00004408154,0.00017919976,0.000113868184,0.000027724805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055834797,0.00048470532,0.00071052037,0.0004586232,0.00046143122,0.0006077845,0.0018184485,0.0006454459,0.00575218],"category_scores_gemma":[0.0017128916,0.00039425923,0.00043953944,0.0007846693,0.00044851436,0.00047439165,0.00046739774,0.0010288052,0.0012676296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067489705,0.00027836172,0.003111744,0.0003657869,0.0002099481,0.00027264055,0.00018432614,0.6258358,0.051363982,0.050850417,0.009363434,0.25748876],"study_design_scores_gemma":[0.00006326563,0.000052157997,0.00030808704,0.0000072128482,0.00001642842,0.000051396495,0.0000065650565,0.9806403,0.012054018,0.0030599316,0.0037246803,0.00001588296],"about_ca_topic_score_codex":0.0037434832,"about_ca_topic_score_gemma":0.0049719666,"teacher_disagreement_score":0.00575218,"about_ca_system_score_codex":0.00067352486,"about_ca_system_score_gemma":0.0013632359,"threshold_uncertainty_score":0.019242942},"labels":[],"label_agreement":null},{"id":"W3012473311","doi":"10.1109/cdc40024.2019.9029722","title":"Discounted Mirror Descent Dynamics in Concave Games","year":2019,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamics (music); Convergence (economics); Monotone polygon; Descent (aeronautics); Monotonic function; Gradient descent; Kernel (algebra); Computer science; Mathematical optimization; Mathematics; Applied mathematics; Discrete mathematics; Mathematical analysis; Artificial intelligence; Geometry; Physics","score_opus":0.041060899513192056,"score_gpt":0.3510207421777824,"score_spread":0.3099598426645903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012473311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18507904,0.0002096959,0.8049932,0.00046517947,0.00005254806,0.00009536564,0.00007940281,0.00013749374,0.008888187],"genre_scores_gemma":[0.95332444,0.00017723757,0.039531134,0.00009865697,0.00001678723,0.000095202595,0.00004309646,0.000039948925,0.0066734403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.0003163859,0.000025176794,0.000102004335,0.00011519078,0.0000797592],"domain_scores_gemma":[0.9977984,0.0013340224,0.0002193688,0.00014729663,0.00027354367,0.00022738332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016302374,0.00067655946,0.00083028397,0.00046759364,0.00059375254,0.0013503548,0.001184016,0.00097306713,0.0031859102],"category_scores_gemma":[0.009205068,0.00035273156,0.0006239798,0.00022909525,0.0019055506,0.0022018943,0.0011240231,0.0012714844,0.00030922034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013112849,0.00007337159,0.0012690908,0.000078986115,0.000040379306,0.00023639837,0.00027863582,0.28371844,0.0043548993,0.69886935,0.0008603517,0.010088875],"study_design_scores_gemma":[0.000014709469,0.000038107715,0.00013902037,0.0000075842886,0.0000046852215,0.000039563787,0.000032653097,0.9078259,0.0005744534,0.09080059,0.00051104027,0.000011707062],"about_ca_topic_score_codex":0.004060566,"about_ca_topic_score_gemma":0.0022535697,"teacher_disagreement_score":0.004060566,"about_ca_system_score_codex":0.0018231153,"about_ca_system_score_gemma":0.0010234265,"threshold_uncertainty_score":0.013227642},"labels":[],"label_agreement":null},{"id":"W3021867977","doi":"10.48550/arxiv.1904.12157","title":"Optimal Scaling of Random-Walk Metropolis Algorithms on General Target Distributions","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Scaling; Random walk; Markov chain Monte Carlo; Bayesian probability; Metropolis–Hastings algorithm; Mathematics; Distribution (mathematics); Mathematical optimization; Algorithm; Prior probability; Limit (mathematics); Applied mathematics; Diffusion; Probability distribution; Statistical physics; Computer science; Statistics; Mathematical analysis","score_opus":0.12147352763203881,"score_gpt":0.26570489546041615,"score_spread":0.14423136782837734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021867977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061462678,0.0006758599,0.9268289,0.0006784708,0.0000767203,0.00011100815,0.00008958972,0.0004260644,0.00965066],"genre_scores_gemma":[0.81303626,0.000882051,0.1798298,0.00033784442,0.00015333705,0.00045763102,0.00023787389,0.0004631001,0.004602113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966182,0.0015353515,0.00023690013,0.0006048335,0.0006789785,0.0003258141],"domain_scores_gemma":[0.97550255,0.01882715,0.0014738477,0.001984606,0.0015516969,0.0006601678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00559538,0.0009894939,0.0014602107,0.0011192812,0.0008042277,0.0026105435,0.0015009093,0.00144722,0.0034799268],"category_scores_gemma":[0.041416116,0.00073700206,0.0008056386,0.0010448631,0.002280388,0.0052921264,0.00265271,0.0021463516,0.0006551167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014851155,0.00011166492,0.0013525155,0.00023747348,0.00004677939,0.00011743817,0.00026293416,0.37983543,0.004126346,0.5882882,0.0020477138,0.02342505],"study_design_scores_gemma":[0.000014332128,0.0000199408,0.00014938282,0.000015523943,0.000005593573,0.000025295938,0.000020493639,0.8703334,0.0011069694,0.12773345,0.0005643668,0.00001135743],"about_ca_topic_score_codex":0.0010805215,"about_ca_topic_score_gemma":0.0009112647,"teacher_disagreement_score":0.00559538,"about_ca_system_score_codex":0.0021371504,"about_ca_system_score_gemma":0.0013692329,"threshold_uncertainty_score":0.02959156},"labels":[],"label_agreement":null},{"id":"W3026366478","doi":"10.1016/j.spa.2020.05.004","title":"Optimal scaling of random-walk metropolis algorithms on general target distributions","year":2020,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scaling; Random walk; Markov chain Monte Carlo; Bayesian probability; Metropolis–Hastings algorithm; Distribution (mathematics); Applied mathematics; Algorithm; Prior probability; Asymptotically optimal algorithm; Limit (mathematics); Mathematical optimization; Probability distribution; Statistical physics; Statistics; Mathematical analysis","score_opus":0.04112606456423818,"score_gpt":0.3193986184460046,"score_spread":0.2782725538817664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026366478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036572196,0.001088869,0.95108587,0.0010335428,0.00023209903,0.00013473135,0.00009161097,0.00040272172,0.009358374],"genre_scores_gemma":[0.7057017,0.0019657551,0.2730639,0.00067817164,0.0006259119,0.0008378332,0.0004056132,0.0011436585,0.01557741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996761,0.0018164755,0.00014272248,0.00047505455,0.0005283244,0.00027643764],"domain_scores_gemma":[0.97029054,0.024084521,0.0012615052,0.0016574425,0.0016231262,0.0010828598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008869829,0.0017427781,0.0030131813,0.0020861935,0.0014195525,0.0037821108,0.0033951001,0.0032122813,0.00620759],"category_scores_gemma":[0.047666002,0.0017121629,0.0011909254,0.0018713091,0.0041055167,0.0073670214,0.004115599,0.0036448922,0.00079066574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014159815,0.00012773322,0.00044677127,0.0001674378,0.000055207485,0.000057596168,0.00013926734,0.34145924,0.0011860335,0.6396296,0.0024963343,0.014093183],"study_design_scores_gemma":[0.000015609234,0.000014009878,0.0000735729,0.0000149121015,0.0000066217694,0.0000100621755,0.000011272853,0.8609071,0.0002366071,0.1383027,0.00039629333,0.000011254602],"about_ca_topic_score_codex":0.0027688623,"about_ca_topic_score_gemma":0.0024632132,"teacher_disagreement_score":0.008869829,"about_ca_system_score_codex":0.0034554098,"about_ca_system_score_gemma":0.002850389,"threshold_uncertainty_score":0.046908677},"labels":[],"label_agreement":null},{"id":"W3036967870","doi":"10.1017/apr.2021.10","title":"Approximations of geometrically ergodic reversible markov chains","year":2021,"lang":"en","type":"preprint","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodic theory; Ergodicity; Markov chain Monte Carlo; Markov chain; Stationary distribution; Mathematics; Stationary ergodic process; Kernel (algebra); Markov chain mixing time; Statistical physics; Monte Carlo method; Applied mathematics; Computation; Distribution (mathematics); Markov model; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis; Markov property; Physics; Statistics; Invariant measure","score_opus":0.05472042717793013,"score_gpt":0.3471632967997076,"score_spread":0.29244286962177746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036967870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100967586,0.00040752025,0.8914157,0.0004972473,0.00006480382,0.000074190255,0.00016089027,0.00034796438,0.006064057],"genre_scores_gemma":[0.90119267,0.0004346418,0.09330537,0.0001859981,0.00007259872,0.00012745494,0.00037332697,0.00018112287,0.0041268417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834895,0.00070093083,0.00006916995,0.0002422493,0.00047177164,0.00016699801],"domain_scores_gemma":[0.98970246,0.007027755,0.0010750111,0.0010385229,0.0007890335,0.00036716394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055088,0.00073296984,0.0010463792,0.001906005,0.00076992257,0.0015914494,0.0019648485,0.0013936774,0.004069009],"category_scores_gemma":[0.026099479,0.00060473476,0.0009850102,0.0008309373,0.0034535336,0.0024683564,0.0020932825,0.0023945337,0.0005302295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000517284,0.000032199645,0.0014187525,0.000061981205,0.000024982606,0.00010167364,0.0001314819,0.56023085,0.0009517925,0.43125507,0.00057383324,0.0051656794],"study_design_scores_gemma":[0.0000052219284,0.000008829615,0.00012200292,0.000015088249,0.0000034391196,0.000017112052,0.000015286296,0.9164977,0.00027514112,0.08271149,0.00032042677,0.000008258143],"about_ca_topic_score_codex":0.005008388,"about_ca_topic_score_gemma":0.0042933277,"teacher_disagreement_score":0.005008388,"about_ca_system_score_codex":0.0021392044,"about_ca_system_score_gemma":0.0012795702,"threshold_uncertainty_score":0.016157031},"labels":[],"label_agreement":null},{"id":"W3045563289","doi":"10.1214/19-aap1526","title":"Thermalisation for small random perturbations of dynamical systems","year":2020,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Ordinary differential equation; Attractor; Exponential growth; Mathematical analysis; Stochastic differential equation; Applied mathematics; Markov chain; Statistical physics; Differential equation; Statistics","score_opus":0.30096749444650295,"score_gpt":0.37388627206502417,"score_spread":0.07291877761852122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045563289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24712427,0.0011590631,0.7321761,0.0013709605,0.00023466573,0.00014156291,0.00008222174,0.00026719712,0.017443916],"genre_scores_gemma":[0.9678825,0.00047952734,0.025463426,0.00023438249,0.00010423349,0.00013470485,0.000053381133,0.00009643461,0.0055513955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993443,0.0003083291,0.000024946341,0.000095983516,0.00013832559,0.000088119334],"domain_scores_gemma":[0.9977139,0.0013228997,0.00033524228,0.00017867911,0.00021863701,0.00023060033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014689442,0.00061195035,0.0006172992,0.0007632109,0.0006005058,0.001140458,0.00081344804,0.0010691411,0.0021440275],"category_scores_gemma":[0.0068275756,0.00033035676,0.00068441656,0.0002480614,0.00297076,0.002202364,0.0019056294,0.0016360928,0.00021517827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010206708,0.00003813379,0.00081024255,0.000112053654,0.000033775,0.00033314785,0.00031532935,0.21311454,0.009129642,0.7715179,0.00056979124,0.0039233943],"study_design_scores_gemma":[0.000014462588,0.00004566905,0.00025916076,0.000015468991,0.0000070611723,0.000049661394,0.000045109326,0.8007904,0.0011108211,0.196905,0.0007418565,0.000015397783],"about_ca_topic_score_codex":0.0012805022,"about_ca_topic_score_gemma":0.0008147757,"teacher_disagreement_score":0.0021440275,"about_ca_system_score_codex":0.0010437225,"about_ca_system_score_gemma":0.0005079289,"threshold_uncertainty_score":0.0077685714},"labels":[],"label_agreement":null},{"id":"W3049754944","doi":"10.4153/s0008439520000636","title":"Mixing and average mixing times for general Markov processes","year":2020,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Mixing (physics); Markov chain; Multiplicative function; Constant (computer programming); Pure mathematics; Discrete mathematics; Statistical physics; Mathematical analysis; Statistics; Computer science","score_opus":0.04784284881614583,"score_gpt":0.29177769943505366,"score_spread":0.24393485061890782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049754944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3959692,0.002403941,0.5843522,0.0016239171,0.0001448462,0.000077472716,0.00028111966,0.00031249595,0.0148348035],"genre_scores_gemma":[0.96571624,0.00083522376,0.028515646,0.00014126314,0.00018603518,0.00010711258,0.00018416897,0.00009146582,0.004222916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783236,0.00068447454,0.00012406692,0.00058166357,0.00050644047,0.00027091856],"domain_scores_gemma":[0.9836543,0.012267831,0.0015540606,0.00082706125,0.00085070997,0.00084604236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006302907,0.0007777109,0.0011756719,0.0026600487,0.0010925038,0.0023660676,0.001322329,0.0012769956,0.004389643],"category_scores_gemma":[0.025409121,0.0006130262,0.0013529087,0.0011823395,0.003817875,0.004746062,0.0021901617,0.0024728137,0.00027781978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000683688,0.00002076615,0.00092188705,0.00006356255,0.000051291736,0.00010000038,0.0002268638,0.025459567,0.0024246671,0.9667705,0.00024127749,0.0036511899],"study_design_scores_gemma":[0.000021033215,0.000026233361,0.00067986245,0.000019628571,0.000023267772,0.000079250996,0.000037162194,0.22865847,0.001238252,0.7684583,0.00073142163,0.00002710006],"about_ca_topic_score_codex":0.0019662243,"about_ca_topic_score_gemma":0.0010730523,"teacher_disagreement_score":0.006302907,"about_ca_system_score_codex":0.0024651552,"about_ca_system_score_gemma":0.0011270918,"threshold_uncertainty_score":0.03333336},"labels":[],"label_agreement":null},{"id":"W3080502369","doi":"10.1007/s00283-021-10058-w","title":"The-Square-and-Add Markov Chain","year":2021,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Finite field; Galois theory; Chain (unit); Markov process; Field (mathematics)","score_opus":0.09580324888480413,"score_gpt":0.3793122009293051,"score_spread":0.283508952044501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080502369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037319403,0.0004708829,0.9274553,0.0025977197,0.00047105987,0.00014347973,0.00057043385,0.0005209855,0.030450787],"genre_scores_gemma":[0.7628263,0.0010629136,0.17909177,0.0011909922,0.000529374,0.00042326906,0.0006633806,0.0001689237,0.05404303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981639,0.0007415979,0.00006836675,0.0003910571,0.00036519632,0.00026984673],"domain_scores_gemma":[0.98666394,0.00962476,0.000431024,0.0014568267,0.0013022589,0.0005211607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029542292,0.000762663,0.0014653242,0.0011481423,0.0015937415,0.0027847597,0.0022267194,0.0023280072,0.017843364],"category_scores_gemma":[0.01916061,0.00071843667,0.0010879133,0.0012395374,0.0041498304,0.0048009437,0.0024991527,0.0034284848,0.0023514312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006799578,0.00003497794,0.000572716,0.00003550915,0.000015558802,0.0000727484,0.00007125332,0.03790207,0.00018571693,0.9478188,0.0030154982,0.0102070505],"study_design_scores_gemma":[0.000030684907,0.00001809379,0.00013150708,0.000014881772,0.00001314175,0.000049396684,0.000020572637,0.36723068,0.00026676766,0.63033086,0.0018707126,0.000022752907],"about_ca_topic_score_codex":0.005174634,"about_ca_topic_score_gemma":0.0053347354,"teacher_disagreement_score":0.017843364,"about_ca_system_score_codex":0.00170867,"about_ca_system_score_gemma":0.0024262122,"threshold_uncertainty_score":0.059692025},"labels":[],"label_agreement":null},{"id":"W3082702514","doi":"10.1007/s11538-021-00920-5","title":"Variance Reduction with Array-RQMC for Tau-Leaping Simulation of Stochastic Biological and Chemical Reaction Networks","year":2021,"lang":"en","type":"preprint","venue":"Bulletin of Mathematical Biology","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Ministerio de Economía y Competitividad; European Regional Development Fund; European Science Foundation; Eusko Jaurlaritza; Canada Research Chairs; Ministerio de Ciencia, Innovación y Universidades","keywords":"Variance reduction; Sorting; Markov chain Monte Carlo; Markov chain; Variance (accounting); Estimator; Monte Carlo method; Computer science; Sample (material); Reduction (mathematics); Algorithm; Function (biology); Mathematics; Mathematical optimization; Statistics; Physics","score_opus":0.07289785100481763,"score_gpt":0.34143123602288394,"score_spread":0.26853338501806634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082702514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022692058,0.00021300561,0.97306496,0.00032148598,0.00007209141,0.000044773762,0.00013410364,0.0011946396,0.0022629881],"genre_scores_gemma":[0.5955396,0.00020795016,0.39788076,0.00035631354,0.00012869593,0.0005743509,0.0004593841,0.0011497989,0.0037030897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901927,0.00052503945,0.00003341199,0.00012319967,0.00020964767,0.00008947663],"domain_scores_gemma":[0.9925408,0.0057009915,0.00026685974,0.0006524924,0.00059962325,0.00023934066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026851005,0.00076760136,0.0017169873,0.00085996644,0.0008254549,0.0011173125,0.0023836622,0.0018058247,0.0043226066],"category_scores_gemma":[0.012729992,0.00081897003,0.0013931268,0.00078791595,0.0012410247,0.001108198,0.0017069246,0.0029314277,0.0007033186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007929152,0.00004865579,0.0004985846,0.000048008194,0.00005409002,0.000055399978,0.000050430714,0.94216454,0.00091239926,0.046849646,0.0007380573,0.008500778],"study_design_scores_gemma":[0.0000035515816,0.000002610394,0.000012760825,0.0000013595317,0.0000020609643,0.0000020003363,0.0000011257913,0.9943845,0.00011759552,0.005394374,0.000076092816,0.0000019854663],"about_ca_topic_score_codex":0.008754421,"about_ca_topic_score_gemma":0.006767783,"teacher_disagreement_score":0.008754421,"about_ca_system_score_codex":0.0013731818,"about_ca_system_score_gemma":0.0019085719,"threshold_uncertainty_score":0.01740694},"labels":[],"label_agreement":null},{"id":"W3088015146","doi":"10.1002/rsa.20960","title":"The Glauber dynamics for edge‐colorings of trees","year":2020,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Glauber; Mathematics; Combinatorics; Tree (set theory); Monotonic function; Ergodic theory; Degree (music); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Block (permutation group theory); Relaxation (psychology); Computer science; Pure mathematics; Physics; Mathematical analysis","score_opus":0.04033608779503749,"score_gpt":0.3188249526561544,"score_spread":0.2784888648611169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088015146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19153023,0.00068423705,0.782738,0.0014640227,0.00008969094,0.0001404722,0.00024784898,0.000419911,0.022685701],"genre_scores_gemma":[0.8390785,0.00079043885,0.14122397,0.00060157507,0.00011524627,0.0005193944,0.0003388549,0.00034028172,0.01699179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924797,0.00027393323,0.0000185976,0.00015491861,0.00013395905,0.00017056087],"domain_scores_gemma":[0.9952513,0.0032551342,0.0003984708,0.0003746333,0.00020083219,0.0005195185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014117924,0.00058713934,0.00066207844,0.0008380884,0.0014565615,0.0018147875,0.0011971268,0.0010176905,0.007206703],"category_scores_gemma":[0.009994968,0.0006612625,0.00074402645,0.0006585697,0.0024735983,0.003619105,0.0017534515,0.0030089112,0.0007544696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008445018,0.00004055915,0.00047005733,0.000055276767,0.000013890237,0.000047945614,0.00025819903,0.06977507,0.0041488744,0.91644645,0.0018556276,0.0068036118],"study_design_scores_gemma":[0.000029550116,0.000023594572,0.00029223584,0.00002119474,0.000006882645,0.0000307452,0.00004707733,0.44202211,0.0009809972,0.55444115,0.0020872995,0.000017180253],"about_ca_topic_score_codex":0.0051997,"about_ca_topic_score_gemma":0.0060211984,"teacher_disagreement_score":0.007206703,"about_ca_system_score_codex":0.0034256396,"about_ca_system_score_gemma":0.0014119416,"threshold_uncertainty_score":0.024854898},"labels":[],"label_agreement":null},{"id":"W3088799486","doi":"10.1093/imaiai/iaab027","title":"Strong replica symmetry for high-dimensional disordered log-concave Gibbs measures","year":2021,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Replica; Mathematics; Inference; Gibbs measure; Regular polygon; Decoupling (probability); Gibbs sampling; Applied mathematics; Statistical physics; Mathematical analysis; Statistics; Computer science; Bayesian probability; Physics; Geometry; Artificial intelligence","score_opus":0.05467278135402242,"score_gpt":0.3396268383534964,"score_spread":0.28495405699947396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088799486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3758707,0.00042320348,0.6057317,0.0015771443,0.00009274576,0.00009818108,0.00026210674,0.00027382554,0.015670346],"genre_scores_gemma":[0.98174506,0.00013918667,0.014993203,0.0002357317,0.00007474507,0.00009464084,0.00009759571,0.000066166736,0.0025535012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.0003560424,0.000041660183,0.00016911424,0.000256585,0.0001540524],"domain_scores_gemma":[0.9931779,0.0040758997,0.0007795537,0.0008355514,0.0005547777,0.0005763042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033273627,0.00056381826,0.0010356727,0.0010600691,0.00089615036,0.0019817792,0.0017861675,0.0014419999,0.0038012823],"category_scores_gemma":[0.013402039,0.0005176239,0.0008886483,0.0004005448,0.0042244145,0.0029297003,0.0016674792,0.0017566384,0.00033504848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038468934,0.000033160908,0.0008883383,0.000043091917,0.000019477991,0.00029517655,0.00012374044,0.03731636,0.0021887335,0.9570278,0.0006990175,0.0013266285],"study_design_scores_gemma":[0.000022047303,0.000022869926,0.00048195868,0.000013452616,0.000005472354,0.00014224896,0.00004697561,0.49097526,0.000761715,0.5070888,0.0004185637,0.000020720612],"about_ca_topic_score_codex":0.001536313,"about_ca_topic_score_gemma":0.000953494,"teacher_disagreement_score":0.0038012823,"about_ca_system_score_codex":0.0013421118,"about_ca_system_score_gemma":0.00073504593,"threshold_uncertainty_score":0.01759702},"labels":[],"label_agreement":null},{"id":"W3091402461","doi":"10.48550/arxiv.2010.03817","title":"Efficient Sampling from Feasible Sets of SDPs and Volume Approximation","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ouranos","funders":"","keywords":"Dimension (graph theory); Random walk; Eigenvalues and eigenvectors; Computation; Sampling (signal processing); Computer science; Polynomial; Quantum walk; Mathematics; Theoretical computer science; Algorithm; Quantum computer; Combinatorics","score_opus":0.2455097458445565,"score_gpt":0.26827583209651934,"score_spread":0.02276608625196283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091402461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026109962,0.00010748878,0.97073776,0.0002312783,0.00002224346,0.00007512976,0.00015708059,0.0005616762,0.0019974462],"genre_scores_gemma":[0.4162467,0.00017135934,0.57970375,0.00014946355,0.000057665555,0.00039230677,0.0008408003,0.0003676871,0.0020702225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984067,0.00060208346,0.00007559257,0.00026860822,0.0004750855,0.00017190447],"domain_scores_gemma":[0.99360764,0.0046346453,0.00039626745,0.0008041242,0.0003337949,0.0002234259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017606087,0.0009888046,0.0013274894,0.0010580326,0.0007099826,0.0018501097,0.0017358632,0.0010657178,0.0046840804],"category_scores_gemma":[0.012396318,0.000712553,0.001279723,0.0012832034,0.0016799778,0.0023211662,0.0022055483,0.0022163403,0.00067957863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019741536,0.000100494464,0.0014983054,0.00015432571,0.000056722707,0.00009678746,0.00016476464,0.80847377,0.0020467942,0.13690162,0.0022349725,0.048073947],"study_design_scores_gemma":[0.000010954909,0.00001336013,0.000049252707,0.0000066054045,0.0000024982025,0.00001146242,0.0000125602,0.9548134,0.0004947819,0.044263482,0.00031764613,0.0000039837682],"about_ca_topic_score_codex":0.0030110648,"about_ca_topic_score_gemma":0.004198602,"teacher_disagreement_score":0.0046840804,"about_ca_system_score_codex":0.0015041992,"about_ca_system_score_gemma":0.0017217473,"threshold_uncertainty_score":0.015669823},"labels":[],"label_agreement":null},{"id":"W3094253867","doi":"10.3150/22-bej1576","title":"Riemannian Langevin algorithm for solving semidefinite programs","year":2023,"lang":"en","type":"article","venue":"Bernoulli","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Applied mathematics; Langevin dynamics; Maxima and minima; Saddle point; Mathematical optimization; Mathematical analysis","score_opus":0.15634364674802287,"score_gpt":0.3893626400023225,"score_spread":0.23301899325429964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094253867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034327547,0.00005765088,0.99485445,0.00017786687,0.00001820639,0.000023301323,0.000018265662,0.0001100987,0.0013073446],"genre_scores_gemma":[0.26089254,0.00026302016,0.73068666,0.00039464916,0.000067250796,0.00043142936,0.00023429512,0.00027644334,0.006753658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.00035825145,0.00004153256,0.0001550042,0.00029632612,0.000076962475],"domain_scores_gemma":[0.9985116,0.0008938366,0.00013088224,0.00017288604,0.0001913694,0.00009929648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021382256,0.00085670967,0.001112971,0.0005378174,0.0004889158,0.0010780005,0.0017842725,0.0015632965,0.0028392572],"category_scores_gemma":[0.005186799,0.00051859923,0.0008799084,0.0005522217,0.0020060092,0.0012223801,0.001979924,0.002678144,0.0006113097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057443525,0.000055409044,0.00033106847,0.000090420996,0.000038869122,0.00006739201,0.000090890026,0.6940335,0.0028130854,0.27846712,0.0014139734,0.02254081],"study_design_scores_gemma":[0.000007446789,0.000009773331,0.000015630345,0.000003520403,0.0000012750079,0.000007668981,0.0000021290102,0.97899055,0.0002961809,0.020279504,0.0003814478,0.0000049065425],"about_ca_topic_score_codex":0.0017095724,"about_ca_topic_score_gemma":0.0021945743,"teacher_disagreement_score":0.0028392572,"about_ca_system_score_codex":0.0013593982,"about_ca_system_score_gemma":0.0017794153,"threshold_uncertainty_score":0.011308134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Mathematics education","score_opus":0.05510388448335679,"score_gpt":0.30595003119851105,"score_spread":0.25084614671515426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098551378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17954776,0.00031131489,0.80935645,0.00039326333,0.00004669423,0.00006167601,0.00012260232,0.00021527248,0.009945004],"genre_scores_gemma":[0.9045774,0.0006084154,0.08979175,0.00016127723,0.00010951973,0.00015287328,0.00021997909,0.000114848066,0.004263967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.00032637126,0.000028173261,0.00014981047,0.0002375858,0.00015443146],"domain_scores_gemma":[0.99011993,0.0072478238,0.000912694,0.00083248917,0.0004715212,0.0004154451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019239218,0.00072980474,0.0008757923,0.0023861262,0.0009147435,0.0012796987,0.0012251659,0.0009254775,0.0028622958],"category_scores_gemma":[0.0141554,0.00053876074,0.0013924675,0.0011842072,0.0035437006,0.0015817938,0.0019282682,0.0020959496,0.00046181623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092190574,0.00006332173,0.0032814138,0.000094570525,0.00005984738,0.00024010723,0.00034415774,0.15980469,0.0036020365,0.82071745,0.0012403558,0.010459865],"study_design_scores_gemma":[0.00001653753,0.000024344088,0.0006964641,0.000020228608,0.000016882641,0.0000904164,0.000039701405,0.60216707,0.0015172143,0.39456537,0.000829004,0.000016704867],"about_ca_topic_score_codex":0.0016329709,"about_ca_topic_score_gemma":0.0015401058,"teacher_disagreement_score":0.0028622958,"about_ca_system_score_codex":0.0011824089,"about_ca_system_score_gemma":0.0007337204,"threshold_uncertainty_score":0.010174751},"labels":[],"label_agreement":null},{"id":"W3098689268","doi":"","title":"Minimising MCMC Variance via Diffusion Limits, with an Application to Simulated Tempering by","year":2012,"lang":"en","type":"article","venue":"Warwick Research Archive Portal (University of Warwick)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parallel tempering; Variance (accounting); Markov chain Monte Carlo; Applied mathematics; Tempering; Mathematics; Delta method; Diffusion; Inverse; Algorithm; Computer science; Mathematical optimization; Econometrics; Statistics; Bayesian probability; Economics; Physics; Materials science; Hybrid Monte Carlo; Estimator; Geometry","score_opus":0.05870970522585075,"score_gpt":0.34369799683443963,"score_spread":0.2849882916085889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098689268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00473849,0.00033052635,0.9936846,0.00017520606,0.000028647599,0.000035276287,0.00002297561,0.000158298,0.00082600274],"genre_scores_gemma":[0.19607177,0.0005924143,0.799204,0.00023509853,0.00013600815,0.00045211182,0.00016728985,0.00065890566,0.0024824145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952667,0.0029114771,0.00026253684,0.00048463547,0.0009005076,0.0001741172],"domain_scores_gemma":[0.97339207,0.021761969,0.0010735781,0.0016742185,0.0016004235,0.00049783813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011838731,0.0014046584,0.0019214,0.0021260374,0.0009974393,0.0020653622,0.0029276658,0.0022007956,0.0022782572],"category_scores_gemma":[0.061617527,0.0011921187,0.001553188,0.0019950315,0.0037464881,0.002911954,0.004375632,0.0036970887,0.00041606472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009311972,0.000056527868,0.0009959348,0.00016457713,0.00015633841,0.0001354242,0.00018831865,0.70233446,0.003058435,0.25601694,0.0009269633,0.035872966],"study_design_scores_gemma":[0.000009947277,0.000010204889,0.00007280787,0.000019715511,0.000011632195,0.00002354919,0.0000050670574,0.93874115,0.00076977856,0.059852894,0.0004716331,0.000011646948],"about_ca_topic_score_codex":0.0037843753,"about_ca_topic_score_gemma":0.0032302374,"teacher_disagreement_score":0.011838731,"about_ca_system_score_codex":0.0023283935,"about_ca_system_score_gemma":0.0021238816,"threshold_uncertainty_score":0.06260997},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.17406331167524894,"score_gpt":0.35904852120356745,"score_spread":0.1849852095283185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099541808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002081153,0.000060736675,0.9968509,0.00007472691,0.000012994003,0.000022364924,0.000028766195,0.0004148881,0.0004535439],"genre_scores_gemma":[0.1526445,0.0002852016,0.8436448,0.00021368578,0.00007808943,0.00036168398,0.00029337977,0.00054635,0.0019324076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.0007041308,0.00007007429,0.0002436381,0.00047398923,0.00011697077],"domain_scores_gemma":[0.99102694,0.0062628607,0.0005189312,0.001350038,0.0005872443,0.00025387443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050994046,0.001104978,0.0014040445,0.0012130475,0.0008452092,0.0013206789,0.0028410032,0.0012885359,0.005528803],"category_scores_gemma":[0.02257735,0.00086784083,0.0011206692,0.0012310885,0.0018627873,0.0018441043,0.0026616366,0.0034849904,0.0015194678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096401265,0.00007487331,0.001623074,0.00015409697,0.00007832802,0.000122000754,0.00015686436,0.79593927,0.0030680322,0.14499216,0.0019160431,0.05177887],"study_design_scores_gemma":[0.000008816254,0.000009215937,0.00006413224,0.000008961087,0.000005608534,0.000013169144,0.0000054011125,0.97565424,0.00067201484,0.02291287,0.00063940854,0.000006136867],"about_ca_topic_score_codex":0.0078088,"about_ca_topic_score_gemma":0.013558246,"teacher_disagreement_score":0.0078088,"about_ca_system_score_codex":0.0019079354,"about_ca_system_score_gemma":0.0034209886,"threshold_uncertainty_score":0.026968539},"labels":[],"label_agreement":null},{"id":"W3100638628","doi":"","title":"The compensation approach for walks with small steps in the quarter plane","year":2011,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Plane (geometry); Mathematics; Compensation (psychology); Set (abstract data type); Class (philosophy); Function (biology); Zero (linguistics); Expression (computer science); Generating function; Holonomic; Applied mathematics; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.1767212145553926,"score_gpt":0.3304207476234461,"score_spread":0.15369953306805348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100638628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06523391,0.00032150868,0.9223053,0.00048046806,0.00010314866,0.000072396695,0.000067482295,0.00020754697,0.0112082735],"genre_scores_gemma":[0.80795944,0.0006065968,0.17229268,0.00051770505,0.00022295435,0.0004660178,0.00024313129,0.0002417777,0.017449737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934727,0.00022090269,0.000029002225,0.00009237303,0.00019113414,0.00011946061],"domain_scores_gemma":[0.9975823,0.0014714976,0.00025019323,0.00029763588,0.00019810097,0.00020015685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015484366,0.00046057912,0.00097413757,0.0016597575,0.0010625235,0.0009738411,0.0014794215,0.0013602497,0.0070802397],"category_scores_gemma":[0.006072495,0.00039400786,0.00088352006,0.0008063717,0.0017431913,0.0019640482,0.0011354608,0.0012351031,0.0005313235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042037285,0.00003468058,0.00063525426,0.000059439673,0.00001189229,0.00010889312,0.00006776917,0.048581626,0.0018976082,0.93672776,0.00094210164,0.010890927],"study_design_scores_gemma":[0.000019721288,0.000034988385,0.00041375338,0.000024464458,0.000009439619,0.000097906,0.000035899946,0.6681286,0.0012510313,0.3277496,0.0022098597,0.00002473351],"about_ca_topic_score_codex":0.001998131,"about_ca_topic_score_gemma":0.0022927532,"teacher_disagreement_score":0.0070802397,"about_ca_system_score_codex":0.0011387119,"about_ca_system_score_gemma":0.0012829395,"threshold_uncertainty_score":0.023685694},"labels":[],"label_agreement":null},{"id":"W3101422082","doi":"10.48550/arxiv.2011.03176","title":"On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodicity; Normality; Midpoint; Mathematics; Econometrics; Sampling (signal processing); Asymptotic distribution; Statistics; Economics; Computer science; Estimator; Geometry; Computer vision","score_opus":0.3555341708900262,"score_gpt":0.2994408213156473,"score_spread":0.05609334957437889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101422082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025295246,0.00048503737,0.97103655,0.00043155235,0.0000522404,0.00004576574,0.00006690092,0.0002322315,0.0023544047],"genre_scores_gemma":[0.7826761,0.001182381,0.21163873,0.00041859376,0.00025307146,0.00045013655,0.00032316946,0.00038478503,0.0026730066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948302,0.0028082822,0.0001998058,0.0005869245,0.001285794,0.00028899522],"domain_scores_gemma":[0.93184465,0.05376373,0.004096391,0.0044617746,0.004975075,0.00085845904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016688194,0.00081388414,0.0014512333,0.0017856072,0.0009841472,0.0017924537,0.0022745316,0.0016255705,0.002430958],"category_scores_gemma":[0.098291025,0.00056444574,0.0011981346,0.0009627536,0.0051352633,0.0031459,0.0031298953,0.0032585955,0.000498267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019112325,0.000063815896,0.004385894,0.00018624809,0.00007371115,0.00023594427,0.00028551248,0.23881559,0.004135286,0.7368811,0.00093069184,0.013815059],"study_design_scores_gemma":[0.000018224266,0.000029883904,0.00034871465,0.000045411765,0.000012025257,0.000046905243,0.00002260881,0.89643306,0.0012445727,0.101388104,0.00038676313,0.000023688499],"about_ca_topic_score_codex":0.0028342353,"about_ca_topic_score_gemma":0.0012541375,"teacher_disagreement_score":0.016688194,"about_ca_system_score_codex":0.0015363524,"about_ca_system_score_gemma":0.0020691336,"threshold_uncertainty_score":0.08825666},"labels":[],"label_agreement":null},{"id":"W3101802995","doi":"","title":"Optimal Scaling of Random Walk Metropolis algorithms with\\nDiscontinuous target densities","year":2007,"lang":"en","type":"article","venue":"MIMS EPrints (University of Southampton)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Random walk; Curse of dimensionality; Mathematics; Metropolis–Hastings algorithm; Convergence (economics); Scaling; Markov chain; Sequence (biology); Algorithm; Rate of convergence; Markov process; Probability density function; Stochastic process; Diffusion process; Diffusion; Applied mathematics; Mathematical optimization; Statistical physics; Computer science; Markov chain Monte Carlo; Statistics; Monte Carlo method; Physics","score_opus":0.02672775531838749,"score_gpt":0.2668259879196557,"score_spread":0.24009823260126822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101802995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06809768,0.00052719004,0.9248439,0.00063285435,0.000099934805,0.00013345925,0.000039624036,0.00043693878,0.00518844],"genre_scores_gemma":[0.6791213,0.00050851144,0.31538367,0.00021959837,0.00011404235,0.00045257757,0.00011823398,0.00027703136,0.0038050117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841154,0.00082231354,0.0000883836,0.00025444754,0.00027054304,0.00015268751],"domain_scores_gemma":[0.99238014,0.005610737,0.00048909656,0.0006705196,0.00051289174,0.00033670026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050897757,0.00068551523,0.0011796936,0.00066836656,0.000663815,0.0018203607,0.0015352827,0.0012922068,0.0029352573],"category_scores_gemma":[0.022533093,0.00059353304,0.0005182402,0.0006922039,0.0017995319,0.0031085312,0.0018842696,0.0014049722,0.0006130671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002378995,0.00014444617,0.0010704492,0.00015872631,0.00004271397,0.00007919112,0.0001938055,0.72657955,0.0026174178,0.21978046,0.0015673144,0.047528066],"study_design_scores_gemma":[0.000014913392,0.00002210015,0.000041642437,0.0000068472345,0.0000029788691,0.0000063643215,0.000009501042,0.97025687,0.00044803476,0.028884793,0.00030053867,0.0000053893405],"about_ca_topic_score_codex":0.0015450432,"about_ca_topic_score_gemma":0.0011358821,"teacher_disagreement_score":0.0050897757,"about_ca_system_score_codex":0.0014391456,"about_ca_system_score_gemma":0.0011877171,"threshold_uncertainty_score":0.026917636},"labels":[],"label_agreement":null},{"id":"W3102590949","doi":"10.1088/1742-5468/ac3ae7","title":"Hausdorff dimension, heavy tails, and generalization in neural networks*","year":2021,"lang":"en","type":"article","venue":"Journal of Statistical Mechanics Theory and Experiment","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Generalization; Stochastic gradient descent; Applied mathematics; Artificial neural network; Hausdorff dimension; Mathematics; Hausdorff distance; Computer science; Range (aeronautics); Dimension (graph theory); Metric (unit); Artificial intelligence; Pure mathematics; Mathematical analysis","score_opus":0.029459313117431055,"score_gpt":0.3379642316986228,"score_spread":0.3085049185811917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102590949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492411,0.0026399156,0.6402736,0.0018937461,0.00010462074,0.00005595562,0.00031769872,0.00048108152,0.0049923602],"genre_scores_gemma":[0.9746663,0.00082876644,0.022903001,0.00022248966,0.00008477767,0.00007856138,0.00021759825,0.00007293997,0.000925437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838567,0.0006153917,0.00013133608,0.0003672081,0.00033272913,0.00016761798],"domain_scores_gemma":[0.9651509,0.024650384,0.0034548496,0.0034084308,0.0019198314,0.0014156584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006092908,0.0008843944,0.0012048687,0.0018494591,0.0009572602,0.0015248597,0.0013085746,0.0014658364,0.0012548293],"category_scores_gemma":[0.030531043,0.0005079071,0.0010313375,0.0008349335,0.0044997656,0.0044544823,0.0037278824,0.0028912593,0.0001563427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022896778,0.00010546484,0.011261385,0.0002621841,0.00015328251,0.00029690668,0.00055135385,0.5300042,0.0043254998,0.42842066,0.0016755803,0.022714414],"study_design_scores_gemma":[0.000008402135,0.000064114305,0.0017962209,0.000038141585,0.000012191306,0.00005780309,0.000042379437,0.780853,0.0010669278,0.2156555,0.00037297833,0.00003229532],"about_ca_topic_score_codex":0.0027579425,"about_ca_topic_score_gemma":0.0013775837,"teacher_disagreement_score":0.006092908,"about_ca_system_score_codex":0.002013976,"about_ca_system_score_gemma":0.00088727265,"threshold_uncertainty_score":0.032222748},"labels":[],"label_agreement":null},{"id":"W3104148044","doi":"","title":"On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Midpoint; Discretization; Ergodicity; Mathematics; Midpoint method; Asymptotic distribution; Langevin equation; Applied mathematics; Stationary distribution; Mathematical analysis; Mathematical optimization; Statistical physics; Geometry; Statistics; Physics; Estimator","score_opus":0.3249807132132427,"score_gpt":0.2792546313757626,"score_spread":0.04572608183748006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104148044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024941755,0.00047523086,0.9714012,0.0004272129,0.000052200747,0.000046699937,0.000064491906,0.00023530392,0.0023559686],"genre_scores_gemma":[0.7809576,0.0011443604,0.21349803,0.00041981757,0.0002517934,0.00045033343,0.00031022064,0.00037035046,0.0025975015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949008,0.0027610117,0.00019989183,0.00057136506,0.0012759235,0.00029097157],"domain_scores_gemma":[0.9313774,0.054302115,0.003959712,0.004498802,0.005009461,0.00085240876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017102558,0.0007987931,0.0014613777,0.0017513869,0.0009790754,0.0017279299,0.0022429896,0.0015616853,0.0024023866],"category_scores_gemma":[0.09853845,0.00055322296,0.0011772347,0.0009430894,0.0050818813,0.00311802,0.0030833066,0.0031990465,0.00049226097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019830593,0.000066945264,0.004507471,0.0001878782,0.00007442418,0.00024263537,0.00029144692,0.24469179,0.00418918,0.73011434,0.00095334474,0.0144822225],"study_design_scores_gemma":[0.000018840552,0.000031065156,0.00035899982,0.000044766086,0.000012134873,0.000047994814,0.00002297854,0.900109,0.0012335584,0.09771153,0.0003852553,0.00002393847],"about_ca_topic_score_codex":0.0028642484,"about_ca_topic_score_gemma":0.0012706134,"teacher_disagreement_score":0.017102558,"about_ca_system_score_codex":0.0015245512,"about_ca_system_score_gemma":0.002116503,"threshold_uncertainty_score":0.09044802},"labels":[],"label_agreement":null},{"id":"W3109100680","doi":"10.82308/3059","title":"Dynamical systems based non equilibrium statistical mechanics for Markov chains","year":2011,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Markov chain; Statistical mechanics; Statistical physics; Markov process; Computer science; Mathematical economics; Mathematics; Physics; Statistics; Machine learning","score_opus":0.06952225254246581,"score_gpt":0.2996079906735338,"score_spread":0.23008573813106797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109100680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015606129,0.002681613,0.9616171,0.0018414845,0.00023826338,0.000043944066,0.00013939607,0.00008956043,0.017742509],"genre_scores_gemma":[0.71665186,0.0056001046,0.25514516,0.0010187695,0.0011200551,0.00052210636,0.00034831002,0.0001419497,0.01945156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.0003689067,0.000030207175,0.000097956596,0.00019493818,0.00005381284],"domain_scores_gemma":[0.9973326,0.0019671395,0.00022618912,0.00018333047,0.00016550132,0.00012531584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014575989,0.0006970203,0.0007295544,0.0012048199,0.00072934205,0.0014914214,0.0010077793,0.0009057425,0.004032562],"category_scores_gemma":[0.003873249,0.00028869946,0.00086522056,0.00086060213,0.0029601,0.0023015288,0.0015012058,0.002036299,0.0004608327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010569586,0.0000033067763,0.000047376263,0.000011578252,0.000003082119,0.000017963455,0.000027779235,0.0055279653,0.00013798005,0.9932941,0.00017187739,0.00075596594],"study_design_scores_gemma":[0.0000032303399,0.000007453617,0.00007811931,0.00001290945,0.0000029883229,0.000022038472,0.000010931685,0.10417916,0.00008165087,0.89264435,0.002950165,0.0000069709963],"about_ca_topic_score_codex":0.0021749684,"about_ca_topic_score_gemma":0.0019723414,"teacher_disagreement_score":0.004032562,"about_ca_system_score_codex":0.0016440268,"about_ca_system_score_gemma":0.0010976901,"threshold_uncertainty_score":0.01349026},"labels":[],"label_agreement":null},{"id":"W3112638984","doi":"10.20382/jocg.v13i1a3","title":"Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics","year":2021,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Monte Carlo method; Polytope; Mathematics; Hamiltonian (control theory); Arithmetic; Geometry; Mathematical optimization; Statistics","score_opus":0.03433791763792107,"score_gpt":0.29557554371501976,"score_spread":0.26123762607709866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112638984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092963986,0.00028272084,0.89420044,0.00024933473,0.000112719936,0.00005362135,0.00009449863,0.00091158244,0.011131008],"genre_scores_gemma":[0.64645606,0.00015527234,0.34940216,0.00014985622,0.000058676367,0.00014846261,0.00019122665,0.0005790338,0.0028591983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992718,0.00024080848,0.000024089311,0.000066949804,0.0003040327,0.00009239178],"domain_scores_gemma":[0.99803084,0.0010737508,0.00010058199,0.00048351742,0.00019956511,0.00011183938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291655,0.00041793103,0.0010160034,0.0007457329,0.0006721923,0.0011402549,0.0014335314,0.00079138635,0.0040719453],"category_scores_gemma":[0.0052741393,0.00031531273,0.0005643113,0.00072578795,0.0015630465,0.0015731496,0.0015889284,0.0015004978,0.00055746944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010995691,0.00007459886,0.00080643257,0.00007503374,0.000030946194,0.00009597758,0.00013444708,0.63264287,0.0029270966,0.33211464,0.0013939887,0.029594002],"study_design_scores_gemma":[0.000008764917,0.000014530851,0.000052763175,0.00000554182,0.0000028038974,0.000008912,0.0000088652505,0.959935,0.00077108474,0.038646307,0.000539072,0.000006408387],"about_ca_topic_score_codex":0.002423339,"about_ca_topic_score_gemma":0.0032081415,"teacher_disagreement_score":0.0040719453,"about_ca_system_score_codex":0.0007579319,"about_ca_system_score_gemma":0.0009339787,"threshold_uncertainty_score":0.0136220455},"labels":[],"label_agreement":null},{"id":"W3117535463","doi":"10.1017/9781108571401.018","title":"Lower Bounds: Basic Ideas","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science","score_opus":0.05776252692409166,"score_gpt":0.25704753240586986,"score_spread":0.1992850054817782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117535463","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049784123,0.04732624,0.47886863,0.010973401,0.002197512,0.00012038007,0.0013747659,0.00069171033,0.4534689],"genre_scores_gemma":[0.33974764,0.098352656,0.29123208,0.015442299,0.0133853005,0.0024213027,0.0033371511,0.0032605429,0.23282096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969997,0.0009956061,0.00010135115,0.00047395562,0.0011209828,0.00030835232],"domain_scores_gemma":[0.9907917,0.0072146887,0.00022532885,0.00078155595,0.0007431106,0.00024357447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047301105,0.0025596737,0.0018944759,0.004356434,0.0020181185,0.006264319,0.0035224042,0.002533337,0.030797163],"category_scores_gemma":[0.020637315,0.0010388754,0.0022903471,0.004661621,0.0047889384,0.008733715,0.0042452603,0.009473275,0.010765244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002743724,0.000037242087,0.00015461816,0.00029323017,0.00002580134,0.000036801954,0.00009148042,0.0032947934,0.00017345815,0.9326515,0.030389735,0.032823864],"study_design_scores_gemma":[0.0000066207017,0.000011022255,0.00011791871,0.00011764688,0.000012766301,0.000043022093,0.000021528276,0.0048212684,0.00012178304,0.9744736,0.020244714,0.00000809733],"about_ca_topic_score_codex":0.0030502076,"about_ca_topic_score_gemma":0.002097523,"teacher_disagreement_score":0.030797163,"about_ca_system_score_codex":0.0036090498,"about_ca_system_score_gemma":0.0016132379,"threshold_uncertainty_score":0.10302675},"labels":[],"label_agreement":null},{"id":"W3118435503","doi":"10.1109/cdc42340.2020.9304291","title":"On the Master Equation for Linear Quadratic Graphon Mean Field Games","year":2020,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic equation; Master equation; Mathematics; Decoupling (probability); Population; Probabilistic logic; Applied mathematics; Mean field theory; Stability theory; Field (mathematics); Nonlinear system; Pure mathematics; Physics; Statistics","score_opus":0.24398762938901145,"score_gpt":0.36513939785510574,"score_spread":0.1211517684660943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118435503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15867363,0.0012638975,0.80166835,0.0038206389,0.00020560768,0.00014167858,0.00033376255,0.00013430537,0.033758227],"genre_scores_gemma":[0.93029475,0.0009061274,0.043100365,0.0006297465,0.00020563255,0.00035343907,0.00024699312,0.00008539721,0.024177566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00018115302,0.000015580643,0.00007558224,0.0001004991,0.000099555466],"domain_scores_gemma":[0.9986541,0.0009102703,0.00014051588,0.000056800956,0.000118467724,0.00011989768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016085912,0.0007512856,0.0011167953,0.0007822344,0.00067829294,0.0012451925,0.0012666616,0.0018992786,0.0042584674],"category_scores_gemma":[0.0046393857,0.00039863525,0.0009169202,0.00055590156,0.0022587015,0.0023361493,0.0014586276,0.0016435621,0.00033665434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029680145,0.000028009708,0.00042300177,0.000051189607,0.000017049839,0.00010709566,0.00013885746,0.1542844,0.00091973966,0.84132624,0.0009917711,0.0016829772],"study_design_scores_gemma":[0.000018852154,0.000016350521,0.00014563947,0.00001261165,0.000004964279,0.000028436029,0.000032113738,0.6630045,0.00011035545,0.33600506,0.00060712494,0.000013957175],"about_ca_topic_score_codex":0.006281688,"about_ca_topic_score_gemma":0.0034100844,"teacher_disagreement_score":0.006281688,"about_ca_system_score_codex":0.0018193447,"about_ca_system_score_gemma":0.0013221601,"threshold_uncertainty_score":0.014245927},"labels":[],"label_agreement":null},{"id":"W3120192676","doi":"10.48550/arxiv.2101.00277","title":"Augmented truncation approximations to the solution of Poisson's equation for Markov chains","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Central South University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Markov chain; Truncation (statistics); Mathematics; Applied mathematics; Truncation error; Discrete time and continuous time; Poisson distribution; Limit (mathematics); Convergence (economics); Monotonic function; Markov renewal process; Discrete Poisson equation; Continuous-time Markov chain; Balance equation; Markov property; Markov model; Mathematical analysis; Uniqueness theorem for Poisson's equation; Statistics","score_opus":0.24338006404807908,"score_gpt":0.2744449218441904,"score_spread":0.031064857796111317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120192676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157438,0.00075441634,0.9832772,0.0004726707,0.00013283313,0.000039863095,0.00008014901,0.00007920392,0.0040063085],"genre_scores_gemma":[0.6440504,0.0044033085,0.32114995,0.00053214934,0.00066661055,0.000718615,0.00061552343,0.0002767413,0.027586764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838006,0.000853098,0.00007292206,0.00014372557,0.000413977,0.00013619881],"domain_scores_gemma":[0.99047136,0.0072566187,0.0006465967,0.0004588076,0.0008936512,0.00027294006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004419471,0.00097293407,0.0012836361,0.0011286975,0.00070404826,0.0013888585,0.0020946097,0.0018340652,0.0032327073],"category_scores_gemma":[0.020854069,0.0005830976,0.0015192494,0.0010413661,0.0024819071,0.0024838864,0.0019736239,0.0033793526,0.0005814108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045021494,0.000028364198,0.00061791344,0.0001288092,0.000037092163,0.00013149086,0.00018914814,0.40420005,0.0009883564,0.5860582,0.0010781551,0.0064973654],"study_design_scores_gemma":[0.0000047396425,0.0000057919547,0.000049986633,0.000014449753,0.0000035179935,0.00001055467,0.000009968965,0.93208414,0.0001055986,0.067154095,0.00055133266,0.000005926514],"about_ca_topic_score_codex":0.007854841,"about_ca_topic_score_gemma":0.0038966103,"teacher_disagreement_score":0.007854841,"about_ca_system_score_codex":0.0019596955,"about_ca_system_score_gemma":0.0019905355,"threshold_uncertainty_score":0.02337271},"labels":[],"label_agreement":null},{"id":"W3122206612","doi":"10.26180/21521490","title":"Asymptotic Properties of Approximate Bayesian Computation","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Institut Universitaire de Gériatrie de Montréal","funders":"","keywords":"Approximate Bayesian computation; Posterior probability; Bayesian probability; Computation; Limiting; Mathematics; Applied mathematics; Posterior predictive distribution; Distribution (mathematics); Asymptotic distribution; Statistics; Computer science; Bayesian inference; Bayesian linear regression; Artificial intelligence; Algorithm; Mathematical analysis; Engineering","score_opus":0.03452658436828475,"score_gpt":0.2649957237957925,"score_spread":0.23046913942750774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122206612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023075463,0.001327332,0.9641769,0.0012449846,0.000058172227,0.00007422623,0.00018524157,0.00033655704,0.009521121],"genre_scores_gemma":[0.7294377,0.0033439812,0.25499523,0.00115988,0.0005982526,0.0008514451,0.0009091509,0.00083210174,0.007872218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894238,0.005354482,0.00048690964,0.0011106282,0.0031266257,0.00049766555],"domain_scores_gemma":[0.852584,0.123850144,0.0050349245,0.0096841855,0.0077303443,0.0011164056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018903974,0.00086379715,0.0018921456,0.0031228825,0.0012678445,0.004338918,0.0027322022,0.0022354193,0.0050650663],"category_scores_gemma":[0.20042129,0.00093041407,0.0011905546,0.0024575419,0.0057036923,0.0067928336,0.004506542,0.0043505123,0.0009885535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008766789,0.000024517793,0.0020441464,0.00017662645,0.00005082865,0.0000907325,0.0002951861,0.081492305,0.0007976161,0.89238906,0.0013530517,0.02119829],"study_design_scores_gemma":[0.000016787595,0.000041798772,0.00079250336,0.00010725628,0.000020088231,0.00014573714,0.000055271175,0.4702349,0.00063320633,0.525674,0.0022514614,0.000026938766],"about_ca_topic_score_codex":0.0028636763,"about_ca_topic_score_gemma":0.0013357615,"teacher_disagreement_score":0.018903974,"about_ca_system_score_codex":0.0028281424,"about_ca_system_score_gemma":0.0022044564,"threshold_uncertainty_score":0.09997493},"labels":[],"label_agreement":null},{"id":"W3122465892","doi":"10.3150/21-bej1400","title":"Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference","year":2022,"lang":"en","type":"article","venue":"Bernoulli","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discretization; Mathematics; Langevin dynamics; Applied mathematics; Statistical physics; Inference; Sampling (signal processing); Stochastic differential equation; Bayesian inference; Langevin equation; Bayesian probability; Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Physics; Statistics","score_opus":0.06941538896282652,"score_gpt":0.37697377804848653,"score_spread":0.30755838908566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122465892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025408375,0.00025252163,0.9960104,0.00021434647,0.000027248678,0.000018707733,0.000036144793,0.00005695188,0.00084295304],"genre_scores_gemma":[0.3322343,0.0019358807,0.65924644,0.00041205453,0.00020190816,0.00045022918,0.00034828793,0.00026659173,0.0049042753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.0008267044,0.000084902895,0.00019427591,0.00043978728,0.000092233844],"domain_scores_gemma":[0.989593,0.008419047,0.00057160424,0.00068273436,0.000476108,0.00025748106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054340186,0.00094698806,0.0011219206,0.000952463,0.0007415133,0.0017526279,0.0019139617,0.0016380324,0.003040797],"category_scores_gemma":[0.023084069,0.0007222769,0.0012894615,0.0009606132,0.0027826512,0.0027264927,0.0019165402,0.003586193,0.00051500916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029423793,0.000025826253,0.0005980076,0.00011067716,0.000032084605,0.00005877285,0.000100989935,0.37477562,0.0008311834,0.6096375,0.00084245374,0.012957435],"study_design_scores_gemma":[0.0000046627233,0.0000061868795,0.000048827213,0.000016120111,0.0000029731407,0.000012067305,0.0000058159335,0.8852816,0.00017205186,0.11381189,0.00062996557,0.000007880418],"about_ca_topic_score_codex":0.004460155,"about_ca_topic_score_gemma":0.00468757,"teacher_disagreement_score":0.0054340186,"about_ca_system_score_codex":0.0021195172,"about_ca_system_score_gemma":0.0020082863,"threshold_uncertainty_score":0.0287382},"labels":[],"label_agreement":null},{"id":"W3123450492","doi":"","title":"Nonlinearity and Temporal Dependence","year":2008,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Science Foundation","keywords":"Mixing (physics); Scalar (mathematics); Statistical physics; Exponential decay; Mathematics; Exponential function; Nonlinear system; Poisson distribution; Diffusion; Markov chain; Stationary state; Physics; Mathematical analysis; Statistics; Quantum mechanics","score_opus":0.11486650248189172,"score_gpt":0.39252818304085924,"score_spread":0.2776616805589675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123450492","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4856844,0.0047189547,0.39864254,0.008516022,0.0002648621,0.00004849646,0.0005802608,0.00036571856,0.101178594],"genre_scores_gemma":[0.9763298,0.0013170034,0.0047655213,0.00020034396,0.00009953334,0.000031953,0.000071346876,0.000060060844,0.017124403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00009199627,0.000021315558,0.00010798084,0.00012273793,0.00007961408],"domain_scores_gemma":[0.9952146,0.003032117,0.00066623784,0.00044167318,0.000467051,0.0001782713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898616,0.00032312828,0.00036014686,0.0005890833,0.000589254,0.0012169773,0.00069347856,0.0009914511,0.00668062],"category_scores_gemma":[0.0077331187,0.00030962005,0.00071244634,0.0005417552,0.0017020652,0.002858042,0.0012547947,0.0013891192,0.0006140516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100571,0.0000309999,0.008154242,0.00016798488,0.000051087492,0.00046817138,0.0006402948,0.097232774,0.008876677,0.8639127,0.0015353326,0.018829202],"study_design_scores_gemma":[0.00002134305,0.000057331054,0.009581137,0.000075079406,0.000047969406,0.00061553455,0.00025156655,0.39230233,0.0026036627,0.5839033,0.010474956,0.00006571063],"about_ca_topic_score_codex":0.005841409,"about_ca_topic_score_gemma":0.003841509,"teacher_disagreement_score":0.00668062,"about_ca_system_score_codex":0.0013708012,"about_ca_system_score_gemma":0.00089671335,"threshold_uncertainty_score":0.02234888},"labels":[],"label_agreement":null},{"id":"W3124950155","doi":"","title":"Bayesian Adaptively Updated Hamiltonian Monte Carlo with an Application to High-Dimensional BEKK GARCH Models","year":2012,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Markov chain Monte Carlo; Curse of dimensionality; Parameter space; Monte Carlo method; Markov chain; Sample space; Computer science; Mathematics; Mathematical optimization; Applied mathematics; Hybrid Monte Carlo; Bayesian probability; Statistical physics; Statistics; Physics","score_opus":0.07147000100748045,"score_gpt":0.3605462532889955,"score_spread":0.289076252281515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124950155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023012629,0.00047642857,0.9747935,0.0002967738,0.000030814903,0.000034702574,0.000040332277,0.00019603356,0.0011187886],"genre_scores_gemma":[0.535421,0.00065140775,0.46065906,0.00015820637,0.000112962814,0.00018392892,0.00013920739,0.00014803378,0.002526159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989066,0.00075343944,0.000031059775,0.00009737216,0.00016990124,0.000041513493],"domain_scores_gemma":[0.9930502,0.0057920506,0.00027883545,0.00036511038,0.0003562277,0.00015766709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029487046,0.00046126408,0.0010377492,0.00067069265,0.00056659564,0.00083714776,0.0013202394,0.001225285,0.002024785],"category_scores_gemma":[0.013333182,0.0004999238,0.0005381218,0.0009499612,0.00133175,0.0011196246,0.0016198762,0.0018435268,0.00018442003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006547172,0.000033170432,0.0011483354,0.00006340963,0.000055310764,0.00014949126,0.00013784894,0.8169852,0.0008756883,0.14654104,0.0006100241,0.033335056],"study_design_scores_gemma":[0.0000045910792,0.000004503001,0.000073127914,0.000002771648,0.000002556815,0.000007370466,0.0000031133661,0.98598087,0.00009445368,0.01362761,0.00019415823,0.0000048804945],"about_ca_topic_score_codex":0.008020882,"about_ca_topic_score_gemma":0.0068319514,"teacher_disagreement_score":0.008020882,"about_ca_system_score_codex":0.00096085074,"about_ca_system_score_gemma":0.0012443276,"threshold_uncertainty_score":0.015948355},"labels":[],"label_agreement":null},{"id":"W3125965415","doi":"","title":"An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift","year":2005,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; Metropolis–Hastings algorithm; Kernel (algebra); Convergence (economics); Rate of convergence; Covariance matrix; Covariance; Distribution (mathematics); Computer science; Mathematics; Scale (ratio); Mathematical optimization; Statistics; Markov chain Monte Carlo; Monte Carlo method; Combinatorics; Geography; Cartography; Key (lock)","score_opus":0.09527253068271278,"score_gpt":0.39021635328597815,"score_spread":0.29494382260326535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125965415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039073476,0.00012266407,0.99418396,0.00015921562,0.00011620692,0.00007688093,0.0000328592,0.00016662899,0.0012342953],"genre_scores_gemma":[0.1539797,0.00041222238,0.83671194,0.00037447215,0.00033105974,0.00062122685,0.0001912168,0.00031290617,0.007065219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997621,0.0008789673,0.000120984805,0.00043990192,0.00078423764,0.00015493625],"domain_scores_gemma":[0.9967763,0.0016556273,0.00023393176,0.00053989445,0.0006289265,0.00016530919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036520043,0.00085131935,0.0014355725,0.00068564684,0.0007022798,0.0015082784,0.004348621,0.002307369,0.005377896],"category_scores_gemma":[0.011226952,0.0005936971,0.001512638,0.00084250903,0.0017439374,0.0029887212,0.0019762602,0.0033114797,0.001596397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025498116,0.00017209101,0.0014307968,0.0001780359,0.00019672538,0.00023342663,0.00021276431,0.5079674,0.008743196,0.35938895,0.0034040275,0.11781768],"study_design_scores_gemma":[0.000054295004,0.00005185675,0.00012957408,0.000011622286,0.000015635604,0.00006167487,0.0000062815857,0.961102,0.0007916638,0.035140023,0.0026022734,0.000033004024],"about_ca_topic_score_codex":0.0028161674,"about_ca_topic_score_gemma":0.0021839787,"teacher_disagreement_score":0.005377896,"about_ca_system_score_codex":0.0011814435,"about_ca_system_score_gemma":0.0024131439,"threshold_uncertainty_score":0.019313872},"labels":[],"label_agreement":null},{"id":"W3138576109","doi":"10.1007/s00180-021-01095-2","title":"Jump Markov chains and rejection-free Metropolis algorithms","year":2021,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fujitsu","keywords":"Metropolis–Hastings algorithm; Parallel tempering; Markov chain Monte Carlo; Markov chain; Algorithm; Jump; Computer science; Rejection sampling; Bayesian probability; Mathematics; Artificial intelligence; Machine learning","score_opus":0.050060355030074964,"score_gpt":0.3511342344902775,"score_spread":0.30107387946020253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138576109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036645927,0.00081277423,0.991812,0.0004716725,0.00009957534,0.00003856611,0.00007819277,0.00017415905,0.0028484883],"genre_scores_gemma":[0.44571343,0.0044051264,0.5151523,0.0009001424,0.0013882333,0.0010448389,0.0012670422,0.000882138,0.029246861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941245,0.003494677,0.00019113223,0.00069038355,0.001148159,0.0003511861],"domain_scores_gemma":[0.9438767,0.04898545,0.0016072281,0.002678984,0.002262488,0.0005891411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008019308,0.0016520041,0.00302674,0.0025588511,0.0015209304,0.003913442,0.0051989085,0.003483929,0.008593509],"category_scores_gemma":[0.05460677,0.0014896558,0.0015570422,0.0033504157,0.0053234696,0.007023775,0.0028669476,0.006119349,0.0018684976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081092876,0.00005752479,0.00047134171,0.00012281942,0.00006511541,0.000037931022,0.000087701956,0.13359077,0.0001931692,0.8501696,0.0021304442,0.012992479],"study_design_scores_gemma":[0.00002557955,0.000008315027,0.000093335366,0.000022810667,0.000012012435,0.000016978644,0.000009507423,0.53176033,0.00016731564,0.4667005,0.0011667256,0.000016598231],"about_ca_topic_score_codex":0.0052830824,"about_ca_topic_score_gemma":0.0046354965,"teacher_disagreement_score":0.008593509,"about_ca_system_score_codex":0.0027856166,"about_ca_system_score_gemma":0.002954635,"threshold_uncertainty_score":0.04241067},"labels":[],"label_agreement":null},{"id":"W3142303584","doi":"","title":"Des Résultats théoriques sur les algorithmes Monte Carlo par chaînes de Markov","year":2009,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Humanities; Mathematics; Markov chain Monte Carlo; Monte Carlo method; Philosophy; Statistics","score_opus":0.028104581872426457,"score_gpt":0.2735591967733959,"score_spread":0.24545461490096945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142303584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085802805,0.0017659065,0.9717148,0.0015856748,0.0004141167,0.000084851825,0.0001611529,0.00027208938,0.01542109],"genre_scores_gemma":[0.31991237,0.008913182,0.6265032,0.0026922598,0.0029163288,0.0015660712,0.0012992301,0.0015300689,0.03466729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99092543,0.004222528,0.0003255325,0.00150279,0.0024856576,0.0005380007],"domain_scores_gemma":[0.88810235,0.101927154,0.0011982876,0.0037268833,0.004081479,0.0009639067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013013004,0.0032449623,0.0034669933,0.005205394,0.003937625,0.006796646,0.0052719256,0.0055460474,0.012972609],"category_scores_gemma":[0.07625138,0.002417249,0.00546629,0.0060026823,0.010696483,0.012942529,0.00462054,0.014677055,0.0029869329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014141054,0.00010350888,0.00091235584,0.00037757517,0.00013123402,0.000091844006,0.00027865084,0.14654799,0.00057059695,0.8241769,0.0034561304,0.023211751],"study_design_scores_gemma":[0.000038514812,0.000024021889,0.00020759404,0.000092103764,0.000044673532,0.000056446574,0.000038775037,0.46225145,0.00062034855,0.5340959,0.0024990812,0.000031188814],"about_ca_topic_score_codex":0.011215498,"about_ca_topic_score_gemma":0.0075239753,"teacher_disagreement_score":0.013013004,"about_ca_system_score_codex":0.0060017863,"about_ca_system_score_gemma":0.00441512,"threshold_uncertainty_score":0.06882018},"labels":[],"label_agreement":null},{"id":"W3148940311","doi":"10.1214/25-ejp1348","title":"Covering a graph with independent walks","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Physics; Inverse; Spectral gap; Vertex (graph theory); Graph; Mathematics; Geometry; Quantum mechanics","score_opus":0.022015937762547805,"score_gpt":0.3129867763913225,"score_spread":0.2909708386287747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148940311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5671693,0.00071373704,0.37872094,0.0012270709,0.00010870343,0.000219072,0.0012114083,0.0016538245,0.048975844],"genre_scores_gemma":[0.92253155,0.0005954084,0.05877929,0.00031445446,0.00011799548,0.00024182576,0.0016872237,0.00031635308,0.015415908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987054,0.00027890046,0.00006225894,0.00043394312,0.00023069482,0.00028875738],"domain_scores_gemma":[0.9958339,0.0019959977,0.00048775267,0.0008196119,0.00029027282,0.000572434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188986,0.001006332,0.0007817005,0.0017803676,0.0014947506,0.0019880969,0.0016503761,0.0013973921,0.009125383],"category_scores_gemma":[0.005816175,0.0011114659,0.0014114892,0.0014704991,0.001576158,0.0037203387,0.0024283957,0.0016709691,0.0016689759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041946175,0.00022653429,0.0044908626,0.00026959783,0.00013543142,0.0011364433,0.00080853875,0.15027998,0.0139677925,0.7908677,0.0062365714,0.031161029],"study_design_scores_gemma":[0.00007697734,0.00012967603,0.0020101182,0.00006119623,0.00008208836,0.00051595265,0.00016471457,0.45667824,0.0040975,0.52835923,0.007771281,0.000052938805],"about_ca_topic_score_codex":0.0031292154,"about_ca_topic_score_gemma":0.0027824023,"teacher_disagreement_score":0.009125383,"about_ca_system_score_codex":0.0014986186,"about_ca_system_score_gemma":0.0009561204,"threshold_uncertainty_score":0.030527472},"labels":[],"label_agreement":null},{"id":"W3151847906","doi":"10.1017/9781108377423.004","title":"Hidden Markov Models","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Hidden Markov model; Artificial intelligence","score_opus":0.07787909614172948,"score_gpt":0.2651419135247263,"score_spread":0.18726281738299683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151847906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030596075,0.037152924,0.79619795,0.0066260407,0.0016198278,0.00010525619,0.007362671,0.003509629,0.14436603],"genre_scores_gemma":[0.18964349,0.07765767,0.35915628,0.0028482948,0.0026112506,0.00073299976,0.024966132,0.002342644,0.3400412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994692,0.00022158209,0.000027150292,0.00010801025,0.0001369723,0.00003696107],"domain_scores_gemma":[0.9979151,0.0016094751,0.00006144001,0.0002001696,0.00016391005,0.00004991461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010991226,0.0012535529,0.0010156193,0.0010926323,0.00044353504,0.0019266631,0.0015245476,0.0014888077,0.05839645],"category_scores_gemma":[0.0047461074,0.0006063519,0.0010156468,0.0016332888,0.00065333495,0.0025784702,0.001053487,0.0020498459,0.021289637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007026915,0.000074180374,0.0008464708,0.0009399999,0.00017324465,0.0002605372,0.00026396307,0.042460535,0.0006968712,0.48532194,0.19337219,0.27551988],"study_design_scores_gemma":[0.000020500624,0.000027499818,0.000599722,0.00039302642,0.00005238174,0.00025668708,0.00006342962,0.08645027,0.00058696076,0.6766495,0.23485169,0.00004830264],"about_ca_topic_score_codex":0.002463176,"about_ca_topic_score_gemma":0.0038241837,"teacher_disagreement_score":0.05839645,"about_ca_system_score_codex":0.00089665904,"about_ca_system_score_gemma":0.0010698222,"threshold_uncertainty_score":0.1953556},"labels":[],"label_agreement":null},{"id":"W3153027315","doi":"10.1214/23-aap2013","title":"Linear-time uniform generation of random sparse contingency tables with specified marginals","year":2024,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"","keywords":"Contingency table; Mathematics; Applied mathematics; Algorithm; Computer science; Statistics; Combinatorics","score_opus":0.21617565193954852,"score_gpt":0.3646997353871591,"score_spread":0.1485240834476106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153027315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023937834,0.00013367637,0.9706717,0.00030257858,0.000048500748,0.00017417502,0.0005926434,0.0020315738,0.002107354],"genre_scores_gemma":[0.34476963,0.000115761795,0.64853317,0.00028364928,0.00006575402,0.0006242978,0.0020958744,0.00040888914,0.0031029005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975885,0.0010747836,0.00013946701,0.00046100575,0.000482906,0.00025327582],"domain_scores_gemma":[0.98931354,0.007630283,0.00041312535,0.0018046898,0.0005992403,0.00023915358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022898342,0.0006841094,0.0009952722,0.0006263694,0.0006161771,0.0010651144,0.0015896306,0.00070460775,0.007561244],"category_scores_gemma":[0.016035834,0.0005829503,0.00077983376,0.0010481592,0.0009304482,0.001436172,0.001600104,0.0012069518,0.0015210675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017963778,0.00028444748,0.0047744373,0.00041375458,0.00017222743,0.00047879107,0.00034673538,0.44488078,0.009133354,0.23765166,0.025103094,0.27496433],"study_design_scores_gemma":[0.00022286792,0.00006936537,0.00025390106,0.000016806507,0.000020262929,0.0001236029,0.00002866273,0.87507373,0.0045478866,0.1176443,0.001975285,0.000023367083],"about_ca_topic_score_codex":0.0015223484,"about_ca_topic_score_gemma":0.0029413747,"teacher_disagreement_score":0.007561244,"about_ca_system_score_codex":0.0008165746,"about_ca_system_score_gemma":0.001839797,"threshold_uncertainty_score":0.02529484},"labels":[],"label_agreement":null},{"id":"W3155275415","doi":"10.21468/scipostphys.11.3.072","title":"Navigator function for the conformal bootstrap","year":2021,"lang":"en","type":"preprint","venue":"SciPost Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; European Commission; Fonds de recherche du Québec – Nature et technologies; San Diego Supercomputer Center; California Institute of Technology; Mitsubishi International Corporation; U.S. Department of Energy; Gordon and Betty Moore Foundation; Simons Foundation; European Research Council; National Science Foundation","keywords":"Conformal map; Function (biology); Space (punctuation); Property (philosophy); Ising model; Computer science; Binary number; Applied mathematics; Algorithm; Mathematics; Mathematical optimization; Mathematical analysis; Statistical physics; Physics","score_opus":0.1792016979596798,"score_gpt":0.40657913437318766,"score_spread":0.22737743641350786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155275415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02877622,0.00036776855,0.9578641,0.0006434889,0.00009739637,0.000064698186,0.000101960875,0.0005434074,0.011540929],"genre_scores_gemma":[0.47300974,0.0004703511,0.5159158,0.00046741305,0.00013482392,0.00057296996,0.00026612295,0.0007289242,0.008433896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.00018573155,0.000013197112,0.00003719636,0.000111709036,0.00003427075],"domain_scores_gemma":[0.9983985,0.00097394176,0.00010405925,0.00021569312,0.00019831165,0.00010956259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016845514,0.00039577376,0.00056659186,0.0010449443,0.0007561579,0.00093550613,0.0011700875,0.0014023981,0.0058604996],"category_scores_gemma":[0.008774902,0.00027660377,0.0005738556,0.0004341007,0.0015646265,0.0014030461,0.0015579031,0.0016219073,0.0009245358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066759996,0.00003817163,0.0007821707,0.00009193526,0.000018846727,0.00010448355,0.00009675717,0.13252518,0.0027181807,0.82628244,0.0029985385,0.034276355],"study_design_scores_gemma":[0.000013393639,0.000013053902,0.00010873008,0.00002179441,0.0000034456023,0.00003367893,0.00001043433,0.8407085,0.00059497973,0.15592262,0.0025582868,0.000011118637],"about_ca_topic_score_codex":0.001478447,"about_ca_topic_score_gemma":0.0013690144,"teacher_disagreement_score":0.0058604996,"about_ca_system_score_codex":0.00095924316,"about_ca_system_score_gemma":0.00092018733,"threshold_uncertainty_score":0.019605339},"labels":[],"label_agreement":null},{"id":"W3156595930","doi":"10.1007/s11222-022-10080-8","title":"Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics","year":2022,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematics; Scaling; Algorithm; Limit (mathematics); Applied mathematics; Random walk; Sample (material); Dimension (graph theory); Product (mathematics); Scaling limit; Mathematical optimization; Mathematical analysis; Statistics; Combinatorics","score_opus":0.041831090474959136,"score_gpt":0.34892493573844585,"score_spread":0.3070938452634867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156595930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00925894,0.00045419676,0.98738164,0.00028364497,0.000049340055,0.00008429886,0.000030362846,0.00039368754,0.0020639314],"genre_scores_gemma":[0.43959725,0.0012121487,0.55277205,0.0004801066,0.00024854607,0.0010346264,0.0002756559,0.00076992525,0.003609653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99415165,0.0035305258,0.00027681896,0.0007129733,0.001030066,0.0002979408],"domain_scores_gemma":[0.9661736,0.027012473,0.0015115072,0.0027942802,0.0018635783,0.0006446785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01387407,0.0013060687,0.0019032675,0.0018028788,0.0010539211,0.0030876612,0.0027710618,0.001770958,0.0038572634],"category_scores_gemma":[0.08484256,0.0011052692,0.0010124553,0.0013521513,0.00337148,0.0054340516,0.0031539493,0.0033928293,0.0010556239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021504218,0.00016881766,0.0018029135,0.00033998681,0.00012101234,0.000130015,0.00031587257,0.3968462,0.0027020052,0.5367613,0.0027342339,0.057862613],"study_design_scores_gemma":[0.00001955826,0.0000304479,0.00014299068,0.000040473165,0.000009936175,0.000024555007,0.000017596232,0.8898942,0.00080283097,0.108235516,0.00076225743,0.000019688887],"about_ca_topic_score_codex":0.0019150194,"about_ca_topic_score_gemma":0.0019662618,"teacher_disagreement_score":0.01387407,"about_ca_system_score_codex":0.0019219548,"about_ca_system_score_gemma":0.0023073163,"threshold_uncertainty_score":0.07337397},"labels":[],"label_agreement":null},{"id":"W3157830070","doi":"","title":"The number of RPGR cases remains under-represented","year":2019,"lang":"en","type":"article","venue":"Investigative Ophthalmology & Visual Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hospital for Sick Children","funders":"","keywords":"Medicine","score_opus":0.1155623651537472,"score_gpt":0.44162654525627426,"score_spread":0.3260641801025271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157830070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5571618,0.16249745,0.13482061,0.057291888,0.0054347035,0.00042157224,0.025580103,0.0012026965,0.055589102],"genre_scores_gemma":[0.89808357,0.06408602,0.013796482,0.004397366,0.0023022757,0.00020210615,0.009888825,0.000318095,0.006925246],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9926893,0.0029380112,0.00096281,0.0018597263,0.001080106,0.00047007436],"domain_scores_gemma":[0.956476,0.026969688,0.0044365744,0.0053286133,0.005222858,0.0015663808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009418371,0.00041813092,0.001342461,0.0035352597,0.00055729866,0.002815135,0.0022627746,0.0016324525,0.0125041455],"category_scores_gemma":[0.0466031,0.00038530436,0.0016827086,0.0029752988,0.0013389749,0.0032804422,0.0011220339,0.0016789152,0.004585768],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076115085,0.0001854412,0.3551317,0.001813068,0.00053787866,0.00075350987,0.0006755974,0.0040760296,0.00076173496,0.018378796,0.030109711,0.5868154],"study_design_scores_gemma":[0.00016944004,0.00072705635,0.46405998,0.008638464,0.0020382956,0.030876664,0.005563273,0.030680016,0.0041378764,0.075722106,0.37707844,0.0003083413],"about_ca_topic_score_codex":0.0046059266,"about_ca_topic_score_gemma":0.0030848095,"teacher_disagreement_score":0.0125041455,"about_ca_system_score_codex":0.0011905823,"about_ca_system_score_gemma":0.0028546862,"threshold_uncertainty_score":0.049809694},"labels":[],"label_agreement":null},{"id":"W3157875018","doi":"10.1111/sjos.12532","title":"An <i>n</i>‐dimensional Rosenbrock distribution for Markov chain Monte Carlo testing","year":2021,"lang":"en","type":"article","venue":"Scandinavian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Medical Research Council; Medical Research Council Canada; University of Manchester","keywords":"Benchmark (surveying); Markov chain Monte Carlo; Mathematics; Monte Carlo method; Markov chain; Kernel (algebra); Algorithm; Hybrid Monte Carlo; Mathematical optimization; Applied mathematics; Statistical physics; Computer science; Discrete mathematics; Statistics","score_opus":0.06261011098684073,"score_gpt":0.35254361246061316,"score_spread":0.28993350147377245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157875018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05755079,0.00021558593,0.9383415,0.000486796,0.000037923623,0.00012547296,0.00012473397,0.0002201359,0.0028970337],"genre_scores_gemma":[0.7000838,0.0001711931,0.297283,0.00022214223,0.000060516857,0.0003725335,0.00026736245,0.00010224892,0.0014371637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494135,0.003656953,0.00014327234,0.00044530377,0.0006009251,0.00021221463],"domain_scores_gemma":[0.9655051,0.02646924,0.0018109063,0.0033811266,0.0018998726,0.00093361957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013044177,0.00067197427,0.0010772476,0.0014913006,0.0009180659,0.0017936544,0.0021185766,0.0017384588,0.0024270064],"category_scores_gemma":[0.04548187,0.0004514206,0.00069080474,0.0012515098,0.0039400677,0.0029934424,0.0020430584,0.0022194646,0.00034569684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019324756,0.00009630478,0.004072337,0.00007058385,0.00003835265,0.00009362727,0.00007956363,0.3787649,0.0012784761,0.5984368,0.0013072543,0.015568752],"study_design_scores_gemma":[0.000014264594,0.000034760673,0.00027923487,0.000013403043,0.0000026880018,0.00002413153,0.000010100353,0.9294636,0.0005759841,0.069226444,0.00034251192,0.000012859351],"about_ca_topic_score_codex":0.0036526255,"about_ca_topic_score_gemma":0.0021930442,"teacher_disagreement_score":0.013044177,"about_ca_system_score_codex":0.0022379241,"about_ca_system_score_gemma":0.0021374943,"threshold_uncertainty_score":0.068985045},"labels":[],"label_agreement":null},{"id":"W3160769587","doi":"10.48550/arxiv.1708.04640","title":"Lower bounds for graph bootstrap percolation via properties of polynomials","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypercube; Simple (philosophy); Torus; Mathematics; Graph; Combinatorics; Set (abstract data type); Percolation (cognitive psychology); Discrete mathematics; Computer science","score_opus":0.29228283171051733,"score_gpt":0.28049261280479226,"score_spread":0.01179021890572507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160769587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095581196,0.0027172437,0.8635726,0.0036913813,0.00027309475,0.00015091524,0.00069760537,0.00088905456,0.03242698],"genre_scores_gemma":[0.88742983,0.0029262623,0.099147476,0.0011819019,0.0015285207,0.0006181091,0.00089744735,0.00079199,0.005478387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964908,0.0010321105,0.000111979054,0.0006729443,0.0010507865,0.0006412537],"domain_scores_gemma":[0.93884695,0.050007742,0.0030894773,0.003656328,0.002142104,0.0022572693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005856384,0.0020044367,0.0020686768,0.00642749,0.0024637077,0.0032224767,0.0038668294,0.0026470227,0.007528374],"category_scores_gemma":[0.048771508,0.0009679188,0.0027145518,0.0029124343,0.007187858,0.009421361,0.0051927962,0.008899297,0.0012108923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014116098,0.00013631611,0.0018905036,0.00034671873,0.00007776375,0.00024084446,0.00042759578,0.033670694,0.0060799355,0.9419273,0.0036998906,0.01136121],"study_design_scores_gemma":[0.000028438806,0.00005900052,0.00072369416,0.0000653546,0.000036926514,0.00014922257,0.000068544745,0.17478636,0.0024352705,0.819421,0.0021837964,0.000042309166],"about_ca_topic_score_codex":0.0011794048,"about_ca_topic_score_gemma":0.0011050412,"teacher_disagreement_score":0.007528374,"about_ca_system_score_codex":0.0025657595,"about_ca_system_score_gemma":0.0010081001,"threshold_uncertainty_score":0.030971885},"labels":[],"label_agreement":null},{"id":"W3168896849","doi":"","title":"Parallel tempering on optimized paths","year":2021,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Simulated annealing; Computer science; Markov chain Monte Carlo; Path (computing); Mathematical optimization; Parallel tempering; Algorithm; Mathematics; Bayesian probability; Artificial intelligence; Hybrid Monte Carlo; Machine learning","score_opus":0.09120427770636018,"score_gpt":0.36147501970408674,"score_spread":0.27027074199772655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168896849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016089316,0.00021326715,0.9809089,0.0001050821,0.000031479052,0.000042420663,0.000045518882,0.0005185262,0.0020454705],"genre_scores_gemma":[0.5047177,0.00041067018,0.48726246,0.000253783,0.0000790191,0.00030406247,0.00030807624,0.0006806752,0.005983527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878865,0.0005121657,0.000051306542,0.00027573385,0.0002344559,0.00013770851],"domain_scores_gemma":[0.9952957,0.0031969661,0.0002602622,0.00070642435,0.00034490816,0.00019562537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031529032,0.0009732484,0.0012669807,0.000654044,0.00092795555,0.001137255,0.0016388281,0.0012513578,0.0049137413],"category_scores_gemma":[0.014110622,0.0007955752,0.0009731084,0.0008265982,0.0018864953,0.0024502221,0.0022391854,0.0023793255,0.0008179714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017241697,0.000039644747,0.001017562,0.00007033231,0.000033895143,0.00006946546,0.00011593315,0.8521841,0.0017163322,0.10446082,0.001277844,0.038841598],"study_design_scores_gemma":[0.000010136128,0.000022944252,0.000060818747,0.000007761959,0.0000045269926,0.000016366412,0.000005206592,0.966368,0.000492955,0.032300103,0.0007050619,0.0000060487446],"about_ca_topic_score_codex":0.003802998,"about_ca_topic_score_gemma":0.0033001238,"teacher_disagreement_score":0.0049137413,"about_ca_system_score_codex":0.0014241271,"about_ca_system_score_gemma":0.0016022979,"threshold_uncertainty_score":0.01667434},"labels":[],"label_agreement":null},{"id":"W3175907392","doi":"","title":"On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness","year":2021,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monte Carlo method; Smoothness; Lipschitz continuity; Rate of convergence; Physics; Combinatorics; BETA (programming language); Convex function; Distribution (mathematics); Mathematics; Regular polygon; Mathematical analysis; Statistics; Geometry","score_opus":0.06749056405776141,"score_gpt":0.3460512910546785,"score_spread":0.27856072699691714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175907392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11162674,0.0020801078,0.8689936,0.003075062,0.00015943698,0.00012676691,0.00017620972,0.00057780853,0.013184214],"genre_scores_gemma":[0.83565515,0.002149785,0.14875129,0.0010884703,0.00023896487,0.0005997261,0.0004542747,0.0010473452,0.01001502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981244,0.0010700884,0.00005344765,0.00024304769,0.00029921732,0.00020972833],"domain_scores_gemma":[0.9560564,0.037872896,0.0015864659,0.0015344282,0.0016270232,0.001322809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010156654,0.0014924485,0.0016739937,0.0014587895,0.001389655,0.0019882056,0.0031474032,0.0023231504,0.0032336046],"category_scores_gemma":[0.05688222,0.00080968766,0.0015588009,0.00086441915,0.0049681114,0.00476789,0.0040155286,0.0042954315,0.0004887366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028644086,0.000107607055,0.0039635138,0.0002791783,0.00009057664,0.00023675934,0.00032742287,0.5231228,0.0026999637,0.45632878,0.0021715355,0.010385448],"study_design_scores_gemma":[0.000015146822,0.000031030984,0.00018915941,0.000037650265,0.000009602818,0.000024996978,0.000021369407,0.93003666,0.0004941398,0.06878212,0.00034122242,0.000016910235],"about_ca_topic_score_codex":0.005815599,"about_ca_topic_score_gemma":0.0046269763,"teacher_disagreement_score":0.010156654,"about_ca_system_score_codex":0.0025195132,"about_ca_system_score_gemma":0.0020169597,"threshold_uncertainty_score":0.053714097},"labels":[],"label_agreement":null},{"id":"W3177643880","doi":"10.1007/978-1-4612-2256-9_19","title":"Correction to: Minimal Models I","year":2011,"lang":"en","type":"book-chapter","venue":"Graduate texts in contemporary physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université Laval","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence","score_opus":0.3623939788609523,"score_gpt":0.3557069587010333,"score_spread":0.0066870201599190104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177643880","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050601276,0.0024595342,0.007495013,0.1424235,0.78725934,0.00004709501,0.0048009795,0.0022196986,0.0527888],"genre_scores_gemma":[0.045186784,0.005939644,0.010381186,0.08927936,0.27447003,0.00026380923,0.0068672257,0.0051064407,0.5625055],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976527,0.00047592615,0.00023111193,0.00047923776,0.0008991392,0.00026197554],"domain_scores_gemma":[0.987866,0.0030125333,0.00053207116,0.0024116314,0.005520495,0.0006573313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118124,0.0017828769,0.0020144966,0.0035556331,0.0029982305,0.0038627235,0.0033263369,0.0050032125,0.18059781],"category_scores_gemma":[0.03617696,0.000762206,0.0017073586,0.0024840627,0.002288722,0.004896055,0.0022898526,0.007489142,0.07420537],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013199263,0.0000031654313,0.00002574365,0.000063364925,0.0000054970897,0.000039505398,0.0000145530985,0.000054750137,0.0000113955475,0.009605211,0.9859116,0.004252015],"study_design_scores_gemma":[0.000023861356,0.000009359385,0.00025558847,0.00016724695,0.000022298722,0.0002784706,0.000040462768,0.00061380793,0.00013282917,0.046156984,0.9522742,0.000024934783],"about_ca_topic_score_codex":0.0076679494,"about_ca_topic_score_gemma":0.012166761,"teacher_disagreement_score":0.18059781,"about_ca_system_score_codex":0.0039541223,"about_ca_system_score_gemma":0.0041854805,"threshold_uncertainty_score":0.60415983},"labels":[],"label_agreement":null},{"id":"W3183069953","doi":"10.48550/arxiv.2007.11612","title":"Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergence","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monte Carlo method; Statistical physics; Convergence (economics); Divergence (linguistics); Mathematics; Applied mathematics; Physics; Statistics; Economics","score_opus":0.22812879610242673,"score_gpt":0.2548282495006869,"score_spread":0.02669945339826016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183069953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057780027,0.0012351421,0.9324335,0.001355461,0.00011677836,0.00009573825,0.00012840512,0.00045013416,0.006404885],"genre_scores_gemma":[0.7851554,0.0012340422,0.19943905,0.00077380973,0.00018406606,0.0005336156,0.00058196543,0.00074028235,0.011357823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807227,0.0009831351,0.00006658885,0.00029185676,0.00037147684,0.0002146663],"domain_scores_gemma":[0.9736901,0.022260109,0.0010552062,0.00093420624,0.0012457728,0.00081458903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007957774,0.0016892055,0.0019142486,0.0012842573,0.0009758208,0.0019296436,0.0029636545,0.0021977047,0.0031867113],"category_scores_gemma":[0.038545795,0.0009870953,0.0015321983,0.0008769488,0.004162908,0.0035242576,0.003702427,0.0039039874,0.0004872339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015213549,0.00004870934,0.0022037167,0.00014893831,0.00007523744,0.00013988097,0.00017178536,0.7084979,0.001118835,0.27980068,0.001032902,0.0066092373],"study_design_scores_gemma":[0.000007509427,0.000012251879,0.000084530475,0.000012147784,0.000004201654,0.000011408446,0.000008172874,0.9657607,0.00023265541,0.03366993,0.00018688646,0.000009622839],"about_ca_topic_score_codex":0.008769056,"about_ca_topic_score_gemma":0.0055363826,"teacher_disagreement_score":0.008769056,"about_ca_system_score_codex":0.0031786843,"about_ca_system_score_gemma":0.002334253,"threshold_uncertainty_score":0.04208523},"labels":[],"label_agreement":null},{"id":"W3184271985","doi":"10.1002/rsa.21032","title":"Finitary codings for gradient models and a new graphical representation for the six-vertex model","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"","keywords":"Finitary; Ising model; Potts model; Mathematics; Vertex (graph theory); Representation (politics); Statistical physics; Spins; Combinatorics; Square-lattice Ising model; Pure mathematics; Physics; Graph; Condensed matter physics","score_opus":0.29745213654278024,"score_gpt":0.27614847798421815,"score_spread":0.02130365855856209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184271985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.252671,0.0007819702,0.6849918,0.0018287743,0.0003048409,0.00011512836,0.0007153891,0.0013097317,0.05728139],"genre_scores_gemma":[0.9214518,0.00035151234,0.06495806,0.00037664213,0.0001464208,0.00012508064,0.00037482847,0.0002819685,0.011933641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995384,0.00014199773,0.00002622849,0.0000725416,0.00013380812,0.00008700677],"domain_scores_gemma":[0.99887115,0.00041924213,0.00016896885,0.00021337309,0.00015951671,0.00016771357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797635,0.00043148463,0.00035700313,0.0012532347,0.0005826556,0.0015538498,0.001113402,0.0009786601,0.0068895468],"category_scores_gemma":[0.0029927748,0.00022007378,0.0006976391,0.00075565325,0.0017220057,0.0024887389,0.0011016001,0.0015080508,0.00087486656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012284521,0.00000731822,0.00007126547,0.000014845969,0.0000013634518,0.00004681805,0.00011811796,0.0039828126,0.0008397273,0.9915638,0.00043911414,0.0029024284],"study_design_scores_gemma":[0.000010098161,0.000018491459,0.00012512883,0.000017223841,0.0000041397343,0.00007316437,0.00006143807,0.07993432,0.00076761644,0.9156876,0.0032805915,0.00002020469],"about_ca_topic_score_codex":0.00196768,"about_ca_topic_score_gemma":0.001505684,"teacher_disagreement_score":0.0068895468,"about_ca_system_score_codex":0.0010756186,"about_ca_system_score_gemma":0.00051460305,"threshold_uncertainty_score":0.023047864},"labels":[],"label_agreement":null},{"id":"W3186092959","doi":"10.48550/arxiv.2107.10211","title":"Differentiable Annealed Importance Sampling and the Perils of Gradient Noise","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Differentiable function; Computation; Mathematical optimization; Convergence (economics); Sublinear function; Noise (video); Mathematics; Sampling (signal processing); Computer science; Rate of convergence; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.16635644517308631,"score_gpt":0.2479423587077539,"score_spread":0.0815859135346676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186092959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012690949,0.00045530676,0.9838066,0.00058894954,0.000065731554,0.000031970998,0.00004831502,0.00023899942,0.002073133],"genre_scores_gemma":[0.6503001,0.0010136929,0.33794385,0.0008209077,0.0002540989,0.000332735,0.0002690662,0.0004064336,0.008659097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976463,0.0012697747,0.000087091954,0.00038824303,0.00045813358,0.00015050537],"domain_scores_gemma":[0.98436534,0.012171319,0.0009297229,0.0013645401,0.0007825883,0.0003864265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005465176,0.0009191096,0.0012682755,0.0008374075,0.00074750494,0.0017749285,0.0021499966,0.0018442948,0.002810264],"category_scores_gemma":[0.03471281,0.00091690937,0.0007828716,0.0007845265,0.0037920536,0.0030489855,0.00226175,0.0034621237,0.00051721896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013472205,0.00005531234,0.0017406427,0.00018808445,0.0000802577,0.0001596943,0.00019978799,0.34179398,0.0020720796,0.62750727,0.0020346672,0.024033574],"study_design_scores_gemma":[0.000017470922,0.0000271949,0.00022331515,0.000026159389,0.000010680738,0.000031419782,0.00001007206,0.826617,0.00077500986,0.17110635,0.0011407175,0.0000146503435],"about_ca_topic_score_codex":0.0032150873,"about_ca_topic_score_gemma":0.0038570673,"teacher_disagreement_score":0.005465176,"about_ca_system_score_codex":0.0020040541,"about_ca_system_score_gemma":0.001632708,"threshold_uncertainty_score":0.028903008},"labels":[],"label_agreement":null},{"id":"W3186789731","doi":"10.3390/e23080961","title":"ABCDP: Approximate Bayesian Computation with Differential Privacy","year":2021,"lang":"en","type":"article","venue":"MDPI (MDPI AG)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differential privacy; Approximate Bayesian computation; Computer science; Computation; Bayesian probability; Sample (material); Posterior probability; Noise (video); Secure multi-party computation; Data mining; Algorithm; Artificial intelligence","score_opus":0.04492684427359561,"score_gpt":0.3267668623492428,"score_spread":0.2818400180756472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186789731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021335604,0.000099606295,0.99637103,0.00019352103,0.000015927693,0.000039357557,0.00005546284,0.00014686628,0.0009446729],"genre_scores_gemma":[0.35129538,0.00044644013,0.64375395,0.0004743833,0.00011651385,0.00037672857,0.00035397988,0.00015349907,0.0030291022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995684,0.0018071051,0.00020567517,0.0005442477,0.0014690008,0.0002899182],"domain_scores_gemma":[0.9919071,0.0052078855,0.00041642724,0.00134519,0.000893701,0.00022962014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047715115,0.0007506991,0.001521828,0.0010455278,0.00072997063,0.0022310365,0.0023770267,0.0017139757,0.0031604446],"category_scores_gemma":[0.021146353,0.0006662434,0.00101827,0.0017806422,0.0021294886,0.0027317852,0.0032343687,0.003055778,0.00060406997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016335298,0.00005698429,0.00089520286,0.0001196587,0.00006122355,0.00010008505,0.00010766711,0.5540982,0.00144367,0.36867473,0.0025817642,0.07169747],"study_design_scores_gemma":[0.000016360054,0.00002119055,0.000051530595,0.000009493029,0.0000063394805,0.000034033572,0.000005691167,0.91791254,0.0006681949,0.07991833,0.001348445,0.00000785632],"about_ca_topic_score_codex":0.0045082946,"about_ca_topic_score_gemma":0.0035612874,"teacher_disagreement_score":0.0047715115,"about_ca_system_score_codex":0.002251556,"about_ca_system_score_gemma":0.0035526594,"threshold_uncertainty_score":0.02523446},"labels":[],"label_agreement":null},{"id":"W3192514715","doi":"10.48550/arxiv.1907.02333","title":"Randomized sequential importance sampling for estimating the number of\\n perfect matchings in bipartite graphs","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Bipartite graph; Combinatorics; Sampling (signal processing); Limit (mathematics); Discrete mathematics; Graph; Computer science","score_opus":0.1280888965388046,"score_gpt":0.29111006547333557,"score_spread":0.16302116893453097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192514715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032186035,0.00044631163,0.9654295,0.00037956084,0.00006908039,0.00007391565,0.000073131116,0.00030258312,0.0010399907],"genre_scores_gemma":[0.6655793,0.00074681407,0.3295837,0.00034867052,0.00035127267,0.00036216274,0.00047949955,0.00017118422,0.002377392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684525,0.0018269656,0.0000875012,0.00049447356,0.0005324826,0.0002134364],"domain_scores_gemma":[0.9695338,0.026010072,0.0013830796,0.0016946977,0.0007695354,0.0006088613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072421134,0.00096129486,0.001212,0.0015166114,0.000732938,0.0012894026,0.003057199,0.0014784047,0.0018453862],"category_scores_gemma":[0.041290708,0.0009067813,0.0006649709,0.0014382107,0.003004093,0.002908712,0.001816925,0.0020416414,0.00028966166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006696892,0.00025169775,0.004822204,0.00035209075,0.00018172426,0.00012441496,0.00016057496,0.66601276,0.0041764784,0.26198298,0.0029318158,0.058333624],"study_design_scores_gemma":[0.000022894448,0.000020609494,0.00015029967,0.000008165282,0.000007631341,0.000011358386,0.0000045491743,0.96186584,0.00046630416,0.03725344,0.00018320144,0.0000057289744],"about_ca_topic_score_codex":0.0038836314,"about_ca_topic_score_gemma":0.0045813187,"teacher_disagreement_score":0.0072421134,"about_ca_system_score_codex":0.001804669,"about_ca_system_score_gemma":0.0015258705,"threshold_uncertainty_score":0.038300395},"labels":[],"label_agreement":null},{"id":"W3193567672","doi":"","title":"Comparison of Methodologies to Assess the Convergence of Markov Chain Monte Carlo Methods","year":2003,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Markov chain Monte Carlo; Convergence (economics); Monte Carlo method; Bivariate analysis; Markov chain; Applied mathematics; Parametric statistics; Mathematics; Computer science; Econometrics; Mathematical optimization; Statistics; Economics","score_opus":0.22024466265329062,"score_gpt":0.4917079725964461,"score_spread":0.2714633099431555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193567672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057469018,0.007206731,0.9291422,0.0006657113,0.00025458966,0.00056084496,0.00027890573,0.001013034,0.003408905],"genre_scores_gemma":[0.3132063,0.0041558635,0.6784479,0.00024262482,0.00019374791,0.0013453683,0.0007577953,0.00081532495,0.0008350762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95575064,0.03396799,0.0022669975,0.0014567202,0.0060198056,0.00053783355],"domain_scores_gemma":[0.6569944,0.3060113,0.00693274,0.012134425,0.016120574,0.0018066319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06626381,0.0016159827,0.0020392498,0.008950872,0.0009985152,0.0023997186,0.002471593,0.0034824675,0.0021513985],"category_scores_gemma":[0.23829624,0.0007169969,0.0014816737,0.0032730429,0.0022482707,0.003414406,0.0032032307,0.0027594692,0.00044789145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015993884,0.00048202192,0.02565215,0.0017622727,0.002006737,0.00018110064,0.0015762976,0.54338235,0.0020666185,0.18388689,0.0035484426,0.2338557],"study_design_scores_gemma":[0.00023051018,0.00039704825,0.0057006003,0.0005160649,0.00017850472,0.0002110046,0.00031685393,0.9164064,0.0020933521,0.07039482,0.0033949064,0.0001599636],"about_ca_topic_score_codex":0.003666634,"about_ca_topic_score_gemma":0.0034398,"teacher_disagreement_score":0.06626381,"about_ca_system_score_codex":0.0019423586,"about_ca_system_score_gemma":0.0024561335,"threshold_uncertainty_score":0.35044068},"labels":[],"label_agreement":null},{"id":"W3195979657","doi":"10.1215/00192082-9421096","title":"Mixing and hitting times for Gibbs samplers and other non-Feller processes","year":2021,"lang":"en","type":"article","venue":"Illinois Journal of Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Mathematics; Mixing (physics); Hitting time; Markov chain mixing time; Markov property; Statistical physics; Multiplicative function; Spectral gap; Connection (principal bundle); Pure mathematics; Combinatorics; Discrete mathematics; Applied mathematics; Markov model; Mathematical analysis; Statistics; Physics; Geometry","score_opus":0.08213504132193418,"score_gpt":0.3527355843383236,"score_spread":0.2706005430163894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195979657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045801874,0.0023259697,0.94243675,0.00095100974,0.0001019083,0.00007260561,0.00012732258,0.0002704387,0.007912081],"genre_scores_gemma":[0.73558253,0.0031795013,0.24421826,0.0009758904,0.0006336211,0.00054244936,0.0006737758,0.000605202,0.013588794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944675,0.0024392758,0.00031188517,0.0011238316,0.0011666514,0.00049082574],"domain_scores_gemma":[0.9397007,0.049508676,0.0035581668,0.0026898466,0.0023440483,0.0021985779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014134927,0.0019569611,0.0018853794,0.0045946008,0.0017692661,0.003951042,0.0024294632,0.0027721452,0.0073478227],"category_scores_gemma":[0.06693672,0.0010424212,0.0023350993,0.0025347748,0.008210303,0.009179614,0.0038796526,0.0063224,0.00087358366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038577524,0.000020184254,0.00056178623,0.00005718307,0.000028696968,0.000076487384,0.00021753162,0.015175297,0.00069311564,0.9792492,0.00029366082,0.0035883752],"study_design_scores_gemma":[0.0000127935,0.000022483933,0.00029241512,0.000034290708,0.000017939641,0.00006557169,0.000035208624,0.21201602,0.00057044753,0.7860069,0.00090157636,0.000024206822],"about_ca_topic_score_codex":0.0021165311,"about_ca_topic_score_gemma":0.0016447962,"teacher_disagreement_score":0.014134927,"about_ca_system_score_codex":0.0034165909,"about_ca_system_score_gemma":0.0014397544,"threshold_uncertainty_score":0.07475352},"labels":[],"label_agreement":null},{"id":"W3201959809","doi":"","title":"New approach to Monte Carlo Hamiltonian and test","year":2005,"lang":"en","type":"article","venue":"High Energy Physics and Nuclear Physics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Physics; Monte Carlo method; Statistical physics; Hybrid Monte Carlo; Hamiltonian (control theory); Monte Carlo method in statistical physics; Monte Carlo molecular modeling; Markov chain Monte Carlo; Statistics; Mathematical optimization","score_opus":0.029411804149580095,"score_gpt":0.2608807387526572,"score_spread":0.23146893460307713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201959809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017638117,0.00010983563,0.990368,0.00052848563,0.00017593698,0.00003932039,0.000049332648,0.00011062279,0.006854568],"genre_scores_gemma":[0.21367739,0.0005191287,0.7570591,0.0012410947,0.0012732944,0.00083975395,0.00026045254,0.00065851904,0.024471194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604636,0.0021451036,0.00012781072,0.00031392372,0.001211779,0.00015509054],"domain_scores_gemma":[0.9887944,0.0077844327,0.0003723011,0.0013890074,0.0011977477,0.00046222116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004505858,0.001224449,0.002024865,0.0025319734,0.0013373011,0.0025009757,0.005062522,0.002934773,0.010477096],"category_scores_gemma":[0.02026871,0.00094437425,0.0014538178,0.0015528485,0.005617551,0.005378868,0.00376078,0.005169884,0.0010351563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009332607,0.000027673497,0.00008628547,0.00001952954,0.000017964676,0.000028300594,0.000032676147,0.025042333,0.00013139947,0.9690132,0.0008319797,0.004759249],"study_design_scores_gemma":[0.00001235709,0.000007646286,0.00003703295,0.000007554358,0.000008061175,0.000025515246,0.000007757702,0.3004495,0.00012931676,0.6974341,0.0018691313,0.000011989977],"about_ca_topic_score_codex":0.0032483896,"about_ca_topic_score_gemma":0.004049675,"teacher_disagreement_score":0.010477096,"about_ca_system_score_codex":0.0023263223,"about_ca_system_score_gemma":0.0025034428,"threshold_uncertainty_score":0.03504938},"labels":[],"label_agreement":null},{"id":"W3205918438","doi":"10.1017/9781108377447.016","title":"Local Structure and Nonuniform Recovery","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Content (measure theory); Computer science; Computer network; Telecommunications; Computer security; Business; Mathematics","score_opus":0.035200415312549464,"score_gpt":0.23959087296589213,"score_spread":0.20439045765334266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205918438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012830372,0.029441234,0.6455418,0.004960642,0.0009767492,0.00007209681,0.00047271667,0.00080904656,0.30489534],"genre_scores_gemma":[0.3705693,0.030160693,0.16599934,0.0017414546,0.0014397883,0.0002740683,0.0010990573,0.0010174884,0.4276988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997147,0.00007941443,0.000009665047,0.00006848335,0.00010081013,0.000026971435],"domain_scores_gemma":[0.99922204,0.00043420322,0.000040663876,0.00017886782,0.00008899306,0.000035313988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007626223,0.00040428588,0.00055478467,0.0005647969,0.00043960672,0.0010473457,0.00068721786,0.0006365305,0.014813328],"category_scores_gemma":[0.0038209246,0.00028406314,0.00033687154,0.00072073913,0.002009949,0.0020992174,0.0012960292,0.0016659667,0.0034571341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003621645,0.000010873446,0.00018266079,0.00018470398,0.000010775275,0.000056799825,0.00008999256,0.017986257,0.0010354144,0.85384977,0.037602056,0.088954486],"study_design_scores_gemma":[0.00000806931,0.000028565712,0.0005317959,0.00010706286,0.000012273055,0.00020438245,0.000047047386,0.06267776,0.0015923174,0.85206205,0.08270977,0.000018886349],"about_ca_topic_score_codex":0.0018888713,"about_ca_topic_score_gemma":0.0017066932,"teacher_disagreement_score":0.014813328,"about_ca_system_score_codex":0.0010840229,"about_ca_system_score_gemma":0.0006461839,"threshold_uncertainty_score":0.04955554},"labels":[],"label_agreement":null},{"id":"W3210415424","doi":"10.1007/s11009-021-09909-y","title":"Convergence Rates of Attractive-Repulsive MCMC Algorithms","year":2021,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ergodic theory; Mathematics; Convergence (economics); Rate of convergence; Bounded function; Applied mathematics; Algorithm; Compact convergence; State space; Markov chain Monte Carlo; State (computer science); Space (punctuation); Pure mathematics; Mathematical analysis; Monte Carlo method; Computer science; Statistics","score_opus":0.2792081277756497,"score_gpt":0.43360761981715645,"score_spread":0.15439949204150677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210415424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081170924,0.0024424084,0.8815396,0.0025904535,0.00045918283,0.00035729902,0.0005281147,0.001203374,0.029708767],"genre_scores_gemma":[0.5969404,0.0015101092,0.37445664,0.0011571752,0.00050249125,0.0012997275,0.001537179,0.0025743567,0.020021958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98809296,0.007071572,0.00048261244,0.00092659285,0.002468812,0.0009575006],"domain_scores_gemma":[0.8311056,0.1443913,0.0027718036,0.0078011127,0.010459939,0.0034702625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027939904,0.0016738742,0.002262553,0.0038078716,0.0036706007,0.0046553886,0.00552186,0.004369081,0.010092445],"category_scores_gemma":[0.1695661,0.0014679065,0.00193519,0.0023351102,0.005368187,0.005197126,0.006442106,0.005203927,0.0016573961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066575664,0.00016082758,0.0036731772,0.00042977842,0.00015002307,0.00012474101,0.00046753668,0.35501143,0.0012220278,0.59326994,0.007909861,0.03691486],"study_design_scores_gemma":[0.00007658409,0.00003991599,0.0003886597,0.00008146754,0.000033862954,0.000068672714,0.000057446425,0.8479756,0.0009841974,0.14913876,0.0011224903,0.000032325446],"about_ca_topic_score_codex":0.0060920455,"about_ca_topic_score_gemma":0.005364609,"teacher_disagreement_score":0.027939904,"about_ca_system_score_codex":0.0037164383,"about_ca_system_score_gemma":0.005239662,"threshold_uncertainty_score":0.14776206},"labels":[],"label_agreement":null},{"id":"W3216685853","doi":"10.1007/s11222-021-10063-1","title":"MALA with annealed proposals: a generalization of locally and globally balanced proposal distributions","year":2021,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Context (archaeology); Applied mathematics; Dimension (graph theory); Interpolation (computer graphics); Mathematics; Bayesian probability; Computer science; Distribution (mathematics); Mathematical optimization; Algorithm; Statistics; Artificial intelligence; Combinatorics; Mathematical analysis; Geography","score_opus":0.01872987595330092,"score_gpt":0.30967142467322034,"score_spread":0.2909415487199194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216685853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043715015,0.0003565237,0.99343747,0.00025496882,0.00007032288,0.00006841188,0.00007672282,0.00032255033,0.0010415041],"genre_scores_gemma":[0.21865733,0.001298826,0.76469886,0.0008501134,0.00065500155,0.0010931883,0.0008618997,0.0011083066,0.010776491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918703,0.004406731,0.00036187697,0.0016856517,0.001160641,0.0005147764],"domain_scores_gemma":[0.9694373,0.02114362,0.001348687,0.005473996,0.0015710888,0.0010253147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017877743,0.0021791086,0.004501727,0.0030893087,0.0017858001,0.004908777,0.0076840613,0.0046103816,0.008035958],"category_scores_gemma":[0.056029048,0.002790275,0.003032355,0.0032984524,0.0049816384,0.01188843,0.010245028,0.0067405123,0.0023988534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030991106,0.000120642035,0.0011312974,0.00019675732,0.00020739782,0.00012398575,0.00033835007,0.28265598,0.001096693,0.6403018,0.0032626437,0.07025447],"study_design_scores_gemma":[0.000034549645,0.000040024777,0.00009981267,0.000026435293,0.000031133357,0.000044874556,0.000015524523,0.7478285,0.00036383956,0.24984172,0.0016462207,0.000027376542],"about_ca_topic_score_codex":0.004464771,"about_ca_topic_score_gemma":0.0052488106,"teacher_disagreement_score":0.017877743,"about_ca_system_score_codex":0.00302832,"about_ca_system_score_gemma":0.004391077,"threshold_uncertainty_score":0.09454769},"labels":[],"label_agreement":null},{"id":"W4205696233","doi":"10.5539/ijsp.v11n1p29","title":"Markov Chain Confidence Intervals and Biases","year":2021,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ergodicity; Markov chain Monte Carlo; Applied mathematics; Markov chain; Delta method; Simple (philosophy); Limit (mathematics); Confidence interval; Asymptotic analysis; Central limit theorem; Statistics; Monte Carlo method; Mathematical analysis; Estimator","score_opus":0.0808077694143704,"score_gpt":0.37933316282142254,"score_spread":0.29852539340705214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205696233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065837577,0.0008135156,0.98874646,0.00034043044,0.000050320512,0.000028028237,0.00014084393,0.00021106111,0.0030854773],"genre_scores_gemma":[0.50783813,0.0025608912,0.48309243,0.000594746,0.00042554387,0.00046543678,0.000979185,0.00056801335,0.0034756416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98987716,0.004747462,0.0005908568,0.0014425684,0.0027903195,0.0005516611],"domain_scores_gemma":[0.8092165,0.16349712,0.008067552,0.00963522,0.008667618,0.0009159872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017911766,0.0011222322,0.0013747305,0.0033480218,0.0008238338,0.0032059513,0.0033355544,0.002260983,0.005781682],"category_scores_gemma":[0.20484185,0.0008289211,0.0013629346,0.0030403694,0.0033529832,0.0060051526,0.0035074693,0.0050950693,0.0010127892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067765955,0.000027250559,0.0020984306,0.00022358874,0.0000760375,0.00013404421,0.00019764596,0.17784694,0.00058673765,0.782126,0.0012255573,0.03539002],"study_design_scores_gemma":[0.000019462355,0.000018636987,0.0005546486,0.00017241598,0.000024899926,0.00012481408,0.000023682987,0.4420097,0.0010142152,0.5541514,0.0018460519,0.00004010105],"about_ca_topic_score_codex":0.0025844122,"about_ca_topic_score_gemma":0.0015523038,"teacher_disagreement_score":0.017911766,"about_ca_system_score_codex":0.002332509,"about_ca_system_score_gemma":0.0017475346,"threshold_uncertainty_score":0.094727576},"labels":[],"label_agreement":null},{"id":"W4206463141","doi":"10.5948/upo9781614444039.001","title":"The Problems","year":2012,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Notice; Pleasure; Set (abstract data type); Entertainment; Class (philosophy); Perspective (graphical); Psychology; Computer science; Visual arts; Art; Political science; Artificial intelligence; Law","score_opus":0.059833396802783295,"score_gpt":0.3155564716505859,"score_spread":0.25572307484780266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206463141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029374082,0.0063390383,0.025962802,0.19596598,0.009198054,0.00023448995,0.0017062037,0.00064771157,0.7570083],"genre_scores_gemma":[0.11063035,0.009749174,0.029692108,0.088674255,0.007424059,0.00092980126,0.00533603,0.0015215662,0.7460427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98999166,0.003018017,0.00060218864,0.0022975805,0.0027780398,0.0013125797],"domain_scores_gemma":[0.9883931,0.0033321842,0.00069626706,0.0018931772,0.004328258,0.0013570581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00633815,0.001460742,0.00096110255,0.002198553,0.008051352,0.015092965,0.0042412225,0.00802248,0.14313269],"category_scores_gemma":[0.031661596,0.00088866265,0.001658504,0.0031441792,0.008908811,0.015728544,0.008030293,0.0113504995,0.062423456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005171146,0.000046974117,0.0006278059,0.00014105068,0.000010362749,0.00021491505,0.0011244089,0.00026347116,0.00007805525,0.5103226,0.43367094,0.05344765],"study_design_scores_gemma":[0.0000136291665,0.000011677139,0.0002625209,0.00022594484,0.00000577267,0.00048488684,0.0014811637,0.00033114143,0.000088830544,0.178057,0.8190224,0.000015023401],"about_ca_topic_score_codex":0.008222791,"about_ca_topic_score_gemma":0.0059293346,"teacher_disagreement_score":0.14313269,"about_ca_system_score_codex":0.007714624,"about_ca_system_score_gemma":0.007501363,"threshold_uncertainty_score":0.47882652},"labels":[],"label_agreement":null},{"id":"W4225341677","doi":"10.1214/24-ejp1082","title":"Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.","year":2024,"lang":"en","type":"preprint","venue":"Electronic Journal of Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodular matrix; Ising model; Mathematics; Combinatorics; Tree (set theory); Boundary (topology); Factor (programming language); Graph; Discrete mathematics; Computer science; Statistical physics; Physics; Mathematical analysis","score_opus":0.048900467135387836,"score_gpt":0.372072167004742,"score_spread":0.3231716998693542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225341677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6186788,0.0008872234,0.3465468,0.0006630497,0.000070096656,0.0000562595,0.0002636147,0.00046722012,0.032366898],"genre_scores_gemma":[0.9767776,0.00023928573,0.019168768,0.00012871127,0.000051146515,0.000037634716,0.00010507492,0.00006545914,0.0034262177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997675,0.000058917172,0.000009606296,0.000066453445,0.0000486553,0.000048873408],"domain_scores_gemma":[0.9987785,0.00045420995,0.00029321705,0.00021114093,0.00009927557,0.0001636178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000410615,0.00030412868,0.00038326147,0.001088573,0.00035516697,0.0007980966,0.0007238653,0.0005818975,0.003619628],"category_scores_gemma":[0.0029153423,0.0002164972,0.00051370746,0.00041312684,0.0013159103,0.0017733519,0.000726832,0.0008394243,0.0002758821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003788236,0.00001872243,0.0009699683,0.00003387408,0.0000080681275,0.00011620061,0.00015791033,0.011341539,0.0024760403,0.98009884,0.00057725015,0.004163684],"study_design_scores_gemma":[0.0000134901575,0.000037458693,0.0011485004,0.000020411086,0.0000141576675,0.00019560373,0.00007934876,0.16150607,0.0015702676,0.83328605,0.0021120852,0.000016559079],"about_ca_topic_score_codex":0.0009847544,"about_ca_topic_score_gemma":0.0009462631,"teacher_disagreement_score":0.003619628,"about_ca_system_score_codex":0.0007697802,"about_ca_system_score_gemma":0.00023913219,"threshold_uncertainty_score":0.012108922},"labels":[],"label_agreement":null},{"id":"W4226232650","doi":"10.1007/s11222-022-10134-x","title":"Convergence rate bounds for iterative random functions using one-shot coupling","year":2022,"lang":"en","type":"preprint","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Rate of convergence; Mathematics; Iterated function; Applied mathematics; Upper and lower bounds; Convergence (economics); Bounding overwatch; Coupling (piping); Rate function; Random variable; Markov process; Discrete mathematics; Large deviations theory; Computer science; Mathematical analysis; Statistics","score_opus":0.21681556012923428,"score_gpt":0.42074246547733135,"score_spread":0.20392690534809707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226232650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010893963,0.0015202048,0.97763664,0.00086132286,0.0001308317,0.00007080168,0.000093921415,0.00027610516,0.008516264],"genre_scores_gemma":[0.53991514,0.0059722075,0.41989255,0.0016323915,0.0009451801,0.0013264036,0.0008515691,0.0025480052,0.026916584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99234045,0.004014303,0.0003165571,0.0009458611,0.0016407089,0.000742158],"domain_scores_gemma":[0.88051885,0.10110177,0.003304727,0.0053087818,0.0066400543,0.0031258403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022661189,0.0046578352,0.0044424054,0.0052720807,0.0022250377,0.0053681233,0.0066677784,0.005087603,0.005974907],"category_scores_gemma":[0.10013853,0.0022306968,0.003358787,0.0031209355,0.0086954795,0.011798322,0.00918636,0.009687987,0.0015071457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025507197,0.00014765741,0.0008482006,0.0004413195,0.00016277903,0.00014183861,0.0003860317,0.20457071,0.0019464273,0.7756418,0.0026830728,0.012775096],"study_design_scores_gemma":[0.000015606181,0.000032610715,0.00013863751,0.000084648214,0.000038275193,0.00005247808,0.000040617295,0.7610212,0.0008880957,0.23691103,0.0007363295,0.000040474068],"about_ca_topic_score_codex":0.0048784423,"about_ca_topic_score_gemma":0.003421395,"teacher_disagreement_score":0.022661189,"about_ca_system_score_codex":0.005739872,"about_ca_system_score_gemma":0.0043329624,"threshold_uncertainty_score":0.11984527},"labels":[],"label_agreement":null},{"id":"W4230143430","doi":"10.1007/978-1-4939-6719-3_4","title":"Resource Reservation","year":2016,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Computer science; Reservation; Quality of service; Channel (broadcasting); Scalability; Wireless; Channel allocation schemes; Telecommunications","score_opus":0.02786699433332241,"score_gpt":0.2512620769069242,"score_spread":0.2233950825736018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230143430","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003756199,0.0018100338,0.08437938,0.0023614306,0.0019898026,0.0002354537,0.0013990545,0.0033899173,0.9006788],"genre_scores_gemma":[0.07492994,0.0023556126,0.028918946,0.001271217,0.0007125562,0.0002747412,0.0023602538,0.0011784169,0.8879983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940205,0.000081580474,0.00002836287,0.00013373792,0.00023805647,0.000116267576],"domain_scores_gemma":[0.9988662,0.00020067592,0.000036495785,0.00051438797,0.00023519884,0.00014716543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008666707,0.000637573,0.00063367357,0.0008365892,0.0013645672,0.0031337377,0.0021686926,0.00084073475,0.20470473],"category_scores_gemma":[0.0028694335,0.0004178219,0.00046457382,0.0012241015,0.0006315828,0.0034267465,0.0020273216,0.0017263028,0.06968671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022334536,0.0001231328,0.00023841822,0.00025178524,0.00001915303,0.00026079424,0.0002504984,0.0034171788,0.004102234,0.40003678,0.33762762,0.25344896],"study_design_scores_gemma":[0.000016238386,0.000030711773,0.0001740453,0.0001022823,0.000011097076,0.00021475807,0.00013214078,0.0063915593,0.002459347,0.08433367,0.9061098,0.000024449555],"about_ca_topic_score_codex":0.0026446271,"about_ca_topic_score_gemma":0.002976794,"teacher_disagreement_score":0.20470473,"about_ca_system_score_codex":0.0008785483,"about_ca_system_score_gemma":0.0017762514,"threshold_uncertainty_score":0.6848055},"labels":[],"label_agreement":null},{"id":"W4230579920","doi":"10.1017/s0021900200022300","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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Ergodicity; Random walk; Metropolis–Hastings algorithm; Statistical physics; Applied mathematics; Combinatorics; Statistics; Markov chain Monte Carlo; Monte Carlo method","score_opus":0.08652925242123094,"score_gpt":0.31206761388875665,"score_spread":0.2255383614675257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230579920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072607666,0.00079401286,0.91724455,0.0005984231,0.00006756347,0.00009089353,0.00013312395,0.0003881208,0.008075651],"genre_scores_gemma":[0.90154725,0.0007947817,0.09056907,0.00034099782,0.00023514415,0.0003717563,0.00039385242,0.00039222438,0.005354797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963605,0.0018747901,0.00014431545,0.0005615433,0.00063169916,0.00042719187],"domain_scores_gemma":[0.9668387,0.025347464,0.0020517171,0.002678382,0.0021406345,0.00094309304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008784991,0.0010116406,0.0014342511,0.0021708906,0.0013070562,0.00238876,0.0025130194,0.0014145983,0.004842856],"category_scores_gemma":[0.042908512,0.0008073747,0.0012460101,0.0010016618,0.006145479,0.004786107,0.004552644,0.0023849495,0.0006967982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008510137,0.000022183702,0.0011735351,0.00006517249,0.0000489985,0.00009389996,0.00011645419,0.10151656,0.00075796875,0.8899831,0.0004968122,0.005640247],"study_design_scores_gemma":[0.000030678577,0.000047055983,0.00025528678,0.000030624033,0.000015878253,0.000055781275,0.000029253108,0.66743636,0.000795039,0.33056155,0.00072028826,0.00002212025],"about_ca_topic_score_codex":0.0020817688,"about_ca_topic_score_gemma":0.0016359657,"teacher_disagreement_score":0.008784991,"about_ca_system_score_codex":0.0020222948,"about_ca_system_score_gemma":0.001447016,"threshold_uncertainty_score":0.046460032},"labels":[],"label_agreement":null},{"id":"W4233115469","doi":"10.1007/978-1-4939-7131-2_100634","title":"Markov Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.07279900266710636,"score_gpt":0.32819089263013396,"score_spread":0.2553918899630276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233115469","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027703217,0.007062471,0.46329683,0.004664873,0.0012029443,0.00008666163,0.0009794573,0.00080115325,0.5191353],"genre_scores_gemma":[0.18437192,0.019799165,0.13635239,0.0020171548,0.0018662189,0.000598361,0.002979705,0.0010250162,0.6509901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995351,0.00013459373,0.000015587371,0.00011626852,0.00016608225,0.000032323325],"domain_scores_gemma":[0.99922645,0.00046715408,0.000035798224,0.00010670755,0.00012828875,0.000035531666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051764166,0.0008652948,0.00056317943,0.0010006932,0.0007260594,0.0021872073,0.00075653876,0.0010905234,0.045379624],"category_scores_gemma":[0.0030076841,0.0004577682,0.00041887636,0.0010707608,0.0012671871,0.0028475,0.0010533099,0.0017851094,0.0111863725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004889069,0.000011562855,0.00005612296,0.00005544018,0.0000071081145,0.000017822449,0.00005711152,0.0068155597,0.0001303101,0.9230701,0.029938908,0.039835084],"study_design_scores_gemma":[0.0000027422773,0.0000031897337,0.000059679347,0.000059601025,0.0000049244336,0.00002983172,0.000019862642,0.012964206,0.00017020872,0.86503416,0.12164338,0.000008279104],"about_ca_topic_score_codex":0.0028640032,"about_ca_topic_score_gemma":0.003048626,"teacher_disagreement_score":0.045379624,"about_ca_system_score_codex":0.0016708656,"about_ca_system_score_gemma":0.0013086599,"threshold_uncertainty_score":0.15180993},"labels":[],"label_agreement":null},{"id":"W4233603854","doi":"10.1017/s0001867800007151","title":"Convergence of Conditional Metropolis-Hastings Samplers","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metropolis–Hastings algorithm; Markov chain Monte Carlo; Mathematics; Gibbs sampling; Markov chain; Convergence (economics); Bayesian probability; Ergodic theory; Monte Carlo method; Statistics","score_opus":0.044681408336678184,"score_gpt":0.3493056804692662,"score_spread":0.304624272132588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233603854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059358235,0.0003240202,0.99154973,0.00018821078,0.000042139363,0.000054945263,0.000061240185,0.00020392888,0.0016399722],"genre_scores_gemma":[0.4245325,0.001307761,0.5651277,0.0003475415,0.0002980607,0.0007751375,0.0006388762,0.00048399434,0.0064884857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935482,0.0035903133,0.00027325738,0.00091487565,0.0012737047,0.00039966626],"domain_scores_gemma":[0.95304894,0.03989776,0.0013275612,0.0021458992,0.0028319955,0.0007478732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0141487485,0.0013762016,0.0020946127,0.0023791704,0.001267539,0.002512853,0.0036841615,0.0019445061,0.007061438],"category_scores_gemma":[0.06732424,0.0012503136,0.0018296682,0.0018590948,0.004529859,0.004546524,0.0037992478,0.0040627318,0.0011651437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658411,0.000059188624,0.0017552128,0.00017216192,0.000107657404,0.00010753202,0.00021207868,0.30454794,0.0008519663,0.6682728,0.0013053128,0.022481535],"study_design_scores_gemma":[0.000019894056,0.000018735205,0.00013461371,0.000032259075,0.000013616068,0.000028367718,0.000011732234,0.86400616,0.0004674045,0.1343512,0.000897551,0.000018459823],"about_ca_topic_score_codex":0.0064344737,"about_ca_topic_score_gemma":0.0059853154,"teacher_disagreement_score":0.0141487485,"about_ca_system_score_codex":0.0025925867,"about_ca_system_score_gemma":0.0031572222,"threshold_uncertainty_score":0.0748266},"labels":[],"label_agreement":null},{"id":"W4233733177","doi":"10.1109/ismvl.2012.4","title":"Welcome from the ISMVL-2012 Symposium Chair","year":2012,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.07777052159366425,"score_gpt":0.3394280516136918,"score_spread":0.2616575300200275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233733177","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009158286,0.010019449,0.0028366907,0.2552167,0.6624076,0.00036571932,0.0018290187,0.0010722965,0.06533661],"genre_scores_gemma":[0.007520751,0.005363886,0.002375066,0.067415416,0.112288885,0.000376366,0.0019563187,0.00091158616,0.8017917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972677,0.00050841464,0.000106754225,0.0004313645,0.0011635129,0.0005222513],"domain_scores_gemma":[0.9778882,0.0005852268,0.00041503756,0.00038766803,0.00781061,0.012913172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005079085,0.0013766906,0.001256609,0.0010538237,0.0022871601,0.0059347562,0.0013318419,0.0044131754,0.1782205],"category_scores_gemma":[0.008308071,0.0006098008,0.0013408241,0.0005843366,0.0006736754,0.0026258118,0.004340257,0.0071867616,0.14746584],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021801388,0.000010351892,0.00004305386,0.000019557106,0.0000017025435,0.000032100263,0.0000101081,0.000022996615,0.00009952874,0.00031224955,0.9952857,0.0041409032],"study_design_scores_gemma":[0.000010936631,0.000022639604,0.0002774422,0.00004398804,0.0000027435528,0.000052276708,0.00010111398,0.00005274217,0.000054792938,0.00034330002,0.9990283,0.000009608911],"about_ca_topic_score_codex":0.005669588,"about_ca_topic_score_gemma":0.01986973,"teacher_disagreement_score":0.1782205,"about_ca_system_score_codex":0.0027916487,"about_ca_system_score_gemma":0.006416367,"threshold_uncertainty_score":0.59620696},"labels":[],"label_agreement":null},{"id":"W4234349307","doi":"10.22215/etd/2009-06451","title":"Tail asymptotics and ergodicity for the GI/G/1-type Markov chains","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Markov chain; Ergodicity; Mathematics; Type (biology); Combinatorics; Statistics","score_opus":0.05749291357170187,"score_gpt":0.3699356534610344,"score_spread":0.3124427398893325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234349307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33050752,0.0038901477,0.6160799,0.004236565,0.0004658504,0.0002741648,0.0015069909,0.0012389349,0.041799936],"genre_scores_gemma":[0.949475,0.0031214417,0.023579502,0.00062383123,0.00077002356,0.0005124938,0.0014343172,0.00047508162,0.020008305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843067,0.0005617455,0.00006179397,0.0003048291,0.000273811,0.00036708335],"domain_scores_gemma":[0.96568334,0.023777239,0.0027211548,0.0027281255,0.0029942186,0.0020958686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063534062,0.0012168335,0.0018570917,0.0041553183,0.001771602,0.0033112485,0.002555142,0.0017668869,0.010440804],"category_scores_gemma":[0.044482864,0.0008902547,0.0016170795,0.0020059424,0.0057471013,0.00449016,0.0023814894,0.0052564675,0.0015403478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014523126,0.00007642224,0.0033457323,0.00013459263,0.00006474784,0.00024475856,0.00045514063,0.047204036,0.0014117225,0.93467844,0.004850277,0.0073889056],"study_design_scores_gemma":[0.000052875093,0.000052745407,0.0025658985,0.00015192568,0.000057499627,0.00017829389,0.00016117068,0.45292622,0.0009334603,0.5410387,0.0017891569,0.000092055445],"about_ca_topic_score_codex":0.008254924,"about_ca_topic_score_gemma":0.008515389,"teacher_disagreement_score":0.010440804,"about_ca_system_score_codex":0.003553208,"about_ca_system_score_gemma":0.0022298915,"threshold_uncertainty_score":0.034927964},"labels":[],"label_agreement":null},{"id":"W4235940087","doi":"10.1090/fic/026/05","title":"Monte Carlo algorithms and non-local actions","year":2000,"lang":"en","type":"other","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Monte Carlo method; Computer science; Algorithm; Statistical physics; Mathematics; Statistics; Physics","score_opus":0.05643967132389099,"score_gpt":0.354613368443636,"score_spread":0.298173697119745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235940087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022891685,0.0033048904,0.9529175,0.00090965524,0.00022151598,0.00003635322,0.00008788234,0.00046765726,0.03976537],"genre_scores_gemma":[0.2042012,0.008385063,0.68401563,0.0007122814,0.0010351879,0.00053159735,0.0006962172,0.0012778208,0.09914501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977677,0.0011725295,0.000062073086,0.00026043726,0.0006585888,0.00007867506],"domain_scores_gemma":[0.99024147,0.0077573834,0.00030664998,0.0008150954,0.00070422696,0.00017513294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424724,0.001391109,0.0016248309,0.0019572768,0.0010493802,0.002886125,0.0017884584,0.0020772535,0.016946437],"category_scores_gemma":[0.014624401,0.00076171913,0.000768532,0.0033641371,0.003079308,0.0044831717,0.0019164763,0.0036555473,0.00394158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001936243,0.00003657273,0.00018782118,0.00010032617,0.000023843055,0.000019686015,0.00005786753,0.04005405,0.00009079719,0.8953261,0.008186537,0.055897083],"study_design_scores_gemma":[0.000013448903,0.000004924124,0.00008722976,0.000044221237,0.000009076373,0.000030124616,0.000010817479,0.17374732,0.00021717833,0.8111889,0.014637375,0.000009362453],"about_ca_topic_score_codex":0.0037294892,"about_ca_topic_score_gemma":0.00407386,"teacher_disagreement_score":0.016946437,"about_ca_system_score_codex":0.0020142884,"about_ca_system_score_gemma":0.0018105255,"threshold_uncertainty_score":0.056691468},"labels":[],"label_agreement":null},{"id":"W4236048360","doi":"10.1007/978-1-4614-6170-8_100980","title":"Markov Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Markov chain; Computer science; Machine learning","score_opus":0.05773306739266761,"score_gpt":0.31197671661696147,"score_spread":0.2542436492242939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236048360","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025656554,0.0068938727,0.43725437,0.0042133844,0.0009858202,0.00007938741,0.00078025303,0.0006701384,0.5465572],"genre_scores_gemma":[0.17464347,0.019166933,0.12870938,0.0018058944,0.0015258205,0.0005272262,0.0022463512,0.000804714,0.6705702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958616,0.00012399563,0.000013874005,0.00009879696,0.00014845245,0.000028709004],"domain_scores_gemma":[0.9993787,0.0003764105,0.000028800741,0.0000852417,0.00010272546,0.000028059889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045861508,0.00080615235,0.00053234346,0.0009538625,0.0006917376,0.0019352942,0.00070906704,0.0009876626,0.041204475],"category_scores_gemma":[0.0024351173,0.00044049224,0.00037981354,0.0010234212,0.001254359,0.0026589595,0.0009697802,0.001665522,0.009270864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041363114,0.00001051013,0.000050289,0.000048236478,0.0000065244694,0.000017500997,0.000057785157,0.0065559335,0.00012641617,0.9233507,0.028598884,0.041173127],"study_design_scores_gemma":[0.0000025013787,0.00000316862,0.000059374495,0.000055322853,0.0000045747597,0.00003119464,0.000021516653,0.01269849,0.0001745423,0.86068195,0.12625934,0.000008012424],"about_ca_topic_score_codex":0.0030991235,"about_ca_topic_score_gemma":0.003470153,"teacher_disagreement_score":0.041204475,"about_ca_system_score_codex":0.0016658304,"about_ca_system_score_gemma":0.0012438697,"threshold_uncertainty_score":0.13784271},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05514559893675608,"score_gpt":0.31967634724247374,"score_spread":0.26453074830571766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238723945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051528465,0.00016914228,0.94374514,0.00028979982,0.00002324213,0.00005539647,0.000036696496,0.00013548697,0.0040166215],"genre_scores_gemma":[0.92022306,0.00032545027,0.0765617,0.00020184265,0.000082518294,0.00024982565,0.000118290074,0.00015412274,0.0020831765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963313,0.0017825572,0.00018950456,0.00051574473,0.00084970315,0.0003312484],"domain_scores_gemma":[0.9683355,0.024085378,0.0021298197,0.002310489,0.0018475524,0.0012913392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007942821,0.00095398334,0.001364857,0.0015701604,0.0011763715,0.0020811716,0.0021366896,0.0013740002,0.002344527],"category_scores_gemma":[0.044299744,0.00065832713,0.0012598832,0.00094976526,0.0034520712,0.0035332362,0.004465282,0.0027167005,0.00037593374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001221527,0.00007776385,0.0019233591,0.00009992306,0.00009929382,0.00011646704,0.0002728541,0.20492895,0.0041410304,0.77753633,0.00043679102,0.010245069],"study_design_scores_gemma":[0.00002780908,0.00007181094,0.00036989187,0.000024382163,0.000023540835,0.000045685654,0.000027594033,0.7986093,0.0017072689,0.19839837,0.00067424885,0.000020087691],"about_ca_topic_score_codex":0.0014076662,"about_ca_topic_score_gemma":0.00073671,"teacher_disagreement_score":0.007942821,"about_ca_system_score_codex":0.0013962128,"about_ca_system_score_gemma":0.001294108,"threshold_uncertainty_score":0.042006195},"labels":[],"label_agreement":null},{"id":"W4239358995","doi":"10.1007/978-0-387-74437-7_5","title":"Reducible Markov Chains","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Markov chain; Computer science; Mathematics; Machine learning","score_opus":0.11844723524884203,"score_gpt":0.3359455851100587,"score_spread":0.21749834986121663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239358995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050844736,0.005255071,0.5666708,0.0028265577,0.0008677886,0.00009966876,0.0003844765,0.00061087013,0.41820025],"genre_scores_gemma":[0.33294544,0.013324049,0.23412912,0.0020062155,0.0022719798,0.00062694977,0.0014450235,0.001112394,0.41213876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991173,0.00029257056,0.000032849246,0.00015697182,0.00034450693,0.00005577357],"domain_scores_gemma":[0.9983924,0.0010201642,0.00006250109,0.00029552454,0.00017615603,0.000053300624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010637464,0.0009418887,0.0011033986,0.0011813146,0.00087771704,0.002373979,0.0010841044,0.0011572003,0.01892943],"category_scores_gemma":[0.0044052484,0.00076421554,0.00076389185,0.0009491036,0.0030693407,0.0033641094,0.0012146819,0.003999254,0.0043439576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017795788,0.000004687779,0.00001380835,0.000018842233,0.0000024290991,0.0000071451877,0.00004083709,0.0020909926,0.000035249963,0.9879068,0.0035127127,0.006364654],"study_design_scores_gemma":[0.0000016189165,0.0000013384503,0.000014512143,0.0000167255,0.0000020395016,0.0000117692725,0.0000063375287,0.0051487614,0.00006655359,0.9758631,0.018864082,0.0000031322395],"about_ca_topic_score_codex":0.0017136519,"about_ca_topic_score_gemma":0.0013646849,"teacher_disagreement_score":0.01892943,"about_ca_system_score_codex":0.0018423306,"about_ca_system_score_gemma":0.0014642334,"threshold_uncertainty_score":0.06332523},"labels":[],"label_agreement":null},{"id":"W4239378096","doi":"10.1002/9781119517566.ch8","title":"Orientation","year":2019,"lang":"en","type":"other","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Orientation (vector space); Product (mathematics); Scalar (mathematics); Vector space; Algebraic number; Algebra over a field; Cross product; Wedge (geometry); Computer science; Mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.06697738462844635,"score_gpt":0.38767656629587915,"score_spread":0.32069918166743283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239378096","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006902137,0.003636449,0.39833456,0.0030242638,0.0023106774,0.00011067161,0.00044292206,0.00088126404,0.5843571],"genre_scores_gemma":[0.3487782,0.009755954,0.23738332,0.0038209013,0.0028857936,0.0004773412,0.0015498614,0.0026276202,0.39272106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795353,0.00042252862,0.00012277551,0.00063125003,0.00061554427,0.0002543153],"domain_scores_gemma":[0.9985134,0.0003547947,0.00016272208,0.0004690916,0.00035036323,0.00014967575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073314,0.0009037098,0.0006722542,0.0015256817,0.0023941898,0.0066359024,0.0013805788,0.0016922994,0.032978922],"category_scores_gemma":[0.004249031,0.00045733227,0.0009072748,0.0014997999,0.0076803938,0.009137325,0.004174835,0.0030759412,0.014277067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006804639,0.0000035305532,0.00006122248,0.00003106598,0.0000023571076,0.00002341944,0.00013748101,0.00019556958,0.0002206431,0.98026305,0.0048481477,0.014206771],"study_design_scores_gemma":[0.0000041283715,0.00001880739,0.000118069074,0.00005072459,0.000005664533,0.00029960764,0.00020308905,0.0011490732,0.0008766989,0.62018347,0.37707508,0.000015662084],"about_ca_topic_score_codex":0.0014461584,"about_ca_topic_score_gemma":0.001268293,"teacher_disagreement_score":0.032978922,"about_ca_system_score_codex":0.0017935188,"about_ca_system_score_gemma":0.0012355956,"threshold_uncertainty_score":0.110325456},"labels":[],"label_agreement":null},{"id":"W4239752617","doi":"10.1017/cbo9781316219232.003","title":"Fundamental results","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Content (measure theory); Information retrieval; Mathematics","score_opus":0.07503007492392086,"score_gpt":0.2714722405712743,"score_spread":0.19644216564735342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239752617","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059442334,0.010935151,0.07462038,0.007216943,0.0015783627,0.000041539603,0.0013077887,0.00030044047,0.8980552],"genre_scores_gemma":[0.3588623,0.02971909,0.04963129,0.0065001706,0.0042468775,0.00035810127,0.003130784,0.0008759587,0.5466755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993979,0.00011972032,0.00002466164,0.00014237165,0.00022266692,0.00009271786],"domain_scores_gemma":[0.99931586,0.00027881554,0.000041273066,0.00012662738,0.00017065203,0.000066809625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096917694,0.0007023893,0.00057374866,0.0012367535,0.0011152475,0.002158309,0.0008669751,0.0008858977,0.048378132],"category_scores_gemma":[0.0026555993,0.00021890186,0.0008985625,0.0009172733,0.0019935842,0.0030620745,0.0015828491,0.0025936412,0.01346927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067503215,0.000010097624,0.00006092894,0.00008147146,0.000005539662,0.000015511348,0.00005691162,0.0003467216,0.00013395607,0.962138,0.023693029,0.013451198],"study_design_scores_gemma":[0.00000458662,0.000007061235,0.00016285726,0.00004935541,0.0000046364166,0.00007419469,0.000027040871,0.0007428005,0.00015504213,0.91851383,0.08025337,0.0000051807333],"about_ca_topic_score_codex":0.0013387646,"about_ca_topic_score_gemma":0.0011982128,"teacher_disagreement_score":0.048378132,"about_ca_system_score_codex":0.001901749,"about_ca_system_score_gemma":0.0011330901,"threshold_uncertainty_score":0.16184098},"labels":[],"label_agreement":null},{"id":"W4240213570","doi":"10.1002/cjs.11227","title":"Interdisciplinary sojourns","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Toronto; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reflection (computer programming); Gold medal; Engineering ethics; Library science; Sociology; Political science; Medical education; Computer science; Engineering; History; Medicine; Art history","score_opus":0.05292531159923715,"score_gpt":0.33530487874669673,"score_spread":0.2823795671474596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240213570","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09784709,0.012764843,0.025542796,0.460692,0.03460205,0.00025649427,0.0006842035,0.0007313108,0.36687922],"genre_scores_gemma":[0.74901026,0.004890002,0.009383087,0.050654516,0.006201428,0.00034175205,0.0004912915,0.00085405266,0.17817365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9745677,0.014192131,0.000642104,0.0025258078,0.0042695287,0.0038026809],"domain_scores_gemma":[0.9411101,0.011871045,0.0027989978,0.005311656,0.007550076,0.031358153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016422393,0.0006057304,0.0008040001,0.0019399648,0.0151369255,0.008971364,0.0024399385,0.004012179,0.05066102],"category_scores_gemma":[0.042198773,0.00038890663,0.0010229625,0.0020285472,0.0088026095,0.0075769112,0.020502822,0.008901122,0.0068439846],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018738107,0.00031666592,0.007379219,0.00025690885,0.000065136344,0.0009956259,0.04593044,0.0005846393,0.0003405033,0.38922516,0.43303525,0.121683136],"study_design_scores_gemma":[0.000017356586,0.000042149906,0.0027638762,0.0004519027,0.000008725941,0.00040794167,0.029916195,0.0004510278,0.000117299445,0.08445808,0.88132435,0.00004110038],"about_ca_topic_score_codex":0.005992372,"about_ca_topic_score_gemma":0.012806291,"teacher_disagreement_score":0.05066102,"about_ca_system_score_codex":0.010742568,"about_ca_system_score_gemma":0.015660694,"threshold_uncertainty_score":0.169478},"labels":[],"label_agreement":null},{"id":"W4241505850","doi":"10.1007/978-1-4614-6170-8_100773","title":"Probability Theory","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics","score_opus":0.12956220488915574,"score_gpt":0.3292962971463652,"score_spread":0.19973409225720948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241505850","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010595765,0.017638586,0.225967,0.0054722307,0.0019363129,0.00006089689,0.00043073122,0.00047229012,0.7469624],"genre_scores_gemma":[0.08340832,0.026033584,0.061581846,0.0028496454,0.0044536884,0.0003350122,0.0007740984,0.00074075774,0.819823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922216,0.00022693556,0.000026215417,0.00012858755,0.00035773212,0.000038434304],"domain_scores_gemma":[0.99930906,0.0004122387,0.00002608233,0.000103151426,0.0001230027,0.000026380947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074395025,0.0011483978,0.0009772559,0.0015899424,0.0009253037,0.0027147802,0.0008666658,0.001288099,0.039539393],"category_scores_gemma":[0.0025560716,0.00051726383,0.0005112803,0.0014655336,0.0025846064,0.0032523938,0.0011839726,0.0029798711,0.014828082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023246234,0.000010532936,0.000031104155,0.00006288511,0.0000065442105,0.0000130349135,0.0000714188,0.0011978378,0.000079404825,0.9122435,0.050859246,0.035422117],"study_design_scores_gemma":[0.0000021985684,0.000003243846,0.000064047985,0.000059322956,0.0000037971884,0.00003790761,0.000019566833,0.002407641,0.00009569807,0.8340356,0.16326438,0.0000066625958],"about_ca_topic_score_codex":0.0017282795,"about_ca_topic_score_gemma":0.0020915272,"teacher_disagreement_score":0.039539393,"about_ca_system_score_codex":0.0020828857,"about_ca_system_score_gemma":0.0014012761,"threshold_uncertainty_score":0.13227248},"labels":[],"label_agreement":null},{"id":"W4243195147","doi":"10.1007/978-1-4939-7131-2_100672","title":"Missing Data Mechanisms","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.2993044159812077,"score_gpt":0.3998822009888989,"score_spread":0.10057778500769116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243195147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012538583,0.0060160323,0.8862959,0.007672463,0.001300663,0.000070300564,0.00060873595,0.000820411,0.095961586],"genre_scores_gemma":[0.18144694,0.02112858,0.46544066,0.005816229,0.0056512645,0.00093000534,0.0027119047,0.002116891,0.31475756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969279,0.0014094139,0.00014445299,0.00052769424,0.00085683377,0.00013377554],"domain_scores_gemma":[0.98994935,0.007055315,0.0003209868,0.0017399244,0.00078428054,0.00015007421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055833003,0.0012750268,0.0013808794,0.0015638974,0.0011017454,0.0039214822,0.0025241468,0.0027392898,0.035751734],"category_scores_gemma":[0.02262027,0.0011496954,0.0011181729,0.0018270427,0.003543024,0.006970833,0.0024076332,0.0055456734,0.011725571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101258975,0.000015681338,0.00006943918,0.00008321623,0.000014354615,0.000023542227,0.00006861985,0.0027954767,0.000065273016,0.9306695,0.022987155,0.04319766],"study_design_scores_gemma":[0.0000051831285,0.0000037462416,0.000037197926,0.00007182393,0.000007643856,0.00004187823,0.000012291669,0.007344639,0.0001408667,0.9597898,0.03253557,0.000009306926],"about_ca_topic_score_codex":0.0011230465,"about_ca_topic_score_gemma":0.0009647295,"teacher_disagreement_score":0.035751734,"about_ca_system_score_codex":0.0019278775,"about_ca_system_score_gemma":0.002728673,"threshold_uncertainty_score":0.11960143},"labels":[],"label_agreement":null},{"id":"W4245097098","doi":"10.1002/rsa.20145","title":"Concentration for self‐bounding functions and an inequality of Talagrand","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Mathematics; Concentration inequality; Inequality; struct; Random variable; Applied mathematics; Statistical physics; Pure mathematics; Physics; Statistics; Mathematical analysis; Computer science","score_opus":0.034684852864017277,"score_gpt":0.3432106182288202,"score_spread":0.3085257653648029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245097098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105194375,0.0056317444,0.807686,0.007524972,0.0004988844,0.00013243865,0.00033038872,0.0003853176,0.0726159],"genre_scores_gemma":[0.9072257,0.0029561108,0.06918854,0.0021139248,0.001124368,0.0004692428,0.00030354926,0.00044742168,0.016171148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947372,0.0024797167,0.00020127343,0.00060759665,0.0013284535,0.00064578664],"domain_scores_gemma":[0.959734,0.031624995,0.001585248,0.0020987499,0.003425775,0.0015311935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01185536,0.001419583,0.0020499562,0.004460962,0.001875383,0.003866637,0.0029036866,0.002349281,0.0075120954],"category_scores_gemma":[0.037663702,0.0009272913,0.0025451717,0.0017105028,0.006989755,0.007847138,0.006891064,0.0045946944,0.0008781763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005696089,0.000025546888,0.00038390476,0.00011095666,0.000036414036,0.000093474446,0.00015426241,0.009629749,0.0014730053,0.9818112,0.0019270495,0.0042974344],"study_design_scores_gemma":[0.000024560837,0.000050457795,0.000490738,0.00007767895,0.00003231246,0.00018071062,0.00004522572,0.22320893,0.0027849993,0.77011496,0.0029412583,0.000048180606],"about_ca_topic_score_codex":0.0017076074,"about_ca_topic_score_gemma":0.00067890313,"teacher_disagreement_score":0.01185536,"about_ca_system_score_codex":0.0033728997,"about_ca_system_score_gemma":0.0013330989,"threshold_uncertainty_score":0.06269789},"labels":[],"label_agreement":null},{"id":"W4245246423","doi":"10.1002/9780470012505.tam006","title":"<scp>M</scp>arkov Chain<scp>M</scp>onte<scp>C</scp>arlo Methods","year":2004,"lang":"en","type":"other","venue":"Encyclopedia of Actuarial Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Markov chain Monte Carlo; Ergodic theory; Curse of dimensionality; Markov chain mixing time; Statistical physics; Computer science; Markov process; Measure (data warehouse); Variable-order Markov model; Chain (unit); Monte Carlo method; Algorithm; Markov model; Mathematics; Artificial intelligence; Statistics; Data mining; Physics; Machine learning","score_opus":0.03194344119435688,"score_gpt":0.34750547367275075,"score_spread":0.3155620324783939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245246423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002400067,0.0025821305,0.83765626,0.003926236,0.0010916608,0.00019946603,0.0018864598,0.0034926515,0.14676498],"genre_scores_gemma":[0.12504236,0.004177121,0.56401336,0.0018348572,0.0013457711,0.0010384893,0.00422186,0.004776513,0.2935497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816835,0.0007046635,0.00009548024,0.0002796942,0.0006407871,0.00011107434],"domain_scores_gemma":[0.9920711,0.0035297743,0.0005326616,0.0019325184,0.0015759389,0.0003579306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025407546,0.0008515275,0.0008846919,0.002302188,0.0010557551,0.0026572328,0.0020567195,0.0012251752,0.13582419],"category_scores_gemma":[0.013727724,0.00049721275,0.0008672812,0.0025237831,0.0012890146,0.001894484,0.0029569087,0.0020187313,0.048989877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011746357,0.0001238732,0.0012436045,0.00028078564,0.0000733606,0.00013220281,0.00006917547,0.030278563,0.00060149777,0.37066317,0.16464737,0.43176892],"study_design_scores_gemma":[0.00008309026,0.00003454052,0.00092508993,0.00028564347,0.000036565027,0.00020549147,0.000050343035,0.28342906,0.0029804895,0.36746046,0.34443974,0.000069524816],"about_ca_topic_score_codex":0.006095834,"about_ca_topic_score_gemma":0.01066724,"teacher_disagreement_score":0.13582419,"about_ca_system_score_codex":0.0017433745,"about_ca_system_score_gemma":0.0026473084,"threshold_uncertainty_score":0.45437717},"labels":[],"label_agreement":null},{"id":"W4245643498","doi":"10.5539/jmr.v3n2p98","title":"Uniform Bound on Normal Approximation of Latin Hypercube Sampling","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Commission on Higher Education","keywords":"Mathematics; Latin hypercube sampling; Stein's method; Hypercube; Upper and lower bounds; Random variable; Combinatorics; Constant (computer programming); Sampling (signal processing); Distribution (mathematics); Rate of convergence; Discrete mathematics; Statistics; Mathematical analysis; Monte Carlo method","score_opus":0.567236413546368,"score_gpt":0.47956854824592954,"score_spread":0.08766786530043846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245643498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006650678,0.0018994076,0.9749279,0.00096760923,0.00022576253,0.00017126775,0.00019329156,0.00039032623,0.014573788],"genre_scores_gemma":[0.25038892,0.0052761966,0.7137112,0.0023114008,0.00084840646,0.0031099513,0.0014205248,0.0010113505,0.021921989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98756903,0.0067185457,0.00035697155,0.0016350264,0.002766383,0.00095408456],"domain_scores_gemma":[0.9573048,0.030134577,0.0011609835,0.0041283015,0.0061946763,0.0010767767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019652322,0.0018871813,0.0024712838,0.003671567,0.002198532,0.003438233,0.004728923,0.002339881,0.010387516],"category_scores_gemma":[0.092918776,0.001083014,0.0019459124,0.0031680549,0.005475311,0.0064340318,0.007176545,0.0062757786,0.0027422195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003489783,0.00008265257,0.0018715493,0.00026688923,0.00008353049,0.00013879743,0.0003074766,0.08306576,0.001895381,0.86853427,0.006839587,0.036565214],"study_design_scores_gemma":[0.000059596143,0.0001380209,0.000599562,0.0002111024,0.000046957048,0.00021583193,0.00008630375,0.65840226,0.003657129,0.32372802,0.012786604,0.00006864226],"about_ca_topic_score_codex":0.0054036393,"about_ca_topic_score_gemma":0.004672517,"teacher_disagreement_score":0.019652322,"about_ca_system_score_codex":0.004905056,"about_ca_system_score_gemma":0.002933455,"threshold_uncertainty_score":0.10393268},"labels":[],"label_agreement":null},{"id":"W4245839397","doi":"10.1017/9781108610902.013","title":"Random matrix models II. Level spacings","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"John Abbott College; Université de Montréal; Concordia University","funders":"","keywords":"Matrix (chemical analysis); Mathematics; Materials science; Composite material","score_opus":0.11412819906962052,"score_gpt":0.27983807734060856,"score_spread":0.16570987827098804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245839397","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004714358,0.04040193,0.69001055,0.0065348065,0.0020249246,0.000097913726,0.0021851338,0.0012702344,0.25276014],"genre_scores_gemma":[0.32539928,0.058389727,0.17860146,0.0041523003,0.0040411567,0.00089022954,0.0031257581,0.0019116335,0.42348844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992077,0.00030671744,0.000023244802,0.0001558263,0.00024112257,0.0000654598],"domain_scores_gemma":[0.99754995,0.0015461976,0.00019471896,0.00034856197,0.0002550697,0.00010555193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013646096,0.0010683306,0.0011380727,0.000987392,0.0004876725,0.0021500026,0.0016856069,0.0019474669,0.03832228],"category_scores_gemma":[0.006908165,0.00069798686,0.00088429154,0.0017607823,0.0016170541,0.0025820388,0.0009733476,0.0028421895,0.015651178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015414207,0.000021327873,0.00018460721,0.00017201607,0.000017330676,0.000060857954,0.000055869627,0.017664606,0.00021397213,0.90759605,0.038252015,0.035745975],"study_design_scores_gemma":[0.0000071462964,0.000014001167,0.00020344135,0.000082548104,0.000008846575,0.00012182866,0.000021100745,0.032574225,0.0001020253,0.9300663,0.036782008,0.000016631251],"about_ca_topic_score_codex":0.0020619133,"about_ca_topic_score_gemma":0.00158463,"teacher_disagreement_score":0.03832228,"about_ca_system_score_codex":0.001227802,"about_ca_system_score_gemma":0.00091248204,"threshold_uncertainty_score":0.12820077},"labels":[],"label_agreement":null},{"id":"W4245913672","doi":"10.1090/fic/026/12","title":"Introduction to semi Markov chain Monte Carlo","year":2000,"lang":"en","type":"other","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain Monte Carlo; Markov chain; Monte Carlo method; Statistical physics; Computer science; Mathematics; Statistics; Machine learning; Physics","score_opus":0.023640573437034393,"score_gpt":0.30998831174214375,"score_spread":0.28634773830510935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245913672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005666617,0.0043523125,0.95108515,0.00096358126,0.00063646265,0.000054586635,0.00032587012,0.0010852966,0.04093014],"genre_scores_gemma":[0.079505116,0.017621117,0.8176995,0.0015385082,0.002768235,0.000739355,0.0013825126,0.002195677,0.07655009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840754,0.00066399673,0.00008300438,0.00017558191,0.0006166574,0.000053264335],"domain_scores_gemma":[0.99371237,0.0045204135,0.00012943392,0.00063573953,0.00086922315,0.0001327086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002246314,0.0012973975,0.0012537767,0.0021044041,0.00052256463,0.0021861827,0.0013528437,0.0014002575,0.030224489],"category_scores_gemma":[0.010210442,0.0009874734,0.00085343514,0.0040167873,0.0018533337,0.0036383248,0.0017054992,0.003853419,0.00825856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018864042,0.000044799475,0.00019951715,0.00021618814,0.000027154847,0.000049912553,0.00009117416,0.020709695,0.000247416,0.7960548,0.038001906,0.14433861],"study_design_scores_gemma":[0.000015321999,0.000009444418,0.00018448196,0.00014381947,0.000013212117,0.000120629076,0.000016289088,0.12866394,0.00044206227,0.75180846,0.11855821,0.000024204099],"about_ca_topic_score_codex":0.0027002427,"about_ca_topic_score_gemma":0.0020925316,"teacher_disagreement_score":0.030224489,"about_ca_system_score_codex":0.001234541,"about_ca_system_score_gemma":0.0017978041,"threshold_uncertainty_score":0.101111054},"labels":[],"label_agreement":null},{"id":"W4246605113","doi":"10.1017/s0001867800012957","title":"Conductance bounds on the L 2 convergence rate of Metropolis algorithms on unbounded state spaces","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Conductance; Spectral gap; Bounded function; Monotone polygon; Upper and lower bounds; Measure (data warehouse); Domain (mathematical analysis); Markov chain; Combinatorics; Discrete mathematics; Convergence (economics); State (computer science); Probability measure; Interval (graph theory); Algorithm; Mathematical analysis; Statistics; Geometry","score_opus":0.062480328100364566,"score_gpt":0.35118589695721764,"score_spread":0.28870556885685306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246605113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0843086,0.0022496872,0.88413525,0.0032883878,0.000184236,0.00016594917,0.0001798992,0.0009842304,0.024503747],"genre_scores_gemma":[0.8880153,0.0017701247,0.100095734,0.0012704814,0.00026647226,0.0006632089,0.00030101716,0.0011000821,0.006517563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970696,0.0011321568,0.000104007006,0.00047691318,0.0007434694,0.00047384153],"domain_scores_gemma":[0.9513929,0.040961236,0.0016253253,0.0022119372,0.0022475396,0.0015611054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057910834,0.001894732,0.0018772922,0.0018571906,0.0014949021,0.0024953731,0.0030832991,0.0026734015,0.004844904],"category_scores_gemma":[0.056240622,0.0007529782,0.0012256183,0.000961086,0.0044163316,0.008052502,0.0051415525,0.005742556,0.0011733561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034472844,0.00012254754,0.0013026912,0.00033392315,0.00006280821,0.00019089456,0.00058926834,0.22194622,0.008546114,0.74807453,0.0022131032,0.016273186],"study_design_scores_gemma":[0.000024059304,0.00006775352,0.00025184243,0.00007497486,0.000015879134,0.00010854348,0.00006828361,0.6870495,0.0027807115,0.30845147,0.0010736161,0.000033389468],"about_ca_topic_score_codex":0.0009205263,"about_ca_topic_score_gemma":0.0007551497,"teacher_disagreement_score":0.0057910834,"about_ca_system_score_codex":0.003561558,"about_ca_system_score_gemma":0.0018677979,"threshold_uncertainty_score":0.030626535},"labels":[],"label_agreement":null},{"id":"W4247320627","doi":"10.1017/9781139048040.018","title":"First-Quantized Methods","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Perimeter Institute","funders":"","keywords":"Content (measure theory); Computer science; Information retrieval; Mathematics","score_opus":0.10831877115587313,"score_gpt":0.31522140580552555,"score_spread":0.20690263464965242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247320627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014107433,0.010716691,0.8533258,0.0014379876,0.0018310411,0.000066026914,0.0006667322,0.0013678024,0.12917715],"genre_scores_gemma":[0.12067698,0.018275222,0.5305266,0.0018943531,0.001732978,0.0004358905,0.0018532643,0.0034360187,0.3211687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878734,0.00040200676,0.00004494885,0.00016112068,0.0005129696,0.00009161926],"domain_scores_gemma":[0.998626,0.0006454826,0.00004825425,0.00034846755,0.00025878803,0.00007310633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014552126,0.0009600537,0.0012224242,0.0011559987,0.00072023034,0.0022908507,0.001953892,0.0012486676,0.057359014],"category_scores_gemma":[0.0054439306,0.00050890516,0.0010636639,0.0012680165,0.001617178,0.0024525078,0.0025164175,0.0027193516,0.01932073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003443232,0.0000353769,0.00015030587,0.00041837964,0.00003932133,0.00004116449,0.00013083857,0.014075638,0.00089320395,0.78658545,0.06328834,0.13430764],"study_design_scores_gemma":[0.000019269386,0.000028505345,0.00024998814,0.00019942182,0.00001968812,0.00015493676,0.000049815004,0.10714788,0.0011519096,0.71673995,0.17419748,0.000041212086],"about_ca_topic_score_codex":0.0020211749,"about_ca_topic_score_gemma":0.002667075,"teacher_disagreement_score":0.057359014,"about_ca_system_score_codex":0.0012983148,"about_ca_system_score_gemma":0.0013460334,"threshold_uncertainty_score":0.191885},"labels":[],"label_agreement":null},{"id":"W4250752047","doi":"10.1017/s0001867800003918","title":"Translation-Equivariant Matchings of Coin Flips on ℤd","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivariant map; Mathematics; Combinatorics; Translation (biology); Matching (statistics); Lattice (music); Discrete mathematics; Pure mathematics; Statistics","score_opus":0.050465099686878144,"score_gpt":0.3581684544179972,"score_spread":0.3077033547311191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250752047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5517084,0.00048340159,0.4239778,0.001061197,0.00018923177,0.00014452449,0.00032789775,0.0004328969,0.021674545],"genre_scores_gemma":[0.95322317,0.00024706102,0.038606584,0.00017657496,0.00007936846,0.00012044237,0.00014781163,0.000070314,0.007328635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978538,0.0006431617,0.00012767382,0.00042071688,0.0004900565,0.00046461116],"domain_scores_gemma":[0.9960517,0.0017706003,0.00060418504,0.0006669897,0.0003437697,0.0005628263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022811713,0.00054980716,0.0009970203,0.0011501838,0.0013012537,0.0022916028,0.0016687147,0.0013025326,0.0059064305],"category_scores_gemma":[0.011649546,0.00050875,0.0010562243,0.0010265778,0.0034156232,0.0036542516,0.0021738664,0.0014876307,0.0008092148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001998318,0.000048664086,0.0009404199,0.000040165894,0.000024759793,0.00021216412,0.00021633547,0.02455141,0.0021061155,0.96372837,0.0005696268,0.007362118],"study_design_scores_gemma":[0.00004495435,0.000060591887,0.00024196731,0.000011680588,0.000009179537,0.000085730346,0.00006582476,0.11867843,0.0017882247,0.87803584,0.00095006585,0.000027428146],"about_ca_topic_score_codex":0.0016278946,"about_ca_topic_score_gemma":0.0011372588,"teacher_disagreement_score":0.0059064305,"about_ca_system_score_codex":0.0014501549,"about_ca_system_score_gemma":0.0008465137,"threshold_uncertainty_score":0.019759},"labels":[],"label_agreement":null},{"id":"W4252099195","doi":"10.1007/978-1-4939-7131-2_100915","title":"Probability Theory","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Psychology","score_opus":0.1583672447967818,"score_gpt":0.3453450106121729,"score_spread":0.18697776581539108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252099195","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011703186,0.01806564,0.22604506,0.0061879563,0.0023738085,0.0000635148,0.00056351314,0.00055936404,0.74497086],"genre_scores_gemma":[0.08968052,0.026407111,0.061793827,0.0030575485,0.0053546163,0.00036471128,0.0010332623,0.00091175124,0.81139654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999201,0.00022496797,0.000026232292,0.00013750928,0.0003690933,0.00004121766],"domain_scores_gemma":[0.99920386,0.00046913247,0.000030226574,0.00012271311,0.00014194995,0.000032110052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007750058,0.0012015267,0.0009822362,0.0015696363,0.000942541,0.0029914093,0.0008758861,0.0013781637,0.045099158],"category_scores_gemma":[0.0029450438,0.00051781285,0.0005498226,0.0014866762,0.0024998542,0.003327788,0.0012299956,0.003080195,0.018118985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026716925,0.0000110154215,0.000032344462,0.00007045504,0.0000065235217,0.0000125141705,0.00006849504,0.0011661898,0.00007927474,0.9111077,0.054178264,0.033264566],"study_design_scores_gemma":[0.0000023733573,0.0000031284162,0.00006235881,0.00006048879,0.0000037632258,0.000034929355,0.000018260189,0.0022404017,0.00008873233,0.8356256,0.16185348,0.0000064279698],"about_ca_topic_score_codex":0.0015346198,"about_ca_topic_score_gemma":0.0017329099,"teacher_disagreement_score":0.045099158,"about_ca_system_score_codex":0.0020273603,"about_ca_system_score_gemma":0.0014141572,"threshold_uncertainty_score":0.15087175},"labels":[],"label_agreement":null},{"id":"W4253108823","doi":"10.1017/9781108989817.040","title":"Summary and Future Work","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Work (physics); Computer science; Engineering; Mechanical engineering","score_opus":0.04230489357218267,"score_gpt":0.2442750331479979,"score_spread":0.20197013957581522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253108823","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022942,0.5473644,0.01384848,0.20189692,0.04916716,0.0005288721,0.009439707,0.0017811174,0.17367913],"genre_scores_gemma":[0.02294681,0.66647416,0.02492705,0.06640784,0.01855921,0.0009370862,0.017919082,0.00087978813,0.18094888],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99654937,0.0010228944,0.00026078543,0.00066026393,0.0010543967,0.0004522131],"domain_scores_gemma":[0.9849519,0.004129191,0.0006768541,0.0011067555,0.0071753906,0.0019598277],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008240329,0.0013135525,0.0011126482,0.0033914752,0.0019094534,0.010049043,0.0031939067,0.003087532,0.16645092],"category_scores_gemma":[0.024051897,0.0003978873,0.0015227348,0.0046686023,0.0010851419,0.00971541,0.0029569229,0.0032590972,0.07657852],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002614251,0.0000675666,0.0005213637,0.007657303,0.00006101631,0.00016428041,0.00044958334,0.0005757408,0.00036754966,0.032993082,0.6370486,0.31983247],"study_design_scores_gemma":[0.000018130246,0.000056198613,0.0005183743,0.0061720456,0.000058637164,0.00020490268,0.0007782852,0.0001479122,0.00024962146,0.02486422,0.9669084,0.00002330231],"about_ca_topic_score_codex":0.0078125615,"about_ca_topic_score_gemma":0.009487788,"teacher_disagreement_score":0.8335491,"about_ca_system_score_codex":0.0043668807,"about_ca_system_score_gemma":0.009812082,"threshold_uncertainty_score":0.5568338},"labels":[],"label_agreement":null},{"id":"W4280571382","doi":"10.48550/arxiv.2205.07069","title":"Homogenization of SGD in high-dimensions: Exact dynamics and generalization properties","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematics; Applied mathematics; Quadratic equation; Stochastic gradient descent; Covariance; Statistics; Computer science; Artificial neural network; Artificial intelligence","score_opus":0.11630987304367017,"score_gpt":0.22865038887764538,"score_spread":0.11234051583397521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280571382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028302155,0.00023636743,0.9671737,0.00075238076,0.000046931014,0.000034198863,0.0000748992,0.00013947168,0.0032398556],"genre_scores_gemma":[0.77289194,0.00094171317,0.20944355,0.0010875532,0.00023852216,0.00034833074,0.0004846401,0.00036222,0.014201459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.00034275855,0.000057637753,0.0002486528,0.0002385012,0.00011054377],"domain_scores_gemma":[0.9942703,0.0031205227,0.000929968,0.00055968354,0.0007141146,0.00040539898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031965293,0.0010275567,0.0011300563,0.001143784,0.00070790364,0.0015641765,0.0014795265,0.0018995238,0.0024892786],"category_scores_gemma":[0.016145227,0.0007541904,0.0013608199,0.0005905874,0.0035209232,0.0032413353,0.0033127435,0.0025370147,0.0003980163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004249366,0.000042608215,0.0024014825,0.00011914527,0.00006555249,0.0002003551,0.00026789197,0.47294566,0.0033870228,0.5100057,0.0017651765,0.008756837],"study_design_scores_gemma":[0.0000039563097,0.000011869671,0.0001958947,0.000008325686,0.000004004312,0.000022903885,0.000012456902,0.93842465,0.00020725341,0.06071322,0.0003865222,0.000008962304],"about_ca_topic_score_codex":0.006088212,"about_ca_topic_score_gemma":0.0040077455,"teacher_disagreement_score":0.006088212,"about_ca_system_score_codex":0.0020602155,"about_ca_system_score_gemma":0.0012990407,"threshold_uncertainty_score":0.01690501},"labels":[],"label_agreement":null},{"id":"W4281393138","doi":"10.1017/etds.2021.160","title":"Proper -colorings of are Bernoulli","year":2022,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bernoulli's principle; Mathematics; Measure (data warehouse); Independent and identically distributed random variables; Gibbs measure; Combinatorics; Equivariant map; Zero (linguistics); Entropy (arrow of time); Mixing (physics); Random variable; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Physics; Computer science; Quantum mechanics; Linguistics","score_opus":0.02911964807855518,"score_gpt":0.29153159546037566,"score_spread":0.2624119473818205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281393138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84185857,0.00034557658,0.13968424,0.00047561666,0.00014835988,0.000035557805,0.00017355218,0.00016420468,0.017114298],"genre_scores_gemma":[0.9866658,0.00010982692,0.009749033,0.0001075521,0.00006843792,0.000027233864,0.000104125225,0.00006736899,0.0031007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908996,0.00028545441,0.000033820033,0.00019177319,0.0002154382,0.00018348896],"domain_scores_gemma":[0.99804544,0.0007124845,0.0002841285,0.00024435594,0.0002513147,0.00046233548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729776,0.0003561594,0.0005424982,0.0012156988,0.0010028472,0.0018665431,0.0006408808,0.0005892914,0.004134235],"category_scores_gemma":[0.0032803158,0.00036523156,0.00049787934,0.0006272233,0.002930532,0.0017255396,0.001073498,0.0008140497,0.00036499574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001276794,0.000026918458,0.002522441,0.000032544416,0.000019180214,0.00014436053,0.0002747545,0.008483204,0.0062930933,0.9771613,0.0007385399,0.0041761165],"study_design_scores_gemma":[0.000027434828,0.000051191353,0.0033005099,0.000029106955,0.000015294061,0.00016574393,0.00017587928,0.08365076,0.004881835,0.9051488,0.002511541,0.00004198944],"about_ca_topic_score_codex":0.00093001925,"about_ca_topic_score_gemma":0.00096585846,"teacher_disagreement_score":0.004134235,"about_ca_system_score_codex":0.0010666893,"about_ca_system_score_gemma":0.00042081103,"threshold_uncertainty_score":0.013830423},"labels":[],"label_agreement":null},{"id":"W4283793874","doi":"10.1002/cjs.11707","title":"Reflections on Bayesian inference and Markov chain Monte Carlo","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Bayesian inference; Inference; Bayesian probability; Monte Carlo method; Computer science; Markov chain; Hybrid Monte Carlo; Variable-order Bayesian network; Statistical physics; Econometrics; Artificial intelligence; Mathematics; Statistics; Machine learning; Physics","score_opus":0.0827219781909236,"score_gpt":0.36482400993703484,"score_spread":0.28210203174611126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283793874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002503208,0.069122486,0.5832308,0.28536287,0.009240458,0.00006875284,0.0004551843,0.00021197791,0.049804274],"genre_scores_gemma":[0.30575353,0.118636265,0.44630036,0.055527028,0.04784819,0.00053374894,0.00039639708,0.00086723175,0.024137294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9640675,0.025530318,0.001041014,0.0018554382,0.0068194875,0.00068626413],"domain_scores_gemma":[0.71256423,0.26912522,0.0020791711,0.0061161304,0.00872614,0.0013890761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04630028,0.0011536325,0.002181102,0.00313126,0.0017198757,0.006664959,0.0036693804,0.0072215693,0.01005543],"category_scores_gemma":[0.1382574,0.001360643,0.0019363087,0.002989105,0.02328488,0.01256299,0.0035506815,0.023460347,0.0017354443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001669247,0.000016637337,0.00010130584,0.000093442475,0.000024783554,0.00003071521,0.00010824516,0.0050722267,0.000024115154,0.9763706,0.007950722,0.0101904385],"study_design_scores_gemma":[0.000011947434,0.0000050997455,0.00006342062,0.00014326719,0.0000050072067,0.000017635355,0.000027813026,0.0068700775,0.000054788332,0.97516847,0.017615194,0.000017129194],"about_ca_topic_score_codex":0.023153607,"about_ca_topic_score_gemma":0.01077846,"teacher_disagreement_score":0.04630028,"about_ca_system_score_codex":0.009204159,"about_ca_system_score_gemma":0.0060006683,"threshold_uncertainty_score":0.2448622},"labels":[],"label_agreement":null},{"id":"W4287186549","doi":"10.48550/arxiv.2105.00520","title":"Sampling by Divergence Minimization","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Divergence (linguistics); Gaussian; Kullback–Leibler divergence; Sampling (signal processing); Minification; Computer science; Position (finance); Projection (relational algebra); Algorithm; Monte Carlo method; Adaptive sampling; Markov chain; Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Computer vision; Machine learning; Physics","score_opus":0.21330757603749206,"score_gpt":0.2651169086923624,"score_spread":0.05180933265487031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287186549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018956483,0.00006730079,0.99682826,0.00009666759,0.000028219309,0.000046773934,0.000033515986,0.00012947983,0.0008741451],"genre_scores_gemma":[0.13112505,0.000299992,0.86274993,0.00030177954,0.00016017,0.0006970824,0.00047274225,0.0003704444,0.0038228035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815637,0.0009915807,0.00007306916,0.0002839648,0.00039001394,0.000104937],"domain_scores_gemma":[0.99451774,0.0039865905,0.00027577343,0.00048905,0.0005019069,0.00022890825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003753136,0.0010463872,0.0015020723,0.0015074478,0.0009700564,0.0015818139,0.0024714826,0.0017787676,0.0044429875],"category_scores_gemma":[0.015172117,0.0009032166,0.0012133006,0.0011967956,0.0018891647,0.0019063725,0.0027504547,0.0025028917,0.0011138725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090816764,0.000083557716,0.0017620835,0.00017580054,0.00008917673,0.00012277867,0.00014719901,0.7175619,0.001964571,0.21511663,0.003464456,0.05942109],"study_design_scores_gemma":[0.000019976898,0.000018481285,0.00008736791,0.000015338395,0.0000064948335,0.000030298132,0.000008052007,0.93985784,0.00041017754,0.05796268,0.0015702241,0.000013021686],"about_ca_topic_score_codex":0.0041351933,"about_ca_topic_score_gemma":0.0037584654,"teacher_disagreement_score":0.0044429875,"about_ca_system_score_codex":0.0013632099,"about_ca_system_score_gemma":0.002258884,"threshold_uncertainty_score":0.019848764},"labels":[],"label_agreement":null},{"id":"W4292074665","doi":"10.1007/s11222-022-10125-y","title":"The computational asymptotics of Gaussian variational inference and the Laplace approximation","year":2022,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Laplace's method; Mathematical optimization; Mathematics; Applied mathematics; Gaussian; Inference; Optimization problem; Laplace transform; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.02531002923880011,"score_gpt":0.3177553844060853,"score_spread":0.2924453551672852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292074665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009691702,0.0012923699,0.9817348,0.0021108408,0.00015312171,0.000036156078,0.00009039178,0.00017174528,0.004718809],"genre_scores_gemma":[0.6022783,0.0038941912,0.3734049,0.0017432008,0.002319306,0.0006434675,0.0006608429,0.00072520244,0.014330554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99165064,0.0054064086,0.00027644876,0.0008059855,0.0014009668,0.00045946732],"domain_scores_gemma":[0.8749287,0.11424911,0.0020639563,0.004160026,0.0035914772,0.0010067846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019794792,0.0013916993,0.0028101944,0.0032458277,0.001724854,0.0047939066,0.005288724,0.0029701416,0.006961933],"category_scores_gemma":[0.13349928,0.0018263663,0.0019985426,0.0027348045,0.009944542,0.010308247,0.004632657,0.0072973464,0.0007184004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056018136,0.000041212355,0.00061034417,0.00009061087,0.0000470844,0.000043939333,0.00013029613,0.074127376,0.00013714611,0.913045,0.0016466985,0.010024211],"study_design_scores_gemma":[0.000014669096,0.000009942849,0.00014921282,0.000028137183,0.00001048196,0.000024529218,0.000018432906,0.40112224,0.000104056424,0.5978959,0.000608619,0.0000136886265],"about_ca_topic_score_codex":0.009816795,"about_ca_topic_score_gemma":0.0076733218,"teacher_disagreement_score":0.019794792,"about_ca_system_score_codex":0.0045420867,"about_ca_system_score_gemma":0.0047117793,"threshold_uncertainty_score":0.10468614},"labels":[],"label_agreement":null},{"id":"W4294044075","doi":"10.21203/rs.3.rs-1995506/v1","title":"Polynomial Convergence Rates of Piecewise Deterministic Markov Processes","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Piecewise; Polynomial; Mathematics; Norm (philosophy); Convergence (economics); Markov chain; Applied mathematics; Rate of convergence; Markov process; Mathematical optimization; Mathematical analysis; Computer science; Statistics","score_opus":0.23771241854376485,"score_gpt":0.5111118976659662,"score_spread":0.27339947912220136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294044075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109134585,0.0008899126,0.8842898,0.0007325197,0.000054771182,0.000057056634,0.00014558228,0.00032125367,0.004374507],"genre_scores_gemma":[0.9137994,0.0010825566,0.07588321,0.00020070988,0.00008186862,0.0001567981,0.00026127373,0.0002504695,0.008283758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755484,0.0009057576,0.00009275248,0.0003983371,0.00069825246,0.0003500002],"domain_scores_gemma":[0.9628143,0.03083099,0.0020389939,0.0012984567,0.0020045745,0.00101265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076090586,0.0010597717,0.0013936277,0.0017758859,0.00082979753,0.001468398,0.0027429995,0.0014642132,0.0037921239],"category_scores_gemma":[0.045238473,0.00073676754,0.0010442113,0.0009786657,0.003823316,0.0036651362,0.0031623575,0.0035503153,0.0003889107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018674013,0.000047975802,0.0022244311,0.00019098131,0.00004792971,0.00018515592,0.00030972183,0.4853305,0.0040572863,0.49730673,0.00067456655,0.009438055],"study_design_scores_gemma":[0.000009370063,0.0000233118,0.0002729396,0.000018219058,0.000007322718,0.000029874282,0.000016988623,0.9409955,0.00074882904,0.057552133,0.00031299697,0.00001250197],"about_ca_topic_score_codex":0.0072035617,"about_ca_topic_score_gemma":0.0036350128,"teacher_disagreement_score":0.0076090586,"about_ca_system_score_codex":0.0030837199,"about_ca_system_score_gemma":0.0014810475,"threshold_uncertainty_score":0.040241003},"labels":[],"label_agreement":null},{"id":"W4297198872","doi":"10.1007/s11071-022-07865-x","title":"Sequential time-window learning with approximate Bayesian computation: an application to epidemic forecasting","year":2022,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Ministério da Ciência, Tecnologia e Inovação; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computation; Window (computing); Bayesian probability; Approximate Bayesian computation; Computer science; Coronavirus disease 2019 (COVID-19); Posterior probability; Sliding window protocol; Term (time); Algorithm; Artificial intelligence; Machine learning","score_opus":0.0413212484479854,"score_gpt":0.3283262256086914,"score_spread":0.287004977160706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297198872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015610514,0.00041148506,0.9824326,0.00038947424,0.000057623285,0.000030515479,0.00004372992,0.00016783275,0.0008562621],"genre_scores_gemma":[0.57434916,0.0012258133,0.41809073,0.00024246579,0.00029178313,0.00027785244,0.0002417106,0.00019151013,0.0050889244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998909,0.0005777311,0.000058302405,0.00020241151,0.00017770525,0.000074870266],"domain_scores_gemma":[0.98205733,0.016044185,0.0004453508,0.000460412,0.00072443025,0.00026832477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053530396,0.0009702117,0.002735404,0.0011919116,0.001141955,0.0018605829,0.002418316,0.0024785178,0.003537888],"category_scores_gemma":[0.028151363,0.001299454,0.0011031701,0.0020413809,0.0018250297,0.0035542971,0.0018337631,0.003193304,0.00030013354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009702433,0.00006983376,0.0005929106,0.00005408308,0.000050325045,0.00004583183,0.00008288134,0.91666436,0.00023809721,0.05510031,0.00074583106,0.026258536],"study_design_scores_gemma":[0.0000046845003,0.000003110095,0.000025012407,0.0000024215462,0.0000027590015,0.0000031307175,0.0000020157972,0.9880918,0.000035335026,0.011747404,0.00007937177,0.000002988098],"about_ca_topic_score_codex":0.021735962,"about_ca_topic_score_gemma":0.015555919,"teacher_disagreement_score":0.021735962,"about_ca_system_score_codex":0.0017811575,"about_ca_system_score_gemma":0.0025464406,"threshold_uncertainty_score":0.04321891},"labels":[],"label_agreement":null},{"id":"W4299648429","doi":"10.1609/aaai.v31i1.10854","title":"Tsallis Regularized Optimal Transport and Ecological Inference","year":2017,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical proof; Inference; Joint probability distribution; Kullback–Leibler divergence; Computer science; Probability distribution; Convergence (economics); Divergence (linguistics); Mathematics; Artificial intelligence; Statistics; Economics","score_opus":0.11910263389143697,"score_gpt":0.4031109781441055,"score_spread":0.2840083442526685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299648429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147153875,0.00045856243,0.98142415,0.00074309367,0.00004727061,0.00003122698,0.00023174068,0.00020991624,0.0021386375],"genre_scores_gemma":[0.63709295,0.0013601037,0.3519054,0.0004772665,0.00022353027,0.0003074072,0.0010845973,0.00041648833,0.0071322713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977083,0.0011456832,0.00015367186,0.00049470435,0.00034826988,0.0001494088],"domain_scores_gemma":[0.9853098,0.010756626,0.001439874,0.0014468486,0.00069888437,0.0003480055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005039053,0.0009604837,0.0014845175,0.0023300026,0.0013459246,0.0023147573,0.0020919603,0.0020344423,0.003995875],"category_scores_gemma":[0.028548596,0.0009077287,0.0021047355,0.0022232314,0.0046327496,0.0061871232,0.0026435517,0.0036652337,0.00051648734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063218955,0.000023746481,0.0015486105,0.00010671755,0.00008999804,0.00008174994,0.00013048973,0.37381965,0.0004069578,0.60768217,0.0012746737,0.014772045],"study_design_scores_gemma":[0.0000085248075,0.000017916705,0.00023610727,0.000021582135,0.000010171799,0.000033159784,0.000019884801,0.48605984,0.00027355299,0.51211333,0.0011874938,0.00001851374],"about_ca_topic_score_codex":0.008664797,"about_ca_topic_score_gemma":0.0057630464,"teacher_disagreement_score":0.008664797,"about_ca_system_score_codex":0.0051067714,"about_ca_system_score_gemma":0.0025601387,"threshold_uncertainty_score":0.037052453},"labels":[],"label_agreement":null},{"id":"W4300527658","doi":"10.48550/arxiv.1107.2181","title":"Multi-level Monte Carlo for continuous time Markov chains, with\\n applications in biochemical kinetics","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Leverhulme Trust","keywords":"Computer science; Monte Carlo method; Markov chain Monte Carlo; Hybrid Monte Carlo; Algorithm; Estimator; Kinetic Monte Carlo; Monte Carlo molecular modeling; Monte Carlo algorithm; Mathematical optimization; Particle filter; Mathematics; Artificial intelligence; Statistics","score_opus":0.1427432371573775,"score_gpt":0.24166359763212236,"score_spread":0.09892036047474487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300527658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020654507,0.0002529632,0.9950789,0.00023449953,0.00005065013,0.000018652683,0.000022446427,0.00015068865,0.002125709],"genre_scores_gemma":[0.18986684,0.0011398974,0.8021462,0.00039527167,0.00015419949,0.0003355425,0.00013217384,0.0002839253,0.005545909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914384,0.0003789348,0.00003714201,0.00011867546,0.00026303553,0.000058334248],"domain_scores_gemma":[0.99743193,0.0017976328,0.00016874567,0.00035133763,0.00015508915,0.00009529403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017718729,0.0006891435,0.0007197795,0.0007673093,0.0008291925,0.0013340546,0.0012793405,0.0012351648,0.0038060814],"category_scores_gemma":[0.007196274,0.00058050297,0.0012316668,0.00099752,0.0018679667,0.001926819,0.0018728559,0.0028656323,0.0008738884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021074835,0.000034070184,0.0005018001,0.000067041066,0.000022367949,0.0000737375,0.00006500043,0.44259793,0.0010190483,0.5365148,0.00089174794,0.018191433],"study_design_scores_gemma":[0.0000037486218,0.0000063033103,0.000033476903,0.000007662906,0.0000029232606,0.000012055674,0.0000023614703,0.9413828,0.00027937637,0.056660786,0.001602523,0.000005966227],"about_ca_topic_score_codex":0.002827404,"about_ca_topic_score_gemma":0.0034723536,"teacher_disagreement_score":0.0038060814,"about_ca_system_score_codex":0.001408686,"about_ca_system_score_gemma":0.0013295207,"threshold_uncertainty_score":0.012732625},"labels":[],"label_agreement":null},{"id":"W4301387240","doi":"10.46298/dmtcs.2317","title":"Singularity analysis via the iterated kernel method","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Kernel (algebra); Iterated function; Singularity; Computer science; Mathematics; Applied mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.02512541658036955,"score_gpt":0.32952734175285003,"score_spread":0.3044019251724805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301387240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19489366,0.00046260073,0.7882238,0.00034270922,0.00007373599,0.000054606884,0.000105638646,0.0004151544,0.015428124],"genre_scores_gemma":[0.9128266,0.00044814192,0.07793402,0.00007008755,0.00008563573,0.000103050224,0.00012421035,0.00022102465,0.008187234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.000090745445,0.000016150127,0.000028283705,0.00010095379,0.000057445588],"domain_scores_gemma":[0.9992668,0.00024903158,0.00013346082,0.00010104345,0.00014325441,0.0001064012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000702706,0.0005123563,0.0008004885,0.002570775,0.00067587703,0.0010184054,0.0015021724,0.0006334314,0.0048146737],"category_scores_gemma":[0.0022059807,0.00027215487,0.0010263529,0.00076949014,0.0013002142,0.0019062137,0.0012321485,0.0010589688,0.0005651224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023594734,0.00004972325,0.0010229023,0.00007024055,0.000027065327,0.00021622083,0.00014953758,0.05240445,0.0026331467,0.9340857,0.0006903008,0.008627037],"study_design_scores_gemma":[0.000011813007,0.00001528284,0.00034494203,0.000018317995,0.000007838556,0.00008623971,0.000037138132,0.7676313,0.00063956087,0.23046677,0.00072322367,0.000017599787],"about_ca_topic_score_codex":0.0020356355,"about_ca_topic_score_gemma":0.0021652016,"teacher_disagreement_score":0.0048146737,"about_ca_system_score_codex":0.0009092561,"about_ca_system_score_gemma":0.00071088166,"threshold_uncertainty_score":0.016106725},"labels":[],"label_agreement":null},{"id":"W4302012974","doi":"10.1016/j.jfranklin.2023.08.044","title":"Efficient bayes inference in neural networks through adaptive importance sampling","year":2023,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Army Research Office; Agence Nationale de la Recherche; Leverhulme Trust","keywords":"Computer science; Machine learning; Artificial intelligence; Curse of dimensionality; Artificial neural network; Bayes' theorem; Inference; Bayesian probability; Convergence (economics); Bayesian inference; Adaptation (eye); Bayesian network; Importance sampling; Monte Carlo method; Mathematics","score_opus":0.1356838686056046,"score_gpt":0.38337042920619624,"score_spread":0.24768656060059163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302012974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066910153,0.00038124545,0.99172264,0.0003215314,0.00005182404,0.000028478456,0.000031773016,0.00014211853,0.0006292575],"genre_scores_gemma":[0.44366583,0.001059175,0.5479013,0.0004375301,0.00051863876,0.0004391697,0.0004199452,0.00030968536,0.0052487347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961118,0.0023930664,0.0001677493,0.00040482034,0.00072286953,0.00019961988],"domain_scores_gemma":[0.9537176,0.042224925,0.00088278705,0.001229935,0.0015182103,0.0004265178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008833203,0.001015215,0.0027296336,0.0017706975,0.0009674172,0.0020979983,0.0028900523,0.0020895894,0.0033138648],"category_scores_gemma":[0.053489763,0.0020745934,0.0010933888,0.001385073,0.002942182,0.004192291,0.002893374,0.004698004,0.00051710807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018126881,0.00012845563,0.0012971511,0.00017649683,0.0001446322,0.00007231482,0.00011399863,0.80735064,0.0005653665,0.13437977,0.0021182178,0.05347167],"study_design_scores_gemma":[0.000015286967,0.00000568703,0.0000670366,0.000010365621,0.0000066209204,0.0000062152667,0.0000031569673,0.9459612,0.00011711656,0.053668216,0.00013411981,0.0000049889613],"about_ca_topic_score_codex":0.009380531,"about_ca_topic_score_gemma":0.011957531,"teacher_disagreement_score":0.009380531,"about_ca_system_score_codex":0.0022075935,"about_ca_system_score_gemma":0.0030273702,"threshold_uncertainty_score":0.04671496},"labels":[],"label_agreement":null},{"id":"W4306906381","doi":"10.1137/22m1527696","title":"Infinite-Dimensional Hamilton–Jacobi Equations for Statistical Inference on Sparse Graphs","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Mathematical Analysis","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hamilton–Jacobi equation; Mathematics; Inference; Statistical inference; Applied mathematics; Mathematical analysis; Pure mathematics; Statistics","score_opus":0.11229770778290872,"score_gpt":0.4154416824464509,"score_spread":0.3031439746635422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306906381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060782316,0.001135214,0.9876852,0.0019669821,0.00017983606,0.000057999252,0.0003618434,0.00018324894,0.0023514612],"genre_scores_gemma":[0.47181717,0.0072947196,0.4716218,0.0028456913,0.0029418736,0.0018802324,0.0030831678,0.0009434829,0.03757193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961882,0.0020940786,0.00021665734,0.00073214725,0.00055942696,0.00020953338],"domain_scores_gemma":[0.9270575,0.06519313,0.0021900295,0.0021402484,0.0024586276,0.00096040836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008667854,0.0017347101,0.0039736438,0.0026261527,0.0014940305,0.0034004853,0.004883818,0.0045566806,0.0074683446],"category_scores_gemma":[0.05992038,0.0028048668,0.002312602,0.0035167334,0.006466804,0.005387186,0.0045754556,0.0073432885,0.0011350282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038251746,0.000057300025,0.0008893743,0.00024359491,0.00013772356,0.00013113268,0.0001960471,0.28219077,0.0003107057,0.7014217,0.0037671302,0.010616289],"study_design_scores_gemma":[0.000014403905,0.000006261245,0.00012222273,0.00002620227,0.000012874199,0.0000182001,0.000012969667,0.6368796,0.00006106764,0.36216757,0.00065556617,0.000022964972],"about_ca_topic_score_codex":0.019283393,"about_ca_topic_score_gemma":0.016900575,"teacher_disagreement_score":0.019283393,"about_ca_system_score_codex":0.0042409045,"about_ca_system_score_gemma":0.0044801,"threshold_uncertainty_score":0.04584056},"labels":[],"label_agreement":null},{"id":"W4307185865","doi":"10.21203/rs.3.rs-2163839/v1","title":"Effect of Stochastic Model Error on the Convergence and Accuracy of Markov Chains","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; Simon Fraser University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Markov chain Monte Carlo; Markov chain; Convergence (economics); Stability (learning theory); Computer science; Limiting; Mathematical optimization; Markov process; Computation; Markov chain mixing time; Applied mathematics; Variable-order Markov model; Markov model; Algorithm; Monte Carlo method; Mathematics; Statistics; Machine learning; Engineering","score_opus":0.1941996932799591,"score_gpt":0.49865835379257456,"score_spread":0.3044586605126155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307185865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25542653,0.00096127694,0.7323965,0.0020942164,0.00017313886,0.00006868138,0.00015763873,0.00037807558,0.008343853],"genre_scores_gemma":[0.9785684,0.00027709722,0.020052131,0.0001162012,0.000058746322,0.00006011606,0.00007071361,0.000110388806,0.0006861212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906267,0.0053109084,0.0004108716,0.0010066658,0.0019839946,0.0006609453],"domain_scores_gemma":[0.776217,0.19714418,0.0112212915,0.007318224,0.0066313525,0.0014680076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012798704,0.00093681633,0.0014660682,0.0014363697,0.0010067539,0.0026460623,0.0013190655,0.002032124,0.0020194368],"category_scores_gemma":[0.17793494,0.0007493747,0.0007610995,0.00071866985,0.005371878,0.003059073,0.002800369,0.0026616987,0.00025701133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016049614,0.000042708638,0.0030432153,0.00009191344,0.000060074406,0.00017045731,0.00017031595,0.89630127,0.0020538608,0.09379232,0.00034226722,0.0037712066],"study_design_scores_gemma":[0.000011044569,0.00002422606,0.00029203497,0.000024178005,0.000007811379,0.000020924179,0.00001445028,0.96901023,0.001217286,0.02925297,0.00011041636,0.00001454829],"about_ca_topic_score_codex":0.0045043714,"about_ca_topic_score_gemma":0.0020185825,"teacher_disagreement_score":0.012798704,"about_ca_system_score_codex":0.0024119583,"about_ca_system_score_gemma":0.0019769697,"threshold_uncertainty_score":0.067686856},"labels":[],"label_agreement":null},{"id":"W4309685037","doi":"10.1146/annurev-statistics-033121-110254","title":"Approximate Methods for Bayesian Computation","year":2022,"lang":"en","type":"article","venue":"Annual Review of Statistics and Its Application","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Approximate Bayesian computation; Bayesian probability; Bayesian inference; Inference; Variable-order Bayesian network; Statistical inference; Big data; Computation; Sampling (signal processing); Bayesian statistics; Machine learning; Artificial intelligence; Data mining; Algorithm; Mathematics; Statistics","score_opus":0.04505196798231386,"score_gpt":0.4333828634473406,"score_spread":0.38833089546502675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309685037","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047240756,0.00511362,0.98585993,0.00093623577,0.0002613401,0.00004272913,0.00021471761,0.00031757937,0.006781465],"genre_scores_gemma":[0.08881023,0.017341437,0.87186235,0.0013062869,0.0023218063,0.00086175563,0.0012296154,0.0009993175,0.015267156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956713,0.0023232233,0.00019540191,0.0004588463,0.0011819046,0.00016939228],"domain_scores_gemma":[0.9872773,0.009735317,0.0004262776,0.0012702479,0.0011011761,0.00018967483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004910797,0.0018242159,0.0022115717,0.0022736997,0.0009682347,0.0037442609,0.0028004157,0.002510421,0.016596632],"category_scores_gemma":[0.03544446,0.0010085251,0.001647111,0.0035613873,0.0026595248,0.0040665655,0.003445639,0.005501403,0.005648774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039780116,0.00003475055,0.00036877693,0.00043130966,0.00010767984,0.00005368173,0.00009286328,0.07525256,0.00025246516,0.8047632,0.013689579,0.10491332],"study_design_scores_gemma":[0.000015850159,0.000011608927,0.00009158303,0.00009239327,0.000017108909,0.000039647646,0.000016190468,0.16769668,0.0001318236,0.8118809,0.019992365,0.000013860848],"about_ca_topic_score_codex":0.005879162,"about_ca_topic_score_gemma":0.0048655234,"teacher_disagreement_score":0.016596632,"about_ca_system_score_codex":0.0023373999,"about_ca_system_score_gemma":0.0029736764,"threshold_uncertainty_score":0.05552131},"labels":[],"label_agreement":null},{"id":"W4310446950","doi":"10.1007/s10208-023-09630-x","title":"On the Representation and Learning of Monotone Triangular Transport Maps","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); U.S. Department of Energy","keywords":"Maxima and minima; Mathematics; Inference; Parametric statistics; Monotone polygon; Density estimation; Representation (politics); Algorithm; Measure (data warehouse); Applied mathematics; Computer science; Artificial intelligence; Geometry; Data mining","score_opus":0.09728548284479145,"score_gpt":0.3765147759111037,"score_spread":0.2792292930663123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310446950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041330844,0.00058266456,0.9522858,0.0009522152,0.00005626362,0.00003770436,0.00015667958,0.00018136295,0.0044164206],"genre_scores_gemma":[0.8230791,0.0016220529,0.16266844,0.0004741597,0.00025925337,0.0002301809,0.00074619165,0.00019697787,0.010723718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884194,0.00059210433,0.00006279929,0.00019324037,0.00019172064,0.000118340606],"domain_scores_gemma":[0.98114336,0.015690261,0.0008306775,0.001017255,0.0008164334,0.0005021156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030804265,0.00069796055,0.0015096522,0.0012400298,0.00083038287,0.0025713975,0.0022145987,0.0025022787,0.005535551],"category_scores_gemma":[0.028024388,0.00073327165,0.0010257957,0.0016485647,0.0032480145,0.0065897442,0.0030476032,0.0032478957,0.00050707074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077397584,0.00004707658,0.00055803533,0.00009177991,0.0000193318,0.000040828665,0.00019776271,0.19386055,0.00036107193,0.78315544,0.0011918943,0.020398892],"study_design_scores_gemma":[0.000006404649,0.000012037566,0.000050924416,0.00001259169,0.0000030797494,0.000008849473,0.000014338011,0.5782195,0.00007749807,0.42131177,0.0002768903,0.000006087579],"about_ca_topic_score_codex":0.0064596147,"about_ca_topic_score_gemma":0.004213605,"teacher_disagreement_score":0.0064596147,"about_ca_system_score_codex":0.001850595,"about_ca_system_score_gemma":0.0015584129,"threshold_uncertainty_score":0.01851821},"labels":[],"label_agreement":null},{"id":"W4311175942","doi":"10.1080/00029890.2022.2144088","title":"Random Walks, Directed Cycles, and Markov Chains","year":2022,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Random walk; Examples of Markov chains; Mathematics; Variable-order Markov model; Discrete phase-type distribution; Markov renewal process; Markov process; Markov property; Markov chain mixing time; Markov kernel; Absorbing Markov chain; Discrete mathematics; Markov model; Limiting; Statistical physics; Statistics; Physics","score_opus":0.024955621222572496,"score_gpt":0.30640072457839906,"score_spread":0.28144510335582656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311175942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05201429,0.032736912,0.8394448,0.0041523594,0.00049859285,0.00018113079,0.0009037248,0.00039564565,0.069672495],"genre_scores_gemma":[0.7429022,0.025444621,0.20086153,0.0015249708,0.0015247192,0.000663267,0.0010736029,0.00022090132,0.025784163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00077012624,0.00005845297,0.00029793577,0.00029585863,0.00012062423],"domain_scores_gemma":[0.9961874,0.0027220142,0.00039870178,0.00021718259,0.00025995483,0.00021483585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713802,0.0008325617,0.00075988815,0.0024388928,0.00087354414,0.0017220974,0.0009870911,0.0014428069,0.004524723],"category_scores_gemma":[0.008924643,0.00044181693,0.00055489043,0.0027009104,0.0036040277,0.00395201,0.0012205853,0.0018149266,0.000656788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007494189,0.000009186733,0.0003463527,0.00005043936,0.000009986665,0.000037932572,0.00008511606,0.008420168,0.000087549844,0.9831618,0.0011915275,0.006592444],"study_design_scores_gemma":[0.000004900932,0.0000054952575,0.00013170042,0.000027459679,0.0000037288946,0.000030508236,0.000023997765,0.02156196,0.000040310988,0.9731609,0.0050024325,0.0000066527627],"about_ca_topic_score_codex":0.004729395,"about_ca_topic_score_gemma":0.004042222,"teacher_disagreement_score":0.004729395,"about_ca_system_score_codex":0.0016994722,"about_ca_system_score_gemma":0.00123894,"threshold_uncertainty_score":0.015136778},"labels":[],"label_agreement":null},{"id":"W4311401913","doi":"10.1007/s41884-022-00089-3","title":"Conformal mirror descent with logarithmic divergences","year":2022,"lang":"en","type":"article","venue":"Information Geometry","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Connaught Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Conformal map; Mathematics; Logarithm; Bregman divergence; Gradient descent; Stochastic gradient descent; Duality (order theory); Hessian matrix; Divergence (linguistics); Descent (aeronautics); Generalization; Applied mathematics; Regular polygon; Simplex; Mathematical analysis; Pure mathematics; Combinatorics; Geometry; Computer science; Physics; Artificial neural network","score_opus":0.038631270062971304,"score_gpt":0.29362628209178676,"score_spread":0.25499501202881547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311401913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10917587,0.00043272192,0.8753746,0.0012293846,0.00014713546,0.000063276566,0.00016162042,0.00022849701,0.0131869],"genre_scores_gemma":[0.90328616,0.00052062725,0.079732925,0.00046894967,0.00020113915,0.00013178957,0.0001923582,0.00023158304,0.015234509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926656,0.00026090464,0.000032504977,0.00016222495,0.00017849203,0.00009936463],"domain_scores_gemma":[0.99788445,0.00092011195,0.00026002424,0.00028820924,0.00036218797,0.0002848882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016557241,0.0006039174,0.0008138166,0.00081692525,0.0008746893,0.0016476457,0.0010106749,0.0013492685,0.004248476],"category_scores_gemma":[0.0094353715,0.0004001212,0.00089780113,0.0005200937,0.0024797476,0.0033365819,0.0021616553,0.0019584424,0.00048033224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032878634,0.000022582484,0.00076015876,0.000031485775,0.00001487694,0.000121449666,0.00008764058,0.03458311,0.0015043401,0.9550112,0.00092920073,0.0069011417],"study_design_scores_gemma":[0.000014670473,0.000034622848,0.0004236521,0.00001508436,0.000005204382,0.00009475688,0.000032992044,0.40699995,0.00069649366,0.59001654,0.0016461803,0.000019893476],"about_ca_topic_score_codex":0.002835923,"about_ca_topic_score_gemma":0.0018714623,"teacher_disagreement_score":0.004248476,"about_ca_system_score_codex":0.0018163319,"about_ca_system_score_gemma":0.0010898147,"threshold_uncertainty_score":0.014212549},"labels":[],"label_agreement":null},{"id":"W4312101515","doi":"10.21203/rs.3.rs-2386040/v1","title":"Equivalences of Geometric Ergodicity of Markov Chains","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ergodicity; Markov chain; Mathematics; Examples of Markov chains; Mathematical proof; Convergence (economics); Pure mathematics; Metric (unit); Homogeneous; Statistical physics; Applied mathematics; Markov property; Combinatorics; Markov model; Geometry; Statistics; Physics","score_opus":0.2918902489518322,"score_gpt":0.513740082299482,"score_spread":0.2218498333476498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312101515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36439902,0.001443672,0.56000215,0.0013854376,0.00032947064,0.0001964631,0.00062929495,0.00044911532,0.07116535],"genre_scores_gemma":[0.97732407,0.00037092643,0.019164015,0.00024605656,0.00027625044,0.00012450693,0.0002881195,0.000119690005,0.0020863689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933843,0.00202495,0.0004372391,0.0014166081,0.001872605,0.0008642869],"domain_scores_gemma":[0.9779279,0.0138670625,0.0024746007,0.0020691114,0.0023012066,0.0013600049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053600715,0.0005447076,0.0012715275,0.0029951888,0.0011882694,0.0024730219,0.0014154575,0.0012380412,0.008397756],"category_scores_gemma":[0.03202567,0.00042333637,0.0012480435,0.0010701433,0.006126563,0.005602548,0.0033666063,0.0025856763,0.0005493239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022120163,0.000014001662,0.00043687565,0.000026185853,0.000012787074,0.0000632596,0.00012125675,0.005466779,0.0003728679,0.9902232,0.00024107889,0.0029994198],"study_design_scores_gemma":[0.000014616551,0.00004222338,0.0007229668,0.000024436085,0.000007466955,0.00007636724,0.00007617645,0.04341647,0.00065927807,0.9536027,0.0013380564,0.000019355068],"about_ca_topic_score_codex":0.00072757597,"about_ca_topic_score_gemma":0.0004575662,"teacher_disagreement_score":0.008397756,"about_ca_system_score_codex":0.0015496284,"about_ca_system_score_gemma":0.000783126,"threshold_uncertainty_score":0.028347075},"labels":[],"label_agreement":null},{"id":"W4315488788","doi":"10.1109/cdc51059.2022.9993231","title":"Optimal Network Location in Infinite Horizon LQG Graphon Mean Field Games","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mean field theory; Node (physics); Linear-quadratic-Gaussian control; Gaussian; Class (philosophy); Field (mathematics); Mathematics; Horizon; Computer science; Mathematical optimization; Applied mathematics; Optimal control; Artificial intelligence; Pure mathematics; Physics","score_opus":0.04726647935961854,"score_gpt":0.3210221523611729,"score_spread":0.27375567300155434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315488788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083719045,0.00036373123,0.9081172,0.0009647969,0.00007496958,0.000057638492,0.00018598944,0.0001094115,0.0064072832],"genre_scores_gemma":[0.9703572,0.00027927908,0.023761595,0.00019354196,0.000046195433,0.00011642896,0.00010259691,0.000037771093,0.0051052948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993518,0.00029386053,0.000015907477,0.00012990569,0.000081365506,0.0001270828],"domain_scores_gemma":[0.9980325,0.0012956326,0.00029233625,0.00005011525,0.00015623789,0.00017316418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013902964,0.000986385,0.0013374577,0.00052288803,0.00041518416,0.0012760358,0.0014286757,0.0014512761,0.0025028917],"category_scores_gemma":[0.0048723067,0.0004490868,0.00048891344,0.00054252514,0.0017692231,0.0019804884,0.0009993541,0.0011455803,0.00017959133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009516712,0.000036019097,0.0004296034,0.000070715185,0.000029090397,0.0001247586,0.00006396992,0.8443025,0.0008224984,0.14964776,0.0010000349,0.0033779275],"study_design_scores_gemma":[0.000015968686,0.000025465108,0.00008526185,0.000005877241,0.000005514179,0.000012098538,0.000021940681,0.9589075,0.0001011201,0.040584404,0.00022655391,0.00000832679],"about_ca_topic_score_codex":0.0055539263,"about_ca_topic_score_gemma":0.0032655492,"teacher_disagreement_score":0.0055539263,"about_ca_system_score_codex":0.0018230912,"about_ca_system_score_gemma":0.0011424402,"threshold_uncertainty_score":0.013227582},"labels":[],"label_agreement":null},{"id":"W4318612225","doi":"10.1007/s11009-023-09977-2","title":"Polynomial Convergence Rates of Piecewise Deterministic Markov Processes","year":2023,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Piecewise; Polynomial; Norm (philosophy); Rate of convergence; Markov chain; Convergence (economics); Applied mathematics; Markov process; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.24631298924565015,"score_gpt":0.41867714619989016,"score_spread":0.17236415695424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318612225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06733695,0.001977345,0.9159961,0.0018338029,0.0001329808,0.00006628422,0.00024295642,0.00038533838,0.012028276],"genre_scores_gemma":[0.855472,0.0034157594,0.11617327,0.00053170545,0.0003428695,0.00037485006,0.0005004294,0.00069633825,0.022492796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965417,0.0015173006,0.00014844119,0.0004969901,0.00077842927,0.0005169802],"domain_scores_gemma":[0.89812744,0.08908353,0.0033341243,0.0026559455,0.004604309,0.0021946444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009600139,0.0013454015,0.0020521854,0.0031453753,0.001279689,0.0027351193,0.0038395007,0.0019499748,0.008268387],"category_scores_gemma":[0.07960992,0.0010413483,0.0014386654,0.0021271491,0.0054127113,0.006252561,0.0040134923,0.005487536,0.0007958967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009560198,0.000039509265,0.0007255762,0.00018819842,0.000027973889,0.00008054918,0.00033083666,0.09707107,0.0007692161,0.8923996,0.0012146932,0.0070572738],"study_design_scores_gemma":[0.000017461007,0.000020179465,0.00029587504,0.00004383184,0.00002109118,0.000048586226,0.00005722078,0.6027086,0.00049539685,0.39546952,0.0008005458,0.000021699387],"about_ca_topic_score_codex":0.007952837,"about_ca_topic_score_gemma":0.00409156,"teacher_disagreement_score":0.009600139,"about_ca_system_score_codex":0.0041013313,"about_ca_system_score_gemma":0.002602169,"threshold_uncertainty_score":0.05077094},"labels":[],"label_agreement":null},{"id":"W4319655089","doi":"","title":"Quasi-Monte Carlo methods for Markov chains with continuous multi-dimensional state space","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Statistical physics; Markov chain Monte Carlo; Monte Carlo method; State space; Markov chain; Computer science; Monte Carlo molecular modeling; Space (punctuation); Hybrid Monte Carlo; Mathematics; Physics; Statistics; Machine learning","score_opus":0.026473972644953377,"score_gpt":0.31968215637241915,"score_spread":0.29320818372746577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319655089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001702029,0.0005189593,0.99663204,0.00017792742,0.0000701926,0.00003279805,0.000043774606,0.00006041846,0.00076189014],"genre_scores_gemma":[0.19964378,0.0028133676,0.7829712,0.00048315414,0.00057774055,0.0014123813,0.0006858235,0.00050111196,0.010911426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957008,0.0030571693,0.00014391213,0.00031404415,0.0005809585,0.00020318007],"domain_scores_gemma":[0.9545858,0.040521353,0.0011891526,0.0014597459,0.0015214971,0.0007225054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010031138,0.0014943299,0.0025545207,0.002190713,0.0014476859,0.0025866614,0.0046805404,0.003133711,0.0068379887],"category_scores_gemma":[0.02639603,0.0020509085,0.002249331,0.0020384495,0.0049946005,0.004214295,0.0036018998,0.004667712,0.00087088963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007262009,0.00004855168,0.00039354496,0.00021986577,0.00011002177,0.00005111391,0.00008412204,0.48340455,0.0002975547,0.5069942,0.00080497685,0.0075188284],"study_design_scores_gemma":[0.000012708247,0.000008654073,0.000040137147,0.000021434158,0.000009350664,0.0000077553,0.0000057608377,0.9087596,0.0000687449,0.09049123,0.00056356617,0.000011101267],"about_ca_topic_score_codex":0.011752966,"about_ca_topic_score_gemma":0.012013535,"teacher_disagreement_score":0.011752966,"about_ca_system_score_codex":0.0031018474,"about_ca_system_score_gemma":0.0041669705,"threshold_uncertainty_score":0.05305034},"labels":[],"label_agreement":null},{"id":"W4322707172","doi":"10.1109/tit.2023.3250099","title":"Martingale Methods for Sequential Estimation of Convex Functionals and Divergences","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Regular polygon; Martingale (probability theory); Applied mathematics; Convex function; Kullback–Leibler divergence; Logarithm; Probability measure; Combinatorics; Discrete mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.07514884128663901,"score_gpt":0.4022217221927577,"score_spread":0.3270728809061187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322707172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067144533,0.00007476975,0.9987987,0.000051071565,0.000013615376,0.000013918636,0.000023437833,0.00006175311,0.00029133147],"genre_scores_gemma":[0.17021684,0.0009901901,0.8212227,0.00034373224,0.00035488946,0.0006806061,0.00056498696,0.00045420625,0.0051717577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952166,0.002171808,0.00029060847,0.00090164685,0.0011168842,0.00030237762],"domain_scores_gemma":[0.97182006,0.021964923,0.0017144041,0.0022122252,0.0017039614,0.0005844994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01158974,0.0026164874,0.0022168073,0.0030488262,0.0006346884,0.0024448272,0.0033490448,0.0018085324,0.0045892],"category_scores_gemma":[0.04469908,0.0013745342,0.0024459357,0.0018593143,0.0033674834,0.0048885937,0.0046625305,0.0062781107,0.00097478426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110007386,0.000098178905,0.0010840134,0.00026400678,0.00016341342,0.00014940216,0.00016824125,0.28011593,0.0028351939,0.65906733,0.0014185215,0.054525655],"study_design_scores_gemma":[0.000012043763,0.000060550807,0.00015930756,0.000037077098,0.000017836639,0.000040129762,0.000009950542,0.8263358,0.0015510744,0.17016312,0.001588085,0.000025097957],"about_ca_topic_score_codex":0.0019715014,"about_ca_topic_score_gemma":0.0016437522,"teacher_disagreement_score":0.01158974,"about_ca_system_score_codex":0.0021236492,"about_ca_system_score_gemma":0.0025442203,"threshold_uncertainty_score":0.061293125},"labels":[],"label_agreement":null},{"id":"W4353080673","doi":"10.1214/22-aap1846","title":"Complexity results for MCMC derived from quantitative bounds","year":2023,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Markov chain; Upper and lower bounds; Mixing (physics); Estimator; Gibbs sampling; Convergence (economics); Markov chain Monte Carlo; State space; Dimension (graph theory); Applied mathematics; State (computer science); Mathematical optimization; Algorithm; Combinatorics; Monte Carlo method; Statistics; Mathematical analysis; Bayesian probability","score_opus":0.5365528702608247,"score_gpt":0.46436562103167806,"score_spread":0.0721872492291466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353080673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005692621,0.00087639556,0.98570454,0.0009442033,0.00009416337,0.00008756741,0.0001923932,0.00022462517,0.00618347],"genre_scores_gemma":[0.442551,0.0031567889,0.537365,0.0020312525,0.0012256524,0.0016471789,0.0014344074,0.0012232685,0.009365365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921423,0.0031690195,0.00039712773,0.0009788669,0.0026909052,0.0006216526],"domain_scores_gemma":[0.9125827,0.07274476,0.0031275451,0.0061084377,0.004149386,0.0012871962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012162932,0.0025304216,0.0021008004,0.003579304,0.0015357981,0.0032402803,0.0031248573,0.0023242226,0.0074760257],"category_scores_gemma":[0.083028905,0.0012093955,0.0025721118,0.0024209956,0.0051059816,0.007483775,0.0050895824,0.00807452,0.001129039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010191689,0.000064231484,0.0013263883,0.00036529702,0.000113796414,0.00011537677,0.00020137792,0.27242157,0.002014893,0.70166284,0.0026883876,0.018923948],"study_design_scores_gemma":[0.000012088785,0.000021634607,0.00040684082,0.00005361259,0.000017816707,0.000047080193,0.00002029896,0.6961648,0.0008429757,0.30075175,0.0016309298,0.000030194842],"about_ca_topic_score_codex":0.0037668485,"about_ca_topic_score_gemma":0.0036966742,"teacher_disagreement_score":0.012162932,"about_ca_system_score_codex":0.0055612028,"about_ca_system_score_gemma":0.0028114803,"threshold_uncertainty_score":0.06432456},"labels":[],"label_agreement":null},{"id":"W4367055006","doi":"10.1017/jpr.2023.3","title":"Mixing time bounds for edge flipping on regular graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Markov chain; Mixing (physics); Spectral gap; Graph; Enhanced Data Rates for GSM Evolution; Eigenvalues and eigenvectors; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.08380165045983419,"score_gpt":0.3424716502768692,"score_spread":0.25866999981703503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367055006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3656621,0.0017021617,0.5946687,0.0022242449,0.00017796751,0.00020385382,0.00043877578,0.0010635067,0.03385867],"genre_scores_gemma":[0.9528889,0.0007520586,0.038224373,0.00043168996,0.00016388649,0.0002780422,0.00038887758,0.00040758858,0.0064645237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980883,0.00062132097,0.000065278306,0.00046971207,0.00045821504,0.0002970729],"domain_scores_gemma":[0.96914065,0.021770671,0.0025484078,0.002566231,0.0015701513,0.0024038728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434808,0.0013593219,0.0014264943,0.0031902716,0.0014242947,0.0020229302,0.0032449733,0.0022553275,0.009099936],"category_scores_gemma":[0.032975942,0.00073225703,0.0013788831,0.001127676,0.0037248337,0.0048051374,0.0033941162,0.0043359073,0.000843285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003463162,0.00012225438,0.0024076782,0.00023856961,0.000087158216,0.00032744673,0.0005289462,0.10229474,0.0119011365,0.8685587,0.0023289574,0.010858012],"study_design_scores_gemma":[0.000028840783,0.000069438014,0.0006922884,0.000073930554,0.000036533624,0.00012621547,0.00007332124,0.58465266,0.0026646021,0.41018242,0.0013565158,0.000043284654],"about_ca_topic_score_codex":0.0013379864,"about_ca_topic_score_gemma":0.0010639066,"teacher_disagreement_score":0.009099936,"about_ca_system_score_codex":0.0023296424,"about_ca_system_score_gemma":0.00078401976,"threshold_uncertainty_score":0.030442297},"labels":[],"label_agreement":null},{"id":"W4372358099","doi":"10.1007/s10959-023-01240-1","title":"Equivalences of Geometric Ergodicity of Markov Chains","year":2023,"lang":"en","type":"article","venue":"Journal of Theoretical Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ergodicity; Markov chain; Pure mathematics; Examples of Markov chains; Mathematical proof; Convergence (economics); Metric (unit); Homogeneous; Combinatorics; Markov property; Markov model; Geometry; Statistics","score_opus":0.08296867458518194,"score_gpt":0.36890898498822894,"score_spread":0.285940310403047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372358099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24123661,0.0023622296,0.6802311,0.0030435887,0.00047148854,0.00015170891,0.00070195,0.00034560007,0.07145573],"genre_scores_gemma":[0.9490925,0.001710496,0.03808069,0.00066509447,0.0008767973,0.00029936704,0.0006230948,0.00029634696,0.008355565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419147,0.0021302633,0.00038055022,0.0011046021,0.0014852831,0.0007078305],"domain_scores_gemma":[0.95445895,0.03370496,0.0031383277,0.0035964004,0.0029837878,0.002117627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008087507,0.0009894086,0.002086952,0.0051999814,0.0022469747,0.004484611,0.0024699266,0.0019928785,0.010563867],"category_scores_gemma":[0.041667942,0.0010311278,0.002326269,0.0022496916,0.007938775,0.010161789,0.0055005266,0.0053530904,0.00069906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007960857,0.000011170891,0.00016791315,0.000012487501,0.000007112531,0.00001907628,0.00008923552,0.0014230823,0.00005639715,0.9968167,0.00017117923,0.0012176617],"study_design_scores_gemma":[0.0000075042926,0.000010507376,0.0001954655,0.000010812057,0.000005177767,0.000022598371,0.000030114174,0.015418861,0.000065201566,0.9837946,0.0004301652,0.000008936215],"about_ca_topic_score_codex":0.0016082565,"about_ca_topic_score_gemma":0.00095319975,"teacher_disagreement_score":0.010563867,"about_ca_system_score_codex":0.002775844,"about_ca_system_score_gemma":0.0014859007,"threshold_uncertainty_score":0.04277128},"labels":[],"label_agreement":null},{"id":"W4376149181","doi":"10.1007/s40598-023-00227-4","title":"Enumeration of Multi-rooted Plane Trees","year":2023,"lang":"en","type":"article","venue":"Arnold Mathematical Journal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Recursion (computer science); Plane (geometry); Conjecture; Binomial (polynomial); Interpretation (philosophy); Integer (computer science); Product (mathematics); Binomial coefficient; Generating function; Hypergeometric function; Identity (music); Hypergeometric distribution; Discrete mathematics; Pure mathematics; Algorithm; Geometry; Computer science","score_opus":0.13789772100984252,"score_gpt":0.3929039355796433,"score_spread":0.25500621456980077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376149181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27064726,0.00064229954,0.6912946,0.00032360872,0.00007401337,0.00008997179,0.0006526256,0.00033557334,0.035940036],"genre_scores_gemma":[0.7754425,0.00066279393,0.2127874,0.00011458458,0.00005581159,0.00015741594,0.0007473343,0.00012012817,0.009912031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00013738497,0.000042364696,0.00009964448,0.00019833837,0.000092656446],"domain_scores_gemma":[0.9980233,0.0009509585,0.00035919854,0.00021061098,0.00032678386,0.00012913308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998356,0.00030017702,0.00036436404,0.0016851639,0.00060634984,0.0018036187,0.0007821837,0.0007014922,0.0052732886],"category_scores_gemma":[0.003829881,0.00026085335,0.0003771524,0.0015030232,0.0007805244,0.002201362,0.00092346483,0.000872004,0.0008635293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074831456,0.00003568057,0.0024646611,0.000099263,0.00001157324,0.00020676253,0.00021318698,0.018325092,0.009952235,0.9326535,0.0012215143,0.034741726],"study_design_scores_gemma":[0.000016742426,0.000040506646,0.0011861237,0.00007834234,0.000014563755,0.0005500005,0.00012806154,0.2261686,0.009711592,0.75171304,0.010362317,0.00003005835],"about_ca_topic_score_codex":0.00038368313,"about_ca_topic_score_gemma":0.0007801965,"teacher_disagreement_score":0.0052732886,"about_ca_system_score_codex":0.00062608405,"about_ca_system_score_gemma":0.00033299866,"threshold_uncertainty_score":0.017640889},"labels":[],"label_agreement":null},{"id":"W4380136698","doi":"10.48550/arxiv.2306.05277","title":"Large deviations of return times and related entropy estimators on shift spaces","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Ergodicity; Mathematics; Estimator; Large deviations theory; Markov chain; Rate function; Statistical physics; Entropy rate; Entropy (arrow of time); Invariant (physics); Applied mathematics; Binary entropy function; Principle of maximum entropy; Statistics; Mathematical physics; Quantum mechanics; Physics","score_opus":0.11385398731140567,"score_gpt":0.25966103782465805,"score_spread":0.14580705051325238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380136698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044892404,0.000672083,0.9492713,0.00044440132,0.000054368553,0.000040355873,0.00009463714,0.0001175562,0.004412934],"genre_scores_gemma":[0.81358796,0.00141811,0.17658573,0.000480861,0.0004420703,0.0003615113,0.0003115121,0.0003896724,0.0064224587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967769,0.0015026197,0.00016821963,0.00048856763,0.0008305281,0.0002331448],"domain_scores_gemma":[0.96359,0.028783754,0.0033476478,0.0017951337,0.0016046022,0.00087892835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008042077,0.0013527194,0.0009251839,0.0026388944,0.0007773697,0.00235373,0.0020712642,0.0018671908,0.0027640527],"category_scores_gemma":[0.043693222,0.0007451171,0.0015998153,0.0013666006,0.004859561,0.0060322727,0.0038252412,0.0040315147,0.00059428473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032118016,0.000026167701,0.0010317906,0.00008076694,0.000042335017,0.000101692975,0.00015199244,0.04652544,0.002450878,0.94202626,0.00030184013,0.0072287014],"study_design_scores_gemma":[0.0000110083,0.000046584548,0.00082516606,0.00004612638,0.00001766805,0.00013770084,0.000045496654,0.41332033,0.0028818105,0.58186567,0.00075573026,0.000046714988],"about_ca_topic_score_codex":0.0004744604,"about_ca_topic_score_gemma":0.00032035753,"teacher_disagreement_score":0.008042077,"about_ca_system_score_codex":0.0017473566,"about_ca_system_score_gemma":0.0010082764,"threshold_uncertainty_score":0.042531133},"labels":[],"label_agreement":null},{"id":"W4386044647","doi":"10.48550/arxiv.2308.08977","title":"Hitting the High-Dimensional Notes: An ODE for SGD learning dynamics on GLMs and multi-index models","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Applied mathematics; Ordinary differential equation; Stability (learning theory); Equivalence (formal languages); Rate of convergence; Covariance; Computer science; Statistics; Differential equation; Mathematical analysis; Machine learning; Discrete mathematics","score_opus":0.32848156765210523,"score_gpt":0.2874754231619534,"score_spread":0.04100614449015183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386044647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07839808,0.00064374425,0.90898204,0.002095273,0.00013280626,0.0000452051,0.0001655394,0.0001960727,0.009341152],"genre_scores_gemma":[0.88792974,0.0009714021,0.09225722,0.00064534124,0.00017035952,0.00019200672,0.00022351643,0.00019748315,0.017412951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999637,0.00012905752,0.00002251508,0.00007166266,0.00010246296,0.00003724336],"domain_scores_gemma":[0.99831223,0.0007649252,0.0003090234,0.00013674775,0.00024435276,0.00023269453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015473157,0.00058007456,0.00075663073,0.00083870353,0.0005737681,0.0016122513,0.0010714042,0.0017910158,0.0031893782],"category_scores_gemma":[0.008170124,0.00036735466,0.00086662284,0.0004715929,0.0025809435,0.0024676367,0.002341511,0.0017397609,0.00042170857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031873562,0.000029351851,0.0014325626,0.00008777681,0.00003462922,0.00019543646,0.00019264905,0.38069507,0.0037410513,0.6048258,0.0018004494,0.006933346],"study_design_scores_gemma":[0.0000041081616,0.000009405326,0.00012911296,0.000008658299,0.000002822521,0.000024069506,0.00001079114,0.93196356,0.00014508255,0.0672977,0.00039655063,0.0000081145345],"about_ca_topic_score_codex":0.0038184917,"about_ca_topic_score_gemma":0.0022156537,"teacher_disagreement_score":0.0038184917,"about_ca_system_score_codex":0.0014964674,"about_ca_system_score_gemma":0.00079996575,"threshold_uncertainty_score":0.010857642},"labels":[],"label_agreement":null},{"id":"W4386147958","doi":"10.48550/arxiv.2308.11736","title":"Smooth min-entropy lower bounds for approximation chains","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Combinatorics; Entropy (arrow of time); Equipartition theorem; Sigma; Mathematics; Physics; Statistical physics; Discrete mathematics; Quantum mechanics; Mathematical analysis","score_opus":0.22912568637209482,"score_gpt":0.2740217540377214,"score_spread":0.044896067665626566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386147958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20136791,0.0019471989,0.7582445,0.0015465522,0.00013275837,0.00013838589,0.0007132863,0.00047259618,0.035436813],"genre_scores_gemma":[0.9313076,0.0009908314,0.058166042,0.0004719664,0.00022610373,0.00027773465,0.0006404718,0.0003122068,0.007606857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967063,0.0007633929,0.00015812204,0.0006993439,0.0010911775,0.00058156566],"domain_scores_gemma":[0.97820413,0.015639454,0.001332312,0.0027066823,0.0010618607,0.0010556143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039705383,0.0016387563,0.0014983054,0.002560016,0.0015473944,0.002712264,0.0023791487,0.0016679879,0.006930212],"category_scores_gemma":[0.026451701,0.0008157483,0.0017984735,0.0016998823,0.0056916922,0.007612549,0.005383817,0.005637865,0.0008323618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026660901,0.000059462705,0.0021122803,0.00018785571,0.00008011859,0.00016942239,0.00032005578,0.13285325,0.005312773,0.8471643,0.0011565058,0.010317315],"study_design_scores_gemma":[0.000011775548,0.00007283061,0.000705496,0.00004784677,0.000023131803,0.00007448603,0.000043072218,0.4783551,0.0028831228,0.51675534,0.0009900372,0.000037834463],"about_ca_topic_score_codex":0.0011753713,"about_ca_topic_score_gemma":0.0010903983,"teacher_disagreement_score":0.006930212,"about_ca_system_score_codex":0.0033034836,"about_ca_system_score_gemma":0.0012648344,"threshold_uncertainty_score":0.023968577},"labels":[],"label_agreement":null},{"id":"W4387574248","doi":"10.1080/03610918.2023.2266157","title":"Sampling via Rejection-Free Partial Neighbor Search","year":2023,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fujitsu","keywords":"Computer science; Markov chain; Inefficiency; Simulated annealing; Rejection sampling; Metropolis–Hastings algorithm; Markov chain Monte Carlo; Algorithm; Theoretical computer science; Machine learning; Artificial intelligence","score_opus":0.3752436055675304,"score_gpt":0.5280359319343726,"score_spread":0.1527923263668422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387574248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011153099,0.00009563763,0.98712105,0.000042098076,0.000018414103,0.000048990612,0.000023953615,0.00030617442,0.001190456],"genre_scores_gemma":[0.4130487,0.00018037767,0.5817854,0.00016180426,0.00006637344,0.00041944184,0.00032118039,0.00020267616,0.003814086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983485,0.00080183166,0.000056466582,0.00019469985,0.0004773439,0.00012125907],"domain_scores_gemma":[0.9969007,0.0018935283,0.00019436299,0.0004159476,0.0004681062,0.00012731401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020882774,0.0005379423,0.0011711913,0.0009894978,0.0006158618,0.0007591499,0.0020130638,0.0010287968,0.0025128555],"category_scores_gemma":[0.0067939786,0.00050257525,0.00084029586,0.00084241433,0.00086321007,0.0010930123,0.0011867338,0.00084937393,0.000660647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056551927,0.00018255871,0.0021176022,0.00022714275,0.00014413694,0.00026558948,0.00020842042,0.73433405,0.0078516295,0.09850719,0.0028747702,0.15272135],"study_design_scores_gemma":[0.000034534543,0.000026563761,0.000070379676,0.0000040442387,0.000007337242,0.000037462156,0.000004825617,0.99013036,0.001188609,0.007829385,0.00065827253,0.000008222708],"about_ca_topic_score_codex":0.0023723654,"about_ca_topic_score_gemma":0.0025190555,"teacher_disagreement_score":0.0025128555,"about_ca_system_score_codex":0.0005120685,"about_ca_system_score_gemma":0.0009344287,"threshold_uncertainty_score":0.011044025},"labels":[],"label_agreement":null},{"id":"W4388291224","doi":"10.1093/oso/9780198502784.003.0007","title":"Markov chain methods","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Measure (data warehouse); Markov chain; Lebesgue measure; Mathematics; Set (abstract data type); Focus (optics); Euclidean space; Lebesgue integration; Discrete mathematics; Calculus (dental); Computer science; Pure mathematics; Statistics; Data mining; Physics; Programming language","score_opus":0.09403334601259761,"score_gpt":0.3945166765041213,"score_spread":0.3004833304915237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388291224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017268017,0.0018222919,0.9728721,0.0006932495,0.0002527021,0.0000793039,0.00029324414,0.00023094701,0.02202932],"genre_scores_gemma":[0.2624611,0.008704611,0.60315394,0.0010930526,0.0011898933,0.0012667117,0.0017943874,0.0006116022,0.11972472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989561,0.0005614566,0.00004034084,0.00015028733,0.00022916867,0.00006261891],"domain_scores_gemma":[0.9956585,0.0031886157,0.00020808553,0.00037702316,0.00044573972,0.00012215685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017985281,0.0009205293,0.0011593397,0.0011887385,0.0006956925,0.0018635785,0.0015669864,0.0013854225,0.027083898],"category_scores_gemma":[0.006645644,0.0004755423,0.0011458255,0.0013298386,0.0011616168,0.0020493309,0.0014464802,0.002296205,0.0050993175],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023078293,0.000042611453,0.0005812762,0.00019577077,0.00006233629,0.00007265796,0.00009418345,0.11055376,0.00027180987,0.8386635,0.007990202,0.041448746],"study_design_scores_gemma":[0.00002168793,0.000015089874,0.00014585987,0.00009647196,0.000018612693,0.000044492215,0.000022689645,0.46294138,0.00019315867,0.5161459,0.020339895,0.000014779857],"about_ca_topic_score_codex":0.0033560202,"about_ca_topic_score_gemma":0.0033974454,"teacher_disagreement_score":0.027083898,"about_ca_system_score_codex":0.0011610902,"about_ca_system_score_gemma":0.0016074091,"threshold_uncertainty_score":0.09060466},"labels":[],"label_agreement":null},{"id":"W4388552266","doi":"10.1007/s11222-023-10345-w","title":"Lévy Langevin Monte Carlo","year":2023,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Technische Universität Dresden","keywords":"Monte Carlo method; Algorithm; Stochastic differential equation; Computer science; Statistical physics; Physics; Mathematics; Applied mathematics; Statistics","score_opus":0.07837931877643042,"score_gpt":0.3807386112632208,"score_spread":0.3023592924867904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388552266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020070285,0.00035730368,0.9681977,0.0006754623,0.00017861727,0.00008004333,0.0002037886,0.0005056859,0.009731074],"genre_scores_gemma":[0.7004731,0.0006273448,0.26489767,0.0006509613,0.00023687974,0.00047005003,0.00074115227,0.00040472683,0.031498075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872833,0.0005571542,0.0000474311,0.00020062104,0.00032819633,0.00013829478],"domain_scores_gemma":[0.99550503,0.002998737,0.0002844646,0.0005167747,0.0004426219,0.00025238775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023377,0.00071114016,0.0012667098,0.0008568419,0.00074440875,0.0019059331,0.0018459678,0.0016211022,0.007677938],"category_scores_gemma":[0.008825867,0.00059415115,0.0013252054,0.0009019992,0.0024188396,0.0018320777,0.0014818142,0.0023386222,0.0010559784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006643276,0.000050558996,0.0010166365,0.00006317429,0.00005659748,0.0001435995,0.00007055732,0.5617756,0.0006518746,0.42179865,0.002495748,0.011810563],"study_design_scores_gemma":[0.000011052591,0.000009847954,0.00006753502,0.000009568231,0.0000044948583,0.000016889393,0.000005712629,0.9279534,0.00021546977,0.07072286,0.0009718229,0.000011313876],"about_ca_topic_score_codex":0.0053779855,"about_ca_topic_score_gemma":0.0049298876,"teacher_disagreement_score":0.007677938,"about_ca_system_score_codex":0.001487431,"about_ca_system_score_gemma":0.0016281495,"threshold_uncertainty_score":0.02568525},"labels":[],"label_agreement":null},{"id":"W4388748336","doi":"10.4230/lipics.icalp.2024.79","title":"From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bounding overwatch; Mathematics; Metric (unit); Probabilistic logic; Affine transformation; Resolution (logic); Combinatorics; Discrete mathematics; Applied mathematics; Pure mathematics; Computer science","score_opus":0.25438286692718526,"score_gpt":0.2725296911552049,"score_spread":0.018146824228019665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388748336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021747068,0.0017018494,0.9488874,0.0022548046,0.00018533185,0.00004417468,0.00026089832,0.00038382463,0.02453474],"genre_scores_gemma":[0.75941837,0.0044983234,0.21561903,0.0018379044,0.0014069383,0.0002630778,0.00050163514,0.0011176077,0.015337102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718285,0.0009732338,0.000087102315,0.000491802,0.0008330823,0.00043197407],"domain_scores_gemma":[0.9784949,0.016603488,0.0008752982,0.0021223428,0.0011613149,0.00074265833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029987078,0.0013591839,0.00096232764,0.002163001,0.0012444995,0.003373201,0.0025263317,0.0014090401,0.011325878],"category_scores_gemma":[0.025433263,0.0007783118,0.0015356789,0.0031826682,0.0047283242,0.00951389,0.0048189093,0.007762188,0.001536656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007800257,0.000051225787,0.00045623223,0.00013436825,0.000022391612,0.00007993075,0.0002153221,0.10822439,0.0017357082,0.8605386,0.0054534925,0.023010347],"study_design_scores_gemma":[0.000008860841,0.000026354173,0.00013675763,0.000039731804,0.0000142064255,0.000063297535,0.00003903123,0.3010617,0.0010470616,0.69248587,0.005057336,0.00001983027],"about_ca_topic_score_codex":0.0035541062,"about_ca_topic_score_gemma":0.004009781,"teacher_disagreement_score":0.011325878,"about_ca_system_score_codex":0.002931432,"about_ca_system_score_gemma":0.0013055525,"threshold_uncertainty_score":0.037888825},"labels":[],"label_agreement":null},{"id":"W4390092605","doi":"10.48550/arxiv.2312.13044","title":"Particle Gibbs for Likelihood-Free Inference of State Space Models with Application to Stochastic Volatility","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle filter; Stochastic volatility; Markov chain Monte Carlo; Gibbs sampling; Monte Carlo method; Auxiliary particle filter; Approximate Bayesian computation; Bayesian inference; Computer science; Volatility (finance); State space; Inference; State-space representation; Bayesian probability; Algorithm; Econometrics; Mathematics; Kalman filter; Artificial intelligence; Statistics; Ensemble Kalman filter","score_opus":0.18776235294076918,"score_gpt":0.27678163873929373,"score_spread":0.08901928579852456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390092605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033039653,0.00012241628,0.9959317,0.00012271915,0.000021150518,0.00002575426,0.000032887656,0.00012905456,0.00031031563],"genre_scores_gemma":[0.35780686,0.000753144,0.6359155,0.00027123452,0.00022712516,0.00068549626,0.00057564816,0.000337282,0.0034276743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883753,0.00071553123,0.000051068193,0.00016001245,0.00017123368,0.000064633],"domain_scores_gemma":[0.98793167,0.01051783,0.00036113843,0.00052510767,0.00047779008,0.00018650402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042086337,0.0007950084,0.0012533207,0.0011672587,0.00092330284,0.0011551782,0.0016893374,0.0015069003,0.0029975236],"category_scores_gemma":[0.021427955,0.0010020884,0.001167356,0.0012087045,0.0020222717,0.001808864,0.001719464,0.0027333002,0.0004618103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006960628,0.000050352097,0.0016075643,0.00007973187,0.00006823289,0.00011148465,0.00012907814,0.78205544,0.00046850857,0.18426187,0.0011341678,0.029964024],"study_design_scores_gemma":[0.000008025276,0.00000538938,0.00006272367,0.0000057492775,0.0000035780968,0.000007663514,0.0000045885868,0.96638083,0.000091830494,0.033105183,0.0003197292,0.0000046157243],"about_ca_topic_score_codex":0.011292737,"about_ca_topic_score_gemma":0.010688139,"teacher_disagreement_score":0.011292737,"about_ca_system_score_codex":0.0013955708,"about_ca_system_score_gemma":0.0019808647,"threshold_uncertainty_score":0.022453964},"labels":[],"label_agreement":null},{"id":"W4390496447","doi":"10.3758/s13423-023-02437-5","title":"Give me enough time to rehearse: presentation rate modulates the production effect","year":2024,"lang":"en","type":"review","venue":"Psychonomic Bulletin & Review","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Psychology; Recall; Presentation (obstetrics); Cognitive psychology; Task (project management); Reading (process); Reading aloud; Serial position effect; Read aloud; Free recall; Communication; Linguistics","score_opus":0.07499046657618211,"score_gpt":0.4222773639276585,"score_spread":0.34728689735147644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390496447","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014422752,0.9775909,0.0015104314,0.0014794207,0.0005328023,0.000053524655,0.00019328535,0.00005565864,0.0041612242],"genre_scores_gemma":[0.12092643,0.8700836,0.0023606587,0.0019927856,0.0012013478,0.00013487403,0.00028541998,0.00006996459,0.0029450029],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996232,0.00015279236,0.00003592933,0.00008011877,0.00008001515,0.000027934597],"domain_scores_gemma":[0.995993,0.0032332116,0.00038661103,0.00010356292,0.00018982272,0.00009379751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013232644,0.0005852255,0.0013458263,0.00037774633,0.00019417185,0.0011148582,0.00095427426,0.0011493772,0.008549288],"category_scores_gemma":[0.0064221667,0.00032667143,0.0006845297,0.00050995185,0.00064071687,0.00087837846,0.00041497606,0.0017155895,0.0018863443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028587624,0.0006255472,0.0024234275,0.015744306,0.00084077765,0.00007957874,0.00014347772,0.0004742436,0.006159133,0.0036368058,0.0107382815,0.9562757],"study_design_scores_gemma":[0.007001116,0.011347402,0.30015388,0.029534128,0.013671206,0.00393062,0.00070371525,0.006625913,0.024813527,0.08445248,0.51722395,0.0005420664],"about_ca_topic_score_codex":0.0011956989,"about_ca_topic_score_gemma":0.0016000323,"teacher_disagreement_score":0.008549288,"about_ca_system_score_codex":0.0004000272,"about_ca_system_score_gemma":0.0008153159,"threshold_uncertainty_score":0.028600276},"labels":[],"label_agreement":null},{"id":"W4391463042","doi":"10.48550/arxiv.2401.17963","title":"A non-asymptotic error analysis for parallel Monte Carlo estimation from many short Markov chains","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Markov chain Monte Carlo; Monte Carlo method; Markov chain; Hybrid Monte Carlo; Markov chain mixing time; Estimation; Statistical physics; Applied mathematics; Monte Carlo molecular modeling; Computer science; Mathematics; Econometrics; Markov model; Markov property; Statistics; Economics; Physics","score_opus":0.13790465968584195,"score_gpt":0.27866444662649614,"score_spread":0.1407597869406542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391463042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003073406,0.00017580412,0.9957557,0.00016198414,0.00003733189,0.000024614308,0.000024137717,0.00009732168,0.00064982707],"genre_scores_gemma":[0.30661,0.0012458672,0.6827497,0.00046794978,0.0006149829,0.0007114163,0.0005228728,0.0005784816,0.0064988136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947343,0.0027005866,0.00025308816,0.0006374679,0.0014443506,0.00023033653],"domain_scores_gemma":[0.9573288,0.03477766,0.0015685252,0.002849765,0.0028924553,0.00058287976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014446881,0.0012085421,0.0014988041,0.0018630951,0.0010713775,0.0014938747,0.0022764306,0.00141056,0.0039733322],"category_scores_gemma":[0.063941285,0.0008396363,0.0014801176,0.0015691186,0.0034068015,0.0037479228,0.003705765,0.003616692,0.0007123123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012611241,0.000076992445,0.0028067068,0.00015888314,0.000121605415,0.00015177688,0.00017020071,0.5202565,0.0018325046,0.43463594,0.0014198605,0.03824293],"study_design_scores_gemma":[0.000007272276,0.000016195081,0.00021295373,0.000016797616,0.000010977134,0.00002991713,0.00000635475,0.9289758,0.00049269694,0.069594584,0.00062517053,0.00001129408],"about_ca_topic_score_codex":0.003894545,"about_ca_topic_score_gemma":0.0031701578,"teacher_disagreement_score":0.014446881,"about_ca_system_score_codex":0.0020768642,"about_ca_system_score_gemma":0.0025320782,"threshold_uncertainty_score":0.07640332},"labels":[],"label_agreement":null},{"id":"W4391546480","doi":"10.1214/23-ecp571","title":"High-dimensional limit of one-pass SGD on least squares","year":2024,"lang":"en","type":"article","venue":"Electronic Communications in Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Limit (mathematics); Least-squares function approximation; Applied mathematics; Statistics; Econometrics; Mathematical analysis","score_opus":0.11513548909239635,"score_gpt":0.38368696466970875,"score_spread":0.2685514755773124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391546480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016612634,0.00039435775,0.97696096,0.00039466252,0.000058171216,0.000027742446,0.000071543625,0.00017087853,0.005309104],"genre_scores_gemma":[0.5736943,0.0012147701,0.40058348,0.0007997417,0.00023568726,0.0005612413,0.00046022312,0.00045902736,0.021991536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885345,0.00042639303,0.00007814992,0.00018642964,0.00036870583,0.00008700604],"domain_scores_gemma":[0.9974905,0.0013739732,0.00018379632,0.0003222565,0.00046296764,0.00016651758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027829965,0.00086459797,0.00096488907,0.0006226181,0.0005831178,0.001503953,0.0018041716,0.0013551016,0.0032748203],"category_scores_gemma":[0.00709743,0.00046441995,0.00089435314,0.00047129317,0.0022761044,0.0025498692,0.0020096113,0.0021715034,0.00081917143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093241084,0.000065839464,0.0014947668,0.00022622402,0.00008048684,0.0004127126,0.00024381324,0.3315816,0.0064871996,0.6426072,0.0023307148,0.014376147],"study_design_scores_gemma":[0.000004503087,0.000030637435,0.0002195429,0.000015349786,0.0000066715834,0.00008029155,0.000013622781,0.93165,0.0009120488,0.065925404,0.001125715,0.000016320575],"about_ca_topic_score_codex":0.002106488,"about_ca_topic_score_gemma":0.0013951442,"teacher_disagreement_score":0.0032748203,"about_ca_system_score_codex":0.0014549001,"about_ca_system_score_gemma":0.0010923409,"threshold_uncertainty_score":0.014718115},"labels":[],"label_agreement":null},{"id":"W4392954611","doi":"10.1214/24-ejp1109","title":"Random walks on regular trees can not be slowed down","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Random walk; Combinatorics; Discrete mathematics; Statistical physics; Statistics","score_opus":0.044897814759657005,"score_gpt":0.32936640947456586,"score_spread":0.2844685947149089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392954611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4820858,0.0013198751,0.48661172,0.001492255,0.00024716134,0.000092541726,0.00028720946,0.0005948145,0.027268697],"genre_scores_gemma":[0.9612973,0.00064525416,0.030978924,0.00030392047,0.00012948156,0.00012854599,0.00016125602,0.00019051135,0.0061647613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898165,0.00031778854,0.000043816253,0.00024163723,0.00018393734,0.00023108478],"domain_scores_gemma":[0.9921216,0.0046798214,0.0012591474,0.000912887,0.000512262,0.0005143506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015573849,0.0007548403,0.0007602083,0.001111153,0.0009762904,0.00181953,0.00094209303,0.0013625667,0.0031029268],"category_scores_gemma":[0.014523678,0.0005508649,0.0009779154,0.0006160593,0.0026031048,0.004358424,0.0013288378,0.002128495,0.0007285574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015621346,0.000046511625,0.0012505548,0.000102961414,0.00005352812,0.00033574647,0.0002535104,0.06358766,0.0045353216,0.92217404,0.001204924,0.0062991087],"study_design_scores_gemma":[0.00004175284,0.00008991107,0.00055402296,0.00003850676,0.00002775144,0.00020266236,0.000071228824,0.37209293,0.0014849269,0.6225465,0.002818333,0.00003138628],"about_ca_topic_score_codex":0.0014260943,"about_ca_topic_score_gemma":0.0009974559,"teacher_disagreement_score":0.0031029268,"about_ca_system_score_codex":0.0007901656,"about_ca_system_score_gemma":0.00054020877,"threshold_uncertainty_score":0.010380328},"labels":[],"label_agreement":null},{"id":"W4393221521","doi":"10.1080/01621459.2024.2335587","title":"Automatic Regenerative Simulation via Non-Reversible Simulated Tempering","year":2024,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robustness (evolution); Probabilistic logic; Algorithm; Metric (unit); Mathematical optimization; Variance (accounting); Bounded function; Set (abstract data type); Mathematics; Artificial intelligence","score_opus":0.027965387621884726,"score_gpt":0.37520948006736343,"score_spread":0.3472440924454787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393221521","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011519127,0.000030470761,0.98599017,0.00005156597,0.000011923239,0.000033320364,0.000033094533,0.0009961975,0.0013340997],"genre_scores_gemma":[0.47231188,0.00008695561,0.5244273,0.000108606444,0.000029617395,0.00029391356,0.00018704798,0.00067496137,0.0018796818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987814,0.0004732502,0.000057880316,0.0002218041,0.00036366069,0.00010212796],"domain_scores_gemma":[0.99497366,0.0033648126,0.00037031295,0.00081614236,0.00032162733,0.00015342292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022154367,0.00057933806,0.0006977219,0.0006240342,0.0005836947,0.0009686379,0.002110451,0.0008645954,0.0032774033],"category_scores_gemma":[0.011256395,0.00056776387,0.0008154635,0.0004717116,0.0012467187,0.0011853814,0.0017900672,0.0015533476,0.00075270014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007335502,0.000033191078,0.0008678085,0.00004983778,0.000030388357,0.000065040156,0.00008224167,0.8989815,0.004148264,0.07110701,0.00063130347,0.023930088],"study_design_scores_gemma":[0.00000586441,0.0000069441307,0.000029076253,0.0000027433011,0.0000019149247,0.0000071276513,0.0000023459017,0.9903106,0.00065283896,0.008694709,0.0002821218,0.00000374611],"about_ca_topic_score_codex":0.002778197,"about_ca_topic_score_gemma":0.0032985539,"teacher_disagreement_score":0.0032774033,"about_ca_system_score_codex":0.0010587515,"about_ca_system_score_gemma":0.0014481988,"threshold_uncertainty_score":0.011716425},"labels":[],"label_agreement":null},{"id":"W4399693973","doi":"10.1007/978-3-031-55964-8_6","title":"More on Markov Chain Monte Carlo","year":2024,"lang":"en","type":"book-chapter","venue":"Undergraduate texts in mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Markov chain; Statistical physics; Computer science; Markov chain mixing time; Econometrics; Markov model; Markov property; Mathematics; Statistics; Physics; Machine learning","score_opus":0.05186103224657302,"score_gpt":0.32896517007008436,"score_spread":0.27710413782351134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399693973","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001140757,0.023224209,0.28649503,0.012808375,0.007642622,0.00008943846,0.0012346811,0.0011940253,0.66617084],"genre_scores_gemma":[0.029461117,0.021324025,0.0713836,0.009008872,0.00549304,0.00019427307,0.0014620242,0.0018542637,0.8598189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.00025558053,0.000026088961,0.000100774945,0.000402565,0.00004357336],"domain_scores_gemma":[0.99776137,0.0015544174,0.00005016254,0.00024151521,0.0003279855,0.00006441428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011763934,0.0011900687,0.0011785973,0.0016521738,0.00085356075,0.0019913844,0.0011559564,0.0019366494,0.14914308],"category_scores_gemma":[0.0054048053,0.0006965406,0.0010283127,0.0026846551,0.0013418142,0.0048592505,0.0010863732,0.0031294564,0.03635683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012885092,0.000118483666,0.000118891956,0.00020207814,0.000022350685,0.000050332466,0.00010059857,0.010512354,0.00022223573,0.62808585,0.26726964,0.093284324],"study_design_scores_gemma":[0.00001086951,0.000012272365,0.00016296438,0.00017765118,0.000007717043,0.00005858264,0.000021769922,0.0068390453,0.00016353015,0.53788054,0.4546442,0.000020852756],"about_ca_topic_score_codex":0.0045421943,"about_ca_topic_score_gemma":0.0087244185,"teacher_disagreement_score":0.14914308,"about_ca_system_score_codex":0.0018666418,"about_ca_system_score_gemma":0.0014115161,"threshold_uncertainty_score":0.49893332},"labels":[],"label_agreement":null},{"id":"W4400563965","doi":"10.1007/s10915-024-02614-1","title":"Gradient-Based Monte Carlo Methods for Relaxation Approximations of Hyperbolic Conservation Laws","year":2024,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Gruppo Nazionale per il Calcolo Scientifico; Courant Institute of Mathematical Sciences, New York University; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Università degli Studi di Ferrara; York University; Ministero dell'Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Conservation law; Mathematics; Monte Carlo method; Discretization; Variance reduction; Monte Carlo integration; Partial differential equation; Applied mathematics; Hyperbolic partial differential equation; Relaxation (psychology); Statistical physics; Hybrid Monte Carlo; Mathematical analysis; Markov chain Monte Carlo; Physics","score_opus":0.11602964465403232,"score_gpt":0.42961763204737846,"score_spread":0.31358798739334615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400563965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013813583,0.00029885847,0.9834682,0.0001603904,0.000050827093,0.0000452053,0.000025876001,0.00016168306,0.0019753708],"genre_scores_gemma":[0.5120662,0.00044215386,0.48201197,0.00027671605,0.00011210372,0.00029142984,0.00013828685,0.00027987658,0.0043812767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.00020366028,0.00001771193,0.000038509905,0.0001234905,0.000038474],"domain_scores_gemma":[0.99788886,0.0014568066,0.00014704568,0.00013041784,0.0002597646,0.00011703274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016463905,0.0004306716,0.0006772704,0.0007268761,0.00044998087,0.000638686,0.001239662,0.00094767683,0.001935729],"category_scores_gemma":[0.004130954,0.00043193938,0.0006559438,0.00047177527,0.0013210198,0.0008510853,0.00097247347,0.0013655253,0.00032181677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000738787,0.000050552764,0.0008251938,0.00006715765,0.000032964843,0.00005488434,0.000068629444,0.8850384,0.0019177988,0.09684343,0.0006546617,0.014372414],"study_design_scores_gemma":[0.0000030256228,0.0000027921394,0.000019169287,0.0000027085837,9.64529e-7,0.0000025188576,0.0000013443263,0.9963385,0.00011506509,0.0033396364,0.0001725226,0.0000016663914],"about_ca_topic_score_codex":0.0059879883,"about_ca_topic_score_gemma":0.0053879037,"teacher_disagreement_score":0.0059879883,"about_ca_system_score_codex":0.0011324077,"about_ca_system_score_gemma":0.0009766296,"threshold_uncertainty_score":0.011906266},"labels":[],"label_agreement":null},{"id":"W4400619204","doi":"10.1016/j.jctb.2024.06.007","title":"Spectral arbitrariness for trees fails spectacularly","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Arbitrariness; Mathematics; Philosophy; Epistemology","score_opus":0.0339013001840233,"score_gpt":0.3340395112551943,"score_spread":0.300138211071171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400619204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28676572,0.0015669734,0.63080424,0.015690222,0.0011959348,0.00006403267,0.00022222099,0.0017905001,0.061900165],"genre_scores_gemma":[0.9587264,0.00052856415,0.027319424,0.0013604388,0.0006892672,0.00008426249,0.00011521689,0.0007073287,0.010468941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514234,0.0019311518,0.00025152796,0.0008998384,0.0012770056,0.0004981213],"domain_scores_gemma":[0.9626912,0.025625348,0.0019480927,0.005861048,0.001832888,0.0020415206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008460202,0.0011508026,0.0031156451,0.0023701342,0.0038260715,0.0049227956,0.003661175,0.005078042,0.009389365],"category_scores_gemma":[0.046703395,0.0011770608,0.0017774667,0.0015707195,0.009951417,0.013675559,0.005872753,0.008147477,0.0010781366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003291834,0.000017421118,0.00030950838,0.000035478257,0.000009898687,0.00007385593,0.00012090967,0.0018823593,0.00035021646,0.9939977,0.0010531237,0.0021166666],"study_design_scores_gemma":[0.0000056892977,0.0000060158504,0.00006543937,0.0000072845264,0.0000028057584,0.00004431111,0.000021444215,0.016624536,0.0001614523,0.9827101,0.0003425959,0.000008369197],"about_ca_topic_score_codex":0.0010593821,"about_ca_topic_score_gemma":0.0011033313,"teacher_disagreement_score":0.009389365,"about_ca_system_score_codex":0.0012998582,"about_ca_system_score_gemma":0.0013405981,"threshold_uncertainty_score":0.044742405},"labels":[],"label_agreement":null},{"id":"W4400943839","doi":"10.1016/j.orl.2024.107146","title":"Optimal transport divergences induced by scoring functions","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.20069550021976904,"score_gpt":0.44795122965325973,"score_spread":0.2472557294334907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400943839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05020734,0.0003342859,0.94036806,0.0008936157,0.000074914344,0.00007200986,0.00014867682,0.00019443777,0.007706744],"genre_scores_gemma":[0.83510536,0.0008090629,0.15168285,0.0005019771,0.00016927072,0.0004081016,0.00046524755,0.0004724281,0.01038579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951998,0.002455224,0.00027282452,0.00068527524,0.000998178,0.00038856026],"domain_scores_gemma":[0.9918853,0.0042163623,0.0008799243,0.0010292184,0.0010668265,0.00092241477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008086407,0.0015207212,0.0018576406,0.0017758827,0.0012063638,0.0033808611,0.0020574245,0.003410527,0.004341473],"category_scores_gemma":[0.023805663,0.00076157216,0.0012132284,0.0015209335,0.00440331,0.006808944,0.004808043,0.004343386,0.00075581495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056826928,0.000041878335,0.00044254132,0.00008215872,0.0000308453,0.00007835813,0.0001014104,0.13617323,0.0017964165,0.8481671,0.00097571994,0.0120535325],"study_design_scores_gemma":[0.000013583289,0.0000423933,0.00017776935,0.000027112857,0.0000074492914,0.000039313283,0.000025478725,0.44416496,0.00063586235,0.5540738,0.00076595624,0.000026308473],"about_ca_topic_score_codex":0.0015237065,"about_ca_topic_score_gemma":0.0012142285,"teacher_disagreement_score":0.008086407,"about_ca_system_score_codex":0.0036101337,"about_ca_system_score_gemma":0.0020534173,"threshold_uncertainty_score":0.042765558},"labels":[],"label_agreement":null},{"id":"W4401057266","doi":"10.1007/s10208-024-09667-6","title":"Analysis of Langevin Monte Carlo from Poincaré to Log-Sobolev","year":2024,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Monte Carlo method; Statistical physics; Langevin dynamics; Sobolev space; Mathematical analysis; Physics; Statistics","score_opus":0.07182423705751878,"score_gpt":0.3920132083558933,"score_spread":0.32018897129837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401057266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06447115,0.0020854142,0.90793335,0.00302428,0.00033509027,0.000068326604,0.00016044361,0.0002756518,0.021646302],"genre_scores_gemma":[0.88203335,0.002616777,0.08750465,0.0012082604,0.0012396296,0.00034616317,0.00040656878,0.00066440797,0.023980197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838173,0.00088440994,0.000057083555,0.00013833502,0.0003695215,0.00016890104],"domain_scores_gemma":[0.9808445,0.014857402,0.0010125797,0.00071614346,0.0014508034,0.001118598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057689073,0.0011307418,0.0017990215,0.0029252893,0.0014752152,0.0025534604,0.0026882195,0.0021287673,0.00706093],"category_scores_gemma":[0.026632741,0.0010711934,0.0015147474,0.0012974741,0.0053476775,0.00476492,0.0037262307,0.0036958333,0.0004155221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013636834,0.00001712574,0.00020446115,0.000029714485,0.000015953707,0.000018581979,0.00004216768,0.038299326,0.0001623903,0.9595048,0.00045245208,0.0012393872],"study_design_scores_gemma":[0.0000063949537,0.000008185249,0.000118342716,0.000017077395,0.0000060323855,0.000011467856,0.000012849968,0.4028381,0.00009493013,0.5963657,0.0005076785,0.000013276571],"about_ca_topic_score_codex":0.0048301276,"about_ca_topic_score_gemma":0.0036155735,"teacher_disagreement_score":0.00706093,"about_ca_system_score_codex":0.0036954489,"about_ca_system_score_gemma":0.0027907398,"threshold_uncertainty_score":0.030509293},"labels":[],"label_agreement":null},{"id":"W4401815856","doi":"10.1016/bs.aiq.2024.07.002","title":"Geminal theory within the seniority formalism and bi-variational principle","year":2024,"lang":"en","type":"book-chapter","venue":"Advances in quantum chemistry","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek; Canada Research Chairs","keywords":"Geminal; Formalism (music); Seniority; Theoretical physics; Mathematical physics; Physics; Mathematics; Quantum mechanics; Chemistry; Political science; Law","score_opus":0.02616187756914318,"score_gpt":0.33653166011014585,"score_spread":0.31036978254100267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401815856","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027329888,0.0072040004,0.57849187,0.004478629,0.0014017576,0.0000454912,0.00028619685,0.0003643354,0.38039783],"genre_scores_gemma":[0.61654484,0.00596699,0.1532755,0.0014009841,0.0014710414,0.00016916903,0.0003429738,0.0006698388,0.22015864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994837,0.00016265294,0.00001786152,0.000054395623,0.00023099616,0.000050307488],"domain_scores_gemma":[0.9996612,0.00014006995,0.000019600253,0.000066558,0.00006980503,0.000042822445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010599868,0.00058051926,0.0009873305,0.00073545193,0.0011486312,0.0018000313,0.0017500635,0.0012403014,0.0059213666],"category_scores_gemma":[0.0011520962,0.00036908756,0.00072155043,0.0008672366,0.0032217598,0.0032424496,0.0013561512,0.0028426272,0.001545044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5335736e-7,0.0000018343875,0.000003859253,0.0000046829955,8.1407904e-7,0.000002990527,0.000010655739,0.0006068525,0.000055375407,0.9979322,0.0004722444,0.0009075704],"study_design_scores_gemma":[0.0000010945078,0.0000023352015,0.0000127733965,0.0000034649893,5.449288e-7,0.000008606803,0.0000054344273,0.0065846853,0.000055700406,0.9902693,0.0030531466,0.0000028777702],"about_ca_topic_score_codex":0.002080532,"about_ca_topic_score_gemma":0.0018103461,"teacher_disagreement_score":0.0059213666,"about_ca_system_score_codex":0.0015190577,"about_ca_system_score_gemma":0.0012651562,"threshold_uncertainty_score":0.019808948},"labels":[],"label_agreement":null},{"id":"W4402012699","doi":"10.1007/978-3-031-70344-7_1","title":"Landscape Analysis of Stochastic Policy Gradient Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Operations research; Mathematics","score_opus":0.049154703808018674,"score_gpt":0.3831261730068113,"score_spread":0.3339714691987926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402012699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009643456,0.0025224986,0.9610768,0.0011706284,0.00017787585,0.00005249948,0.000120321245,0.00021357095,0.025022397],"genre_scores_gemma":[0.62414724,0.004983006,0.29500306,0.0008265531,0.0006579827,0.00055549573,0.0005753813,0.001373332,0.071877964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928254,0.00041961903,0.00002106589,0.00007207369,0.00014189519,0.00006285366],"domain_scores_gemma":[0.99716717,0.0020554455,0.00015411642,0.00015202341,0.00032540775,0.00014598173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019010783,0.00089495233,0.0013307609,0.0013876297,0.0006238983,0.002160961,0.0016384434,0.0017900263,0.010076217],"category_scores_gemma":[0.009791607,0.00076204474,0.0010637039,0.0011243953,0.0015179015,0.0025487402,0.0018822656,0.002142347,0.0008729896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040288927,0.000039661354,0.00034544835,0.00016011218,0.00005185183,0.00004001201,0.00006891246,0.20120376,0.0007665785,0.7646955,0.005792948,0.026794925],"study_design_scores_gemma":[0.0000061610244,0.000011209797,0.00015812126,0.000027912374,0.000008633815,0.00001751673,0.000012134108,0.7266039,0.00013214764,0.27036956,0.0026446546,0.0000081607],"about_ca_topic_score_codex":0.0030486393,"about_ca_topic_score_gemma":0.0021026933,"teacher_disagreement_score":0.010076217,"about_ca_system_score_codex":0.001560543,"about_ca_system_score_gemma":0.00095889275,"threshold_uncertainty_score":0.033708334},"labels":[],"label_agreement":null},{"id":"W4402383094","doi":"10.1002/wics.70002","title":"Convergence rates of Metropolis–Hastings algorithms","year":2024,"lang":"en","type":"review","venue":"Wiley Interdisciplinary Reviews Computational Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Metropolis–Hastings algorithm; Convergence (economics); Algorithm; Computer science; Mathematics; Markov chain Monte Carlo; Artificial intelligence; Bayesian probability; Economics","score_opus":0.23097778366581398,"score_gpt":0.5139425053265814,"score_spread":0.28296472166076736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402383094","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01095537,0.1962371,0.7309145,0.0032527428,0.0012623757,0.00041058604,0.0002931216,0.0010820226,0.05559227],"genre_scores_gemma":[0.3481279,0.21340837,0.3961954,0.0020278855,0.0026426073,0.0018481717,0.00085021334,0.0017801631,0.03311936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266326,0.0031555959,0.00038444693,0.0010547377,0.0024172561,0.0003247345],"domain_scores_gemma":[0.97501683,0.020088281,0.00068583555,0.0013867915,0.0025646717,0.0002575705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009622962,0.0011133739,0.00221554,0.0029500662,0.00075906847,0.0028411394,0.0035151292,0.0021411444,0.009405017],"category_scores_gemma":[0.046485897,0.0009773308,0.0013770105,0.0025650715,0.002751983,0.00450544,0.0018793922,0.0032265857,0.004317145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019535013,0.00008757528,0.0009460404,0.0021157356,0.00020982188,0.00009979564,0.00023168532,0.08616121,0.00094242045,0.6247257,0.010637384,0.27364728],"study_design_scores_gemma":[0.00013907533,0.00020146488,0.0010312423,0.0015886227,0.00015550542,0.00058828504,0.00010257443,0.3489551,0.0067948666,0.5253359,0.11494452,0.00016286665],"about_ca_topic_score_codex":0.0018642056,"about_ca_topic_score_gemma":0.00096428895,"teacher_disagreement_score":0.009622962,"about_ca_system_score_codex":0.002511382,"about_ca_system_score_gemma":0.0022472162,"threshold_uncertainty_score":0.050891697},"labels":[],"label_agreement":null},{"id":"W4402770992","doi":"10.1080/00150517.2019.12427627","title":"Problem Section","year":2019,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Section (typography); Geography; Geology; Computer science","score_opus":0.02577574510881496,"score_gpt":0.2986554411280366,"score_spread":0.27287969601922163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402770992","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072650043,0.011346727,0.26528776,0.14558326,0.020099467,0.0014688005,0.020102322,0.0010416082,0.527805],"genre_scores_gemma":[0.18175559,0.015455501,0.17869282,0.05490207,0.016384872,0.005139575,0.026457388,0.0017045519,0.51950765],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975661,0.0009392241,0.00013226079,0.00069386157,0.0004231029,0.00024542146],"domain_scores_gemma":[0.9954535,0.0026231026,0.00027256345,0.00047619513,0.00088300504,0.000291674],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034136646,0.0009792028,0.0009647277,0.0008653587,0.0025896858,0.0043923594,0.0020420135,0.005476568,0.21432665],"category_scores_gemma":[0.019485027,0.0005092519,0.0010619011,0.0012259609,0.0017430874,0.0047183963,0.0034692048,0.0039830892,0.061717615],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010838943,0.000058188845,0.0005876635,0.000534129,0.000025223862,0.00018827213,0.00018103977,0.0023501765,0.00015349267,0.36753976,0.53674275,0.09153101],"study_design_scores_gemma":[0.0000514453,0.000037440783,0.0002319163,0.00043927063,0.000016568503,0.00044935945,0.00026170738,0.004468422,0.00025643685,0.5250983,0.46866134,0.000027788412],"about_ca_topic_score_codex":0.0030051887,"about_ca_topic_score_gemma":0.00209343,"teacher_disagreement_score":0.7856734,"about_ca_system_score_codex":0.0024466407,"about_ca_system_score_gemma":0.0045547322,"threshold_uncertainty_score":0.71699405},"labels":[],"label_agreement":null},{"id":"W4402796181","doi":"10.1007/978-3-031-72341-4_7","title":"Biologically-Plausible Markov Chain Monte Carlo Sampling from Vector Symbolic Algebra-Encoded Distributions","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Markov chain; Monte Carlo method; Rejection sampling; Sampling (signal processing); Algebra over a field; Algorithm; Hybrid Monte Carlo; Theoretical computer science; Artificial intelligence; Mathematics; Machine learning; Statistics; Pure mathematics; Bayesian probability","score_opus":0.05858435400856313,"score_gpt":0.32045753521067605,"score_spread":0.2618731812021129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402796181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03691679,0.00047728408,0.9491156,0.0005714861,0.0001051065,0.000064742504,0.00026188677,0.00033807268,0.012149018],"genre_scores_gemma":[0.69853354,0.00070577,0.28994873,0.00032260883,0.00015850094,0.00029097148,0.0007763399,0.0004538446,0.008809762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994112,0.00028405318,0.000021070473,0.000075073905,0.00015717995,0.000051405645],"domain_scores_gemma":[0.99523574,0.0039436854,0.00013896555,0.00030834766,0.0002484645,0.00012486121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722814,0.00043299704,0.0010270752,0.0008810629,0.00074843585,0.0015823622,0.0016512021,0.0012366594,0.0052664545],"category_scores_gemma":[0.008869242,0.00057395105,0.0008778676,0.0010649367,0.0019588582,0.0022221052,0.0012952627,0.0018201935,0.0007348523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006461663,0.000031014875,0.0004629105,0.0000831114,0.000024647825,0.0000867989,0.00009652572,0.40501502,0.0008415764,0.57643706,0.0015869935,0.01526977],"study_design_scores_gemma":[0.000008474868,0.000006764427,0.00006943294,0.000012845786,0.000003440651,0.000020669064,0.000011205865,0.7557432,0.00027354198,0.24326791,0.0005731863,0.000009342451],"about_ca_topic_score_codex":0.0029601185,"about_ca_topic_score_gemma":0.0036202043,"teacher_disagreement_score":0.0052664545,"about_ca_system_score_codex":0.0015764019,"about_ca_system_score_gemma":0.0012783009,"threshold_uncertainty_score":0.01761806},"labels":[],"label_agreement":null},{"id":"W4403408102","doi":"10.1007/978-1-4614-8033-4_16","title":"Approximations for Discrete Scan Statistics on i.i.d and Markov-Dependent Bernoulli Trials","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bernoulli trial; Bernoulli's principle; Markov chain; Statistics; Mathematics; Econometrics; Computer science; Applied mathematics; Statistical physics; Physics","score_opus":0.16798369785885922,"score_gpt":0.41251586086197245,"score_spread":0.24453216300311323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403408102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014825999,0.0013043104,0.98950547,0.0004956141,0.00015697026,0.000027366816,0.00016937168,0.00023564002,0.0066226153],"genre_scores_gemma":[0.17712195,0.008891387,0.75388914,0.00092122925,0.001037679,0.0007513929,0.0014903675,0.0012637257,0.054633133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718285,0.001353164,0.00012343402,0.00036228832,0.00082192605,0.00015648198],"domain_scores_gemma":[0.96572423,0.029475372,0.00080871535,0.0024093431,0.0012367257,0.00034557615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006820017,0.0011611815,0.0017807235,0.0021322314,0.0006009512,0.0026876964,0.0041178865,0.002390124,0.012326529],"category_scores_gemma":[0.044206355,0.0013344149,0.0015217258,0.003468867,0.0036046116,0.0055028717,0.0018729576,0.0051941904,0.003878225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000305484,0.00001544767,0.00028151163,0.00010817776,0.00002303147,0.000058883863,0.00007734478,0.081967115,0.00016572085,0.8967483,0.0049485816,0.015575167],"study_design_scores_gemma":[0.000011880877,0.0000110847295,0.00016195551,0.00007116347,0.0000117428735,0.00008673153,0.000019180732,0.4052434,0.00015018541,0.5888306,0.005381174,0.000020798778],"about_ca_topic_score_codex":0.005324386,"about_ca_topic_score_gemma":0.0048309644,"teacher_disagreement_score":0.012326529,"about_ca_system_score_codex":0.0027243334,"about_ca_system_score_gemma":0.001617874,"threshold_uncertainty_score":0.0412364},"labels":[],"label_agreement":null},{"id":"W4403575206","doi":"10.48550/arxiv.2410.11777","title":"Measure estimation on a manifold explored by a diffusion process","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Labex Bézout; Agence Nationale de la Recherche; European Commission","keywords":"Measure (data warehouse); Estimation; Diffusion; Diffusion process; Manifold (fluid mechanics); Process (computing); Mathematics; Computer science; Statistical physics; Data mining; Economics; Physics; Innovation diffusion; Engineering; Mechanical engineering","score_opus":0.16293315848944648,"score_gpt":0.2625514235409761,"score_spread":0.09961826505152963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403575206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23521261,0.0006267636,0.7610065,0.0009056971,0.00004597207,0.000044857556,0.00014757107,0.0002338295,0.0017762443],"genre_scores_gemma":[0.88331246,0.00084422244,0.11162564,0.00016876639,0.00012607177,0.00011010751,0.00033930916,0.000069313726,0.0034041298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.00013165842,0.000020735475,0.00021282388,0.000078277255,0.000053959386],"domain_scores_gemma":[0.998159,0.0010608026,0.00031924876,0.00015014263,0.00016603955,0.00014478456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351088,0.0007824994,0.0010134334,0.0016725895,0.0005895281,0.0013001096,0.0015440182,0.0020863882,0.00095009065],"category_scores_gemma":[0.006465355,0.00068848865,0.00110638,0.00083905895,0.0023067421,0.003239595,0.0024111094,0.001400237,0.00016817117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021885213,0.000073166106,0.008306722,0.00021707987,0.00017914854,0.0005183459,0.00042916503,0.7070563,0.018959397,0.24218713,0.00076163514,0.021093],"study_design_scores_gemma":[0.000006447054,0.000023521272,0.00093362044,0.000010287333,0.000007435957,0.00003896992,0.000019942625,0.9683555,0.0008514565,0.029375892,0.0003533567,0.000023481423],"about_ca_topic_score_codex":0.0052424837,"about_ca_topic_score_gemma":0.0021502064,"teacher_disagreement_score":0.0052424837,"about_ca_system_score_codex":0.0014265887,"about_ca_system_score_gemma":0.0007873343,"threshold_uncertainty_score":0.010423958},"labels":[],"label_agreement":null},{"id":"W4403673597","doi":"10.1090/cln/033/02","title":"Markov chains (I)","year":2024,"lang":"en","type":"book-chapter","venue":"Courant lecture notes in mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain; Computer science; Machine learning","score_opus":0.053041278649226066,"score_gpt":0.3237377894647118,"score_spread":0.27069651081548574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403673597","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006030463,0.0029618368,0.41142824,0.0027355258,0.0013226751,0.00013653506,0.0014331059,0.00053861074,0.5734131],"genre_scores_gemma":[0.32473698,0.006998812,0.11114211,0.0025789558,0.0017836328,0.0007058859,0.002574476,0.00064438395,0.5488347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929345,0.00017452615,0.00003161142,0.00018580108,0.00023251287,0.00008208361],"domain_scores_gemma":[0.9988669,0.00051855796,0.00009286643,0.00019641513,0.00025250838,0.000072709234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063066767,0.00075691665,0.0005438666,0.0009262582,0.0009977582,0.0025511126,0.00064505544,0.0013287732,0.050592054],"category_scores_gemma":[0.0034089198,0.0004222053,0.00063636404,0.0012946374,0.00182247,0.002464023,0.0012266015,0.0022639225,0.011240198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003704352,0.000007238175,0.00006534599,0.000032664753,0.000004792384,0.00002020455,0.000059004335,0.0021815114,0.00014252229,0.9786442,0.008623878,0.010215006],"study_design_scores_gemma":[0.0000046302,0.000008085476,0.00010374846,0.00003876227,0.0000053078056,0.000060157738,0.00002785139,0.008816302,0.00026486756,0.9262601,0.06440177,0.000008408519],"about_ca_topic_score_codex":0.002795884,"about_ca_topic_score_gemma":0.0017277596,"teacher_disagreement_score":0.050592054,"about_ca_system_score_codex":0.0011992913,"about_ca_system_score_gemma":0.001237355,"threshold_uncertainty_score":0.16924727},"labels":[],"label_agreement":null},{"id":"W4403673617","doi":"10.1090/cln/033/07","title":"Stochastic integration","year":2024,"lang":"en","type":"book-chapter","venue":"Courant lecture notes in mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.05830516356459813,"score_gpt":0.33075547582471215,"score_spread":0.272450312260114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403673617","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033269427,0.010498984,0.30365732,0.003075181,0.0021364018,0.000045044035,0.00041900523,0.0004867183,0.6763544],"genre_scores_gemma":[0.108629435,0.009554824,0.04418978,0.0010323811,0.0015486958,0.00012489222,0.00063615653,0.000605043,0.83367884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999681,0.000059785732,0.0000108015365,0.000055003446,0.0001736071,0.000019749716],"domain_scores_gemma":[0.9997936,0.00006194374,0.000011424746,0.00003831659,0.00007535976,0.000019421845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038751916,0.0006981379,0.000830969,0.00072453916,0.0005475077,0.0016422247,0.00053353235,0.00087411236,0.02808568],"category_scores_gemma":[0.0011682833,0.0003159802,0.00048666506,0.0006942621,0.00092778227,0.0012002124,0.0010549547,0.0019221699,0.0090782745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004251841,0.000013071487,0.000041090152,0.00004158613,0.0000087255585,0.000019983521,0.000037651826,0.0038841874,0.00043001332,0.92266923,0.030124467,0.042725667],"study_design_scores_gemma":[0.0000043544455,0.000008605234,0.00018009053,0.000044357646,0.0000068826903,0.000069340094,0.000018468583,0.016862068,0.0004971871,0.7928532,0.18944521,0.000010192115],"about_ca_topic_score_codex":0.0016048102,"about_ca_topic_score_gemma":0.0014642028,"teacher_disagreement_score":0.02808568,"about_ca_system_score_codex":0.0010981121,"about_ca_system_score_gemma":0.0007517608,"threshold_uncertainty_score":0.093955934},"labels":[],"label_agreement":null},{"id":"W4403673641","doi":"10.1090/cln/033/03","title":"Markov chains (II): Detailed balance, and Markov chain Monte Carlo (MCMC)","year":2024,"lang":"en","type":"book-chapter","venue":"Courant lecture notes in mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Markov chain; Balance equation; Statistical physics; Monte Carlo method; Markov chain mixing time; Detailed balance; Balance (ability); Computer science; Markov model; Mathematics; Physics; Statistics; Machine learning; Psychology","score_opus":0.02910457283697532,"score_gpt":0.2880834066322882,"score_spread":0.2589788337953129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403673641","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010684641,0.004352311,0.9637676,0.0014651562,0.0006089606,0.000061686755,0.00030610914,0.00064979924,0.027719911],"genre_scores_gemma":[0.16723202,0.014776874,0.7208952,0.0024679697,0.0027050406,0.0009844858,0.0015248116,0.0025779523,0.08683572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997943,0.0009445171,0.00009589144,0.00038084626,0.0005111521,0.00012452237],"domain_scores_gemma":[0.9945991,0.003965844,0.0003297995,0.000492446,0.0004613466,0.00015140706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028393746,0.0017931364,0.0017012148,0.0016345668,0.0009951352,0.004030879,0.0017749445,0.0028974835,0.01935608],"category_scores_gemma":[0.017735967,0.0017207396,0.0014109099,0.0036782837,0.0037276063,0.0049354974,0.0024143632,0.004861208,0.0042918846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018810164,0.00002292184,0.00029978156,0.00017486804,0.000039925082,0.00004020105,0.00013030121,0.045608856,0.00017964684,0.8861173,0.021976195,0.045391236],"study_design_scores_gemma":[0.000009578047,0.000009892742,0.00014458496,0.00010005056,0.000019923946,0.000042677813,0.000018928306,0.11176695,0.00024819066,0.8636282,0.023985855,0.00002514502],"about_ca_topic_score_codex":0.008059571,"about_ca_topic_score_gemma":0.006582238,"teacher_disagreement_score":0.01935608,"about_ca_system_score_codex":0.0023181492,"about_ca_system_score_gemma":0.003076336,"threshold_uncertainty_score":0.06475252},"labels":[],"label_agreement":null},{"id":"W4404056734","doi":"10.1109/lcsys.2024.3491863","title":"An Input-Output “Fundamental Lemma” for Quarter-Plane Causal 2-D Models","year":2024,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Lemma (botany); Plane (geometry); Mathematics; Arithmetic; Geometry; History","score_opus":0.0592456726848649,"score_gpt":0.3287275830126138,"score_spread":0.2694819103277489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404056734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012176182,0.000044757708,0.9828934,0.00029711504,0.00003200041,0.00003939753,0.00022041445,0.0001417272,0.0041549965],"genre_scores_gemma":[0.7986441,0.00026221565,0.19564496,0.00046042574,0.00010170807,0.0004956725,0.0005210948,0.00016674626,0.0037030964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892944,0.00022182935,0.000055817298,0.00030496565,0.0003637805,0.00012413037],"domain_scores_gemma":[0.99463683,0.003488917,0.00047041572,0.0007889375,0.0004618805,0.00015305172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021151418,0.00049368804,0.0006900379,0.0004973882,0.000652889,0.0010293777,0.00073833566,0.0009802871,0.0059631206],"category_scores_gemma":[0.009427126,0.00049857365,0.0008163151,0.0004059548,0.0024588315,0.0022030156,0.0021267526,0.0019051407,0.00054271385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030932974,0.00008228165,0.0011761244,0.00014305233,0.000042162967,0.00019053635,0.0002506178,0.1376675,0.0191685,0.8170552,0.0018932575,0.022021491],"study_design_scores_gemma":[0.000036834077,0.00013287326,0.00063798996,0.000031893476,0.000016779166,0.00013415047,0.000033463817,0.7335875,0.008674202,0.254328,0.002357718,0.000028539383],"about_ca_topic_score_codex":0.001195018,"about_ca_topic_score_gemma":0.00090560096,"teacher_disagreement_score":0.0059631206,"about_ca_system_score_codex":0.0009142146,"about_ca_system_score_gemma":0.0011357443,"threshold_uncertainty_score":0.019948602},"labels":[],"label_agreement":null},{"id":"W4404307845","doi":"10.48550/arxiv.2410.18973","title":"Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoG","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Markov chain Monte Carlo; Monte Carlo method; Markov chain; Markov chain mixing time; Computer science; Hybrid Monte Carlo; Statistical physics; Markov model; Mathematics; Markov property; Statistics; Physics; Machine learning","score_opus":0.11922471758723535,"score_gpt":0.2538016596504409,"score_spread":0.13457694206320553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404307845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018623121,0.00017509799,0.977835,0.00027858737,0.00004875887,0.00008945536,0.00012115989,0.0011163248,0.0017125346],"genre_scores_gemma":[0.52684045,0.00020606165,0.4654471,0.0005973636,0.000110480985,0.0005257886,0.0010383356,0.00073187484,0.004502417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985813,0.00067396543,0.000057291265,0.00030423983,0.00025669576,0.00012656505],"domain_scores_gemma":[0.9927222,0.005238307,0.00038981377,0.0007471331,0.0005942885,0.00030817697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003473893,0.0011947466,0.0017798058,0.0009282442,0.0008365425,0.0013568127,0.0029183796,0.0020534631,0.004979552],"category_scores_gemma":[0.017413652,0.0012747166,0.0010091629,0.0008900974,0.0020019847,0.002406604,0.0024817877,0.0033243296,0.0011032057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017787443,0.00007918478,0.001512296,0.000083015104,0.000058246827,0.00008341372,0.00008041473,0.9145197,0.00067209825,0.03701985,0.0025962936,0.04311763],"study_design_scores_gemma":[0.000012801476,0.00000881271,0.000037674283,0.0000054751677,0.0000025009265,0.000008307096,0.0000034106401,0.9887439,0.0002015814,0.010729293,0.0002425896,0.0000036078134],"about_ca_topic_score_codex":0.0047591464,"about_ca_topic_score_gemma":0.009776206,"teacher_disagreement_score":0.004979552,"about_ca_system_score_codex":0.0014518013,"about_ca_system_score_gemma":0.002678479,"threshold_uncertainty_score":0.01837194},"labels":[],"label_agreement":null},{"id":"W4404348699","doi":"10.48550/arxiv.2410.24130","title":"Using polynomials to find lower bounds for $r$-bond bootstrap percolation","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Percolation (cognitive psychology); Mathematics; Combinatorics; Bond; Economics; Psychology","score_opus":0.3863131009561105,"score_gpt":0.33180971602829235,"score_spread":0.054503384927818144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404348699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05250219,0.0027191103,0.90590715,0.0026546498,0.00024996154,0.00010673297,0.00031491905,0.0005009757,0.03504427],"genre_scores_gemma":[0.76398426,0.004538834,0.2144806,0.0012599442,0.001383229,0.0005899354,0.0006922586,0.000739967,0.012331061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977114,0.00079320325,0.000077652934,0.00043228656,0.00053820154,0.00044726662],"domain_scores_gemma":[0.95710653,0.036512867,0.0019023672,0.0015388364,0.0017355611,0.0012039571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060984665,0.0014901849,0.0016948316,0.0049726297,0.0020610236,0.0036169821,0.0032950586,0.0021592798,0.006971711],"category_scores_gemma":[0.047666516,0.00076775864,0.0020828587,0.002971263,0.0054719807,0.007941363,0.004130187,0.0075502163,0.0013212495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004392498,0.00006193499,0.0011664474,0.00019119795,0.000032802298,0.000095862684,0.0003070079,0.027111696,0.001266209,0.9549216,0.0026113344,0.012190044],"study_design_scores_gemma":[0.000014818768,0.000029700308,0.0004806513,0.000071483366,0.000032167056,0.00007727721,0.00007547686,0.23948169,0.0008075056,0.7559934,0.0029010603,0.00003480686],"about_ca_topic_score_codex":0.0024273505,"about_ca_topic_score_gemma":0.0030789184,"teacher_disagreement_score":0.006971711,"about_ca_system_score_codex":0.0033327641,"about_ca_system_score_gemma":0.0016671497,"threshold_uncertainty_score":0.032252133},"labels":[],"label_agreement":null},{"id":"W4404592392","doi":"10.3390/math12233641","title":"Confidence Regions for Steady-State Probabilities and Additive Functionals Based on a Single Sample Path of an Ergodic Markov Chain","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Ergodic theory; Mathematics; Steady state (chemistry); Markov chain mixing time; Statistical physics; Path (computing); Continuous-time Markov chain; Markov process; Applied mathematics; Balance equation; Ergodicity; Markov chain Monte Carlo; Distribution (mathematics); State (computer science); Markov model; Statistics; Mathematical analysis; Computer science; Algorithm; Physics; Monte Carlo method","score_opus":0.08197535443382861,"score_gpt":0.3321577184686939,"score_spread":0.25018236403486527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404592392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023957329,0.0002601945,0.97439617,0.00015898849,0.000019070696,0.000039917955,0.000073229174,0.00019250493,0.000902614],"genre_scores_gemma":[0.7456535,0.0006851044,0.25138414,0.00014733316,0.00011288467,0.00038687198,0.00044426235,0.00019454154,0.0009912663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99394614,0.0028528622,0.00031193698,0.0013780359,0.0011437412,0.00036726915],"domain_scores_gemma":[0.7988466,0.18328083,0.0067817075,0.005050941,0.004866349,0.0011736561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018221842,0.0011460852,0.0018230851,0.003691313,0.00092229526,0.0031477653,0.0030652785,0.0019710981,0.0032068917],"category_scores_gemma":[0.1391591,0.00085495436,0.0014656954,0.0013770151,0.0051665814,0.0057931263,0.0031584408,0.003283262,0.00049680367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003098091,0.000092085684,0.006032887,0.00029486674,0.00017641654,0.00024020579,0.00056207355,0.5599312,0.0023740912,0.39744002,0.0007222779,0.03182401],"study_design_scores_gemma":[0.000017709277,0.00005619571,0.0009007689,0.00009615268,0.000025291614,0.00009269464,0.00006290291,0.8824495,0.0018442365,0.11391677,0.00048187523,0.00005586],"about_ca_topic_score_codex":0.0022150308,"about_ca_topic_score_gemma":0.0009927597,"teacher_disagreement_score":0.018221842,"about_ca_system_score_codex":0.0016068881,"about_ca_system_score_gemma":0.001563956,"threshold_uncertainty_score":0.09636748},"labels":[],"label_agreement":null},{"id":"W4405655290","doi":"10.48550/arxiv.2412.15147","title":"Performance of Variational Algorithms for Local Hamiltonian Problems on Random Regular Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Hamiltonian (control theory); Random graph; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.11964487931837478,"score_gpt":0.2458416517557114,"score_spread":0.12619677243733662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405655290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21018259,0.0005188665,0.7810284,0.00081634766,0.00009131842,0.0001201604,0.00010414718,0.0009075908,0.006230583],"genre_scores_gemma":[0.7410367,0.00014870432,0.2558675,0.00020116335,0.00003465618,0.00014826364,0.00015952565,0.0002748173,0.0021286737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985808,0.0007049467,0.000054720156,0.00020068078,0.00026922082,0.00018951068],"domain_scores_gemma":[0.99411774,0.0043117027,0.00031335503,0.00054568483,0.00039316836,0.00031839352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004101088,0.00091831473,0.001137112,0.0006955512,0.0006841632,0.0010905821,0.0019902333,0.0019142192,0.0028336935],"category_scores_gemma":[0.011809569,0.0005177487,0.0005632291,0.00055444526,0.0018151929,0.002382016,0.0016459227,0.0014349805,0.0002969735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019141889,0.000118542026,0.00083627313,0.0000719828,0.000049246963,0.000024883282,0.000052573218,0.9304348,0.0017041995,0.045109734,0.0008234681,0.020582909],"study_design_scores_gemma":[0.00000923061,0.000017052513,0.000034113727,0.0000022603203,0.0000013846159,0.0000027935566,0.0000034711645,0.9934524,0.00032725153,0.006097812,0.000049839426,0.000002397829],"about_ca_topic_score_codex":0.004222379,"about_ca_topic_score_gemma":0.0049426476,"teacher_disagreement_score":0.004222379,"about_ca_system_score_codex":0.0018718301,"about_ca_system_score_gemma":0.0018810191,"threshold_uncertainty_score":0.021688879},"labels":[],"label_agreement":null},{"id":"W4406107587","doi":"10.1017/jpr.2024.102","title":"Perturbation analysis of Markov chain Monte Carlo for graphical models","year":2025,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Markov chain Monte Carlo; Mathematics; Markov chain mixing time; Stationary distribution; Statistical physics; Applied mathematics; Rate of convergence; Markov model; Markov kernel; Monte Carlo method; Balance equation; Variable-order Markov model; Statistics; Computer science","score_opus":0.05364212387788761,"score_gpt":0.34079043629311956,"score_spread":0.287148312415232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406107587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022565294,0.0006268752,0.97224164,0.00076025794,0.00008378168,0.00006907268,0.00007827781,0.00026042087,0.0033144376],"genre_scores_gemma":[0.8461889,0.0013230328,0.14409007,0.0005836506,0.0002826421,0.00041965168,0.00037596104,0.00050001114,0.0062359753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633324,0.0025158199,0.000082203944,0.00028191216,0.00062578905,0.00016099525],"domain_scores_gemma":[0.966781,0.029232033,0.0012845227,0.00086731167,0.0011552211,0.00067977206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060698506,0.0010833348,0.0013664615,0.0019967402,0.0008462302,0.0014215878,0.0016221699,0.0017426511,0.003523256],"category_scores_gemma":[0.037334498,0.0008296161,0.0012195132,0.0009523483,0.003310339,0.002772356,0.0023005053,0.0030776146,0.0004280856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009854834,0.000041818705,0.0007864787,0.00011401834,0.0000822943,0.00011769299,0.000109957706,0.6855362,0.0011131027,0.3058526,0.000984231,0.005163153],"study_design_scores_gemma":[0.000003309128,0.0000075707985,0.000056131947,0.000009008459,0.0000037962072,0.000008029844,0.000005822708,0.9106547,0.00013540855,0.08891454,0.00019573169,0.000006003096],"about_ca_topic_score_codex":0.003934583,"about_ca_topic_score_gemma":0.0018527075,"teacher_disagreement_score":0.0060698506,"about_ca_system_score_codex":0.0028224397,"about_ca_system_score_gemma":0.0010729643,"threshold_uncertainty_score":0.032100856},"labels":[],"label_agreement":null},{"id":"W4406599325","doi":"10.28924/2291-8639-23-2025-15","title":"Central Limit Theorem for Markov Chains with Variable Memory via the Chen-Stein Method","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Markov chain; Central limit theorem; Limit (mathematics); Stein's method; Variable (mathematics); Chen; Mathematical economics; Applied mathematics; Calculus (dental); Discrete mathematics; Statistics; Mathematical analysis; Medicine","score_opus":0.01766722477406497,"score_gpt":0.34749460980184993,"score_spread":0.32982738502778497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406599325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016174054,0.0011297917,0.9774854,0.00066962914,0.000112719004,0.000054286967,0.00009135247,0.00011400321,0.004168655],"genre_scores_gemma":[0.73799074,0.004599492,0.22719224,0.0008292562,0.00061412796,0.0008522412,0.00042665898,0.00044865845,0.027046537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835,0.0008235357,0.00006161105,0.00022897613,0.000366927,0.00016892789],"domain_scores_gemma":[0.987789,0.008476754,0.0008194069,0.0006070682,0.001672321,0.00063539215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007931151,0.0011932668,0.0018401833,0.0025872667,0.0011064453,0.0018117946,0.0025463921,0.0017254994,0.005236926],"category_scores_gemma":[0.022895921,0.00066888594,0.0017910072,0.0013781335,0.0036971418,0.0037344638,0.0031068027,0.0037201955,0.00060616294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004215156,0.000030454794,0.00066704146,0.0001464283,0.00008940539,0.00012089906,0.00014828355,0.06819108,0.0011612942,0.92248374,0.0009284804,0.0059907055],"study_design_scores_gemma":[0.000024093606,0.000031356543,0.00029966526,0.00004537608,0.000023963448,0.000067686546,0.000029643275,0.7402482,0.00047955333,0.25744176,0.0012764896,0.000032209584],"about_ca_topic_score_codex":0.005569912,"about_ca_topic_score_gemma":0.0044804383,"teacher_disagreement_score":0.007931151,"about_ca_system_score_codex":0.0023357647,"about_ca_system_score_gemma":0.0038034916,"threshold_uncertainty_score":0.041944444},"labels":[],"label_agreement":null},{"id":"W4407270130","doi":"10.1093/jrsssa/qnaf016","title":"Léo R. Belzile and Rishikesh Yadav’s contribution to the Discussion of ‘the Discussion Meeting on the Analysis of citizen science data’","year":2025,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series A (Statistics in Society)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Citizen science; Physics","score_opus":0.029834661386152612,"score_gpt":0.35045261372444453,"score_spread":0.32061795233829193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407270130","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017821704,0.009708095,0.003406536,0.90578854,0.07646812,0.000034110708,0.00022316044,0.00008086476,0.0041123345],"genre_scores_gemma":[0.012302816,0.015646366,0.008455102,0.7998488,0.10577111,0.0002689873,0.00044008924,0.001076834,0.056189828],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97991997,0.009903183,0.0008873678,0.0026285923,0.0055061723,0.0011546414],"domain_scores_gemma":[0.9217361,0.050613627,0.0028010418,0.0032966698,0.0160275,0.0055250465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026491724,0.0014631979,0.0015044708,0.0024136158,0.0051758224,0.010581107,0.0042198254,0.015420121,0.033303756],"category_scores_gemma":[0.13019612,0.0008780378,0.0018241032,0.0025075688,0.005461823,0.01771931,0.00891453,0.029028732,0.0141508905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017158134,0.000008362126,0.0001310839,0.00013587506,0.000011774913,0.000064412234,0.0006032215,0.000051468876,0.000057428308,0.015104516,0.9743746,0.00944009],"study_design_scores_gemma":[0.0000037815107,0.000003477255,0.00012795939,0.00029607888,0.0000047008016,0.00009860852,0.00043379763,0.000086532375,0.00007402883,0.009793133,0.98905027,0.000027643247],"about_ca_topic_score_codex":0.007892455,"about_ca_topic_score_gemma":0.013222387,"teacher_disagreement_score":0.033303756,"about_ca_system_score_codex":0.005796673,"about_ca_system_score_gemma":0.006764072,"threshold_uncertainty_score":0.14010328},"labels":[],"label_agreement":null},{"id":"W4407904935","doi":"10.1214/25-ecp663","title":"Equivalence of starting point cutoff and the concentration of hitting times on a general state space","year":2025,"lang":"en","type":"article","venue":"Electronic Communications in Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Cutoff; Equivalence (formal languages); State (computer science); Space (punctuation); State space; Point (geometry); Applied mathematics; Mathematical analysis; Combinatorics; Calculus (dental); Pure mathematics; Statistics; Geometry; Algorithm; Computer science; Physics","score_opus":0.04138780001024228,"score_gpt":0.3690319721455434,"score_spread":0.3276441721353011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407904935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33235055,0.0013645807,0.6393629,0.001085261,0.00008213589,0.000158985,0.00028809503,0.0006005739,0.024706988],"genre_scores_gemma":[0.9540768,0.0006672681,0.040958043,0.0002805827,0.00009220264,0.00027025194,0.0002856611,0.00016710142,0.0032020365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974152,0.0006501643,0.00015338896,0.00070071715,0.00071502326,0.00036550264],"domain_scores_gemma":[0.95900965,0.027848005,0.003576711,0.0031287905,0.003975687,0.002461151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043779155,0.0008668218,0.0018033914,0.0030216402,0.0016356393,0.003318877,0.0031135012,0.0019357925,0.0034057382],"category_scores_gemma":[0.044929534,0.00067245954,0.0012063346,0.0015130083,0.0053555,0.0070372066,0.0035516806,0.0038922578,0.0003368033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009222762,0.00006634019,0.0027251467,0.00010563437,0.00003819316,0.00033731313,0.00043206787,0.017812558,0.0023853264,0.97044253,0.0003902541,0.005172485],"study_design_scores_gemma":[0.00004632615,0.00013605447,0.0027760563,0.000101861035,0.000039125844,0.000478614,0.00020227909,0.3016272,0.0028227835,0.6902749,0.0014299422,0.00006489307],"about_ca_topic_score_codex":0.0021903338,"about_ca_topic_score_gemma":0.0009071196,"teacher_disagreement_score":0.0043779155,"about_ca_system_score_codex":0.002981842,"about_ca_system_score_gemma":0.0014582284,"threshold_uncertainty_score":0.023152888},"labels":[],"label_agreement":null},{"id":"W4408307319","doi":"10.1002/mana.202300246","title":"Nonstandard representation of the Dirichlet form and application to the comparison theorem","year":2025,"lang":"en","type":"article","venue":"Mathematische Nachrichten","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Dirichlet distribution; Representation (politics); Pure mathematics; Applied mathematics; Mathematical analysis; Law","score_opus":0.03238748261858692,"score_gpt":0.37672331028033473,"score_spread":0.3443358276617478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408307319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15014541,0.0006890051,0.8182635,0.0012506779,0.0004160375,0.000059908594,0.000089341724,0.00015630112,0.028929792],"genre_scores_gemma":[0.92078567,0.00036712116,0.06982408,0.00027580516,0.00033698056,0.00008458003,0.000056191984,0.00011268817,0.008156953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983352,0.0008369421,0.00007029766,0.00021108365,0.0004182359,0.00012822519],"domain_scores_gemma":[0.99568874,0.0028069478,0.00041840912,0.00028142906,0.00051338604,0.00029114453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003953869,0.00037437372,0.0006810715,0.001878125,0.0007836893,0.0017950953,0.0013418939,0.0009118805,0.0065104445],"category_scores_gemma":[0.010243166,0.00021351589,0.00083092105,0.0009456358,0.003160527,0.002902777,0.0022568002,0.0018171014,0.00031344726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010316689,0.0000097436705,0.00008830802,0.000011146239,0.000004074386,0.000029122395,0.000038840542,0.0037495764,0.0004556376,0.9934916,0.00013813192,0.0019734635],"study_design_scores_gemma":[0.000007912318,0.000030005678,0.00014852337,0.000010046733,0.0000034084826,0.000062485335,0.000030365862,0.13606922,0.0006920686,0.86171335,0.0012204886,0.00001214496],"about_ca_topic_score_codex":0.00078404107,"about_ca_topic_score_gemma":0.00044205855,"teacher_disagreement_score":0.0065104445,"about_ca_system_score_codex":0.0014847408,"about_ca_system_score_gemma":0.00080550427,"threshold_uncertainty_score":0.021779597},"labels":[],"label_agreement":null},{"id":"W4409972846","doi":"10.1017/jpr.2025.4","title":"Weak convergence of adaptive Markov chain Monte Carlo","year":2025,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Markov chain Monte Carlo; Markov chain; Monte Carlo method; Convergence (economics); Applied mathematics; Weak convergence; Chain (unit); Statistical physics; Markov chain mixing time; Mathematical optimization; Econometrics; Calculus (dental); Statistics; Variable-order Markov model; Markov model; Computer science","score_opus":0.043213662158361914,"score_gpt":0.31841675149134346,"score_spread":0.27520308933298154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409972846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018240327,0.00031319231,0.9751662,0.00063899846,0.000104814375,0.00009684237,0.00006474353,0.00018651481,0.0051883864],"genre_scores_gemma":[0.7844935,0.0010837117,0.19688904,0.0010467744,0.0003200539,0.0011259549,0.0004354231,0.0005439546,0.014061571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337137,0.0037166025,0.00033716255,0.0008008813,0.0013288307,0.00044519],"domain_scores_gemma":[0.93728393,0.047843523,0.0033228898,0.0027978374,0.0069470056,0.0018046995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016279776,0.0016033723,0.0021130252,0.0027527302,0.0013625491,0.0024977387,0.003021406,0.0023267218,0.005778172],"category_scores_gemma":[0.08469878,0.0010823605,0.0019543152,0.0010020221,0.0062785624,0.004704385,0.0059450692,0.0046091587,0.0008886462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009371683,0.00004856849,0.0012610342,0.00015926408,0.000081684084,0.00013837486,0.00016082563,0.2710675,0.002032568,0.7162847,0.0010860623,0.007585633],"study_design_scores_gemma":[0.000013204599,0.00002680264,0.00014421862,0.000035328812,0.000007831588,0.000019959676,0.000012241876,0.8420234,0.0005193051,0.15662177,0.0005608787,0.000015105285],"about_ca_topic_score_codex":0.0037774048,"about_ca_topic_score_gemma":0.0020921205,"teacher_disagreement_score":0.016279776,"about_ca_system_score_codex":0.002634231,"about_ca_system_score_gemma":0.002886345,"threshold_uncertainty_score":0.086096704},"labels":[],"label_agreement":null},{"id":"W4412784435","doi":"10.1007/s00030-025-01095-x","title":"Convergence of finite difference schemes for lower semicontinuous viscosity solutions and applications to discrete random processes","year":2025,"lang":"en","type":"article","venue":"Nonlinear Differential Equations and Applications NoDEA","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Universities Space Research Association","keywords":"Convergence (economics); Viscosity; Mathematics; Applied mathematics; Finite difference; Mathematical optimization; Mathematical analysis; Physics; Thermodynamics; Economics","score_opus":0.041549271389226976,"score_gpt":0.3489308285951132,"score_spread":0.3073815572058862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412784435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058490526,0.0008867742,0.93602526,0.0005699176,0.00009122743,0.000084223495,0.000026064363,0.00006636652,0.0037596521],"genre_scores_gemma":[0.82323414,0.00085331657,0.16992633,0.00016913055,0.000082533916,0.0002820352,0.000060903432,0.00006392194,0.0053276448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986084,0.0007697349,0.00007712952,0.00012675028,0.00034530944,0.000072589064],"domain_scores_gemma":[0.9888033,0.008975346,0.0006664114,0.00034697863,0.00086846796,0.00033932476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006834132,0.0007960204,0.0010107303,0.0016429285,0.0006743997,0.0015195966,0.0014246581,0.0018956611,0.0014308528],"category_scores_gemma":[0.021587582,0.00041924565,0.00093783234,0.0007301004,0.0040449775,0.0018128209,0.002465322,0.0021700913,0.00013431867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000988773,0.00008755818,0.0011146656,0.0001553314,0.00003660146,0.00015232849,0.00040172628,0.43485218,0.0066929488,0.5470522,0.00026040815,0.00909513],"study_design_scores_gemma":[0.0000076358565,0.000020786481,0.00004820302,0.000014288683,0.00000268891,0.00001134213,0.000011548409,0.97493964,0.0007083757,0.023980908,0.00024873787,0.0000057845687],"about_ca_topic_score_codex":0.0029543373,"about_ca_topic_score_gemma":0.0012385992,"teacher_disagreement_score":0.006834132,"about_ca_system_score_codex":0.0021793335,"about_ca_system_score_gemma":0.0011275483,"threshold_uncertainty_score":0.036142766},"labels":[],"label_agreement":null},{"id":"W4413400438","doi":"10.1080/03610918.2025.2544242","title":"Exploring the generalizability of the optimal 0.234 acceptance rate in random-walk metropolis and parallel tempering algorithms","year":2025,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalizability theory; Random walk; Parallel tempering; Computer science; Algorithm; Mathematics; Statistics; Artificial intelligence","score_opus":0.3154372681556484,"score_gpt":0.4784603667139984,"score_spread":0.16302309855835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413400438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690036,0.00052849756,0.74047923,0.0007588162,0.00007188121,0.00012839446,0.00009845895,0.00063093187,0.010403375],"genre_scores_gemma":[0.87028676,0.00029779514,0.127705,0.00016695174,0.00003867593,0.00017240962,0.0001035695,0.00018705038,0.0010418565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970071,0.001576342,0.00014099729,0.0005274558,0.00047878356,0.0002694744],"domain_scores_gemma":[0.98109424,0.014098756,0.0009856242,0.0024791022,0.0008876977,0.0004545792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008557084,0.0006883682,0.0009448378,0.00072603975,0.0008405773,0.0020876366,0.0021193186,0.0014582388,0.0019533974],"category_scores_gemma":[0.052046306,0.00062167447,0.0007983844,0.00061204133,0.0026436246,0.0030990576,0.0020016285,0.0022118925,0.000428403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039244635,0.00019492839,0.00472155,0.00018289742,0.00007396753,0.00015273156,0.00035412502,0.5282825,0.0048719905,0.429826,0.0011933167,0.029753461],"study_design_scores_gemma":[0.000036416895,0.00007825145,0.00035362705,0.000023979504,0.000015686077,0.00006114855,0.000036257836,0.8688005,0.002134398,0.1277602,0.0006741147,0.000025292504],"about_ca_topic_score_codex":0.0013623143,"about_ca_topic_score_gemma":0.00081976294,"teacher_disagreement_score":0.008557084,"about_ca_system_score_codex":0.0012841858,"about_ca_system_score_gemma":0.0016890535,"threshold_uncertainty_score":0.045254707},"labels":[],"label_agreement":null},{"id":"W4414265080","doi":"10.1117/12.3063619","title":"MCMC-LIME: enhancing stability of LIME using Markov chain Monte Carlo approach","year":2025,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Markov chain Monte Carlo; Robustness (evolution); Segmentation; Monte Carlo method; Merge (version control); Markov chain; Stability (learning theory); Pattern recognition (psychology)","score_opus":0.08257068759877423,"score_gpt":0.3580593006875617,"score_spread":0.27548861308878747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414265080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013647627,0.00014613838,0.98321277,0.0002240505,0.000023765622,0.00006838448,0.00007287721,0.0017708481,0.0008335497],"genre_scores_gemma":[0.4046977,0.00015094619,0.5917005,0.00039812928,0.000059498572,0.00033630242,0.00043353185,0.0007532673,0.0014702219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987685,0.00057034724,0.000054492895,0.00023503188,0.000293364,0.00007819941],"domain_scores_gemma":[0.988441,0.009256696,0.0004857156,0.0008727499,0.00075153454,0.00019237061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003283456,0.00095048454,0.0009050058,0.0013309289,0.0008361907,0.0011954295,0.0019097069,0.0016973183,0.0046051918],"category_scores_gemma":[0.020303376,0.0006624893,0.0011334313,0.00061695924,0.0011174515,0.0018391187,0.0019961055,0.0023208691,0.0007108529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027519927,0.00011734458,0.0050572506,0.00022096126,0.00014530668,0.0002714259,0.0003582861,0.8207739,0.0059455293,0.036944482,0.0023712781,0.12751907],"study_design_scores_gemma":[0.000010904684,0.000011700804,0.00010248474,0.000005583097,0.0000065651398,0.000015353306,0.000009026336,0.99094146,0.00069033005,0.007798904,0.00040225335,0.0000054413845],"about_ca_topic_score_codex":0.006642041,"about_ca_topic_score_gemma":0.010070212,"teacher_disagreement_score":0.006642041,"about_ca_system_score_codex":0.0011137775,"about_ca_system_score_gemma":0.0018509746,"threshold_uncertainty_score":0.0173648},"labels":[],"label_agreement":null},{"id":"W4414979299","doi":"10.1007/s11009-025-10206-1","title":"Non-stationary Phase of the Metropolis-adjusted Langevin Algorithm with Annealed Proposals","year":2025,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Langevin dynamics; Distribution (mathematics); Dimension (graph theory); Generalization; Sample (material); Stationary distribution","score_opus":0.12697204534827125,"score_gpt":0.403203765512891,"score_spread":0.2762317201646197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414979299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026073923,0.00046559278,0.96549517,0.0006368865,0.0001377403,0.00007326343,0.00006812641,0.0001477794,0.0069016055],"genre_scores_gemma":[0.60107565,0.0008171256,0.36789647,0.000528241,0.0002687178,0.00075744063,0.00037001396,0.0007039966,0.027582336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984301,0.0008715502,0.000054490538,0.00018327544,0.00031671263,0.0001438101],"domain_scores_gemma":[0.99235827,0.0059815557,0.00030226866,0.00044688853,0.00062581664,0.0002852258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044935737,0.0008105352,0.0016777192,0.0010303986,0.0010459288,0.0019514619,0.0040738005,0.0022607301,0.006413315],"category_scores_gemma":[0.016444767,0.0011884437,0.0011957268,0.001100786,0.0034548184,0.0040549696,0.002912278,0.0032770808,0.0009483972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009317406,0.000052101776,0.00038506888,0.00009204728,0.000047355497,0.00006023956,0.00012634107,0.18166883,0.0007451057,0.8082669,0.001250698,0.0072121765],"study_design_scores_gemma":[0.000021272743,0.000012803151,0.00006336844,0.000013899544,0.00000747958,0.000011347799,0.000008703804,0.84799594,0.00021421081,0.15109745,0.0005389606,0.000014650173],"about_ca_topic_score_codex":0.004149545,"about_ca_topic_score_gemma":0.0039903843,"teacher_disagreement_score":0.006413315,"about_ca_system_score_codex":0.0018513509,"about_ca_system_score_gemma":0.0034211546,"threshold_uncertainty_score":0.02376461},"labels":[],"label_agreement":null},{"id":"W4415963243","doi":"10.1007/s00440-025-01437-x","title":"Measure estimation on a manifold explored by a diffusion process","year":2025,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Labex Bézout; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Measure (data warehouse); Rate of convergence; Estimator; Smoothing; Lebesgue measure; Wasserstein metric; Metric (unit); Manifold (fluid mechanics); Path (computing); Kernel (algebra)","score_opus":0.023502729167535746,"score_gpt":0.31339948292548314,"score_spread":0.2898967537579474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415963243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13803999,0.000685133,0.85820657,0.000837783,0.000060533883,0.000056121648,0.00013107106,0.00014761991,0.0018351432],"genre_scores_gemma":[0.87910426,0.00090189785,0.113844305,0.00019495742,0.0002091857,0.00011241703,0.00026602222,0.00011817866,0.005248792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886775,0.00051562133,0.000044195483,0.00029189055,0.00018748586,0.00009307398],"domain_scores_gemma":[0.9906255,0.0071048643,0.0008607978,0.00037004892,0.00052844913,0.00051032886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029162297,0.0012835762,0.0018490392,0.0037511184,0.0011677498,0.0025862432,0.0025736915,0.0037404667,0.0015448963],"category_scores_gemma":[0.014008461,0.0012672233,0.0014019154,0.0018646412,0.004151159,0.00582482,0.0037356792,0.0020972246,0.00018823377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025400042,0.00014075854,0.0033827454,0.00023800677,0.00018276357,0.00039868042,0.00037335628,0.5609646,0.006364938,0.415594,0.0008684267,0.011237689],"study_design_scores_gemma":[0.000009098547,0.000026703223,0.00033444978,0.000013832486,0.000012606014,0.000034665234,0.000021975135,0.9230454,0.000335688,0.07591909,0.00022338984,0.000023186607],"about_ca_topic_score_codex":0.0054812576,"about_ca_topic_score_gemma":0.0029651977,"teacher_disagreement_score":0.0054812576,"about_ca_system_score_codex":0.0019482214,"about_ca_system_score_gemma":0.0009944172,"threshold_uncertainty_score":0.015422702},"labels":[],"label_agreement":null},{"id":"W4416240224","doi":"10.48550/arxiv.2511.10630","title":"Cutoff for generalised Bernoulli-Laplace urn models","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cutoff; Shuffling; Markov chain; Ball (mathematics); Mixing (physics); Permutation (music); Markov process; Distribution (mathematics)","score_opus":0.2315117830512919,"score_gpt":0.3935974357286075,"score_spread":0.16208565267731562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416240224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20528062,0.0011058175,0.7639819,0.0020673245,0.00026736959,0.00015238606,0.0006467029,0.0011676732,0.025330188],"genre_scores_gemma":[0.91326606,0.00066573947,0.062075816,0.00066002586,0.00026215048,0.000439484,0.0007302766,0.00050178135,0.021398641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760914,0.000934346,0.00008878436,0.00041302724,0.00044072646,0.0005138913],"domain_scores_gemma":[0.99076486,0.004741227,0.0011226777,0.0013815848,0.0007630091,0.001226672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880875,0.0011092853,0.0025902118,0.0021534949,0.0018576566,0.0031276941,0.0044954894,0.0036962,0.01128236],"category_scores_gemma":[0.022803634,0.0010212925,0.0022887983,0.0013353716,0.0050615156,0.005813973,0.0038022592,0.005187271,0.001589393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007559803,0.000048295697,0.0009274459,0.000043815,0.000019298566,0.00019604187,0.00022929367,0.054621164,0.0006657355,0.939617,0.0013659855,0.0021904241],"study_design_scores_gemma":[0.000029878165,0.00001521746,0.0001948815,0.000026503982,0.000009195064,0.000061747254,0.000044868782,0.4986605,0.00019946502,0.4998692,0.0008592828,0.00002935506],"about_ca_topic_score_codex":0.007280615,"about_ca_topic_score_gemma":0.0050395383,"teacher_disagreement_score":0.01128236,"about_ca_system_score_codex":0.004110265,"about_ca_system_score_gemma":0.0015161963,"threshold_uncertainty_score":0.03774321},"labels":[],"label_agreement":null},{"id":"W4416935886","doi":"10.48550/arxiv.2511.21868","title":"A Combinatorial Characterization of Constant Mixing Time","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixing (physics); Characterization (materials science); Bipartite graph; Constant (computer programming); Logarithm; Spectral radius","score_opus":0.056103276629503124,"score_gpt":0.32134371320520033,"score_spread":0.2652404365756972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416935886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19231398,0.0006076926,0.7781471,0.0017124884,0.000114239345,0.00011979616,0.00056675274,0.00057537423,0.025842499],"genre_scores_gemma":[0.9368355,0.00041230192,0.057113223,0.000540403,0.00026783568,0.00026183296,0.00043811023,0.00035592544,0.0037749084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737453,0.00089022523,0.00009177908,0.0007964349,0.00052469363,0.00032229736],"domain_scores_gemma":[0.9652102,0.024929836,0.0031452307,0.0032734964,0.001673149,0.0017681137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026571369,0.001081523,0.0009514223,0.0022196295,0.0015036731,0.0026389319,0.0026492293,0.002199215,0.008191001],"category_scores_gemma":[0.03240477,0.000744413,0.0010971371,0.0018761649,0.004869679,0.0082178,0.0027809183,0.003768008,0.00082162535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014733613,0.00006898391,0.0013313302,0.00013716039,0.000029443912,0.00010108753,0.00021324036,0.020196548,0.0065861545,0.9620806,0.0016120913,0.007496103],"study_design_scores_gemma":[0.000029444538,0.00006212116,0.00059945416,0.000028111343,0.000022971068,0.00020328515,0.000060848903,0.1614693,0.003349019,0.83227575,0.0018601456,0.000039604765],"about_ca_topic_score_codex":0.00056363636,"about_ca_topic_score_gemma":0.00048625792,"teacher_disagreement_score":0.008191001,"about_ca_system_score_codex":0.0020380402,"about_ca_system_score_gemma":0.0008633318,"threshold_uncertainty_score":0.027401567},"labels":[],"label_agreement":null},{"id":"W4417285887","doi":"10.48550/arxiv.2503.11583","title":"A Unified Framework for Multiple-Try Metropolis: Construction and Empirical Benchmarks","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rejection sampling; Markov chain Monte Carlo; Metropolis–Hastings algorithm; Monte Carlo method; Kernel (algebra); Markov chain; Generalization; Sampling (signal processing)","score_opus":0.17299356917269512,"score_gpt":0.43336652909585666,"score_spread":0.26037295992316156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417285887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010157938,0.00026016435,0.98319906,0.00034834727,0.000036048372,0.0002103709,0.00017489212,0.0007274014,0.0048858505],"genre_scores_gemma":[0.29330558,0.00048311742,0.70167637,0.00016027146,0.000100808546,0.0012962517,0.00075383513,0.0007209421,0.0015028605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391466,0.0037969637,0.00023483555,0.00052270474,0.0012122835,0.00031847635],"domain_scores_gemma":[0.97433406,0.01810191,0.0010061128,0.0036913434,0.0023139261,0.00055270887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01594954,0.0014397269,0.0018822681,0.0032721628,0.0018651428,0.0037667612,0.0051691136,0.0030408304,0.0072067953],"category_scores_gemma":[0.08268646,0.0008614094,0.0011223305,0.0033126653,0.002580536,0.0049768523,0.0041708406,0.004307305,0.0011901258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010449315,0.00019609608,0.0026754737,0.00016433909,0.00005473585,0.00011940197,0.00020522089,0.3614687,0.0009046738,0.5993543,0.003163424,0.031589143],"study_design_scores_gemma":[0.00002198767,0.000026405038,0.00013334281,0.000022999213,0.000005896426,0.00003079552,0.000026912687,0.91570765,0.00044786563,0.082371175,0.0011916505,0.000013308625],"about_ca_topic_score_codex":0.006988034,"about_ca_topic_score_gemma":0.0065696933,"teacher_disagreement_score":0.01594954,"about_ca_system_score_codex":0.003391285,"about_ca_system_score_gemma":0.0042686197,"threshold_uncertainty_score":0.08435017},"labels":[],"label_agreement":null},{"id":"W4417331488","doi":"10.3390/risks13120252","title":"From Stochastic Orders to Volatility Surfaces: Revisiting the One-X Property","year":2025,"lang":"en","type":"article","venue":"Risks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Unimodality; Property (philosophy); Conjecture; Stochastic volatility; Volatility (finance); Stochastic process","score_opus":0.16328044363885794,"score_gpt":0.4108044017176865,"score_spread":0.24752395807882857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417331488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26667556,0.0019872305,0.6883882,0.003107336,0.00017674877,0.000054821037,0.00020295408,0.0003608155,0.039046295],"genre_scores_gemma":[0.9525679,0.0010781635,0.040276982,0.00031653026,0.000327579,0.000050819308,0.00010250071,0.00013765541,0.0051418324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999151,0.000262712,0.0000506217,0.00017442225,0.00025428995,0.000106983665],"domain_scores_gemma":[0.9938397,0.004096862,0.00075648463,0.0006067032,0.0003532302,0.00034711076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022343209,0.0005341705,0.0006996801,0.0011373156,0.00095301226,0.002697433,0.00093766744,0.0014547907,0.004309414],"category_scores_gemma":[0.0129253995,0.0004903217,0.001029927,0.00069852924,0.004193947,0.0067602997,0.0026885094,0.003469609,0.00038966013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011284345,0.00000733753,0.00048285318,0.000024684305,0.00000359029,0.000060389953,0.000081733946,0.004649277,0.00042778993,0.99096745,0.00022276126,0.0030609018],"study_design_scores_gemma":[0.000008857337,0.00002692317,0.0004850866,0.000014186309,0.00000345396,0.00009246816,0.000035809633,0.05385655,0.0004435493,0.94350696,0.0015139858,0.00001218953],"about_ca_topic_score_codex":0.0007646639,"about_ca_topic_score_gemma":0.00037385372,"teacher_disagreement_score":0.004309414,"about_ca_system_score_codex":0.0007312075,"about_ca_system_score_gemma":0.00063360046,"threshold_uncertainty_score":0.014416456},"labels":[],"label_agreement":null},{"id":"W6930193986","doi":"10.5281/zenodo.11834240","title":"+&gt;![[.WATCH.] The Strangers: Chapter 1 (2024) (FULLMOVIE) ONLINE ON 123MOVIES","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Brother; Demon; Action (physics); Upload; Ridiculous","score_opus":0.10859090016096522,"score_gpt":0.3302651474328095,"score_spread":0.22167424727184426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930193986","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000268885,0.00036159417,0.0006362431,0.000723476,0.0015689569,0.00012049743,0.004538215,0.004204302,0.98757786],"genre_scores_gemma":[0.00084936555,0.00024822477,0.00035420246,0.00042471843,0.00020474296,0.00005411419,0.0020039426,0.002439019,0.9934216],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998074,0.00001623735,0.000006477858,0.00003292031,0.00009151606,0.000045443416],"domain_scores_gemma":[0.9991621,0.00006481067,0.000022268052,0.00007289683,0.00032687918,0.00035107599],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002558561,0.00085480657,0.000457931,0.0010235079,0.001848207,0.0048065674,0.0009252015,0.0013859675,0.9445837],"category_scores_gemma":[0.0014460097,0.0005232091,0.00057944434,0.0009713854,0.00038748427,0.003993818,0.0035924283,0.0015176408,0.92616826],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008239814,0.0000072258604,0.00002445834,0.000041351563,5.169517e-7,0.0000115496005,0.00004020656,0.000007584815,0.00010430738,0.0005224369,0.98436755,0.014864568],"study_design_scores_gemma":[0.0000028523227,0.000004662415,0.00016084994,0.000038955284,6.698978e-7,0.00002314509,0.000060555332,0.000009921749,0.00006507106,0.00015541613,0.9994748,0.0000031295554],"about_ca_topic_score_codex":0.0041867187,"about_ca_topic_score_gemma":0.011278435,"teacher_disagreement_score":0.055416286,"about_ca_system_score_codex":0.00079327123,"about_ca_system_score_gemma":0.0005864478,"threshold_uncertainty_score":0.07904458},"labels":[],"label_agreement":null},{"id":"W6930365431","doi":"10.5281/zenodo.12378164","title":"Englisch zap übungen pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Visitor pattern; Partially sighted","score_opus":0.05954168703810771,"score_gpt":0.30184230306699344,"score_spread":0.24230061602888575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930365431","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005728995,0.0012958549,0.0019138174,0.0010970274,0.0024963396,0.00020857647,0.0081072645,0.007205049,0.9771031],"genre_scores_gemma":[0.0021399842,0.0009143897,0.0008288137,0.0006715034,0.00043988568,0.00007639986,0.0034599656,0.0024360062,0.989033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993617,0.000042544172,0.000035069785,0.00008469104,0.00036814855,0.0001079384],"domain_scores_gemma":[0.99869114,0.00019736683,0.000058715836,0.00016869335,0.0006050291,0.00027911653],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005138671,0.0015693465,0.001002585,0.002548229,0.0016497533,0.0066417926,0.0014313053,0.0020002136,0.91121364],"category_scores_gemma":[0.0031045554,0.0007449406,0.0008872409,0.0021147584,0.00058530725,0.0063777748,0.00324224,0.0027110118,0.86109984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299239,0.00003397241,0.000049656737,0.00020250608,0.0000025277943,0.00008710675,0.00004995274,0.000054987755,0.000597799,0.0021655567,0.93991596,0.056776974],"study_design_scores_gemma":[0.000009644633,0.0000124942535,0.00015460918,0.00006272027,0.0000021128176,0.00007718514,0.000042238586,0.000036696154,0.00037878638,0.0006568932,0.9985587,0.000007847165],"about_ca_topic_score_codex":0.0022363681,"about_ca_topic_score_gemma":0.0039073,"teacher_disagreement_score":0.08878636,"about_ca_system_score_codex":0.0013116504,"about_ca_system_score_gemma":0.0012794178,"threshold_uncertainty_score":0.12664288},"labels":[],"label_agreement":null},{"id":"W6931091438","doi":"10.5281/zenodo.4230736","title":"~&gt;Free Download Essentials of Business Communication (Canadian Edition) Pre Order","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Business communication; Electronic business; Business rule; Business analysis; Download; Order (exchange); Business relationship management; New business development; Business process modeling","score_opus":0.07177083140509116,"score_gpt":0.28952258194545893,"score_spread":0.21775175054036777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931091438","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015452094,0.0011607266,0.0003128045,0.0009696235,0.0013093577,0.000087420725,0.0028020395,0.0007566427,0.9924469],"genre_scores_gemma":[0.00038182345,0.00077246287,0.00018979819,0.00019269112,0.00008737875,0.000026010002,0.0007320185,0.0002251634,0.99739265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985783,0.000058581572,0.00003645845,0.00015514469,0.0009505455,0.00022097431],"domain_scores_gemma":[0.9971825,0.00025796777,0.000043761287,0.00020177898,0.0018164665,0.00049757864],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055421464,0.0014720109,0.001464801,0.0025564851,0.004622604,0.0081623765,0.0017095064,0.0021615732,0.8650378],"category_scores_gemma":[0.0044307774,0.0008846603,0.0009939896,0.0054034367,0.0009991337,0.0049537714,0.0032158496,0.0026474923,0.79769695],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009596013,0.000015309837,0.000049664177,0.000092514434,0.0000013652185,0.000014500842,0.000044994205,0.000025924437,0.00012356715,0.0020336376,0.96697426,0.030614674],"study_design_scores_gemma":[0.0000025182499,0.0000050451463,0.00031770856,0.00007739971,0.0000016461028,0.000014413668,0.00008652293,0.000021567064,0.000063257896,0.00033958466,0.9990645,0.0000058193014],"about_ca_topic_score_codex":0.23551986,"about_ca_topic_score_gemma":0.35523129,"teacher_disagreement_score":0.23551986,"about_ca_system_score_codex":0.0063697575,"about_ca_system_score_gemma":0.01522872,"threshold_uncertainty_score":0.46829796},"labels":[],"label_agreement":null},{"id":"W6931543040","doi":"10.5281/zenodo.8160306","title":"Fig. 4 in Hyperelodiones A-C, monoterpenoid polyprenylated acylphoroglucinols from Hypericum elodeoides, induce cancer cells apoptosis by targeting RXRα","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Apoptosis; Cancer; Cancer cell; Cytotoxicity; Cell culture; Cancer cell lines","score_opus":0.0521449948327312,"score_gpt":0.2873619681522447,"score_spread":0.2352169733195135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931543040","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9341377,0.0024426999,0.02272522,0.00041164208,0.00016522515,0.00011956121,0.01311872,0.0005398421,0.02633924],"genre_scores_gemma":[0.9591849,0.00095976156,0.008410725,0.00018418407,0.000011352528,0.00006104664,0.006437497,0.00012541855,0.024625195],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999318,0.000008300843,0.0000023684445,0.00002113949,0.00001910264,0.00001732392],"domain_scores_gemma":[0.9999368,0.000022188276,0.000011974335,0.00001159444,0.0000071951845,0.000010323093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008210279,0.00027096726,0.000098537515,0.00024017024,0.00016336732,0.000120723285,0.00020987888,0.00017960109,0.011182712],"category_scores_gemma":[0.0000985052,0.00007429937,0.00014033151,0.0002524658,0.00016395673,0.0001390244,0.000104176775,0.00039250398,0.0013879397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008896296,0.00006905094,0.00042908025,0.00014806246,0.000017532864,0.00018711247,0.000028585646,0.0016809998,0.98729706,0.0010022799,0.00111277,0.007137826],"study_design_scores_gemma":[0.000050076207,0.0002846832,0.0031377217,0.00000838647,0.000010286681,0.0001177218,0.00002700672,0.002941011,0.9838203,0.00045877852,0.009132139,0.000011821169],"about_ca_topic_score_codex":0.0011275585,"about_ca_topic_score_gemma":0.0013443711,"teacher_disagreement_score":0.011182712,"about_ca_system_score_codex":0.00024020091,"about_ca_system_score_gemma":0.00015859159,"threshold_uncertainty_score":0.03740996},"labels":[],"label_agreement":null},{"id":"W6931661983","doi":"10.5281/zenodo.7525631","title":"INTERPRETING RESULTS FROM RASCH ANALYSIS 1. THE \"MOST LIKELY\" MEASURES COMING FROM THE MODEL.","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Rehabilitation Institute; University of Toronto; University Health Network","funders":"","keywords":"Rasch model; Raw score; Item response theory; Polytomous Rasch model; Measure (data warehouse); Differential item functioning; Psychometrics; Outcome (game theory)","score_opus":0.13200600015733685,"score_gpt":0.324959777807332,"score_spread":0.19295377764999513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931661983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06334119,0.0029951364,0.9064183,0.004197211,0.00094350026,0.0016886361,0.0054285163,0.005083331,0.0099042],"genre_scores_gemma":[0.52304214,0.0016600403,0.46517488,0.0009691623,0.0006179246,0.0016636667,0.0036109765,0.0013385873,0.00192264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9113019,0.060000632,0.0054891137,0.0054447465,0.017195622,0.0005679543],"domain_scores_gemma":[0.76532227,0.17751616,0.018853854,0.01946303,0.01815607,0.0006885282],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.064244635,0.0025864816,0.002277684,0.0076305997,0.0013193357,0.0055195536,0.0015079043,0.0014434026,0.0070528304],"category_scores_gemma":[0.27705294,0.00094343274,0.0025779097,0.0056174975,0.0023400164,0.0044903983,0.0024164359,0.0019898696,0.0035362425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014321527,0.0002915479,0.17620191,0.010816504,0.006341043,0.001039729,0.01495645,0.035027165,0.008723176,0.084380716,0.05709248,0.6036971],"study_design_scores_gemma":[0.0002956653,0.0017320283,0.18885736,0.007778408,0.0028058672,0.0018385855,0.013907314,0.20055617,0.014654225,0.48180917,0.08464259,0.0011225599],"about_ca_topic_score_codex":0.0032890567,"about_ca_topic_score_gemma":0.0027550205,"teacher_disagreement_score":0.9357554,"about_ca_system_score_codex":0.0014648379,"about_ca_system_score_gemma":0.002602789,"threshold_uncertainty_score":0.33976215},"labels":[],"label_agreement":null},{"id":"W6959789962","doi":"10.11575/prism/2500","title":"Organizational behaviour: Canadian energy companies strategies to manage the greenhouse gas related risks arising from stakeholder pressures","year":2005,"lang":"en","type":"other","venue":"PRISM (University of Calgary)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Greenhouse gas; Stakeholder; Energy (signal processing); Risk management; Government (linguistics); Renewable energy","score_opus":0.046314948517640744,"score_gpt":0.25148055411288567,"score_spread":0.20516560559524494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6959789962","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56273407,0.0010415749,0.0047235847,0.021972103,0.00011595159,0.00022102857,0.0028430084,0.00013532696,0.4062134],"genre_scores_gemma":[0.9273083,0.00074059423,0.0020205376,0.0004885678,0.000012670974,0.000039247323,0.0005876477,0.000030244424,0.06877219],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987702,0.0002284235,0.000019308416,0.00007473197,0.00062404736,0.00028332087],"domain_scores_gemma":[0.99762505,0.00054721173,0.00018285368,0.00010013976,0.0010600759,0.0004845854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712275,0.0003505584,0.0001227277,0.0012220505,0.005079844,0.0030777436,0.0010793749,0.0010799962,0.008551702],"category_scores_gemma":[0.006820569,0.00014845947,0.0002024332,0.00315598,0.0013237692,0.00073312735,0.00077070144,0.0009842545,0.00049873744],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041452152,0.0006669344,0.16784146,0.0003605804,0.00010277362,0.00056706375,0.03162834,0.029069958,0.0020121601,0.22434922,0.24974994,0.29323706],"study_design_scores_gemma":[0.00008679045,0.00013742926,0.5545946,0.000273696,0.00012066069,0.00016903169,0.09007926,0.027362326,0.0026680478,0.021229653,0.30306405,0.00021456886],"about_ca_topic_score_codex":0.9908789,"about_ca_topic_score_gemma":0.9945644,"teacher_disagreement_score":0.063666165,"about_ca_system_score_codex":0.063666165,"about_ca_system_score_gemma":0.06666244,"threshold_uncertainty_score":0.46193254},"labels":[],"label_agreement":null},{"id":"W6979357055","doi":"","title":"Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling","year":2025,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; National University of Singapore","keywords":"Discretization; Acceleration; Degeneracy (biology); Convergence (economics); Langevin dynamics; Dimension (graph theory); Sublinear function","score_opus":0.2546767911777199,"score_gpt":0.2907973394968085,"score_spread":0.03612054831908862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979357055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014461573,0.00018995398,0.9777109,0.00049995974,0.000079531594,0.000045672678,0.00003837858,0.0002812102,0.0066927983],"genre_scores_gemma":[0.60816365,0.00058390247,0.37182766,0.00083022984,0.00018239382,0.00028297838,0.00018557273,0.00061151845,0.017332045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986842,0.00040209063,0.000050930015,0.00022767766,0.00050524884,0.00012979835],"domain_scores_gemma":[0.99716336,0.001405651,0.00024883868,0.000498681,0.0004039212,0.00027959488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002536111,0.0007959506,0.0008556695,0.0007092052,0.0008111205,0.0016346836,0.0013812457,0.0010986432,0.0046477364],"category_scores_gemma":[0.010294489,0.00045263974,0.0009341167,0.0004019965,0.0027860883,0.0024824915,0.0035569156,0.0033206663,0.0007916775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009832604,0.0000404164,0.0007828004,0.00010846481,0.000023658911,0.000075151445,0.00020003247,0.12649326,0.0062504904,0.84566486,0.0014601684,0.018802473],"study_design_scores_gemma":[0.000011606305,0.00003477227,0.00010787528,0.000018133916,0.0000051684815,0.000031319752,0.000021146863,0.8415113,0.0020469178,0.15404351,0.0021569338,0.00001131366],"about_ca_topic_score_codex":0.002687626,"about_ca_topic_score_gemma":0.0019144253,"teacher_disagreement_score":0.0046477364,"about_ca_system_score_codex":0.0019057647,"about_ca_system_score_gemma":0.0016569211,"threshold_uncertainty_score":0.015548229},"labels":[],"label_agreement":null},{"id":"W6986696557","doi":"","title":"Reconstructing Shredded Random Matrices","year":2024,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Row; Binary number; Matrix (chemical analysis); Row and column spaces; Set (abstract data type); Constant (computer programming)","score_opus":0.04049024733791699,"score_gpt":0.3166047520840367,"score_spread":0.2761145047461197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986696557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525275,0.00024510405,0.931802,0.000409161,0.00004416691,0.000046310943,0.00013320753,0.00032771222,0.0017396557],"genre_scores_gemma":[0.49184787,0.0005306322,0.49840164,0.0003584756,0.00012222612,0.00014396537,0.00083449716,0.0002334539,0.0075273546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977888,0.0009440825,0.00010557468,0.0005041262,0.00042544445,0.00023191626],"domain_scores_gemma":[0.98792624,0.0083408225,0.00092821894,0.0018470393,0.0006788722,0.0002788473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024665336,0.00072633283,0.0012778747,0.0012484726,0.0006547497,0.0014321553,0.0013142613,0.0012210255,0.00217702],"category_scores_gemma":[0.01896873,0.00094965537,0.000999714,0.001030461,0.0020732405,0.0033400867,0.0020754721,0.0022808458,0.0007106873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005681605,0.00010545424,0.0033284326,0.00031477207,0.00014312031,0.00050014793,0.00047904724,0.6384789,0.009040256,0.24475037,0.002834296,0.0994571],"study_design_scores_gemma":[0.000024998533,0.000035635887,0.00016900286,0.000024461935,0.000009379467,0.00008848798,0.00004186367,0.87961215,0.003539016,0.11558048,0.0008578938,0.000016641454],"about_ca_topic_score_codex":0.0016523713,"about_ca_topic_score_gemma":0.0018425259,"teacher_disagreement_score":0.0024665336,"about_ca_system_score_codex":0.0009053564,"about_ca_system_score_gemma":0.0009127903,"threshold_uncertainty_score":0.013044417},"labels":[],"label_agreement":null},{"id":"W7007950857","doi":"","title":"Assessing the quality of posterior samples from No-U-Turn Hamiltonian Monte Carlo","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Quality (philosophy); Stability (learning theory); Calculus (dental); Distribution (mathematics)","score_opus":0.11424525346543715,"score_gpt":0.3801010563703571,"score_spread":0.26585580290491995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007950857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40422451,0.0015913156,0.5806349,0.0012701941,0.000255691,0.00022891955,0.0008890204,0.0016690098,0.009236427],"genre_scores_gemma":[0.88163716,0.00039187656,0.11165432,0.00021109937,0.000091178226,0.00013029053,0.002176019,0.00047184082,0.0032362335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596715,0.0021747923,0.00023935016,0.0006879667,0.00067785644,0.00025285597],"domain_scores_gemma":[0.9090417,0.077560075,0.002150897,0.0060802754,0.003911428,0.0012555365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017235765,0.000765227,0.001236767,0.0018961618,0.0013158101,0.0032847498,0.002301369,0.0019208374,0.007829019],"category_scores_gemma":[0.10333514,0.000757481,0.000993928,0.0009282703,0.0017351914,0.0022966485,0.0020355617,0.0024938828,0.00090331386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019362256,0.00018248073,0.048269607,0.0004015426,0.0005612912,0.00027997873,0.0007078887,0.7834334,0.0021067548,0.046565607,0.0027554438,0.1127998],"study_design_scores_gemma":[0.000063553685,0.00009330409,0.0057587433,0.00009487786,0.000048534723,0.00006946962,0.00019372959,0.9818133,0.0015280498,0.009217328,0.0010889287,0.000030131065],"about_ca_topic_score_codex":0.0216366,"about_ca_topic_score_gemma":0.031222107,"teacher_disagreement_score":0.0216366,"about_ca_system_score_codex":0.0014544423,"about_ca_system_score_gemma":0.0025105989,"threshold_uncertainty_score":0.09115255},"labels":[],"label_agreement":null},{"id":"W7009314309","doi":"","title":"Dynamics of the spherical Sherrington-Kirkpatrick model and average case complexity for top eigenvectors","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Eigenvalues and eigenvectors; Limit (mathematics); Limiting; Inverse; Langevin dynamics; Function (biology); Constant (computer programming); Upper and lower bounds","score_opus":0.049781900790317926,"score_gpt":0.28181591868723893,"score_spread":0.23203401789692102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009314309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6768997,0.0008432048,0.28337303,0.0025233584,0.000104289786,0.00005523007,0.00028891556,0.00021278039,0.03569954],"genre_scores_gemma":[0.9759531,0.00036858817,0.013054015,0.000101888494,0.000056838515,0.00006005966,0.00014793125,0.00006833122,0.010189205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965703,0.00007580152,0.000012395045,0.00006438648,0.000090397036,0.00009995806],"domain_scores_gemma":[0.9988538,0.00047406962,0.0001950767,0.00010681769,0.000167879,0.00020231695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724912,0.0003513202,0.00065581506,0.00066919706,0.0008257,0.0019377929,0.0012297526,0.00086621987,0.005725606],"category_scores_gemma":[0.0025374757,0.00025760528,0.0009848276,0.00040108952,0.0015768049,0.0028192648,0.0012189576,0.001324524,0.00040506705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003707509,0.000035163775,0.0012905478,0.000049470076,0.000023127657,0.00013664781,0.00022749745,0.10302616,0.0024040614,0.8881022,0.0011774066,0.003490714],"study_design_scores_gemma":[0.0000074155178,0.00001669902,0.0005194804,0.000009823009,0.000005549001,0.00005279074,0.000055856588,0.7093509,0.00040058163,0.28893304,0.0006288348,0.000018972143],"about_ca_topic_score_codex":0.005263106,"about_ca_topic_score_gemma":0.0033622,"teacher_disagreement_score":0.005725606,"about_ca_system_score_codex":0.0016641952,"about_ca_system_score_gemma":0.000912772,"threshold_uncertainty_score":0.019154012},"labels":[],"label_agreement":null},{"id":"W7011820060","doi":"","title":"New models of teaching /","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Data collection; Context (archaeology); Subject (documents); Curriculum","score_opus":0.03014786440347683,"score_gpt":0.27732200475223195,"score_spread":0.24717414034875512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011820060","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046458833,0.029322827,0.2902476,0.07325335,0.0019565597,0.00018157184,0.009639549,0.0011944663,0.5477453],"genre_scores_gemma":[0.6362563,0.014782522,0.029419852,0.001586115,0.0009387312,0.000359513,0.0024410377,0.00043787688,0.31377813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991518,0.00038238402,0.00002576912,0.00013519474,0.00020075186,0.00010419697],"domain_scores_gemma":[0.99667007,0.0014990115,0.00041918052,0.00042760387,0.0006515767,0.00033255393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020694025,0.0012010759,0.0008825819,0.0019655556,0.0015826938,0.0053248783,0.0021006465,0.0021717162,0.06252105],"category_scores_gemma":[0.0070642736,0.0006331429,0.0010644621,0.0030733163,0.002974788,0.0055665215,0.0012215739,0.0038694793,0.005286627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023345487,0.00003065816,0.0015464043,0.00007168792,0.000031332922,0.00004418364,0.00044785455,0.013413802,0.000049581868,0.9260959,0.035461787,0.022783436],"study_design_scores_gemma":[0.000050724186,0.000023973804,0.003886244,0.0002580607,0.000055735716,0.0001051923,0.00071002136,0.08070928,0.00010742817,0.8106245,0.10341829,0.00005057271],"about_ca_topic_score_codex":0.21651638,"about_ca_topic_score_gemma":0.30660763,"teacher_disagreement_score":0.21651638,"about_ca_system_score_codex":0.014010752,"about_ca_system_score_gemma":0.0070333793,"threshold_uncertainty_score":0.43051225},"labels":[],"label_agreement":null},{"id":"W7017245038","doi":"","title":"Acuerdos de pleno: Taxi hasta el portal","year":2018,"lang":"es","type":"article","venue":"Bilboko Liburutegi Digitala (Municipal Libraries of Bilbao)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill-Queen's University Press","funders":"","keywords":"","score_opus":0.04487414892400082,"score_gpt":0.32910660157184696,"score_spread":0.28423245264784613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017245038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056919225,0.0025288064,0.005994153,0.025765968,0.0059347576,0.0004683258,0.010898923,0.0023612601,0.8891287],"genre_scores_gemma":[0.16959941,0.0017132355,0.002572163,0.0013564194,0.00096438185,0.00023406,0.0052025467,0.0006163091,0.8177414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992435,0.00011021739,0.000028439483,0.00010143917,0.00025198786,0.0002644134],"domain_scores_gemma":[0.99813473,0.00026632004,0.00011684799,0.00024595717,0.0006892878,0.0005468291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083046046,0.00046618655,0.0005562755,0.0014419903,0.0031535728,0.004800016,0.00082579086,0.0017665892,0.29070157],"category_scores_gemma":[0.004512354,0.00033921187,0.00044383912,0.0021559515,0.00073524204,0.0031159103,0.0021392808,0.0032193966,0.089223035],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009092631,0.00059788034,0.014356139,0.00029742092,0.000033851913,0.00073493633,0.00127575,0.00092419377,0.0006125048,0.076982394,0.66668844,0.23658718],"study_design_scores_gemma":[0.00007087945,0.00006144937,0.0071249767,0.00013543968,0.000017010807,0.0002514369,0.0012749239,0.0012113729,0.0005985929,0.0074801785,0.9817374,0.000036345904],"about_ca_topic_score_codex":0.017123822,"about_ca_topic_score_gemma":0.02973644,"teacher_disagreement_score":0.29070157,"about_ca_system_score_codex":0.0029069646,"about_ca_system_score_gemma":0.003599573,"threshold_uncertainty_score":0.97249365},"labels":[],"label_agreement":null},{"id":"W7021179561","doi":"","title":"New Diesel Refinery in Alberta Eager to Prove the Doubters Wrong","year":2017,"lang":"en","type":"other","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Diesel fuel; Refinery; Ultra-low-sulfur diesel; Diesel engine","score_opus":0.06997567845738878,"score_gpt":0.37297519800732476,"score_spread":0.302999519549936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021179561","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044421934,0.0045095677,0.016671102,0.124258466,0.004928053,0.00008959724,0.003466343,0.0010865399,0.80056834],"genre_scores_gemma":[0.16346617,0.001940472,0.007036686,0.005472792,0.00030882712,0.000016577551,0.0013780198,0.0003231156,0.8200574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988961,0.000116913034,0.000024019499,0.000109347726,0.00059761276,0.00025586007],"domain_scores_gemma":[0.99799937,0.0003600966,0.00006686953,0.00013048454,0.0010867632,0.00035641427],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014534752,0.0004306938,0.00038725158,0.00091440155,0.005086558,0.004967977,0.0014635315,0.0028498864,0.049886808],"category_scores_gemma":[0.004993279,0.0003230399,0.00049640134,0.0009677155,0.0026178344,0.0019312772,0.0024233423,0.0034271113,0.0045137033],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027709943,0.000101854595,0.014117741,0.00019749002,0.000059905895,0.0011201089,0.0009672504,0.010265715,0.0008398694,0.38076714,0.4661821,0.12510379],"study_design_scores_gemma":[0.00003431994,0.000027390204,0.009723825,0.0002688097,0.000025820067,0.00018751058,0.0027174642,0.008091385,0.0012807656,0.07006883,0.90752065,0.000053145424],"about_ca_topic_score_codex":0.84844035,"about_ca_topic_score_gemma":0.9324738,"teacher_disagreement_score":0.9501132,"about_ca_system_score_codex":0.01767916,"about_ca_system_score_gemma":0.041493315,"threshold_uncertainty_score":0.3049044},"labels":[],"label_agreement":null},{"id":"W7022391673","doi":"","title":"Sorry business","year":2016,"lang":"en","type":"other","venue":"Queensland's institutional digital repository (The University of Queensland)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Testimonial; Witness; Indigenous; Commission; Representation (politics); Narrative; Power (physics)","score_opus":0.022453040387834206,"score_gpt":0.25227127216080775,"score_spread":0.22981823177297353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022391673","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005055361,0.0010873228,0.0015001047,0.008349432,0.0025437495,0.00007254928,0.0007333957,0.00051599304,0.980142],"genre_scores_gemma":[0.008419398,0.00031428577,0.0004194473,0.00085709966,0.000095985386,0.000012877422,0.00017552765,0.00016567383,0.98953956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870956,0.00016962473,0.00003530894,0.00023695074,0.0005441353,0.0003044319],"domain_scores_gemma":[0.9980379,0.0002203521,0.000082655366,0.00028108386,0.00053975283,0.000838248],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015284984,0.00048404696,0.00044831986,0.0012282635,0.0062284335,0.0082380725,0.0011025207,0.0019482955,0.46108127],"category_scores_gemma":[0.0055933823,0.0004683294,0.00041436628,0.00095216866,0.0014544209,0.0042141187,0.003981523,0.0029481256,0.17811878],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069562535,0.00006162924,0.0008715846,0.00010865604,0.0000055004966,0.00033038016,0.0031654504,0.00009248547,0.00031678495,0.09908756,0.7891391,0.106751345],"study_design_scores_gemma":[0.0000014165379,0.0000061059745,0.0002980143,0.000026921765,5.838339e-7,0.00006892774,0.00058939564,0.00004214597,0.000045044773,0.0012593959,0.9976586,0.000003356562],"about_ca_topic_score_codex":0.01445747,"about_ca_topic_score_gemma":0.040672846,"teacher_disagreement_score":0.53891873,"about_ca_system_score_codex":0.0026229885,"about_ca_system_score_gemma":0.0029829254,"threshold_uncertainty_score":0.76870215},"labels":[],"label_agreement":null},{"id":"W7022456699","doi":"","title":"Management matters","year":2012,"lang":"en","type":"book","venue":"ePrints Soton (University of Southampton)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Production (economics); Intermediary; Key (lock); Space (punctuation); Production model; Music industry; Emerging technologies; Production manager; Disintermediation","score_opus":0.04450415593416708,"score_gpt":0.2623771735125037,"score_spread":0.21787301757833666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022456699","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047712037,0.013119635,0.00076199503,0.13021412,0.035965886,0.00007016976,0.00047089465,0.00037180452,0.8185484],"genre_scores_gemma":[0.0042525167,0.00360168,0.00032385765,0.032002427,0.0066320384,0.000047765177,0.00019007514,0.00013566774,0.9528139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955778,0.00054267293,0.00022041751,0.0009738771,0.002051497,0.00063367916],"domain_scores_gemma":[0.99329317,0.001093488,0.00042363143,0.0011200014,0.0023359023,0.001733789],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028089962,0.0009166398,0.00089277123,0.0010778167,0.0041175266,0.01023089,0.001783061,0.008732352,0.38393894],"category_scores_gemma":[0.014325775,0.00049550406,0.00052741787,0.0020191271,0.002489513,0.005833218,0.0036855778,0.005596274,0.31084004],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007580959,0.000013207198,0.00012201803,0.00009233068,0.0000029364323,0.00007705436,0.00016013002,0.000025230276,0.00008609449,0.034730464,0.9075944,0.05708854],"study_design_scores_gemma":[0.0000016219748,0.000002224898,0.00006379798,0.00005900484,7.764558e-7,0.00004056995,0.000052147523,0.000009260309,0.000016638112,0.0022785892,0.9974733,0.0000019420884],"about_ca_topic_score_codex":0.0027677524,"about_ca_topic_score_gemma":0.005053612,"teacher_disagreement_score":0.38393894,"about_ca_system_score_codex":0.0029784886,"about_ca_system_score_gemma":0.008570453,"threshold_uncertainty_score":0.8787363},"labels":[],"label_agreement":null},{"id":"W7023647187","doi":"","title":"An In-Person Fireside Chat with Canadian Minister Francois-Philippe Champagne","year":2024,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Conversation; State (computer science); Cover (algebra); Prime minister","score_opus":0.032417570790009266,"score_gpt":0.30088000410221505,"score_spread":0.26846243331220576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023647187","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08273467,0.0021374684,0.010392065,0.10398988,0.0041786386,0.00065974577,0.0032625557,0.001519381,0.7911256],"genre_scores_gemma":[0.3097272,0.0007832593,0.0059325458,0.00926769,0.0005616058,0.00024077838,0.000779152,0.00017222273,0.6725355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935514,0.00014745414,0.0000063245257,0.00008326631,0.00020156917,0.00020627468],"domain_scores_gemma":[0.9971119,0.0006849295,0.00007200367,0.000088083965,0.000552267,0.0014907527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012669113,0.0004165185,0.00024743544,0.0006266542,0.013264986,0.0014878085,0.00078067946,0.0016212225,0.08031583],"category_scores_gemma":[0.0036675397,0.00032953228,0.00015990096,0.00046192654,0.0011902949,0.0010453137,0.0013105302,0.0024936278,0.007143556],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018498358,0.00014458165,0.0024383755,0.000030482513,0.0000073547676,0.00084807246,0.007942316,0.00033252558,0.0016838652,0.0110156685,0.939501,0.035870764],"study_design_scores_gemma":[0.000022752092,0.000041404797,0.0059927604,0.00003867081,0.0000027463675,0.0001991781,0.008107846,0.000829508,0.0005248085,0.0009718638,0.98322576,0.000042578802],"about_ca_topic_score_codex":0.6197198,"about_ca_topic_score_gemma":0.8910895,"teacher_disagreement_score":0.3802802,"about_ca_system_score_codex":0.009213304,"about_ca_system_score_gemma":0.010404357,"threshold_uncertainty_score":0.76503944},"labels":[],"label_agreement":null},{"id":"W7024266688","doi":"","title":"A Review of &lt;i&gt;Poanes hobomok&lt;/i&gt; (Hesperiidae: Hesperiinae), with the Description of a New Subspecies from the Southern Appalachians","year":2002,"lang":"en","type":"article","venue":"Insecta mundi","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"NOMINATE; Subspecies; Taxon; Type locality; Range (aeronautics); Taxonomy (biology)","score_opus":0.07872527091991079,"score_gpt":0.2752597792075556,"score_spread":0.19653450828764485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024266688","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015208458,0.98605865,0.0010836164,0.0008030713,0.0015096257,0.000015496751,0.0003154394,0.000039238672,0.008654006],"genre_scores_gemma":[0.0046096165,0.98532027,0.0020597156,0.0010062128,0.0012755715,0.000026336073,0.0006833316,0.000018439854,0.005000603],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9996573,0.00003494259,0.00008955571,0.00010067444,0.000089783694,0.000027746768],"domain_scores_gemma":[0.9993512,0.00018106593,0.00015745345,0.00002904585,0.0001925618,0.000088660956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280504,0.0010652306,0.0009881877,0.005516113,0.00086742005,0.0014059392,0.0011413379,0.00066018064,0.008595976],"category_scores_gemma":[0.0011039996,0.00043736506,0.00047013845,0.008166682,0.00070476753,0.002585296,0.00092579104,0.0008960936,0.0046467],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045417073,0.000039722618,0.0019522114,0.010503712,0.000068117166,0.00033059213,0.00031610113,0.00022067796,0.0015416056,0.0011649779,0.052219104,0.9315977],"study_design_scores_gemma":[0.0000018895095,0.000044422493,0.00743171,0.002439582,0.00005788594,0.0013984973,0.00020825835,0.000045079036,0.00015206284,0.0004087002,0.9877949,0.00001694034],"about_ca_topic_score_codex":0.005413453,"about_ca_topic_score_gemma":0.014434679,"teacher_disagreement_score":0.008595976,"about_ca_system_score_codex":0.0006785855,"about_ca_system_score_gemma":0.0015514318,"threshold_uncertainty_score":0.02875638},"labels":[],"label_agreement":null},{"id":"W7024278698","doi":"","title":"Reforming Canada's Cruel and Unusual Approach to Mandatory Minimum Drug Sentencing","year":2022,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Drug; Criminal justice; Focus (optics); Drug trafficking","score_opus":0.1215057802846225,"score_gpt":0.3304622869294494,"score_spread":0.2089565066448269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024278698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2144452,0.005170997,0.32128105,0.17460611,0.0015084065,0.000603858,0.0013044514,0.00082323066,0.28025675],"genre_scores_gemma":[0.9275054,0.0014480886,0.04765515,0.0048352876,0.00020113174,0.00010429066,0.000107176704,0.000055064604,0.01808842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925989,0.002798643,0.00016285146,0.0005488326,0.0025549554,0.0013358595],"domain_scores_gemma":[0.99040025,0.0048080916,0.00060587196,0.00043311526,0.0029137959,0.00083877397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006624489,0.0003487075,0.00041105444,0.0014298686,0.0058373623,0.0039160806,0.0021317403,0.002068861,0.0029985511],"category_scores_gemma":[0.025940847,0.00037274905,0.0003433643,0.0013533334,0.005000782,0.001166199,0.002157734,0.003319432,0.00022806549],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036251855,0.000041217296,0.003796384,0.00008160737,0.000018457968,0.000106568725,0.0011496313,0.027236724,0.00022997298,0.91259027,0.018925972,0.035786893],"study_design_scores_gemma":[0.00022524696,0.00016121057,0.019371342,0.0006844935,0.00010143424,0.00027814767,0.0026828959,0.3553883,0.001478145,0.4186327,0.20071264,0.0002834645],"about_ca_topic_score_codex":0.96257055,"about_ca_topic_score_gemma":0.98488206,"teacher_disagreement_score":0.04119372,"about_ca_system_score_codex":0.04119372,"about_ca_system_score_gemma":0.15635435,"threshold_uncertainty_score":0.29888278},"labels":[],"label_agreement":null},{"id":"W7024632676","doi":"","title":"Substance Abuse Trust Fund Report: FY2017 Quarter One and Quarter Two Report","year":2017,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Procurement; Administration (probate law); Service (business); Mental health; Substance abuse; House of Representatives","score_opus":0.022079548183196414,"score_gpt":0.2762423167196607,"score_spread":0.2541627685364643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024632676","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009121525,0.0011538812,0.0009262045,0.020784093,0.0022734676,0.00081770244,0.59180593,0.0017464543,0.37137064],"genre_scores_gemma":[0.018531874,0.0013934246,0.0006427231,0.0028198208,0.00052872114,0.0006636271,0.11172738,0.00045721166,0.8632352],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968636,0.00016419518,0.0001364764,0.00011769322,0.0019610901,0.00075699034],"domain_scores_gemma":[0.99228764,0.0006383845,0.0006549622,0.00045804886,0.004143962,0.0018170568],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027422104,0.0009689416,0.00073839864,0.003958399,0.0029620922,0.0035777362,0.002004762,0.0036292004,0.19805495],"category_scores_gemma":[0.010801455,0.0007532035,0.00086560694,0.0036377148,0.0005195767,0.0020994802,0.002876769,0.0026180234,0.092405975],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037214922,0.00006399201,0.0015300155,0.000029304609,0.000004841593,0.000017547009,0.000021346756,0.000074444426,0.000019713792,0.0006383954,0.9896563,0.007906776],"study_design_scores_gemma":[0.00012390122,0.000071541246,0.040403925,0.0002661263,0.000035260426,0.000077782315,0.0006276799,0.00095087005,0.00060063234,0.0013995538,0.9553988,0.00004391245],"about_ca_topic_score_codex":0.4506133,"about_ca_topic_score_gemma":0.5951049,"teacher_disagreement_score":0.80194503,"about_ca_system_score_codex":0.008502367,"about_ca_system_score_gemma":0.026741805,"threshold_uncertainty_score":0.89598083},"labels":[],"label_agreement":null},{"id":"W7073982869","doi":"","title":"Trick or treat:A response to commentaries on “The Markov blanket trick”","year":2023,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.12939813533716565,"score_gpt":0.33982516587972056,"score_spread":0.2104270305425549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7073982869","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095182186,0.00045026533,0.00020835293,0.97960037,0.019086024,0.000007997737,0.000054118987,0.00003713168,0.00046053398],"genre_scores_gemma":[0.0009916621,0.00023096416,0.00016448171,0.9828362,0.014252147,0.000034781762,0.000015189477,0.00006527292,0.0014093636],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9720509,0.010042478,0.0036054587,0.004205588,0.007111326,0.0029843575],"domain_scores_gemma":[0.8032437,0.15158817,0.011983798,0.005517386,0.020894835,0.0067721317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032379303,0.002189473,0.0027516165,0.0021947913,0.011777071,0.0115939025,0.007342899,0.096280806,0.017293075],"category_scores_gemma":[0.2264746,0.0022645257,0.0031609926,0.003037487,0.012755098,0.015479641,0.008281727,0.13814783,0.016809847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023179135,0.000010652274,0.00010336444,0.000044702734,0.000010138592,0.00008308664,0.00046282358,0.000044080924,0.000058672274,0.0037336005,0.99433076,0.0010948798],"study_design_scores_gemma":[0.000087869426,0.000035230343,0.0010822838,0.00079176895,0.00004849155,0.00021384071,0.0021172173,0.0006428312,0.00042468682,0.0114041045,0.98294026,0.0002114244],"about_ca_topic_score_codex":0.0209814,"about_ca_topic_score_gemma":0.018261956,"teacher_disagreement_score":0.096280806,"about_ca_system_score_codex":0.011315434,"about_ca_system_score_gemma":0.014269004,"threshold_uncertainty_score":0.17124015},"labels":[],"label_agreement":null},{"id":"W7089314022","doi":"10.15468/dl.jku73v","title":"Occurrence Download","year":2025,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Set (abstract data type); Data set","score_opus":0.03520737922633579,"score_gpt":0.2939348608728697,"score_spread":0.2587274816465339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7089314022","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004925415,0.000029768156,0.0000591427,0.00003798096,0.000010917214,0.0000053204876,0.99887365,0.00036872824,0.00056524633],"genre_scores_gemma":[0.00021285853,0.000036387053,0.0002684576,0.00004689372,0.000003759504,0.00004956026,0.9987771,0.00013605885,0.0004689976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999054,0.00015654674,0.00012532328,0.00031909134,0.00021709004,0.00012790115],"domain_scores_gemma":[0.9974337,0.0008601732,0.00023552995,0.0006728097,0.000542364,0.00025550055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010824265,0.0016821177,0.0014162792,0.004154687,0.00083517464,0.0023362138,0.0026782434,0.001981651,0.14732604],"category_scores_gemma":[0.007097679,0.00078610104,0.0010768027,0.008529071,0.00042990994,0.0019359188,0.0021041438,0.001848793,0.1895623],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026985615,0.000013128143,0.00042926578,0.0004915618,0.000016200584,0.000013553546,0.000019068211,0.00021674426,0.00007334115,0.000519018,0.9965888,0.0015923269],"study_design_scores_gemma":[0.000100048666,0.000009183902,0.0018469483,0.00020499328,0.00001558911,0.000037591926,0.000064545595,0.00030748436,0.00016509544,0.0014379447,0.9957931,0.000017445078],"about_ca_topic_score_codex":0.01690396,"about_ca_topic_score_gemma":0.029395452,"teacher_disagreement_score":0.14732604,"about_ca_system_score_codex":0.0014774181,"about_ca_system_score_gemma":0.002030845,"threshold_uncertainty_score":0.4928547},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"dataset","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"dataset","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W7097534229","doi":"","title":"Girth and Euclidean distortion / Random walks and Hilbert space compression- notes Probability, Geometry and Groups seminar, Toronto, 05.10.2012","year":2014,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Embedding; Distortion (music); Upper and lower bounds; Metric space; Euclidean geometry; Girth (graph theory); Constant (computer programming); Euclidean space","score_opus":0.028261934010530114,"score_gpt":0.2990995605077452,"score_spread":0.2708376264972151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097534229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2336393,0.081983015,0.36592945,0.045391385,0.00343294,0.00016053654,0.0031982625,0.0014112006,0.2648539],"genre_scores_gemma":[0.84339124,0.016691757,0.040526334,0.0016825615,0.002942962,0.00019938455,0.0016289969,0.0005407051,0.092396006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992736,0.00020549077,0.000028102728,0.00015891927,0.00022874119,0.00010513022],"domain_scores_gemma":[0.9980691,0.0009891618,0.0002104602,0.00029353012,0.00021538335,0.00022240054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010271241,0.0009536766,0.00094595744,0.0017439149,0.00081102655,0.0025078095,0.00087100995,0.0011711362,0.016031794],"category_scores_gemma":[0.0055175675,0.00042119468,0.0007651887,0.002596948,0.0024458624,0.0035885044,0.002093409,0.0028921624,0.0020526503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014546183,0.00004019366,0.0011517666,0.00013260033,0.00005185607,0.00012279383,0.0002205463,0.014350306,0.0012429248,0.90326124,0.030933147,0.04834729],"study_design_scores_gemma":[0.000027299224,0.00009201073,0.0029772085,0.00008892253,0.000026675207,0.00027547084,0.0001153776,0.046124432,0.0013350357,0.91362303,0.035253868,0.000060708466],"about_ca_topic_score_codex":0.002767201,"about_ca_topic_score_gemma":0.002330853,"teacher_disagreement_score":0.016031794,"about_ca_system_score_codex":0.0033019264,"about_ca_system_score_gemma":0.0007628912,"threshold_uncertainty_score":0.053631723},"labels":[],"label_agreement":null},{"id":"W7099269675","doi":"","title":"Comparing physician fee schedules in Canada and the","year":2016,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Fee-for-service; Health care; Service (business); Health services; User fee; Healthcare system","score_opus":0.05665420037485448,"score_gpt":0.29172005935564715,"score_spread":0.23506585898079269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099269675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82646286,0.008347368,0.006102137,0.014155781,0.00039922213,0.00031259417,0.010689119,0.00022753979,0.1333034],"genre_scores_gemma":[0.9855392,0.001827698,0.0025978908,0.0007101625,0.000026164265,0.00004865149,0.0032049273,0.00005551842,0.0059897485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9943585,0.0008484875,0.00019132753,0.00024893772,0.0030478432,0.0013050085],"domain_scores_gemma":[0.9886346,0.0025214495,0.0008830151,0.0003457993,0.0063125207,0.00130264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004218041,0.00024496205,0.00049230177,0.0042851446,0.0026602915,0.0028347746,0.0012600013,0.0005247651,0.0027464672],"category_scores_gemma":[0.029529886,0.0002662511,0.00049150817,0.008019824,0.001143863,0.00079690304,0.0012396235,0.0010265465,0.00017692032],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001219269,0.00038552063,0.20299168,0.00033227177,0.00039882227,0.00034895996,0.004337314,0.12324134,0.00039285127,0.37810913,0.110744864,0.17749803],"study_design_scores_gemma":[0.00036758353,0.00023306192,0.72415483,0.00064980227,0.000181235,0.00017866393,0.012047407,0.09342979,0.00076610263,0.026560772,0.14112517,0.0003056109],"about_ca_topic_score_codex":0.99541134,"about_ca_topic_score_gemma":0.9963658,"teacher_disagreement_score":0.10391927,"about_ca_system_score_codex":0.10391927,"about_ca_system_score_gemma":0.08552403,"threshold_uncertainty_score":0.7539906},"labels":[],"label_agreement":null},{"id":"W7100911727","doi":"","title":"for","year":2013,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reprint; Interchangeability; Term (time); Identification (biology)","score_opus":0.14329120199193876,"score_gpt":0.4074110127257165,"score_spread":0.26411981073377777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100911727","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089821423,0.0035213071,0.006936802,0.054349273,0.05763285,0.00040286334,0.024460975,0.0032101474,0.84858745],"genre_scores_gemma":[0.0032933468,0.0010761125,0.0016960086,0.0053012106,0.0041654184,0.00011238379,0.005130268,0.0011578487,0.97806734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909747,0.00014233388,0.00006184456,0.00017207854,0.0004335103,0.000092824805],"domain_scores_gemma":[0.9946523,0.00093740015,0.00016363889,0.00070887204,0.002986087,0.0005517404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012828667,0.00079689466,0.0005392786,0.0018189333,0.0018562035,0.0036373206,0.0011654656,0.0015572469,0.7546132],"category_scores_gemma":[0.011241868,0.00026785056,0.00055593066,0.0017235597,0.0006573009,0.0031678244,0.0017032543,0.0027146821,0.57481354],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008849727,0.0000058588257,0.00003911492,0.000025655225,7.597818e-7,0.000011269383,0.000042117863,0.00001574523,0.00003752723,0.0031143453,0.9826733,0.014025438],"study_design_scores_gemma":[0.0000031417803,0.0000040528203,0.00015198976,0.00004028096,7.849988e-7,0.000021900985,0.00004722337,0.000021285465,0.000039498955,0.0012008295,0.998466,0.000002988374],"about_ca_topic_score_codex":0.0068521095,"about_ca_topic_score_gemma":0.011300763,"teacher_disagreement_score":0.24538678,"about_ca_system_score_codex":0.00207892,"about_ca_system_score_gemma":0.0022462266,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7110327960","doi":"10.4230/lipics.approx/random.2025.42","title":"On the Spectral Expansion of Monotone Subsets of the Hypercube","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Upper and lower bounds; Hypercube; Spectral properties; Spectral gap; Mixing (physics)","score_opus":0.03513197230663311,"score_gpt":0.32015924855122824,"score_spread":0.2850272762445951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110327960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44272628,0.0008905871,0.52856356,0.0015017539,0.00008606229,0.00008659619,0.00035834842,0.00020670623,0.025580006],"genre_scores_gemma":[0.93525815,0.00065034593,0.058211386,0.00051971583,0.0001517412,0.00023218515,0.00038347676,0.00013340803,0.004459533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990398,0.00045300636,0.000025407633,0.0001633092,0.00018168747,0.00013675218],"domain_scores_gemma":[0.99201244,0.0063293334,0.0005500242,0.00037311527,0.00035568853,0.00037937157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081752,0.0005482255,0.0006548142,0.0012493719,0.00070979993,0.0011877974,0.0010769679,0.0008262305,0.005078454],"category_scores_gemma":[0.010666702,0.00042880667,0.00064716843,0.0008099623,0.0021914511,0.0032338751,0.0019537068,0.001687819,0.00042870082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122185,0.000039344894,0.0012263696,0.00010171796,0.000018475115,0.00013617573,0.00033171003,0.035645038,0.005367027,0.94674516,0.0013264556,0.008940286],"study_design_scores_gemma":[0.000025808578,0.00005544411,0.00076863886,0.000039065013,0.00000930368,0.00012784541,0.00012643069,0.3083591,0.0018710104,0.687232,0.001369414,0.000015890866],"about_ca_topic_score_codex":0.00090425037,"about_ca_topic_score_gemma":0.0006813584,"teacher_disagreement_score":0.005078454,"about_ca_system_score_codex":0.001057423,"about_ca_system_score_gemma":0.00034636504,"threshold_uncertainty_score":0.016989172},"labels":[],"label_agreement":null},{"id":"W7112281608","doi":"","title":"Strong Decay of Correlations for Gibbs States in Any Dimension","year":2024,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Ministry of Colleges and Universities; Ministerio de Ciencia e Innovación; Government of Canada; Universidad Nacional de Educación a Distancia; Deutsche Forschungsgemeinschaft; Comunidad de Madrid; Agence Nationale de la Recherche; Villum Fonden","keywords":"Christian ministry; Agency (philosophy); Government (linguistics); Excellence; Research program; Research council; Foundation (evidence); Dimension (graph theory)","score_opus":0.04023258942037457,"score_gpt":0.30454018723092774,"score_spread":0.2643075978105532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7112281608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44291556,0.0024780796,0.48000777,0.0073733362,0.0007861516,0.00020068663,0.0023620399,0.0024166799,0.061459694],"genre_scores_gemma":[0.95849484,0.0005904092,0.025067985,0.0011263399,0.00043535206,0.00030275053,0.0012080959,0.0005696535,0.012204618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967423,0.0011513946,0.00015416421,0.00065533293,0.0006158658,0.0006810856],"domain_scores_gemma":[0.96777713,0.01750627,0.002882639,0.0049169827,0.0027009938,0.004215995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004583089,0.0011339184,0.00205749,0.0036613247,0.0031003747,0.00513191,0.0023725822,0.0021180122,0.012319147],"category_scores_gemma":[0.030353654,0.0013347008,0.0016724922,0.0014125966,0.0064590694,0.007064936,0.006285808,0.004842975,0.001475707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107094434,0.000049283666,0.0011992018,0.00011642543,0.000033118144,0.00015130603,0.00022013848,0.0047234553,0.0009909043,0.9849458,0.0047966563,0.0026665695],"study_design_scores_gemma":[0.000030530697,0.000028101289,0.0009684197,0.000053057258,0.000011627777,0.00012426819,0.00006283076,0.0634309,0.0005408888,0.9335083,0.0011963611,0.00004463065],"about_ca_topic_score_codex":0.0028031305,"about_ca_topic_score_gemma":0.003434438,"teacher_disagreement_score":0.012319147,"about_ca_system_score_codex":0.0033435011,"about_ca_system_score_gemma":0.0018526668,"threshold_uncertainty_score":0.041211665},"labels":[],"label_agreement":null},{"id":"W7114999752","doi":"10.2139/ssrn.5912782","title":"Unified Rough Volatility Framework for Variance-Reduced Pricing and Sensitivity of Path-Dependent and Multi-Asset Derivatives","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"","keywords":"Monte Carlo method; Control variates; Estimator; Volatility (finance); Stochastic volatility; Importance sampling; Variance reduction; Equivalence (formal languages); Probability measure","score_opus":0.04361174930433245,"score_gpt":0.35124104750658774,"score_spread":0.30762929820225526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114999752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020640435,0.0006472198,0.9740233,0.0006125118,0.0000987565,0.000039597893,0.000129822,0.00012290233,0.0036854758],"genre_scores_gemma":[0.75719345,0.0023316934,0.22093162,0.00071028486,0.00091071497,0.00033818095,0.00061864266,0.0005166794,0.016448833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970607,0.0014740399,0.00013769056,0.00040137686,0.00064235367,0.00028385222],"domain_scores_gemma":[0.9896722,0.006521077,0.0009231846,0.0010299871,0.0010868156,0.0007666999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007871998,0.0017477883,0.003428711,0.0035347792,0.001378673,0.005194688,0.0045071,0.0033303401,0.0048386846],"category_scores_gemma":[0.019345473,0.002009159,0.0038595723,0.0021690703,0.00492004,0.00837789,0.004716699,0.0056818947,0.00052730576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019596488,0.000033659468,0.000248123,0.00005303373,0.00006078191,0.00007226984,0.00008503482,0.098899424,0.0004906479,0.8973002,0.00044640846,0.0022907753],"study_design_scores_gemma":[0.0000058983574,0.000011024965,0.00013276032,0.000010128767,0.000017731754,0.000019593303,0.00001228824,0.5880344,0.00008032395,0.41133985,0.00031244714,0.000023557952],"about_ca_topic_score_codex":0.0055779307,"about_ca_topic_score_gemma":0.0036618535,"teacher_disagreement_score":0.007871998,"about_ca_system_score_codex":0.003306867,"about_ca_system_score_gemma":0.0025875326,"threshold_uncertainty_score":0.04163164},"labels":[],"label_agreement":null},{"id":"W7117130517","doi":"10.1007/s00180-025-01696-1","title":"Sparse Bayesian multidimensional scaling(s)","year":2025,"lang":"en","type":"article","venue":"Computational Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Mathematical Sciences; National Institutes of Health; National Science Foundation","keywords":"Bayesian probability; Approximate Bayesian computation; Consistency (knowledge bases); Bayesian inference; Multidimensional scaling; Markov chain Monte Carlo; Computation; Sparse matrix; Cluster analysis; Probabilistic logic","score_opus":0.04778326674488278,"score_gpt":0.3778348203275208,"score_spread":0.33005155358263805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117130517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018649273,0.0002476459,0.9768733,0.0006816585,0.00007770713,0.00009944838,0.00042551785,0.00075259863,0.002192853],"genre_scores_gemma":[0.3722125,0.00032382034,0.6229049,0.00033281537,0.00015792402,0.0003513974,0.0012608927,0.0001740026,0.0022817974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854785,0.00055193156,0.00008418451,0.00024990074,0.00047999452,0.00008613085],"domain_scores_gemma":[0.9942625,0.0030132625,0.00048267952,0.00095997367,0.0010846202,0.00019697493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406999,0.00054797,0.0009868836,0.0009789431,0.000727219,0.001399643,0.0012527257,0.0009760574,0.00625591],"category_scores_gemma":[0.015338542,0.0005168651,0.00087535015,0.0013974959,0.0010260117,0.0012919637,0.002082296,0.0010767777,0.00090918544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013093418,0.00006124595,0.0045878817,0.00024124524,0.00011465975,0.00015271317,0.00014734318,0.6905284,0.0026617032,0.13723134,0.0108622145,0.15328033],"study_design_scores_gemma":[0.0000114014165,0.000008040463,0.0002635212,0.000010202381,0.00000432957,0.000026442758,0.00001227543,0.9776348,0.00034110242,0.02064747,0.0010323015,0.000008062109],"about_ca_topic_score_codex":0.0060618445,"about_ca_topic_score_gemma":0.0049218074,"teacher_disagreement_score":0.00625591,"about_ca_system_score_codex":0.0009212238,"about_ca_system_score_gemma":0.001709683,"threshold_uncertainty_score":0.020928025},"labels":[],"label_agreement":null},{"id":"W7127552493","doi":"","title":"ZigZag-based Markov chain Monte Carlo for sampling from challenging posterior distributions","year":2020,"lang":"en","type":"dissertation","venue":"Research Explorer (The University of Manchester)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Sampling (signal processing); Markov chain; Importance sampling; Slice sampling; Rejection sampling","score_opus":0.24574908111472465,"score_gpt":0.39659958046962285,"score_spread":0.1508504993548982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127552493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019120796,0.000255093,0.9778656,0.00021579131,0.000031806398,0.00009494252,0.00006969181,0.00022377778,0.0021225198],"genre_scores_gemma":[0.41678688,0.00062720734,0.57706195,0.00023116994,0.000068029716,0.00068629324,0.00049877167,0.00023615731,0.003803614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985662,0.0009288939,0.000043943463,0.00017581158,0.0002102117,0.00007494964],"domain_scores_gemma":[0.9886646,0.009607492,0.00039478863,0.0007565786,0.00034801185,0.00022842905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004915886,0.00074880075,0.0011122656,0.001098201,0.0008767203,0.0012579641,0.0020604264,0.0016352681,0.0030813636],"category_scores_gemma":[0.0176314,0.000768536,0.00081508275,0.0012991806,0.0026599385,0.0023961335,0.001673361,0.0025748352,0.0005221701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078402685,0.000038266393,0.0007611782,0.0000619816,0.000034547273,0.000034221684,0.000082131155,0.78237706,0.00034366458,0.20393464,0.0005101463,0.011743771],"study_design_scores_gemma":[0.000008961183,0.000007673456,0.00003970436,0.000007808736,0.0000022725346,0.0000039255174,0.0000039812744,0.955898,0.00010526705,0.04368378,0.00023370623,0.00000485003],"about_ca_topic_score_codex":0.008932136,"about_ca_topic_score_gemma":0.011413539,"teacher_disagreement_score":0.008932136,"about_ca_system_score_codex":0.0020597754,"about_ca_system_score_gemma":0.0022312668,"threshold_uncertainty_score":0.025998056},"labels":[],"label_agreement":null},{"id":"W7132941614","doi":"","title":"Approximations and Scaling Llimits of Markov Chains with Applications to MCMC and Approximate Inference","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Markov chain; Variable-order Markov model; Markov chain Monte Carlo; Markov process; Markov model; Scaling; Markov kernel; Inference; Markov chain mixing time","score_opus":0.04966876104332044,"score_gpt":0.39858311311222283,"score_spread":0.34891435206890237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132941614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006603881,0.0006580133,0.98801607,0.0006138327,0.000061060244,0.000043138403,0.000043423577,0.00019470713,0.0037658655],"genre_scores_gemma":[0.38487315,0.0039128284,0.60088354,0.00061750785,0.00036110813,0.0005924509,0.00022011033,0.00058049726,0.007958891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716944,0.0015238672,0.00013461677,0.0003709883,0.0006855244,0.00011567707],"domain_scores_gemma":[0.9798662,0.016414128,0.00095049664,0.0014638162,0.00093494076,0.00037042957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058266073,0.0009936686,0.0010312462,0.0017749582,0.0010787607,0.002081039,0.0013170501,0.0014428034,0.0042833933],"category_scores_gemma":[0.04135985,0.0009707984,0.0013231667,0.0015563472,0.0050029443,0.0040054643,0.003013647,0.00400605,0.0006528893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001572528,0.000017587694,0.00045878362,0.00007566967,0.000027629218,0.00004901188,0.00020398475,0.1544473,0.00062994164,0.82991415,0.0006899626,0.0134701915],"study_design_scores_gemma":[0.0000053689855,0.0000132701425,0.00014156899,0.000038822393,0.0000066228163,0.000022390388,0.000026003494,0.59990585,0.0004522226,0.39755782,0.0018147159,0.000015317222],"about_ca_topic_score_codex":0.0041841487,"about_ca_topic_score_gemma":0.0026602068,"teacher_disagreement_score":0.0058266073,"about_ca_system_score_codex":0.0027645023,"about_ca_system_score_gemma":0.0019936336,"threshold_uncertainty_score":0.03081441},"labels":[],"label_agreement":null},{"id":"W7139410430","doi":"","title":"Embarrassingly Parallel Sequential Markov-chain Monte Carlo for Large Sets of Time Series","year":2016,"lang":"","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Università Ca' Foscari Venezia; Global Risk Institute in Financial Services","keywords":"Markov chain Monte Carlo; Embarrassingly parallel; Monte Carlo method; Metropolis–Hastings algorithm; Particle filter; Computation; Series (stratigraphy); Bayesian probability; Approximate Bayesian computation; Hybrid Monte Carlo","score_opus":0.02724834230598475,"score_gpt":0.27174941742503284,"score_spread":0.2445010751190481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139410430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003329679,0.00011600499,0.99419564,0.0002754318,0.000025451462,0.000046617224,0.00005508458,0.00057656475,0.0013795082],"genre_scores_gemma":[0.109555095,0.00034815393,0.886571,0.00013788363,0.00009312526,0.00032833294,0.00031835368,0.0003061303,0.0023419324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981236,0.00092072395,0.00008728082,0.0003246193,0.00044338222,0.00010040214],"domain_scores_gemma":[0.9906013,0.007520395,0.0002622626,0.00096549914,0.0004623697,0.0001881495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005125263,0.00094685104,0.0013191088,0.0010493776,0.0015687183,0.0021695679,0.0022061644,0.0013851541,0.006074375],"category_scores_gemma":[0.018926805,0.0009918266,0.0009824558,0.0016366404,0.0017564377,0.002526393,0.0020533907,0.0031480612,0.0016371554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014770389,0.00012737255,0.001653135,0.00016861591,0.000102966915,0.00014334981,0.00020939448,0.6794117,0.0013280798,0.18447238,0.0048383498,0.12739697],"study_design_scores_gemma":[0.000020814236,0.000009809816,0.0001099043,0.000011048191,0.0000062761515,0.000016778129,0.000013625922,0.9179146,0.00043025825,0.07944778,0.0020090123,0.000010051475],"about_ca_topic_score_codex":0.015387419,"about_ca_topic_score_gemma":0.025390483,"teacher_disagreement_score":0.015387419,"about_ca_system_score_codex":0.0021465702,"about_ca_system_score_gemma":0.0050679413,"threshold_uncertainty_score":0.03059572},"labels":[],"label_agreement":null},{"id":"W7162449076","doi":"10.1109/urtc68753.2025.11532987","title":"Optimally Revealing Bits for Rejection Sampling","year":2025,"lang":"","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"","score_opus":0.13183912792315933,"score_gpt":0.4422566038477037,"score_spread":0.3104174759245444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162449076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016484976,0.0004855949,0.9765713,0.001549157,0.00009752886,0.000102980455,0.00016294085,0.00033499676,0.004210481],"genre_scores_gemma":[0.642525,0.0010620519,0.33712822,0.0013767089,0.00063165923,0.0012016883,0.00079874194,0.00076579506,0.014510041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9834168,0.012093163,0.00043392237,0.0011869799,0.0018910739,0.0009781641],"domain_scores_gemma":[0.8367273,0.14532578,0.0028579466,0.011127996,0.0024100016,0.0015510219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019464618,0.0020219532,0.0040008137,0.0020549595,0.0021382621,0.0051802383,0.004748547,0.0057105646,0.011226889],"category_scores_gemma":[0.13346699,0.0024005133,0.0016549188,0.0026863958,0.007716427,0.010580218,0.0066101654,0.007967534,0.0017484174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011099309,0.00014905976,0.00077108684,0.00017476732,0.00007953744,0.00009724837,0.00025009064,0.1517009,0.00070072536,0.815556,0.0038004334,0.025610289],"study_design_scores_gemma":[0.00011449858,0.00003001915,0.000087980035,0.000042247113,0.000018676677,0.000030819403,0.000018219936,0.435875,0.00046150564,0.56259084,0.00070529466,0.000024809235],"about_ca_topic_score_codex":0.0020065133,"about_ca_topic_score_gemma":0.0015541511,"teacher_disagreement_score":0.019464618,"about_ca_system_score_codex":0.0032537684,"about_ca_system_score_gemma":0.0030645716,"threshold_uncertainty_score":0.10293996},"labels":[],"label_agreement":null},{"id":"W81435805","doi":"10.1090/fic/026","title":"Monte Carlo Methods","year":2000,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain Monte Carlo; Monte Carlo method; Hybrid Monte Carlo; Statistical physics; Markov chain; Rejection sampling; Monte Carlo integration; Monte Carlo method in statistical physics; Ergodic theory; Algorithm; Sampling (signal processing); Mathematics; Computer science; Physics; Statistics; Pure mathematics","score_opus":0.05176855974587122,"score_gpt":0.3787195558501457,"score_spread":0.32695099610427447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81435805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074724393,0.003234818,0.9620399,0.0012799873,0.0006129176,0.00037095984,0.0013695868,0.0013361223,0.02900858],"genre_scores_gemma":[0.06383287,0.0070682466,0.8728761,0.0013161112,0.0012654504,0.0028027238,0.0030630545,0.001537141,0.04623826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909991,0.0049694544,0.00052957487,0.0011874064,0.0019536195,0.00036082353],"domain_scores_gemma":[0.9845465,0.009550712,0.00078739144,0.0023120982,0.0024766342,0.00032658636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060117366,0.0018215758,0.002366312,0.003288208,0.0014895443,0.004865965,0.0043558856,0.0032621024,0.049152814],"category_scores_gemma":[0.025629189,0.0012110947,0.0028317957,0.003537987,0.0025067434,0.0032842099,0.003736492,0.004097467,0.0152499825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048443006,0.000078466255,0.0012467145,0.0005401748,0.00026428574,0.00011333654,0.00016597671,0.1278103,0.00025208632,0.6673931,0.043488726,0.15859838],"study_design_scores_gemma":[0.000056618665,0.000046038946,0.00034962915,0.0003822316,0.000057322577,0.00015217032,0.0000842127,0.26134908,0.00047512454,0.5499123,0.187064,0.00007138442],"about_ca_topic_score_codex":0.0061554797,"about_ca_topic_score_gemma":0.00579758,"teacher_disagreement_score":0.049152814,"about_ca_system_score_codex":0.003080069,"about_ca_system_score_gemma":0.004580219,"threshold_uncertainty_score":0.16443259},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06814830895941162,"score_gpt":0.3270986019886887,"score_spread":0.2589502930292771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84569508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092622195,0.00010013472,0.9977451,0.00010387102,0.000022503438,0.000027424747,0.000020902384,0.00021117869,0.0008426558],"genre_scores_gemma":[0.108926415,0.00031271676,0.8864298,0.00032799604,0.00014102453,0.00050761865,0.00022236051,0.00042508185,0.0027069508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649364,0.0019631758,0.00011468388,0.0004669433,0.0007822619,0.00017939636],"domain_scores_gemma":[0.9942572,0.0043725413,0.0002828628,0.00058307743,0.00035963976,0.00014463483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004393546,0.0013088799,0.0019436235,0.0014725247,0.0011646238,0.0016263871,0.0038760277,0.0022565715,0.0045682276],"category_scores_gemma":[0.01762444,0.0012750729,0.0013948891,0.0015442285,0.00217304,0.0019156685,0.0025583787,0.0038461192,0.0011691132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010700598,0.000071149254,0.0005962193,0.00011767359,0.00014664182,0.00010224409,0.0000941237,0.71609783,0.0015574542,0.21364222,0.0030843308,0.06438302],"study_design_scores_gemma":[0.00002509415,0.000007757393,0.000047515263,0.000010554129,0.000008364026,0.000013798604,0.0000026839145,0.9598633,0.00030288193,0.038427807,0.0012778948,0.000012417032],"about_ca_topic_score_codex":0.009701291,"about_ca_topic_score_gemma":0.009746183,"teacher_disagreement_score":0.009701291,"about_ca_system_score_codex":0.002035707,"about_ca_system_score_gemma":0.0028510713,"threshold_uncertainty_score":0.02323556},"labels":[],"label_agreement":null}]}