{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029888297,0.000066979526,0.0055144574,0.000023060615,0.00066210545,0.0003638144,0.00008809838,0.00021162475,0.99303997],"genre_scores_gemma":[0.000032896405,0.00009823985,0.0037289737,0.000026219894,0.0009412514,7.08275e-7,0.00002313361,0.00007852529,0.99507004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873364,0.00006717036,0.00021339256,0.0005260087,0.00021050524,0.00024927215],"domain_scores_gemma":[0.9984356,0.00009755728,0.00028628993,0.00083350827,0.0001931228,0.00015390143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025833154,0.00037927018,0.0004862951,0.00017515368,0.0001261417,0.000019829706,0.00037067913,0.0004598332,0.000027949838],"category_scores_gemma":[0.00004751504,0.0004292696,0.00029189955,0.000005303203,0.00016438408,0.000057187564,0.00029192265,0.000496201,0.0000012011433],"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.00005506374,0.0000076036267,8.616908e-8,0.0001062338,0.00010206216,0.00007981873,0.000043872686,2.8587104e-8,0.000029005343,0.7359003,0.26111746,0.002558449],"study_design_scores_gemma":[0.00029232443,0.00004666918,2.9480853e-7,0.00007410061,0.0003317145,0.000023090106,0.000018654497,0.0000052798364,0.0005153461,0.00048334114,0.99778676,0.00042240234],"about_ca_topic_score_codex":0.000043708005,"about_ca_topic_score_gemma":0.0000023108678,"teacher_disagreement_score":0.7366693,"about_ca_system_score_codex":0.00017099286,"about_ca_system_score_gemma":0.00005806015,"threshold_uncertainty_score":0.9998159},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059443205,0.004477257,0.01250974,0.0007039406,0.00032203484,0.00068712124,0.000042244734,0.00021336744,0.98103833],"genre_scores_gemma":[0.00002268294,0.0018974141,0.21419899,0.0013492708,0.0003859011,0.000014352212,0.000005447475,0.00012746223,0.78199846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736637,0.0004522095,0.000612593,0.0007043159,0.0004698736,0.0003946635],"domain_scores_gemma":[0.99239695,0.0057528107,0.0004614932,0.00088801567,0.000260595,0.00024016322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050542117,0.0006815683,0.00090563676,0.00019976422,0.000116592295,0.00009012278,0.00026043793,0.00070174143,0.00029299923],"category_scores_gemma":[0.0026837734,0.00057048304,0.00026503508,0.000029014835,0.00014469745,0.00015137787,0.00019395395,0.0007077827,0.0000010510438],"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.000110742505,0.00002840987,1.0804101e-7,0.00011198564,0.00017378067,0.00013954368,0.00030749486,1.062236e-7,0.000005378597,0.72027713,0.011268739,0.2675766],"study_design_scores_gemma":[0.00046048217,0.00016321635,5.042264e-7,0.00024290448,0.00044929888,0.00023750811,0.00036473366,0.00011980436,0.000010970324,0.28269234,0.71453863,0.0007195978],"about_ca_topic_score_codex":0.000020141388,"about_ca_topic_score_gemma":0.00003091124,"teacher_disagreement_score":0.7032699,"about_ca_system_score_codex":0.00010069562,"about_ca_system_score_gemma":0.00007925534,"threshold_uncertainty_score":0.9996747},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012074262,0.00020167184,0.0022555934,0.00002430701,0.00017244568,0.0005941036,0.00028289168,0.00015889593,0.99618936],"genre_scores_gemma":[0.00012240307,0.00017577743,0.0049745315,0.000048777067,0.00016427442,5.578899e-7,0.000021304473,0.0000818456,0.9944105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984618,0.000059069585,0.0003046404,0.00057899975,0.0002731751,0.0003223436],"domain_scores_gemma":[0.998261,0.00035168187,0.00032840788,0.0006668786,0.0001698524,0.00022220684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006055917,0.00042735133,0.0005307612,0.0002029404,0.00012241364,0.000035259072,0.00029063845,0.00055758405,0.000002053324],"category_scores_gemma":[0.0000619552,0.00045453754,0.00018723609,0.0000069127236,0.0002385994,0.0000458444,0.00037025433,0.0005212088,2.55414e-7],"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.00017825486,0.0000099699455,3.9799556e-7,0.00029043914,0.00014056818,0.00025503722,0.00027544633,1.3736745e-7,0.00002841604,0.96386576,0.028782284,0.0061732717],"study_design_scores_gemma":[0.0010042934,0.000065323155,0.0000011486645,0.00031796846,0.00023576224,0.000028638175,0.00005699709,0.000026601796,0.000108124186,0.00020357686,0.9974588,0.0004927763],"about_ca_topic_score_codex":0.00007140027,"about_ca_topic_score_gemma":0.00001574647,"teacher_disagreement_score":0.9686765,"about_ca_system_score_codex":0.00011392654,"about_ca_system_score_gemma":0.000047881276,"threshold_uncertainty_score":0.9997906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068444235,0.0011943394,0.9860481,0.0007654619,0.0001689893,0.0029533205,0.0007897594,0.00013773944,0.007257871],"genre_scores_gemma":[0.7197624,0.00025683828,0.24551596,0.00050921715,0.0019609134,0.023572953,0.001000814,0.00031391138,0.0071069784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982614,0.000029665496,0.00041675472,0.0007467612,0.00014922276,0.00039617662],"domain_scores_gemma":[0.9967478,0.001277144,0.000504258,0.0010333975,0.0002862977,0.00015112072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006003063,0.0004681027,0.0005988891,0.00012437024,0.0008498338,0.00025385994,0.0005907261,0.00022866284,0.000013819207],"category_scores_gemma":[0.0004199437,0.000388298,0.00015503446,0.00006700315,0.0001416801,0.000054482574,0.00047610246,0.00034215016,2.3691513e-7],"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.00027585548,0.0009896981,0.0000085733045,0.016076177,0.0009529988,0.000001184651,0.0026067276,0.00009775747,0.00038194086,0.833041,0.010083052,0.135485],"study_design_scores_gemma":[0.0006306869,0.00013428363,0.0000015312104,0.0007875887,0.00023641139,0.0000072629036,0.0005612144,0.006964846,0.0004480865,0.97860754,0.010944389,0.0006761722],"about_ca_topic_score_codex":0.000022365195,"about_ca_topic_score_gemma":0.000072839975,"teacher_disagreement_score":0.7405321,"about_ca_system_score_codex":0.00006364253,"about_ca_system_score_gemma":0.00028570634,"threshold_uncertainty_score":0.9998569},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95766634,0.0000621973,0.025387535,0.000090566726,0.0001231681,0.00043025645,0.000014227321,0.00013341694,0.01609231],"genre_scores_gemma":[0.9813312,0.00007508212,0.00785669,0.00012309935,0.00004744245,0.0000021566675,0.0000010356546,0.000030003104,0.010533283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987958,0.00014198221,0.00015883188,0.0004835386,0.000067292116,0.00035257696],"domain_scores_gemma":[0.9987482,0.0003170301,0.00011155835,0.00045897413,0.00012846536,0.00023580235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024347883,0.00023179204,0.0002905659,0.0001200532,0.00015653722,0.000043382915,0.00022785553,0.00012582261,0.00009321162],"category_scores_gemma":[0.000105086976,0.00023524994,0.00011456767,0.00023746697,0.000106556145,0.00029042084,0.00017076661,0.00018280759,0.000003659391],"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.00013660028,0.00019807632,0.0102690505,0.00016134806,0.00035672646,0.0003614099,0.0020633019,0.0006838681,0.0005502449,0.9698073,0.011796992,0.003615071],"study_design_scores_gemma":[0.009545562,0.0014097678,0.024293322,0.00047804377,0.0012669853,0.00013077896,0.028116504,0.47717422,0.0011208615,0.42290142,0.028959949,0.004602584],"about_ca_topic_score_codex":0.0008165943,"about_ca_topic_score_gemma":0.0004124009,"teacher_disagreement_score":0.5469059,"about_ca_system_score_codex":0.0000849445,"about_ca_system_score_gemma":0.000026415883,"threshold_uncertainty_score":0.95932144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9009304,0.0028798685,0.08960737,0.0007617342,0.0010048343,0.0014937229,0.000066873414,0.00004640287,0.0032087741],"genre_scores_gemma":[0.9732144,0.00023534885,0.025829785,0.000068591464,0.00018776546,0.000016135496,0.000002022892,0.000028633473,0.0004173581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998519,0.00043879965,0.00042740745,0.00015555983,0.00027060485,0.00018859809],"domain_scores_gemma":[0.9970578,0.0021072307,0.00031041517,0.00039604524,0.000078368306,0.00005011749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014275276,0.00016189784,0.00051541295,0.000032796797,0.00021896277,0.000018681141,0.00024887425,0.000064736334,0.0000085679685],"category_scores_gemma":[0.00048813372,0.00007276821,0.00025071,0.00009901488,0.00026242356,0.000020169822,0.00010793743,0.00013362907,1.2616562e-8],"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.005534273,0.00023034151,0.00068095134,0.0015743233,0.0015232973,0.000006426782,0.009032185,0.0002318621,0.1401388,0.25120473,0.0049719606,0.5848708],"study_design_scores_gemma":[0.08240771,0.0004996967,0.0059737307,0.0008371544,0.0010526578,0.000168462,0.0015755037,0.109135374,0.11609106,0.659934,0.021098582,0.001226088],"about_ca_topic_score_codex":0.000038169386,"about_ca_topic_score_gemma":0.000009198062,"teacher_disagreement_score":0.58364475,"about_ca_system_score_codex":0.000005250579,"about_ca_system_score_gemma":0.0000132218065,"threshold_uncertainty_score":0.29674014},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06110302,0.000029375964,0.93703467,0.0006564494,0.000095794916,0.00017807579,0.000012995533,0.000027664135,0.00086193817],"genre_scores_gemma":[0.79225725,0.000008454909,0.20657013,0.00024829272,0.00033688554,0.000013624048,0.00003971086,0.000022644705,0.00050300866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813306,0.00043976167,0.00047127355,0.0002259134,0.00047417099,0.00025582718],"domain_scores_gemma":[0.9980506,0.00044214615,0.00023753956,0.00024179953,0.0006368953,0.00039102268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569104,0.0001589996,0.00044225476,0.00039020396,0.00017268643,0.00013995207,0.00015057316,0.00008235534,0.000081422826],"category_scores_gemma":[0.0007122639,0.00011688773,0.00040336692,0.0007140146,0.0000134123475,0.00026925225,0.00001741745,0.00020250623,5.537188e-7],"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.0076158736,0.0076219775,0.020377671,0.00030528172,0.013844013,0.00017396739,0.043095175,0.290278,0.0036833587,0.28037748,0.04012042,0.29250678],"study_design_scores_gemma":[0.001538913,0.0016609047,0.0002443952,0.000027069682,0.0011676287,0.000021960956,0.0015508409,0.9607678,0.0010942465,0.028033637,0.0035358905,0.00035669425],"about_ca_topic_score_codex":0.000007072393,"about_ca_topic_score_gemma":0.0000069846387,"teacher_disagreement_score":0.7311542,"about_ca_system_score_codex":0.00016689605,"about_ca_system_score_gemma":0.000059875405,"threshold_uncertainty_score":0.47665432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020173041,0.00015410404,0.9720591,0.0029294156,0.0032394652,0.00035790296,0.00023623485,0.0000552474,0.000795489],"genre_scores_gemma":[0.018620776,0.000032951837,0.97786033,0.00075788534,0.00071461685,0.000021511247,0.0000017341629,0.000080527105,0.0019096758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904186,0.005640093,0.0017072555,0.0004741796,0.00081720157,0.00094263395],"domain_scores_gemma":[0.97022337,0.026905956,0.00088989944,0.0007467233,0.00056949054,0.000664572],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01496063,0.00050759607,0.0014150459,0.00003923061,0.00045917707,0.00011778484,0.00097099453,0.0004995647,0.0007291614],"category_scores_gemma":[0.053433143,0.00032508696,0.0007546205,0.00033994115,0.0015232693,0.00014653853,0.00045231235,0.0025146538,9.254364e-7],"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.0008832495,0.00042720605,0.0008003085,0.000318794,0.0007256113,0.00013424888,0.0016229787,0.000073607334,0.008513524,0.81374013,0.057053745,0.11570661],"study_design_scores_gemma":[0.0037252023,0.001807338,0.006811652,0.00015286992,0.0021393101,0.0010814852,0.0028868963,0.044606507,0.010967907,0.832821,0.09136394,0.0016358916],"about_ca_topic_score_codex":0.00006686906,"about_ca_topic_score_gemma":0.00007030985,"teacher_disagreement_score":0.11407072,"about_ca_system_score_codex":0.00012347166,"about_ca_system_score_gemma":0.00023088383,"threshold_uncertainty_score":0.9999201},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76272494,0.0005704907,0.036878128,0.00069184194,0.0030820197,0.00057815015,0.0000697983,0.000395661,0.195009],"genre_scores_gemma":[0.90097797,0.00002128314,0.094205454,0.00010173239,0.00041267043,0.00000562915,0.000020007332,0.00004975337,0.0042054984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832326,0.00020713077,0.00022373848,0.0003101785,0.00028683772,0.0006488353],"domain_scores_gemma":[0.9979559,0.00093750464,0.00018317884,0.0005248658,0.00009563619,0.00030288094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007121671,0.0002536417,0.00035464542,0.00019119009,0.00027503766,0.0000330616,0.0003302461,0.00016230572,0.00035684352],"category_scores_gemma":[0.00045011812,0.000276675,0.00020928471,0.00026434794,0.00006497329,0.00059315056,0.00029720677,0.00034376286,0.0000060044954],"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.00061580114,0.002281217,0.046988983,0.0010150922,0.0016763367,0.00051124603,0.05683811,0.00006690686,0.029889274,0.37645096,0.08191961,0.40174648],"study_design_scores_gemma":[0.008483237,0.00071382464,0.004595226,0.00076101633,0.0013757971,0.0005285639,0.06838096,0.042938367,0.015908288,0.011501466,0.84085745,0.0039558182],"about_ca_topic_score_codex":0.00013318037,"about_ca_topic_score_gemma":0.00006493406,"teacher_disagreement_score":0.75893784,"about_ca_system_score_codex":0.0002038041,"about_ca_system_score_gemma":0.0000401605,"threshold_uncertainty_score":0.9999685},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09129176,0.0335886,0.8522425,0.0026872233,0.0048472136,0.008907953,0.0020183031,0.000340529,0.004075894],"genre_scores_gemma":[0.40849584,0.062689975,0.46983954,0.0011358703,0.01547892,0.0041558715,0.00023374303,0.001008594,0.03696161],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746615,0.00030420636,0.0006101818,0.0007505861,0.000292819,0.00057603023],"domain_scores_gemma":[0.994783,0.003759144,0.0004269773,0.00066467334,0.00014895134,0.0002172522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017420525,0.0006204921,0.001165598,0.0000944895,0.00065690855,0.00033058677,0.00034062486,0.00038556766,0.00000927907],"category_scores_gemma":[0.0006979571,0.00032129162,0.00032918053,0.000042387903,0.00019599636,0.00004475328,0.00053647923,0.0004298557,1.9825602e-8],"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.0049544442,0.000049116337,0.00010785122,0.002274641,0.0012827723,0.000017320519,0.0025189447,0.000009245468,0.00035644005,0.27690277,0.003562578,0.7079639],"study_design_scores_gemma":[0.02952609,0.00016102182,0.00008238095,0.0003025919,0.0003963289,0.000052323678,0.0003057969,0.006853523,0.0003479432,0.89011383,0.07097214,0.0008860314],"about_ca_topic_score_codex":0.00002502044,"about_ca_topic_score_gemma":0.00002472332,"teacher_disagreement_score":0.70707786,"about_ca_system_score_codex":0.000041266914,"about_ca_system_score_gemma":0.000078150166,"threshold_uncertainty_score":0.99992394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33437866,0.000059687096,0.36635348,0.002646632,0.00015989224,0.00036148314,0.0000028660268,0.00013110883,0.2959062],"genre_scores_gemma":[0.90549886,0.0000025051704,0.09325628,0.00007542431,0.000034566106,6.1200944e-7,4.3291493e-7,0.0000036207748,0.0011276751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994523,0.00008082939,0.00019178502,0.00006648752,0.00010675865,0.00010185546],"domain_scores_gemma":[0.9992618,0.00036394008,0.000079685524,0.00021333847,0.00005716824,0.00002406281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063101796,0.000052844454,0.00010488092,0.000013025392,0.00009110329,0.000011509326,0.00008494808,0.000026259846,0.000015974672],"category_scores_gemma":[0.0004472708,0.000031236894,0.00005593758,0.000058970392,0.00006024477,0.000023681261,0.00001558946,0.000050827293,3.547972e-8],"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.000008146714,0.000038340375,0.000092609596,0.0000145112,0.0000062164345,3.144497e-7,0.00023063426,0.000013882814,0.0021395555,0.8875077,0.00058902183,0.109359115],"study_design_scores_gemma":[0.00047228017,0.00013820147,0.002281881,0.00003513695,0.000022536828,0.0000031480988,0.0006417122,0.05114319,0.012203148,0.9298828,0.0030119824,0.00016398267],"about_ca_topic_score_codex":0.000012027024,"about_ca_topic_score_gemma":0.00003525465,"teacher_disagreement_score":0.5711202,"about_ca_system_score_codex":0.000009681418,"about_ca_system_score_gemma":0.0000049583778,"threshold_uncertainty_score":0.12738036},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028354374,0.0004873092,0.98332965,0.0001378901,0.00033821617,0.0005507049,0.000016529524,0.00007394272,0.012230316],"genre_scores_gemma":[0.06647974,0.00007838587,0.928364,0.0006743356,0.00039423586,0.000022444114,0.0000074821546,0.00010646678,0.0038729254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976092,0.0000489735,0.0003624387,0.00086964155,0.00056498573,0.0005447657],"domain_scores_gemma":[0.99781513,0.0010450553,0.00024926753,0.0006008718,0.00016499416,0.0001246864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012392693,0.0004750876,0.00068348943,0.0004379114,0.00022179938,0.00016920513,0.00052891363,0.00026716088,0.0000090115345],"category_scores_gemma":[0.0001287036,0.00035441146,0.00009893419,0.00021676521,0.00054005545,0.00011570435,0.00038719227,0.0006069283,1.2772688e-7],"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.00052571105,0.00021902405,0.0014798576,0.0012712872,0.00018087478,0.0012367768,0.004276379,0.0024365638,0.00016911185,0.14856535,0.0011497914,0.8384893],"study_design_scores_gemma":[0.005665973,0.00067252415,0.0002033541,0.0019552144,0.00014197487,0.0003571421,0.0000027730287,0.03897524,0.0007802734,0.94115776,0.0081865,0.0019012875],"about_ca_topic_score_codex":0.000030063851,"about_ca_topic_score_gemma":0.0008808434,"teacher_disagreement_score":0.83658797,"about_ca_system_score_codex":0.00008883317,"about_ca_system_score_gemma":0.00014574855,"threshold_uncertainty_score":0.9998908},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005260982,0.00097021734,0.013952385,0.000011906762,0.000666154,0.0006262654,0.00023285323,0.00029104433,0.98319656],"genre_scores_gemma":[0.000069018526,0.0002277865,0.07002254,0.000058811947,0.00041304354,0.0000019553092,0.0000087861645,0.00015027403,0.92904776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977353,0.00032007165,0.00037294146,0.0006388404,0.00035909362,0.00057372305],"domain_scores_gemma":[0.9969213,0.0006645884,0.00046463625,0.0012696539,0.0002591153,0.00042072733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009497686,0.00068828015,0.0009942233,0.0002526939,0.00020660515,0.000041017876,0.000701408,0.00081439957,0.00001414986],"category_scores_gemma":[0.00010525159,0.0007572832,0.0006399606,0.00001055566,0.0002370241,0.00010140672,0.0006913802,0.00086355413,8.682053e-7],"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.00006229025,0.000015528516,6.180965e-7,0.00025754166,0.000304052,0.00013643678,0.00012905581,3.4520616e-7,0.00007050536,0.91350776,0.06558697,0.0199289],"study_design_scores_gemma":[0.0004909802,0.00003875603,7.5225245e-7,0.00018288079,0.00081949495,0.000030503461,0.00005703487,0.000070749134,0.00050990446,0.00010333147,0.9969266,0.0007689799],"about_ca_topic_score_codex":0.0001063944,"about_ca_topic_score_gemma":0.0000041983562,"teacher_disagreement_score":0.9313397,"about_ca_system_score_codex":0.0003158887,"about_ca_system_score_gemma":0.00009985939,"threshold_uncertainty_score":0.9994878},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19217505,0.000080182035,0.7871086,0.0000340302,0.0015513067,0.0004923408,0.00006728653,0.00025699523,0.0182342],"genre_scores_gemma":[0.87398463,0.00026335564,0.119048096,0.00007947127,0.0005319607,0.0000033658673,0.00002161178,0.0000910326,0.005976483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978539,0.00025216822,0.00029050358,0.0010480852,0.000107697524,0.0004476833],"domain_scores_gemma":[0.99693346,0.00075013103,0.00042946357,0.0013613629,0.00029572117,0.00022984696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083152275,0.0004618255,0.0006310874,0.00020537878,0.00018499732,0.00006180415,0.00084975606,0.0006915089,0.000088613444],"category_scores_gemma":[0.00043493486,0.0005220986,0.00038192995,0.0002891001,0.00014908699,0.00010992116,0.0011649184,0.0019645977,0.0000026925836],"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.00016218873,0.00016972754,0.0001933149,0.00039184283,0.00022436609,0.00017023178,0.0004901001,0.0056894366,0.00032469,0.988322,0.0009893326,0.002872776],"study_design_scores_gemma":[0.0014855532,0.00009406161,0.00011281618,0.00063104735,0.0008230166,0.00001556397,0.0006891523,0.10627227,0.0005296388,0.85462725,0.032806013,0.0019135841],"about_ca_topic_score_codex":0.00013967285,"about_ca_topic_score_gemma":0.00022562157,"teacher_disagreement_score":0.6818096,"about_ca_system_score_codex":0.00018953804,"about_ca_system_score_gemma":0.00022883671,"threshold_uncertainty_score":0.9997231},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57239383,0.00003625916,0.42648524,0.0000066838056,0.000038084832,0.000058203692,0.00007163745,0.000014454354,0.0008955986],"genre_scores_gemma":[0.4802746,0.000012966604,0.51944643,0.000020285162,0.000024367082,3.5017842e-7,0.0000028018412,0.000008129071,0.00021006087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993677,0.00005930587,0.00022112655,0.00011927154,0.00010134058,0.00013122617],"domain_scores_gemma":[0.9985502,0.0011618492,0.00007152705,0.00012395561,0.000047412635,0.000045052217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743741,0.00007890295,0.00017469646,0.000024756357,0.00006442011,0.000024773777,0.000040025,0.000023746868,0.000046931596],"category_scores_gemma":[0.00024335372,0.000069153364,0.00002169152,0.000048717106,0.000043320266,0.0000063784655,0.000031025527,0.0000536659,4.83831e-8],"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.000021294973,0.000091248876,0.0006727065,0.00022319469,0.000034162953,0.000010576256,0.0013045418,0.0012526405,0.0002880241,0.2831661,0.0018286607,0.71110684],"study_design_scores_gemma":[0.0007783347,0.000196016,0.0033376003,0.00025912715,0.00009801219,0.000025548597,0.00032739216,0.9495891,0.00048348127,0.03146556,0.012982573,0.00045725855],"about_ca_topic_score_codex":0.000048908918,"about_ca_topic_score_gemma":0.0000055006794,"teacher_disagreement_score":0.9483365,"about_ca_system_score_codex":0.00000586951,"about_ca_system_score_gemma":0.000010558723,"threshold_uncertainty_score":0.28199926},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057627905,0.000034338733,0.9406952,0.00019506722,0.00002162519,0.0001206509,0.00004677525,0.0000026690952,0.001255752],"genre_scores_gemma":[0.49914566,0.000064036096,0.50034606,0.00018885144,0.00010664599,0.0000018216639,9.3088266e-7,0.000013249154,0.00013273922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993378,0.000048776095,0.00025000173,0.00006488165,0.00016030253,0.00013826399],"domain_scores_gemma":[0.9982392,0.0013988684,0.00012381366,0.00008902093,0.000088604655,0.000060480637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006333579,0.00008156723,0.00021875024,0.000013179321,0.00008269939,0.00003922003,0.00008092825,0.000027282082,0.000007372588],"category_scores_gemma":[0.00012616024,0.000049110353,0.000031600102,0.000055044005,0.00015576421,0.00015192754,0.000011846827,0.00019760153,1.2471414e-8],"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.0009196062,0.00012448044,0.00008483639,0.00013409172,0.00006990826,0.000033007593,0.0014279505,0.002152846,0.000072839364,0.9121309,0.00097318855,0.08187634],"study_design_scores_gemma":[0.0025316318,0.00032879767,0.0003758061,0.00013090382,0.00014640336,0.000054898075,0.00053453876,0.29458717,0.00006114363,0.6989262,0.002154412,0.00016808984],"about_ca_topic_score_codex":0.000007135896,"about_ca_topic_score_gemma":0.000014072559,"teacher_disagreement_score":0.44151774,"about_ca_system_score_codex":0.000037125978,"about_ca_system_score_gemma":0.00011301866,"threshold_uncertainty_score":0.20026621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031575785,0.0050931196,0.6404027,0.00005524834,0.0030610599,0.0024279265,0.033247426,0.0014211984,0.31397557],"genre_scores_gemma":[0.00002889732,0.0063055027,0.5310542,0.0005498694,0.0018037545,0.0002657386,0.004561798,0.0020806591,0.45334956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98167926,0.0039208066,0.0037917604,0.003752337,0.0029046251,0.003951224],"domain_scores_gemma":[0.95583856,0.031459544,0.0044198683,0.0047472157,0.0015373334,0.0019975002],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0054467013,0.0039014823,0.005564147,0.0019764157,0.00056826026,0.00061576586,0.0033037306,0.003029882,0.00052430277],"category_scores_gemma":[0.05000903,0.0036559296,0.0008542456,0.0014321638,0.0011454797,0.00025119798,0.0014162443,0.004239602,0.00008689974],"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.000011855664,0.0010147705,0.00007378156,0.002750041,0.0010603709,0.0002626316,0.0016155692,0.000012497069,0.000332333,0.077961564,0.8821437,0.032760926],"study_design_scores_gemma":[0.0023420556,0.0007851738,0.000043061234,0.002284214,0.0012163124,0.00007892599,0.002788174,0.0038222335,0.00022652946,0.035172205,0.950573,0.0006681116],"about_ca_topic_score_codex":0.00071683625,"about_ca_topic_score_gemma":0.0031491222,"teacher_disagreement_score":0.139374,"about_ca_system_score_codex":0.00063544064,"about_ca_system_score_gemma":0.0012001515,"threshold_uncertainty_score":0.9982644},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010809902,0.00012824872,0.12169547,0.00023183519,0.00021957867,0.0010486358,0.000046019886,0.00050659187,0.87601554],"genre_scores_gemma":[0.000039517825,0.000055477103,0.40927276,0.0017392471,0.00056946423,0.00015027965,0.00000670899,0.00029465125,0.5878719],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99480456,0.0006551581,0.0012244406,0.0011557703,0.0010667186,0.001093331],"domain_scores_gemma":[0.99015236,0.006282186,0.001026245,0.0018177623,0.00020327768,0.00051816803],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0021946288,0.0012998928,0.0026910088,0.00011809959,0.00028440933,0.00012735823,0.00088124414,0.00076726737,0.00026521654],"category_scores_gemma":[0.0011260398,0.0010471843,0.002365084,0.00013951589,0.001280938,0.000029870655,0.00034445582,0.0018396385,0.000008749505],"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.00006130715,0.00024415774,9.4921984e-7,0.0012133501,0.001317147,0.00006246277,0.0040186495,0.00000326901,0.00011204657,0.29472244,0.5130487,0.18519554],"study_design_scores_gemma":[0.00039343434,0.00042444974,2.2353152e-7,0.0005891319,0.000577778,0.00004990229,0.00052792183,0.0007829231,0.0002311781,0.48664513,0.5085753,0.0012026326],"about_ca_topic_score_codex":0.000024066767,"about_ca_topic_score_gemma":0.000008257468,"teacher_disagreement_score":0.28814363,"about_ca_system_score_codex":0.00064892194,"about_ca_system_score_gemma":0.00037705907,"threshold_uncertainty_score":0.99997526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806418,0.0002615925,0.056626014,0.003794435,0.0001427575,0.00030943102,0.0000055227542,0.0000896824,0.15812875],"genre_scores_gemma":[0.94948256,0.0008766291,0.023494199,0.0014756782,0.00023411939,0.00003269985,0.0000051370066,0.000033804426,0.024365187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994235,0.00007850485,0.00015711352,0.00009689371,0.0000957831,0.00014817942],"domain_scores_gemma":[0.9994526,0.00029547376,0.000023928764,0.0001729329,0.00002214589,0.000032904038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005745131,0.00006991058,0.000100308556,0.000030009463,0.000060223258,0.000024130602,0.00007437106,0.00004125997,0.00013330553],"category_scores_gemma":[0.000072848256,0.000041533243,0.00005304598,0.00010325089,0.000011977242,0.000039727172,0.000008155578,0.00006976831,3.3806913e-7],"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.00095520704,0.002051196,0.0011500367,0.0002670255,0.0001405438,0.00022486846,0.01969576,0.00001645944,0.010816786,0.3574641,0.08839971,0.51881826],"study_design_scores_gemma":[0.009456482,0.00036728985,0.0000924171,0.00013759239,0.00007404612,0.00009126423,0.0059272074,0.037120923,0.015967974,0.10251835,0.82755756,0.000688895],"about_ca_topic_score_codex":0.000027122209,"about_ca_topic_score_gemma":0.00039533278,"teacher_disagreement_score":0.73915786,"about_ca_system_score_codex":0.000012430571,"about_ca_system_score_gemma":0.000008783945,"threshold_uncertainty_score":0.16936766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025275277,0.0002769612,0.9775008,0.00006376976,0.00083264627,0.0004937729,0.000004318177,0.000042581203,0.020532425],"genre_scores_gemma":[0.04297049,0.00008317897,0.9547094,0.00043614703,0.00054137246,0.0000050606923,0.000005990717,0.00006292211,0.0011854456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768066,0.000061699684,0.00069156813,0.0005750463,0.00065155735,0.00033947424],"domain_scores_gemma":[0.99602216,0.002526139,0.0004214644,0.00064374943,0.00029477838,0.000091678194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032534816,0.00033458526,0.00078411726,0.0005895401,0.00008428235,0.000053068405,0.00060437,0.00031954542,0.000033353364],"category_scores_gemma":[0.0008972532,0.00027638464,0.00019139962,0.00023748627,0.00043467607,0.00008525631,0.00023155373,0.00043084234,1.8729324e-7],"study_design_candidate":"design_other","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.00027754245,0.00004540334,0.000030088404,0.00029765937,0.000033422315,0.00004354068,0.0012425525,0.0027889651,0.0003849561,0.044068396,0.000057202036,0.95073026],"study_design_scores_gemma":[0.00871167,0.0002607946,0.000011546558,0.0017838127,0.00011825045,0.00007396528,0.0000010311783,0.13516542,0.012836363,0.83604527,0.00377261,0.0012192791],"about_ca_topic_score_codex":0.000010780271,"about_ca_topic_score_gemma":0.00010902892,"teacher_disagreement_score":0.949511,"about_ca_system_score_codex":0.00011098913,"about_ca_system_score_gemma":0.00016748434,"threshold_uncertainty_score":0.9999688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07236476,0.0012759796,0.90919346,0.00010400545,0.0019083143,0.001101221,0.000032073065,0.00035061827,0.013669547],"genre_scores_gemma":[0.94317895,0.00004250463,0.04804053,0.000046852678,0.0008839718,0.000134594,0.0000068536215,0.000099518606,0.007566193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981333,0.00019947374,0.00057975313,0.00033978483,0.0002900283,0.0004576856],"domain_scores_gemma":[0.9981952,0.0007939092,0.00023958107,0.00049415976,0.00014804947,0.00012915226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195861,0.0002454791,0.00047176174,0.00013566205,0.00018331378,0.00013127348,0.0002102509,0.00018277802,0.000014034227],"category_scores_gemma":[0.00037556552,0.00022689019,0.00021457254,0.00014015884,0.000024233637,0.00016255928,0.00004090373,0.00013725956,6.220828e-7],"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.000087812616,0.00044861363,0.0001221129,0.0031967764,0.00047349316,0.000044869656,0.0075988383,0.007426014,0.015618399,0.9243665,0.032433104,0.008183506],"study_design_scores_gemma":[0.000957451,0.00009876933,6.6072107e-7,0.00040601598,0.000097538665,0.000029975961,0.00071982853,0.98017794,0.0012291858,0.004763385,0.011081165,0.00043809757],"about_ca_topic_score_codex":0.000067657005,"about_ca_topic_score_gemma":0.0000071886257,"teacher_disagreement_score":0.9727519,"about_ca_system_score_codex":0.00009007084,"about_ca_system_score_gemma":0.0000130660765,"threshold_uncertainty_score":0.92523134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04893411,0.0000346309,0.93861514,0.0001383864,0.00022493859,0.000069817266,0.000041180814,0.0000075390903,0.0119342785],"genre_scores_gemma":[0.6462611,0.00012524007,0.35258734,0.00014121734,0.0005792752,8.965232e-7,0.0000011716706,0.000029428877,0.00027432144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867535,0.00012168674,0.0005339289,0.00008288122,0.00042495335,0.00016118826],"domain_scores_gemma":[0.99732316,0.0017263646,0.00040213403,0.00016709138,0.00026297368,0.00011826923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553294,0.00011824475,0.0004274157,0.000050175993,0.000029207578,0.000010493465,0.00013755616,0.000048257203,0.00004361627],"category_scores_gemma":[0.0011569876,0.00008708623,0.00014495621,0.00012387031,0.000082925,0.000054550586,0.000022477838,0.00024748573,3.2793145e-7],"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.00036546844,0.0007102845,0.00014595289,0.0001426653,0.000105676576,0.0001746211,0.00065273955,0.000069179914,0.0022506549,0.8849469,0.011396026,0.09903984],"study_design_scores_gemma":[0.0013988757,0.0017337085,0.0003864857,0.00033387728,0.00023283139,0.00008815032,0.000267356,0.0021414189,0.0053806435,0.9801565,0.007611587,0.00026859916],"about_ca_topic_score_codex":0.0000033227982,"about_ca_topic_score_gemma":0.0000014284233,"teacher_disagreement_score":0.597327,"about_ca_system_score_codex":0.000037780097,"about_ca_system_score_gemma":0.0000569211,"threshold_uncertainty_score":0.35512733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66880167,0.00038725836,0.016951367,0.0010157655,0.00024215052,0.0010071266,0.000009236602,0.00027887506,0.31130657],"genre_scores_gemma":[0.79779154,0.00003636939,0.15744534,0.0004092502,0.00008792018,0.00007185927,4.0477815e-7,0.0000337108,0.044123624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990697,0.000078499186,0.00020843306,0.00024655907,0.00014181956,0.0002549963],"domain_scores_gemma":[0.99913955,0.00023755964,0.000058997386,0.00031885746,0.00009509323,0.00014994504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028632203,0.00016990698,0.00024566916,0.000050918585,0.00007317963,0.00005791852,0.000103532635,0.00008709064,0.00019570958],"category_scores_gemma":[0.00012001408,0.00012923087,0.00006399252,0.00006381476,0.000038407146,0.00013744606,0.000102040794,0.000114582814,0.0000019804284],"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.000043183114,0.00021255476,0.0020826268,0.00024577472,0.00025829565,0.000055046996,0.0044127405,0.0000029822684,0.0021990433,0.76820135,0.16156317,0.060723234],"study_design_scores_gemma":[0.01093125,0.0028183842,0.028894113,0.0007905163,0.00088477536,0.00052639603,0.043392662,0.14483073,0.01395697,0.53624934,0.20958209,0.0071427496],"about_ca_topic_score_codex":0.0006169167,"about_ca_topic_score_gemma":0.00033768974,"teacher_disagreement_score":0.26718292,"about_ca_system_score_codex":0.00002245971,"about_ca_system_score_gemma":0.000012273082,"threshold_uncertainty_score":0.5269882},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987865,0.00017508387,0.00043162593,0.0028508464,0.00021546405,0.00046487342,0.00014876557,0.000016724953,0.0078316275],"genre_scores_gemma":[0.9823685,0.00097594946,0.015838591,0.0002489106,0.00031336184,0.000011923003,0.000005824173,0.000027392753,0.00020949266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99407715,0.00027431583,0.0013445283,0.0011542329,0.00042961436,0.0027201388],"domain_scores_gemma":[0.99075335,0.0028390533,0.00032762534,0.00068046903,0.00062370393,0.004775795],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.013300491,0.00037702953,0.00096335576,0.000655507,0.0006595142,0.0007046545,0.00086730503,0.00021862192,0.00007030838],"category_scores_gemma":[0.013540054,0.00033457758,0.000120776036,0.00054006313,0.00850562,0.0010669802,0.0007981806,0.00064387574,0.0000017574903],"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.000058443384,0.00011276763,0.00898712,0.00013586514,0.000012097067,0.0000011727492,0.00003563056,0.000014110171,0.0009712619,0.9884656,0.00003946286,0.0011664632],"study_design_scores_gemma":[0.0024582697,0.001390765,0.02166515,0.00023461503,0.00008542671,0.00009212591,0.0011255008,0.18271013,0.00633263,0.7793196,0.00364487,0.0009409411],"about_ca_topic_score_codex":0.0010938228,"about_ca_topic_score_gemma":0.00016976369,"teacher_disagreement_score":0.20914602,"about_ca_system_score_codex":0.00059323455,"about_ca_system_score_gemma":0.0019963803,"threshold_uncertainty_score":0.99991065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60407704,0.00028121745,0.37524238,0.000028292547,0.000948222,0.00039558538,0.000082839375,0.00026014034,0.018684298],"genre_scores_gemma":[0.973687,0.00023198439,0.018251635,0.00009514118,0.00041314572,0.0000020702869,0.00003572782,0.000074015945,0.007209294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789494,0.00020914435,0.00032112518,0.00081669627,0.00010413301,0.000653969],"domain_scores_gemma":[0.99738836,0.0003908759,0.00043942538,0.0013613683,0.00014230644,0.00027767732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011266213,0.0004351647,0.00060378143,0.0001638256,0.00015556719,0.000041552506,0.0006750662,0.0005206352,0.00019691215],"category_scores_gemma":[0.00029207714,0.00048400983,0.00041008124,0.0002465744,0.00006868354,0.00013008699,0.0011655362,0.0008537609,0.0000029826772],"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.00009864966,0.00041487953,0.02030522,0.00081424724,0.0003793557,0.0002595625,0.0013859046,0.0015942771,0.00013798552,0.9707838,0.0031460887,0.0006800178],"study_design_scores_gemma":[0.003953918,0.00010741446,0.0016339642,0.001198723,0.002214579,0.0000394747,0.0043001515,0.05472399,0.000742456,0.83802265,0.08794691,0.0051157917],"about_ca_topic_score_codex":0.00003106916,"about_ca_topic_score_gemma":0.00010799062,"teacher_disagreement_score":0.36960995,"about_ca_system_score_codex":0.0002471918,"about_ca_system_score_gemma":0.00011154161,"threshold_uncertainty_score":0.99976116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018874299,0.000009053326,0.97718984,0.0027815863,0.00030033998,0.00026662997,0.00007164737,0.000015400477,0.0004911804],"genre_scores_gemma":[0.44817382,0.0000017417038,0.5506438,0.00077133416,0.00022849502,0.000009949819,0.0000067157757,0.000021321117,0.00014284273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975649,0.0004971581,0.00079204765,0.00013256365,0.0007643077,0.00024901837],"domain_scores_gemma":[0.989211,0.005487005,0.0018574847,0.00013396621,0.0031309885,0.00017952856],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0024015207,0.00014544008,0.0005060807,0.00006943247,0.00012710648,0.000071913106,0.00023575735,0.000056104385,0.0000035146345],"category_scores_gemma":[0.015927022,0.000101617865,0.00019148183,0.0002179911,0.000116406656,0.00017965399,0.00006245836,0.00030269948,2.0137557e-7],"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.00091811817,0.0007809718,0.002658448,0.00015206663,0.0012442784,0.000016537502,0.004768325,0.034497198,0.00074145844,0.71975875,0.111113764,0.12335007],"study_design_scores_gemma":[0.0009971628,0.0004489685,0.0010872933,0.00004815039,0.0002418923,0.000035332283,0.0016458005,0.51063025,0.000070663096,0.48430365,0.00031372477,0.00017713274],"about_ca_topic_score_codex":0.000015469874,"about_ca_topic_score_gemma":0.000013223149,"teacher_disagreement_score":0.47613302,"about_ca_system_score_codex":0.00070701045,"about_ca_system_score_gemma":0.00027146636,"threshold_uncertainty_score":0.99236226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07899087,0.0050256182,0.8903917,0.0024458806,0.0065202396,0.005565057,0.0017053467,0.00057655014,0.008778753],"genre_scores_gemma":[0.83955735,0.0011007041,0.14157152,0.00073284964,0.008602783,0.00081363827,0.00035909348,0.00050003506,0.0067620566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996872,0.00046916812,0.0007578766,0.0008684672,0.00050362264,0.00052886864],"domain_scores_gemma":[0.9955303,0.0027359985,0.0004502177,0.0008765087,0.00012184772,0.00028510467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093453244,0.0007384326,0.0015779352,0.00027827595,0.00030076693,0.00016731437,0.00035211642,0.0006160881,0.00008845377],"category_scores_gemma":[0.0010562431,0.00048114074,0.0004917783,0.000086294145,0.00016225714,0.00004581776,0.00024472072,0.00076200545,3.8324586e-7],"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.014841709,0.0004219801,0.000041128584,0.002620281,0.0035643287,0.00027227085,0.005792517,0.0018587734,0.0016479002,0.27002147,0.02117895,0.6777387],"study_design_scores_gemma":[0.059084028,0.00024324276,0.00018801427,0.0012123885,0.0009903057,0.00014092737,0.00019969452,0.0113425255,0.00038982846,0.91571623,0.008613941,0.0018788897],"about_ca_topic_score_codex":0.00005817058,"about_ca_topic_score_gemma":0.000021400956,"teacher_disagreement_score":0.7605665,"about_ca_system_score_codex":0.000068468544,"about_ca_system_score_gemma":0.000097933,"threshold_uncertainty_score":0.999764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06246638,0.000104824685,0.59686166,0.000059522576,0.0015815552,0.0005173602,0.000046783665,0.00029163982,0.33807024],"genre_scores_gemma":[0.025361674,0.00004794643,0.9572919,0.00013399022,0.0002721096,0.00002439935,0.000024404273,0.000119668184,0.016723892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824554,0.00017285674,0.00047928412,0.00051974435,0.00022431978,0.0003582776],"domain_scores_gemma":[0.99804884,0.00017145176,0.00028571903,0.0012123566,0.00014019286,0.00014143546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085245376,0.00039953805,0.00062782463,0.00014355114,0.00007211501,0.00006186639,0.00045892812,0.0005793586,0.00021618871],"category_scores_gemma":[0.00026797515,0.00035079732,0.00032548938,0.00006731988,0.000060509625,0.00003294995,0.0011643934,0.00068507565,3.6024744e-7],"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.000034640365,0.00028754902,0.00049629126,0.0020151762,0.00039064366,0.000056385576,0.0017198919,0.00005247544,0.00032215915,0.9707477,0.0041852808,0.019691784],"study_design_scores_gemma":[0.0005479975,0.000057945897,0.000046022684,0.000769838,0.0005704172,0.000057398636,0.000689791,0.1595727,0.0011464685,0.82889616,0.005709666,0.0019355926],"about_ca_topic_score_codex":0.00054022874,"about_ca_topic_score_gemma":0.00078512233,"teacher_disagreement_score":0.36043024,"about_ca_system_score_codex":0.0002511485,"about_ca_system_score_gemma":0.00015459786,"threshold_uncertainty_score":0.9998944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7233223,0.00015363964,0.04366784,0.00066535623,0.00048428113,0.0002821457,0.0000024260735,0.00024623156,0.23117582],"genre_scores_gemma":[0.7270171,0.00002696993,0.22809952,0.0006420769,0.0001492851,0.000025969002,5.409966e-7,0.000042921314,0.043995604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924994,0.00003946533,0.00017279426,0.00017219383,0.0001296812,0.00023590222],"domain_scores_gemma":[0.9992612,0.0002986475,0.000030006493,0.00025161475,0.000039026192,0.00011950478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028274368,0.00011468698,0.00016491459,0.000080866135,0.00008093057,0.000058645302,0.00011185583,0.00004358195,0.0004689083],"category_scores_gemma":[0.0003351019,0.00009266643,0.0000752497,0.00015479546,0.000011220477,0.000060800172,0.000052852378,0.00007336274,0.0000019241957],"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.0000237296,0.00041093957,0.0067500826,0.00039139035,0.00020374502,0.000065784785,0.018854251,0.000010017785,0.06086552,0.6455674,0.16129524,0.105561905],"study_design_scores_gemma":[0.0020709045,0.00050629064,0.0006662686,0.00037184855,0.0001513625,0.00005413346,0.004861666,0.006059273,0.2106833,0.13470158,0.6372571,0.002616312],"about_ca_topic_score_codex":0.000023305814,"about_ca_topic_score_gemma":0.000027450447,"teacher_disagreement_score":0.5108658,"about_ca_system_score_codex":0.000022613449,"about_ca_system_score_gemma":0.0000025508923,"threshold_uncertainty_score":0.5134217},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24986073,0.00110832,0.15128595,0.0037929716,0.0008775039,0.0017344498,0.00002182071,0.00008391499,0.5912343],"genre_scores_gemma":[0.869052,0.00014418899,0.08660667,0.00047586314,0.0001392269,0.000024164361,0.0000054572142,0.000023106595,0.04352934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998791,0.0005665904,0.0003089201,0.00011260701,0.00012840718,0.0000925256],"domain_scores_gemma":[0.9982739,0.0011638763,0.00012089851,0.0003830139,0.000038275724,0.000020043411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037602496,0.00005832946,0.00010980036,0.000048630693,0.000017647617,0.000009662293,0.00013785939,0.000042840937,0.000015202653],"category_scores_gemma":[0.0032680384,0.000035780373,0.000046084435,0.00013669532,0.000024609453,0.00005205911,0.000008797681,0.00007053924,1.8791867e-7],"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.000024030238,0.000041693802,0.000010713687,0.000013188417,0.000004918394,8.2541413e-7,0.0027730796,5.7388155e-7,0.0006350344,0.98532456,0.007968272,0.0032031117],"study_design_scores_gemma":[0.00043095014,0.000024242932,0.00013389,0.000019573257,0.000012929523,0.0000026179198,0.0039901473,0.0000084298745,0.014985214,0.97564995,0.004683373,0.000058692724],"about_ca_topic_score_codex":0.000017270575,"about_ca_topic_score_gemma":0.000033952627,"teacher_disagreement_score":0.6191912,"about_ca_system_score_codex":0.000012541907,"about_ca_system_score_gemma":0.000032711516,"threshold_uncertainty_score":0.39123833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025216497,0.000046239773,0.97374654,0.00038735557,0.00003942579,0.00027245286,0.000035809662,0.0000028828883,0.00025282532],"genre_scores_gemma":[0.71051884,0.00005035877,0.28912807,0.00003934308,0.00014244446,0.000012674212,0.0000019741992,0.000016143753,0.00009015685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988947,0.00021129638,0.0004515624,0.000094601506,0.00023943136,0.00010843931],"domain_scores_gemma":[0.9959664,0.0031442577,0.00044409203,0.00015068929,0.0002569011,0.00003768975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010238012,0.000086894324,0.0003005045,0.000038084763,0.00002763798,0.000016209164,0.000112474394,0.00005061739,0.000001309237],"category_scores_gemma":[0.0007663394,0.00004813058,0.00005956183,0.000087900866,0.000071535476,0.00024006126,0.000018969007,0.00008816838,1.6171322e-8],"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.0004913807,0.00032021396,0.00010072541,0.00070653536,0.00008689107,0.00001262326,0.002827334,0.00007544484,0.008977059,0.8990077,0.0025765272,0.08481762],"study_design_scores_gemma":[0.0011091284,0.00020325313,0.0002567194,0.00023523498,0.00015708792,0.000029851599,0.00022917932,0.040411673,0.0017958332,0.95542395,0.00006081913,0.00008724058],"about_ca_topic_score_codex":0.0000056616796,"about_ca_topic_score_gemma":0.00000104119,"teacher_disagreement_score":0.6853023,"about_ca_system_score_codex":0.000015815045,"about_ca_system_score_gemma":0.000031281135,"threshold_uncertainty_score":0.19627081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08505029,0.00039329272,0.91124856,0.00012566589,0.0004733017,0.00006776381,0.0021933638,0.0000047454523,0.00044298253],"genre_scores_gemma":[0.21808727,0.000057373632,0.7813322,0.000029809991,0.0002619315,9.0755844e-7,0.000020288744,0.000021519263,0.00018869292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984569,0.00011198866,0.0007082264,0.000101555735,0.00024950155,0.00037184986],"domain_scores_gemma":[0.99778336,0.0003274938,0.00041958207,0.00015543748,0.0006244195,0.0006897292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060381985,0.00014878114,0.00045906156,0.000271686,0.00019249797,0.0000222254,0.00021270389,0.000078788675,0.00009901622],"category_scores_gemma":[0.0016765437,0.000141674,0.00013424557,0.00020833423,0.00021967842,0.00008128808,0.000014656429,0.00026966035,9.996607e-8],"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.00009144593,0.0002468949,0.01254412,0.00068697246,0.0010677539,0.0055061774,0.012875351,0.0029742408,0.0013632458,0.61575854,0.32851693,0.018368319],"study_design_scores_gemma":[0.017090783,0.005611602,0.0131951915,0.003036597,0.0040046754,0.022797912,0.02481069,0.19714764,0.06628799,0.2776954,0.36079687,0.007524664],"about_ca_topic_score_codex":0.0021128913,"about_ca_topic_score_gemma":0.0008939753,"teacher_disagreement_score":0.33806318,"about_ca_system_score_codex":0.00028627727,"about_ca_system_score_gemma":0.0011862317,"threshold_uncertainty_score":0.57772976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13348734,0.000001211704,0.84926015,0.00012024123,0.00020696901,0.00011323812,5.8728676e-7,0.00002611723,0.016784163],"genre_scores_gemma":[0.98989725,1.2495622e-7,0.008974884,0.000115727664,0.000030763975,0.0000096917165,8.99506e-7,0.0000060370166,0.0009646135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995207,0.00010021723,0.00012667787,0.00006884624,0.00012567002,0.000057898025],"domain_scores_gemma":[0.9992601,0.0003997683,0.00007767199,0.00021392449,0.00003326271,0.0000152461525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044303536,0.0000489278,0.000076305645,0.00002071201,0.00003796888,0.0000048590146,0.00004454922,0.000031135853,0.000039606497],"category_scores_gemma":[0.0009140505,0.000028739269,0.000046624722,0.00005901611,0.00001782411,0.000023867615,0.000012904893,0.00004308526,2.9833657e-7],"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.000020924039,0.000042914042,0.0000068201252,0.000035981655,0.000006001393,1.0561206e-8,0.0000639526,0.0033074631,0.00059789646,0.9725467,0.0021555754,0.021215774],"study_design_scores_gemma":[0.0004227739,0.0002489384,0.00042379706,0.00008561153,0.00006285847,0.0000011702169,0.00005361188,0.3293129,0.0057806703,0.6631714,0.00033141565,0.00010482594],"about_ca_topic_score_codex":0.0000039512906,"about_ca_topic_score_gemma":0.0000089035975,"teacher_disagreement_score":0.8564099,"about_ca_system_score_codex":0.000011453795,"about_ca_system_score_gemma":0.0000052102764,"threshold_uncertainty_score":0.11719534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012516686,0.00004532933,0.98567444,0.00014043307,0.000013810666,0.00012453101,0.000021970347,0.000011502817,0.0014513208],"genre_scores_gemma":[0.9913701,0.00002607493,0.0074466607,0.00009931788,0.000040006897,0.00011584995,0.0000040705854,0.0000070691995,0.00089087035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992999,0.000040614937,0.00022029517,0.00017988407,0.00015746045,0.00010188964],"domain_scores_gemma":[0.99892575,0.00041418595,0.00014191613,0.00039055312,0.0000776754,0.00004994938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014129007,0.00008880509,0.00023000706,0.00008090821,0.00018554025,0.0000042496017,0.00012826984,0.00003735803,0.000030210562],"category_scores_gemma":[0.00009477923,0.000058455447,0.00017111862,0.0006644392,0.00014534118,0.000011740623,0.00005169155,0.000056156332,1.04655335e-7],"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.000015434507,0.00023357896,0.00065708265,0.000028957116,0.00052728783,3.891982e-7,0.00048718523,0.0012316101,0.0017314196,0.9847509,0.00062435766,0.00971177],"study_design_scores_gemma":[0.0032896502,0.00058434316,0.022892678,0.00023945745,0.017002951,0.00006815748,0.0020295936,0.3269835,0.012534101,0.56701374,0.044544492,0.0028173195],"about_ca_topic_score_codex":0.0000868041,"about_ca_topic_score_gemma":0.000085541345,"teacher_disagreement_score":0.9788534,"about_ca_system_score_codex":0.000010284476,"about_ca_system_score_gemma":0.000023439898,"threshold_uncertainty_score":0.2383744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88776994,0.00008659737,0.10358689,0.0019850878,0.001740668,0.0032074174,0.00031387716,0.00006104413,0.0012484613],"genre_scores_gemma":[0.991979,4.8224615e-7,0.005601388,0.000660986,0.00067150395,0.00027474138,0.0000066709013,0.000044607372,0.0007606313],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784964,0.000480574,0.0006224907,0.00032268342,0.00035283025,0.0003717646],"domain_scores_gemma":[0.99762845,0.0010914023,0.0003613147,0.00075739285,0.00011449611,0.00004696788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495044,0.00022899255,0.0005521621,0.000055130426,0.000100529556,0.00003636674,0.00027637562,0.00010549035,0.000015856054],"category_scores_gemma":[0.00025470517,0.00015622939,0.00039332508,0.00008815902,0.00006401302,0.000045242028,0.000032699314,0.00015476174,2.62444e-7],"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.001517376,0.00064376905,0.006991091,0.002242269,0.00036089646,0.000010003926,0.0008045345,0.00061458827,0.9320736,0.021965845,0.031257585,0.0015184327],"study_design_scores_gemma":[0.07478367,0.0020782931,0.0064675026,0.0038548138,0.0022289208,0.00008711154,0.0014462462,0.4468541,0.17962578,0.0035569957,0.27365822,0.0053583374],"about_ca_topic_score_codex":0.00039687485,"about_ca_topic_score_gemma":0.00011357233,"teacher_disagreement_score":0.75244784,"about_ca_system_score_codex":0.00009531483,"about_ca_system_score_gemma":0.000032029817,"threshold_uncertainty_score":0.63708496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046666887,0.000023885937,0.9520424,0.000054062108,0.00019317678,0.0005568381,0.0000017661179,0.00004775539,0.00041322992],"genre_scores_gemma":[0.4313803,0.000009911906,0.56832516,0.00008757415,0.000039732735,0.00002502164,0.0000043686823,0.000015449199,0.00011249087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985272,0.00021990888,0.00035191866,0.0003846165,0.00026494678,0.00025135625],"domain_scores_gemma":[0.99844617,0.00071536645,0.00023959938,0.00020869258,0.0003317557,0.000058441485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540552,0.00013465538,0.00018251232,0.00021159154,0.0004047923,0.00008387995,0.0002189189,0.000052633717,0.0000032377068],"category_scores_gemma":[0.0007247469,0.000095706666,0.000024741727,0.0006731116,0.00017124788,0.00018560042,0.00007284851,0.000072186034,3.0094956e-8],"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.00016049625,0.00053830544,0.00444605,0.00039100857,0.000024370114,0.0000017978281,0.05531121,0.0006192799,0.001969955,0.1807114,0.00012886526,0.75569725],"study_design_scores_gemma":[0.00066729094,0.00012923668,0.0017160181,0.0001293281,0.000014434122,0.000008101711,0.00057066133,0.9870041,0.0033715975,0.0061283666,0.00009636924,0.00016451441],"about_ca_topic_score_codex":0.000032391952,"about_ca_topic_score_gemma":0.000017063514,"teacher_disagreement_score":0.9863848,"about_ca_system_score_codex":0.00004869685,"about_ca_system_score_gemma":0.00005391305,"threshold_uncertainty_score":0.39028046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47714436,0.00018542368,0.5127135,0.00013838109,0.00028530578,0.0002967179,0.000046208672,0.000086854736,0.009103265],"genre_scores_gemma":[0.48453727,0.000012249481,0.51419455,0.00011352729,0.00009143423,0.000004161339,0.0000016970746,0.000018351275,0.0010267635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911636,0.000062101295,0.00024445046,0.00019877167,0.00012403142,0.00025429725],"domain_scores_gemma":[0.99899703,0.00050807156,0.00009028182,0.0001856251,0.000106205014,0.00011278308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030176737,0.00013381403,0.00021135795,0.00003554089,0.00014574245,0.00010285369,0.000082697676,0.000044406657,0.00003065814],"category_scores_gemma":[0.00023514156,0.00011891514,0.000027214473,0.0000552907,0.000045918663,0.000032284934,0.00010851975,0.0001210098,6.123637e-7],"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.0000041538583,0.00004646242,0.0015098953,0.0002576193,0.000055050878,0.000024542793,0.0019899516,0.000018612365,0.00028444792,0.499785,0.02592351,0.47010073],"study_design_scores_gemma":[0.0012719037,0.00024292064,0.0100805275,0.00024792235,0.000114720744,0.00006636616,0.0018589568,0.69610214,0.00015591811,0.27028862,0.01849522,0.0010747482],"about_ca_topic_score_codex":0.00021973951,"about_ca_topic_score_gemma":0.000033119948,"teacher_disagreement_score":0.69608355,"about_ca_system_score_codex":0.000015101265,"about_ca_system_score_gemma":0.000015085211,"threshold_uncertainty_score":0.48492184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015352101,0.000076326956,0.9808771,0.0006314616,0.0003265301,0.00025483398,0.0023550522,0.000015500558,0.00011107795],"genre_scores_gemma":[0.4054681,0.000008649223,0.5937901,0.00043849077,0.00015705432,0.0000062321196,0.00005679789,0.000020955058,0.00005361472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772245,0.0001980422,0.0008224167,0.00021932325,0.0007822833,0.00025547776],"domain_scores_gemma":[0.98697037,0.01131012,0.0005478135,0.00009534626,0.00084239896,0.00023395846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063764275,0.000234018,0.00042503673,0.00031278084,0.0002985017,0.000073719806,0.0001211529,0.000087812274,0.00004216154],"category_scores_gemma":[0.0015432264,0.00019832258,0.00014201026,0.00018677588,0.00015918152,0.000040934607,0.00001784633,0.0003297985,2.0457205e-7],"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.00022502913,0.0010303844,0.00011753829,0.00015386009,0.00013975172,0.000087607536,0.00052200595,0.088093705,0.000003943334,0.85091203,0.039328337,0.019385803],"study_design_scores_gemma":[0.0015957436,0.0010413043,0.00070680236,0.00007643483,0.000064669846,0.0000307372,0.00011745868,0.7543796,0.000002856903,0.24143985,0.00036554507,0.00017903853],"about_ca_topic_score_codex":0.0000013939339,"about_ca_topic_score_gemma":0.0000024838557,"teacher_disagreement_score":0.6662859,"about_ca_system_score_codex":0.0000615677,"about_ca_system_score_gemma":0.000054618085,"threshold_uncertainty_score":0.808736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.136094,0.00006775236,0.8622694,0.000089673835,0.00014778106,0.00026302284,0.00033374625,0.000042191874,0.0006924303],"genre_scores_gemma":[0.29948655,0.000008768302,0.700153,0.000043895314,0.00017427628,0.000003265241,0.000031873984,0.000025512827,0.00007283941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988063,0.00005359506,0.00036179522,0.00026916064,0.00011307377,0.0003960718],"domain_scores_gemma":[0.9982883,0.0011138677,0.00018202893,0.00016839326,0.00013237206,0.00011508329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006500784,0.00018031884,0.00027704902,0.000050550923,0.0005717169,0.00009982102,0.00008971712,0.000062714214,0.0000038864473],"category_scores_gemma":[0.0009013771,0.00018241467,0.00006396726,0.000106560794,0.00006343075,0.00003736432,0.0001275035,0.00014280937,6.015229e-8],"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.000013053504,0.00007978403,0.00043893463,0.00047326135,0.0000619037,0.000010554673,0.0007763691,0.0003177253,0.0016586574,0.949137,0.00041485686,0.046617918],"study_design_scores_gemma":[0.004940894,0.00046133422,0.0009211272,0.0016838706,0.00054192595,0.00021419677,0.0029360452,0.7233084,0.0018136353,0.25622705,0.0050490326,0.0019025175],"about_ca_topic_score_codex":0.00002387886,"about_ca_topic_score_gemma":0.000024310786,"teacher_disagreement_score":0.72299063,"about_ca_system_score_codex":0.00007960703,"about_ca_system_score_gemma":0.00006221911,"threshold_uncertainty_score":0.74386543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7161266,0.0017629958,0.16921069,0.05555817,0.0004443526,0.006562305,0.00076104794,0.0001790138,0.049394805],"genre_scores_gemma":[0.7821131,0.00097221433,0.19493203,0.0035073077,0.0010532144,0.00033118727,0.000015472604,0.000048235637,0.017027287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942523,0.000010333376,0.00017017282,0.00015710996,0.00014526607,0.00009189369],"domain_scores_gemma":[0.99934953,0.00023974878,0.00009741389,0.00013246575,0.00013045878,0.000050404353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002319784,0.00008535638,0.00009923921,0.000033157616,0.0001176897,0.000035676196,0.00020003036,0.000038560032,0.0000110929395],"category_scores_gemma":[0.000226829,0.000049122373,0.000021329837,0.00014473422,0.000028738157,0.000034759087,0.000060353155,0.00010046084,4.1797364e-7],"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.00002314807,0.00010930299,0.00017491539,0.00004596126,0.000026689842,6.228162e-8,0.00096284074,0.000004958376,0.0010683041,0.9367854,0.021883199,0.0389152],"study_design_scores_gemma":[0.0011547554,0.00031784252,0.014115244,0.00034223255,0.00027199878,0.00002217656,0.0024949973,0.011564961,0.010688619,0.119742125,0.8386143,0.0006707489],"about_ca_topic_score_codex":0.0000015143443,"about_ca_topic_score_gemma":0.0000028398092,"teacher_disagreement_score":0.8170433,"about_ca_system_score_codex":0.000007731753,"about_ca_system_score_gemma":0.000009650568,"threshold_uncertainty_score":0.20031522},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.486182,0.000043760054,0.5117812,0.000023862325,0.00006514643,0.00031948087,7.8879987e-7,0.000036417277,0.0015472984],"genre_scores_gemma":[0.37262908,0.0000040318423,0.6272622,0.000038440416,0.000016462782,0.000029342882,0.000002093241,0.000008056266,0.000010285185],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503756,0.0031519074,0.00085498294,0.0005410487,0.00010986372,0.0003046705],"domain_scores_gemma":[0.9866844,0.012339686,0.00033756197,0.00046441215,0.000106890504,0.00006709463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019283755,0.00019706976,0.0010015438,0.00034169128,0.000090500966,0.000013275201,0.00015699018,0.00026489844,0.00003467063],"category_scores_gemma":[0.0030600221,0.00017574435,0.00015810759,0.0010221722,0.00020438909,0.000027854181,0.00018170604,0.00033858098,5.5093295e-8],"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.0002514635,0.0003348523,0.024889614,0.0005239658,0.0010639117,9.760225e-7,0.004521851,0.0028336733,0.025650201,0.23408341,0.000032121974,0.70581394],"study_design_scores_gemma":[0.0006942061,0.000085123495,0.031367037,0.000027091937,0.00082371425,0.0000056930717,0.0006691755,0.15414353,0.00946634,0.80228597,0.000055351822,0.0003767465],"about_ca_topic_score_codex":0.00030341922,"about_ca_topic_score_gemma":0.00007518456,"teacher_disagreement_score":0.70543724,"about_ca_system_score_codex":0.00004826069,"about_ca_system_score_gemma":0.000022606873,"threshold_uncertainty_score":0.7166647},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002152186,0.0006687341,0.95572513,0.0005369292,0.00028939097,0.00028116422,0.000014826635,0.00009502481,0.04023662],"genre_scores_gemma":[0.8797558,0.000072939045,0.09036372,0.0005509828,0.0005082037,0.00013582654,0.0000026932435,0.00009658346,0.028513277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987684,0.00010409001,0.00025840144,0.00021920541,0.00027926566,0.0003706682],"domain_scores_gemma":[0.9978498,0.0012903973,0.00008296741,0.0005855016,0.00008208651,0.00010921136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063227693,0.000163939,0.00019218479,0.00003472327,0.000296288,0.000054877823,0.0002809674,0.000072231174,0.00013103425],"category_scores_gemma":[0.0005765739,0.00010768756,0.000108244145,0.00010758287,0.000072480965,0.000078676894,0.00008088377,0.00018268422,0.0000020743055],"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.00001608524,0.00006969427,9.985404e-7,0.000027841721,0.00005716988,0.0000039895235,0.001653682,0.0011362412,0.00013374626,0.93120253,0.04405946,0.021638572],"study_design_scores_gemma":[0.0004033995,0.00005164233,0.0000010765209,0.0000323629,0.000054222848,0.000021293588,0.00025934697,0.58060133,0.000022864222,0.40566006,0.012624415,0.00026796787],"about_ca_topic_score_codex":0.000028070563,"about_ca_topic_score_gemma":0.000026349013,"teacher_disagreement_score":0.8776036,"about_ca_system_score_codex":0.00003279437,"about_ca_system_score_gemma":0.000010579069,"threshold_uncertainty_score":0.43913713},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13324572,0.00009385864,0.8657525,0.00043551886,0.000098799756,0.00006307507,0.0000574637,0.000008866391,0.0002442054],"genre_scores_gemma":[0.45880258,0.000011647898,0.5408974,0.00012186922,0.000094653005,8.2285976e-7,0.00000770612,0.000011737427,0.000051572162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985515,0.000101061516,0.00047980866,0.00011138151,0.0006002365,0.00015603883],"domain_scores_gemma":[0.99725413,0.0012606919,0.0003339904,0.00006035411,0.00075995736,0.00033085572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524216,0.00014745003,0.00035451233,0.00011959151,0.00006786632,0.000053639575,0.00009405854,0.000059651713,0.0000027642097],"category_scores_gemma":[0.00041478305,0.00010114139,0.000048605212,0.00013551195,0.00014267405,0.00008820045,0.000029264394,0.0002653561,4.2741476e-8],"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.00056249165,0.0002687446,0.0012857295,0.00009880475,0.00017399332,0.00016530862,0.0005456446,0.031106634,0.000015514095,0.94966143,0.013079501,0.0030362103],"study_design_scores_gemma":[0.0014286658,0.0005905012,0.0011020699,0.000045476558,0.0001005824,0.00034063874,0.0000810373,0.2705889,0.0000013641054,0.7250999,0.0004925016,0.00012835738],"about_ca_topic_score_codex":0.0000042775673,"about_ca_topic_score_gemma":0.000010825191,"teacher_disagreement_score":0.32555684,"about_ca_system_score_codex":0.000026054617,"about_ca_system_score_gemma":0.00013207573,"threshold_uncertainty_score":0.41244262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81688255,0.0012039202,0.17859966,0.00026065536,0.00023018713,0.002344526,0.00008492408,0.00005256445,0.00034104043],"genre_scores_gemma":[0.5181582,0.0009600224,0.4788937,0.00027035238,0.0003337045,0.0007080086,0.000027701668,0.00011452079,0.00053377385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848485,0.00007094138,0.0003435962,0.000455053,0.00018326205,0.00046231772],"domain_scores_gemma":[0.9984892,0.00095341506,0.00014487575,0.00019806229,0.00007489233,0.00013956097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088236935,0.00031161378,0.0006161291,0.00018761655,0.0001850159,0.00008850775,0.00010947965,0.00015728462,0.0000044987637],"category_scores_gemma":[0.00019469768,0.00022721768,0.00011586767,0.00013470948,0.00008310651,0.00010206251,0.000057238907,0.00016315359,3.1922203e-9],"study_design_candidate":"design_other","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.01590875,0.00018642512,0.0062912568,0.0021686407,0.0006047771,0.00016184691,0.0045168754,0.00003784856,0.0014519695,0.026080638,0.0008323559,0.94175863],"study_design_scores_gemma":[0.2159594,0.0035961065,0.017295256,0.0011456887,0.0009934083,0.0015382628,0.0063537736,0.041891426,0.0034752202,0.68176776,0.022240397,0.0037433251],"about_ca_topic_score_codex":0.000054898213,"about_ca_topic_score_gemma":0.00030486495,"teacher_disagreement_score":0.9380153,"about_ca_system_score_codex":0.000028143426,"about_ca_system_score_gemma":0.00002860755,"threshold_uncertainty_score":0.9265668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008082172,0.00045746003,0.9854801,0.0005362079,0.000016461856,0.0014772222,0.00017462447,0.00003472504,0.003740998],"genre_scores_gemma":[0.99195147,0.00009722878,0.0043590707,0.00016093688,0.00007809944,0.0020601032,0.000009977507,0.000023465023,0.0012596787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989868,0.000039938674,0.00037473615,0.00028328595,0.0001239273,0.000191321],"domain_scores_gemma":[0.997691,0.0011738748,0.00018042227,0.0005846673,0.00027162876,0.00009845284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051702047,0.00017127363,0.00028417842,0.00015406287,0.00019936486,0.000016838057,0.00035416018,0.000054645465,0.000061851504],"category_scores_gemma":[0.00024189451,0.000113577444,0.00005794505,0.0014418165,0.00015447226,0.00003090627,0.000052039577,0.00010050163,0.0000011439727],"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.00013919,0.00078636495,0.000016855522,0.0015275805,0.00016134368,1.2710281e-7,0.0030865509,0.00019682372,0.0014932924,0.560739,0.0010685177,0.43078437],"study_design_scores_gemma":[0.0030888084,0.0018795576,0.0004230699,0.0009992355,0.00080551096,0.000053281383,0.009211945,0.009780922,0.026280712,0.71545935,0.22952664,0.002490953],"about_ca_topic_score_codex":0.000023578215,"about_ca_topic_score_gemma":0.000028083983,"teacher_disagreement_score":0.98386925,"about_ca_system_score_codex":0.000013745764,"about_ca_system_score_gemma":0.000087887856,"threshold_uncertainty_score":0.46315536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93151176,0.00029933781,0.064018026,0.000050230417,0.00017004379,0.0004560537,0.000009083119,0.00001567784,0.0034697934],"genre_scores_gemma":[0.7003861,0.000028509296,0.29940853,0.000018346069,0.0001174975,0.0000030581891,1.3387685e-7,0.000015596386,0.000022236238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781257,0.00006512965,0.0011338504,0.00023031567,0.00046459064,0.00029353416],"domain_scores_gemma":[0.99695927,0.0011395514,0.0009469415,0.00030636333,0.00044306336,0.00020480389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096956,0.0002104738,0.0007314171,0.00012355608,0.00006741998,0.000014070667,0.00019416073,0.00016435354,0.000008465266],"category_scores_gemma":[0.00057080766,0.00016732643,0.00018168362,0.00018199597,0.00021310995,0.00007603334,0.00009973631,0.0004536721,1.5825087e-8],"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.021110306,0.005701291,0.026938336,0.0063695344,0.0024050346,0.0003402429,0.029702606,0.0033843126,0.042051643,0.30041784,0.0020113417,0.5595675],"study_design_scores_gemma":[0.016607942,0.0044410634,0.02210148,0.0013653494,0.0015802567,0.0005025302,0.01632733,0.06790333,0.10217031,0.7610521,0.0031487027,0.002799612],"about_ca_topic_score_codex":0.000017435312,"about_ca_topic_score_gemma":0.00004185286,"teacher_disagreement_score":0.5567679,"about_ca_system_score_codex":0.00014447274,"about_ca_system_score_gemma":0.000094881645,"threshold_uncertainty_score":0.6823374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014980864,0.0016441261,0.9935439,0.0005369414,0.00004333432,0.0016099501,0.00012413882,0.00011674652,0.00088272645],"genre_scores_gemma":[0.96356165,0.000039280592,0.032265794,0.00010517044,0.00026700844,0.0032559827,0.000023681905,0.000050678376,0.00043075436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987933,0.000013470145,0.00031117714,0.00042648218,0.00012156648,0.0003339789],"domain_scores_gemma":[0.99719626,0.0018341044,0.00018514329,0.00031090295,0.0003307502,0.0001428423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002943913,0.00023205804,0.00032958464,0.00008405734,0.00041490456,0.000065908185,0.00021990076,0.00009524075,0.0000196367],"category_scores_gemma":[0.00071866467,0.0001997829,0.0000662325,0.0002951772,0.0001479325,0.000085278705,0.0000497099,0.00012487297,4.224548e-7],"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.00010084256,0.00067078223,0.0000018984603,0.0025526749,0.00026379357,4.45923e-7,0.007043246,0.0007188448,0.0020094481,0.9452044,0.00081864686,0.040615007],"study_design_scores_gemma":[0.00085087057,0.00029903807,7.9005633e-7,0.0003154871,0.00021480578,0.00002044555,0.0039377655,0.06758711,0.0005356845,0.9243489,0.0012217177,0.0006673807],"about_ca_topic_score_codex":0.0000069696066,"about_ca_topic_score_gemma":0.000029778383,"teacher_disagreement_score":0.96206355,"about_ca_system_score_codex":0.000031354804,"about_ca_system_score_gemma":0.00005227707,"threshold_uncertainty_score":0.814691},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071281265,0.0001053691,0.987938,0.0008389523,0.00007495052,0.0032596765,0.00005172199,0.000048569473,0.0005546584],"genre_scores_gemma":[0.51638037,0.0000036118186,0.4802695,0.00017438711,0.000084658044,0.002811277,0.000006958721,0.000034997098,0.00023422764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984576,0.00009362139,0.0003568164,0.00039383932,0.00035101586,0.00034711658],"domain_scores_gemma":[0.9983774,0.000593565,0.00012453765,0.0005907678,0.00020950203,0.000104237704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013072916,0.00021810041,0.00028796424,0.0002469173,0.00014182738,0.000050888324,0.00034778324,0.00007892081,0.0000021554258],"category_scores_gemma":[0.00031518727,0.00015542134,0.00007553218,0.00078810187,0.00004906955,0.00015553567,0.000040368715,0.000152587,3.2841172e-7],"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.0003457349,0.0005122178,0.000005399252,0.00035352982,0.00009027724,0.000018027144,0.01374765,0.34022108,0.0010305558,0.6293268,0.0010253524,0.013323336],"study_design_scores_gemma":[0.003766223,0.00084323436,0.000019172858,0.00023691497,0.00021092588,0.00003066814,0.00541427,0.75450575,0.0003605595,0.2332287,0.00048510454,0.0008984635],"about_ca_topic_score_codex":0.00016150667,"about_ca_topic_score_gemma":0.00039416697,"teacher_disagreement_score":0.50925225,"about_ca_system_score_codex":0.00017948971,"about_ca_system_score_gemma":0.00011106292,"threshold_uncertainty_score":0.63378984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288391,0.00085209304,0.015461419,0.00042172265,0.00014910378,0.00028744066,0.0000025933334,0.00008624012,0.05390029],"genre_scores_gemma":[0.9771364,0.000054695454,0.015536208,0.00011092179,0.000055610035,0.000012390623,0.0000023714103,0.000016925385,0.007074476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987778,0.000415569,0.00027886932,0.00027653412,0.000060377075,0.0001908654],"domain_scores_gemma":[0.9986136,0.0009896863,0.00006392821,0.00024051295,0.000034045028,0.000058247635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022108227,0.00014239529,0.0002124742,0.000033766846,0.00010718009,0.000032668784,0.0000615838,0.00032766833,0.000048801438],"category_scores_gemma":[0.0004047379,0.00010865494,0.00005806741,0.00005962509,0.0001462944,0.000049129416,0.00008344277,0.0003150441,1.2271535e-7],"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.000098508484,0.00009740377,0.0015797628,0.00029545673,0.00003996185,0.000008497342,0.0011343313,0.000004151061,0.000379965,0.97882384,0.0001579495,0.017380174],"study_design_scores_gemma":[0.00036764177,0.000055973025,0.00025691837,0.000050672137,0.000049251707,0.000033353797,0.00012714093,0.0001718192,0.00063479395,0.9972401,0.0008540978,0.00015819512],"about_ca_topic_score_codex":0.000015087754,"about_ca_topic_score_gemma":0.0000283108,"teacher_disagreement_score":0.048297305,"about_ca_system_score_codex":0.000009994742,"about_ca_system_score_gemma":0.000009066066,"threshold_uncertainty_score":0.44308197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96834993,0.00018546375,0.020042935,0.00006307112,0.0019665034,0.00015316813,0.000004389315,0.000019087536,0.00921542],"genre_scores_gemma":[0.96929765,0.00006795855,0.030052034,0.000014868076,0.00031681024,0.0000017146288,8.131565e-7,0.000022602439,0.00022557647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827147,0.00042639952,0.00063685805,0.000093353134,0.0004074179,0.00016448554],"domain_scores_gemma":[0.9975197,0.00066406705,0.0008690959,0.00019874326,0.0006514432,0.00009698429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017265205,0.00016161153,0.0005235708,0.0001528021,0.00011462343,0.000014764056,0.0001837395,0.000097686,0.000062449064],"category_scores_gemma":[0.00063416583,0.00011674405,0.000157812,0.00019878088,0.00040754626,0.0002903768,0.00002479512,0.00025364142,3.4139735e-8],"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.002275429,0.00018030543,0.0009330715,0.00006606991,0.0002253362,0.00013727217,0.0022359171,0.0000019896142,0.0037223934,0.98723406,0.00045555938,0.0025325834],"study_design_scores_gemma":[0.004965361,0.0026144825,0.00030337414,0.0003808678,0.0002174122,0.0017886602,0.001973761,0.000011140872,0.074789226,0.90958464,0.0030172847,0.00035377327],"about_ca_topic_score_codex":0.000001503045,"about_ca_topic_score_gemma":0.0000011312151,"teacher_disagreement_score":0.077649415,"about_ca_system_score_codex":0.000030589097,"about_ca_system_score_gemma":0.0001782213,"threshold_uncertainty_score":0.47606844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40874428,0.000097263786,0.5885156,0.00027037796,0.00033500974,0.0011347231,0.0001569343,0.00006955254,0.0006762594],"genre_scores_gemma":[0.98192286,0.000014466456,0.017192738,0.0000064740093,0.00049786014,0.00015013009,0.00011357625,0.00003279381,0.000069075606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99629176,0.0014243247,0.0006096325,0.00039226885,0.00069060404,0.00059141434],"domain_scores_gemma":[0.99485606,0.0031157513,0.00013723232,0.00054057303,0.0010597613,0.00029062352],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.009131362,0.0001770947,0.00038582017,0.0001892579,0.00022463503,0.00009116135,0.0004318429,0.00017116909,0.0000121881185],"category_scores_gemma":[0.012385681,0.00014756019,0.000110698275,0.0007607967,0.0002672042,0.00018227329,0.0000866197,0.00034700535,0.0000010384935],"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.0047099055,0.00057388627,0.0004984089,0.00072611653,0.000078660094,0.000037374273,0.0024340944,0.0006609505,0.03346396,0.5355871,0.0032376186,0.41799194],"study_design_scores_gemma":[0.00027309847,0.0039055466,0.000023989529,0.00016772748,0.00004359142,0.00000862983,0.0014021093,0.16849874,0.5727441,0.25133613,0.0012581319,0.00033823054],"about_ca_topic_score_codex":0.00038419786,"about_ca_topic_score_gemma":0.00015573879,"teacher_disagreement_score":0.5731786,"about_ca_system_score_codex":0.00011315131,"about_ca_system_score_gemma":0.00018652796,"threshold_uncertainty_score":0.9959334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49049965,0.00026353946,0.5068962,0.000090160494,0.00013212132,0.00042525207,0.0000625194,0.000009287085,0.001621261],"genre_scores_gemma":[0.78046364,0.000039952258,0.21934636,0.000047304107,0.000013107267,0.0000073008373,0.0000017900434,0.000012172579,0.000068402995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.0006004518,0.00031489902,0.0001816507,0.00018371713,0.00016347528],"domain_scores_gemma":[0.9947637,0.004801445,0.00015119303,0.00015263827,0.000088695764,0.000042330284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019251928,0.00012725477,0.00025966173,0.000057684632,0.00014117734,0.000024521709,0.00005669649,0.000042977696,0.000006642056],"category_scores_gemma":[0.002578179,0.000088622444,0.000022337494,0.00010237501,0.00007707953,0.000015747657,0.0000540938,0.00014653296,1.0845118e-8],"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.00005159491,0.00009081619,0.0006803967,0.0001552374,0.00004641076,0.000009539734,0.006417863,0.0004251515,0.00032258654,0.91819483,0.0006886946,0.07291687],"study_design_scores_gemma":[0.002629289,0.00016685014,0.0015550556,0.00038833875,0.000056648456,0.000008406141,0.002325832,0.7940826,0.00077837385,0.19763389,0.00013499481,0.00023975859],"about_ca_topic_score_codex":0.00004326514,"about_ca_topic_score_gemma":0.00001823052,"teacher_disagreement_score":0.7936574,"about_ca_system_score_codex":0.00001750091,"about_ca_system_score_gemma":0.000029313722,"threshold_uncertainty_score":0.3613918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.810384,0.00013212046,0.027819784,0.00030227558,0.00029605566,0.0018416058,0.00004664083,0.00014284064,0.15903471],"genre_scores_gemma":[0.683798,0.00002560748,0.315875,0.00006184266,0.000053234173,0.00012181303,0.0000051594047,0.000022811533,0.000036529353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980517,0.00012462663,0.0006975605,0.0004874629,0.00032211473,0.00031650942],"domain_scores_gemma":[0.9974433,0.0014306707,0.00021472013,0.0007742909,0.000054383683,0.00008260283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022677418,0.0002449375,0.00049675937,0.00007975166,0.000057403715,0.000012487315,0.0003065689,0.00017397072,0.000072768074],"category_scores_gemma":[0.00049912534,0.00021286395,0.00010871204,0.00025033916,0.0002133755,0.00012162919,0.00004915556,0.00055458484,4.8525845e-7],"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.0003296684,0.000583442,0.0007276293,0.0006886853,0.000013827689,0.0000019576776,0.002380201,0.001002325,0.0075668045,0.84244543,0.000038461698,0.14422157],"study_design_scores_gemma":[0.0011714766,0.00009343214,0.00012118413,0.00006440134,0.000021831307,0.000003178885,0.00021348118,0.0028378998,0.01053088,0.96530354,0.019296829,0.00034186046],"about_ca_topic_score_codex":0.000016834625,"about_ca_topic_score_gemma":0.00025481434,"teacher_disagreement_score":0.28805518,"about_ca_system_score_codex":0.000042020372,"about_ca_system_score_gemma":0.000052502146,"threshold_uncertainty_score":0.868034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94792837,0.0000608105,0.031634443,0.0024708933,0.00003485122,0.0021460273,0.000019470568,0.000045503108,0.015659634],"genre_scores_gemma":[0.97864187,0.000014116927,0.020690762,0.00044389334,0.000033625027,0.00010748926,0.0000023345601,0.0000099164345,0.000055990124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988862,0.000090768364,0.00048699236,0.00020037298,0.00015096518,0.00018469674],"domain_scores_gemma":[0.9976055,0.0010109518,0.000426673,0.0005633661,0.00035709506,0.00003642052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153382,0.0001283843,0.00035757505,0.000029393912,0.00005407564,0.0000066698153,0.00025403633,0.00009224003,0.0000064266737],"category_scores_gemma":[0.001060334,0.000085169224,0.00014408652,0.00015396466,0.00006861757,0.000043595606,0.000023346947,0.00009862982,3.809013e-8],"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.0031970814,0.00075963465,0.000065060645,0.0021112105,0.00008645558,1.3732935e-7,0.008446566,0.00009597038,0.01442978,0.8937205,0.0036368615,0.07345076],"study_design_scores_gemma":[0.00028536358,0.0002309416,0.00011052159,0.000029647157,0.00002963959,1.8525414e-7,0.000116619696,0.00017155042,0.1690111,0.82972085,0.00021427765,0.000079280675],"about_ca_topic_score_codex":0.0000073812384,"about_ca_topic_score_gemma":0.00000990368,"teacher_disagreement_score":0.15458132,"about_ca_system_score_codex":0.000007192472,"about_ca_system_score_gemma":0.00003867717,"threshold_uncertainty_score":0.34731004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005285985,0.032417204,0.79544055,0.0068176393,0.001103778,0.001298179,0.00021642186,0.00014435593,0.15727589],"genre_scores_gemma":[0.13728349,0.05417063,0.7998891,0.005388624,0.00031791272,0.00012775561,0.000028402148,0.0000619566,0.002732147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884576,0.00013024382,0.00032467712,0.0002209844,0.000345535,0.00013278675],"domain_scores_gemma":[0.99701685,0.0025645762,0.0000839868,0.00014403771,0.00009340913,0.00009717266],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00087200536,0.00010937832,0.00024402059,0.000047310703,0.000050311064,0.00004653927,0.00011301868,0.000030323663,0.00081498],"category_scores_gemma":[0.016934067,0.00008644909,0.000045782093,0.00010718147,0.000051336567,0.000046273348,0.000050997583,0.00013901987,0.0000021699348],"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.0000028501643,0.000068206646,0.00006138285,0.00067144947,0.000017574093,0.000008735597,0.000015395139,7.122596e-8,0.0000037756988,0.8025538,0.013004038,0.18359274],"study_design_scores_gemma":[0.0004568563,0.00013396787,0.00022392091,0.0038746274,0.00012745085,0.00005418842,0.000006529427,0.0072329943,0.000022190326,0.6889166,0.29858148,0.00036915916],"about_ca_topic_score_codex":0.0000036817653,"about_ca_topic_score_gemma":0.0000020038726,"teacher_disagreement_score":0.28557745,"about_ca_system_score_codex":0.00009232694,"about_ca_system_score_gemma":0.0000052360438,"threshold_uncertainty_score":0.9913467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11186572,0.0001975289,0.88371956,0.00008768745,0.000078091696,0.0005728182,0.000092623246,0.000044507775,0.0033414743],"genre_scores_gemma":[0.9582785,0.000044159922,0.03781909,0.0001233849,0.000072311894,0.000072944546,0.000011398819,0.00005355899,0.0035246925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809474,0.00014005761,0.0006440464,0.0003809274,0.0004087931,0.00033141536],"domain_scores_gemma":[0.997815,0.00074940856,0.00030511,0.0005276214,0.00044799174,0.00015487347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944314,0.00026513354,0.0005711467,0.00043705298,0.000063417014,0.000018259865,0.00029668427,0.0001087588,0.00024132532],"category_scores_gemma":[0.0018480604,0.0002347791,0.00010630804,0.0011956574,0.00007918507,0.00013206179,0.00009094396,0.00009795772,0.0000015614879],"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.0004114812,0.0008585147,0.000035571335,0.0029215545,0.00024965662,0.000008083616,0.008028386,0.8817405,0.0061388924,0.07706016,0.015358954,0.007188227],"study_design_scores_gemma":[0.0006102665,0.00048232413,0.0000029012144,0.00031513802,0.000104579565,0.0000038857,0.00011172681,0.97461724,0.0047260653,0.018586386,0.0000833765,0.00035612867],"about_ca_topic_score_codex":0.00002578928,"about_ca_topic_score_gemma":0.0000030948286,"teacher_disagreement_score":0.8464127,"about_ca_system_score_codex":0.000044789227,"about_ca_system_score_gemma":0.000050803388,"threshold_uncertainty_score":0.9574014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006006008,0.00056908536,0.9903812,0.000014555858,0.000016933762,0.0003566729,0.000050721294,0.00005801102,0.0025468098],"genre_scores_gemma":[0.69586045,0.000012370685,0.30373925,0.000017555298,0.000024045932,0.00027223717,0.000007982667,0.000015525524,0.000050621646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.000054519922,0.00034380885,0.00027340357,0.00007647004,0.00016697445],"domain_scores_gemma":[0.9974392,0.0016330295,0.00021408303,0.00038137438,0.00024149446,0.00009082012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005759127,0.00015738176,0.0004137006,0.0002047564,0.00011815152,0.000011286716,0.0001825804,0.000071646646,0.000020401238],"category_scores_gemma":[0.0007251719,0.00011944588,0.000109555265,0.00097565516,0.0001172816,0.00004556955,0.00007801045,0.00008622133,5.1382223e-8],"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.00011121418,0.0009993355,0.00038245803,0.0022500805,0.0035405133,4.8434686e-7,0.024260137,0.00006539631,0.010309582,0.7113088,0.000042662283,0.24672934],"study_design_scores_gemma":[0.0013781275,0.00019847315,0.00051110866,0.0002796778,0.0074008754,0.000018135757,0.018468013,0.08531762,0.03009684,0.8537366,0.0011592922,0.0014352769],"about_ca_topic_score_codex":0.000032587326,"about_ca_topic_score_gemma":0.000037953094,"teacher_disagreement_score":0.6898544,"about_ca_system_score_codex":0.0000085071015,"about_ca_system_score_gemma":0.000045195353,"threshold_uncertainty_score":0.48708618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026828665,0.00010591074,0.97032785,0.0006963335,0.000019275787,0.00017495446,0.0014996965,0.0000067143146,0.0003406185],"genre_scores_gemma":[0.91620034,0.000093548406,0.08348948,0.000022789704,0.00009386247,0.000035353696,0.00004022089,0.0000067433057,0.000017646129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989171,0.00011389869,0.0005789414,0.00010107856,0.00015240812,0.00013654184],"domain_scores_gemma":[0.9972694,0.001816941,0.000362052,0.00018279676,0.00024370445,0.00012512409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692702,0.00009565708,0.00025496737,0.000032158012,0.00028027841,0.000037915826,0.000114012764,0.000038372815,0.000012769524],"category_scores_gemma":[0.0010456167,0.00006249709,0.000056465866,0.00012967641,0.0002581482,0.000046249337,0.00005733263,0.00019020689,4.18046e-8],"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.000003961718,0.00009588361,0.00078513206,0.000073075455,0.00002593091,3.0945532e-7,0.000050614188,5.771502e-7,0.00021746945,0.979499,0.0007548733,0.018493192],"study_design_scores_gemma":[0.0011566129,0.00032834904,0.03521908,0.00020957635,0.0007119164,0.00028641996,0.001664733,0.005678479,0.0006067453,0.9012148,0.05256483,0.00035849994],"about_ca_topic_score_codex":0.000008094522,"about_ca_topic_score_gemma":0.000004794333,"teacher_disagreement_score":0.8893717,"about_ca_system_score_codex":0.000018204055,"about_ca_system_score_gemma":0.00002692784,"threshold_uncertainty_score":0.25485572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025863554,0.00003400259,0.9003016,0.00036357137,0.000041439922,0.00070345605,0.00014533276,0.00007261172,0.095751666],"genre_scores_gemma":[0.22212097,0.000013738383,0.77286416,0.00012706184,0.00014887442,0.000059113525,0.000047179572,0.000030498577,0.0045883795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891526,0.00005758742,0.0003547192,0.00020518311,0.00025705362,0.00021017996],"domain_scores_gemma":[0.9981357,0.0012549199,0.00011850227,0.0002815763,0.00011272005,0.00009658046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009334107,0.00010287211,0.00018216575,0.0000439993,0.00005885614,0.000009803883,0.00010026456,0.000047341357,0.000014198429],"category_scores_gemma":[0.000847873,0.00006209885,0.00002537821,0.0001375133,0.00012607536,0.000068859175,0.000027871121,0.00010806653,1.7943046e-7],"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.00038159033,0.00015866804,0.00019066407,0.00033239307,0.00004359112,0.000010674846,0.0005419789,0.000007860531,0.008406902,0.93252695,0.0023653354,0.05503341],"study_design_scores_gemma":[0.013069579,0.0021240043,0.009785321,0.00082056253,0.00073131965,0.000046826313,0.005096482,0.003830077,0.030025097,0.4345689,0.49758378,0.0023180454],"about_ca_topic_score_codex":0.000049712067,"about_ca_topic_score_gemma":0.00010205824,"teacher_disagreement_score":0.49795803,"about_ca_system_score_codex":0.00003132823,"about_ca_system_score_gemma":0.000036585603,"threshold_uncertainty_score":0.25323176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28105456,0.00004126804,0.71667385,0.000022381113,0.00009047847,0.00008714494,0.00001053552,0.000042856056,0.0019769447],"genre_scores_gemma":[0.54638016,0.000011620599,0.45334172,0.00006889886,0.00010211009,6.3847506e-7,0.0000042938277,0.000018735991,0.0000718036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893343,0.00012234256,0.0002451142,0.0002773001,0.00015936159,0.00026243977],"domain_scores_gemma":[0.99851155,0.001020205,0.00013333788,0.00015700932,0.00008236321,0.00009551714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388772,0.00017708592,0.000283907,0.000043679982,0.000252159,0.00011321929,0.00006387548,0.000047246765,0.0000029707144],"category_scores_gemma":[0.00022620898,0.00014701844,0.000016713824,0.00005805019,0.000111954745,0.000028963243,0.00013310542,0.00013916452,3.3502044e-8],"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.000036784448,0.000057768702,0.0025044323,0.0004229147,0.00006808444,0.000019069588,0.0025065467,0.000052996667,0.00019973426,0.3734208,0.0011932651,0.6195176],"study_design_scores_gemma":[0.0021299855,0.00053415506,0.0057313135,0.00034388757,0.00017008964,0.000104968865,0.0019646545,0.9160509,0.00018436863,0.06840111,0.003542712,0.0008418602],"about_ca_topic_score_codex":0.000033517572,"about_ca_topic_score_gemma":0.00002875428,"teacher_disagreement_score":0.9159979,"about_ca_system_score_codex":0.000008637554,"about_ca_system_score_gemma":0.000014276354,"threshold_uncertainty_score":0.5995238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14205202,0.00004499066,0.8484206,0.00009595636,0.00034638896,0.000074521355,0.00025507837,0.0000024753324,0.008707963],"genre_scores_gemma":[0.7909229,0.000021427079,0.20812611,0.000083291976,0.00009554394,5.806762e-7,0.0000050466365,0.000021596241,0.0007235296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987484,0.000109484885,0.00062635925,0.00007666587,0.00024089999,0.00019815493],"domain_scores_gemma":[0.9978692,0.0005113202,0.00048956944,0.00019427422,0.0005441423,0.0003914954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009099979,0.000103692226,0.00027828655,0.00022985208,0.000062868494,0.000039604263,0.00017063637,0.000066098684,0.00016795799],"category_scores_gemma":[0.0014544344,0.0000925705,0.000072330164,0.000109729575,0.0000740635,0.0000859017,0.0000045778247,0.00016698148,1.3031674e-7],"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.00007554441,0.00006697807,0.0024380153,0.000110057736,0.000083512714,0.0005393799,0.0013758178,0.0034080022,0.00008916835,0.93661773,0.041485973,0.013709804],"study_design_scores_gemma":[0.0010831484,0.000687454,0.00040042883,0.00023602943,0.00010619873,0.0002676071,0.00028940535,0.010805975,0.0013025778,0.9785624,0.0059714266,0.00028732282],"about_ca_topic_score_codex":0.00046664017,"about_ca_topic_score_gemma":0.002883988,"teacher_disagreement_score":0.6488708,"about_ca_system_score_codex":0.00011004219,"about_ca_system_score_gemma":0.0005311182,"threshold_uncertainty_score":0.37749153},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036436206,0.25356022,0.7384189,0.000050951563,0.000040167888,0.0010116748,0.006154153,0.000050927843,0.0006765977],"genre_scores_gemma":[0.000030373289,0.54310125,0.44840875,0.000022222708,0.000027201577,0.00007312811,0.008032342,0.00004187396,0.00026283323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965343,0.00074336096,0.0011810397,0.00079366856,0.0005291601,0.00021848007],"domain_scores_gemma":[0.99408776,0.0017204199,0.0013997662,0.0025525133,0.00011539932,0.00012417503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002195968,0.00047898668,0.0028704244,0.0006975227,0.00007774567,0.00009011002,0.0007671354,0.00019479386,0.000018331177],"category_scores_gemma":[0.00040991808,0.0003365033,0.00035277687,0.00089387875,0.00007934238,0.00019967405,0.00050887326,0.0003248921,1.4828524e-7],"study_design_candidate":"design_other","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.0000041103235,0.00015371112,0.000088522276,0.009254678,0.006014329,0.0000036075148,0.000053900665,0.00026065268,8.6260684e-8,0.004958437,0.0012007236,0.97800726],"study_design_scores_gemma":[0.00032601375,0.0001223026,0.000080812046,0.0071602385,0.045652058,0.0000057318634,0.000027940401,0.7463775,2.1572593e-7,0.0005677517,0.19907472,0.0006046662],"about_ca_topic_score_codex":0.00006421516,"about_ca_topic_score_gemma":0.000090749076,"teacher_disagreement_score":0.97740257,"about_ca_system_score_codex":0.00006096667,"about_ca_system_score_gemma":0.0001260079,"threshold_uncertainty_score":0.9999087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22700188,0.000016721091,0.76873446,0.001626589,0.00027884843,0.00162609,0.00044669653,0.00003100632,0.00023773644],"genre_scores_gemma":[0.18451768,0.00000971802,0.8140166,0.0006077828,0.00014739716,0.00016898161,0.00004350283,0.0000404969,0.000447838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979132,0.00035757295,0.00060277444,0.00033867132,0.0003595411,0.00042825495],"domain_scores_gemma":[0.99773395,0.00090764725,0.0003200654,0.0007153293,0.000236289,0.000086728185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751048,0.0002284849,0.00035604564,0.0000437539,0.0002471044,0.000016856544,0.00030277617,0.000091228416,0.000012054379],"category_scores_gemma":[0.0018396035,0.00016406328,0.00018484615,0.00016332691,0.00043726273,0.00005980931,0.000077618744,0.00017296454,3.3766685e-8],"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.00019384816,0.00028292515,0.0017897608,0.00094014907,0.0000786779,0.000004158103,0.003455054,0.000035864832,0.006994137,0.95680153,0.023303809,0.0061200843],"study_design_scores_gemma":[0.0021533116,0.00040315907,0.0028708808,0.00016414621,0.0002708929,0.000041233852,0.00008405073,0.009947385,0.040066183,0.93909776,0.004153819,0.0007471847],"about_ca_topic_score_codex":0.00003473789,"about_ca_topic_score_gemma":0.00028569746,"teacher_disagreement_score":0.04528217,"about_ca_system_score_codex":0.00016048638,"about_ca_system_score_gemma":0.00016680371,"threshold_uncertainty_score":0.66903067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16853218,0.000060196944,0.82861197,0.0005809583,0.000022452377,0.0003528119,0.000025838272,0.000016843067,0.0017967384],"genre_scores_gemma":[0.4068007,0.00006754706,0.58920914,0.00011335844,0.00054916076,0.0001456878,0.0000070027363,0.000034279226,0.0030731726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984471,0.00005481245,0.0008359267,0.0001781038,0.00027773637,0.00020627464],"domain_scores_gemma":[0.99615234,0.0022273674,0.0006041512,0.00033694154,0.00044365827,0.00023552637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024050546,0.00015914238,0.0008167897,0.00053710135,0.00014457274,0.0000673598,0.00024113459,0.00011953129,0.00017959857],"category_scores_gemma":[0.0013368428,0.00011267615,0.0005781375,0.00093198655,0.00010142092,0.000068907,0.0000438014,0.0002742687,5.267601e-7],"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.000069041635,0.0015523981,0.0014060757,0.0004447084,0.0025691527,0.0000041601197,0.00029969958,0.0000041196513,0.021733955,0.90874517,0.0034159836,0.059755534],"study_design_scores_gemma":[0.0027676832,0.0005128513,0.0018607371,0.00009521351,0.015190856,0.00027819746,0.00063388655,0.03677265,0.0050146864,0.88144255,0.054382417,0.0010482614],"about_ca_topic_score_codex":0.0000014824001,"about_ca_topic_score_gemma":0.000009128272,"teacher_disagreement_score":0.23940286,"about_ca_system_score_codex":0.000014240259,"about_ca_system_score_gemma":0.000032941993,"threshold_uncertainty_score":0.45948002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06476201,0.00008272879,0.9310781,0.000022040911,0.00007608564,0.00017400843,0.00004925569,0.000064117645,0.003691654],"genre_scores_gemma":[0.27737713,0.000013222408,0.7220798,0.000046800713,0.00010273778,0.0000024950798,0.0000034641496,0.000023441402,0.00035087546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894345,0.0000781176,0.0002364416,0.00025132968,0.00021358745,0.00027705793],"domain_scores_gemma":[0.99877506,0.0006583171,0.00014458277,0.00014239314,0.00017192107,0.000107717446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034484453,0.00017108186,0.00028741898,0.000054268952,0.00030662827,0.000030200348,0.00007594837,0.000039562095,0.000006004313],"category_scores_gemma":[0.00024550516,0.00013093954,0.000021891266,0.00012038647,0.00015961923,0.00003158637,0.00008420494,0.00015276605,9.479433e-8],"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.00009672727,0.0001747261,0.0024873402,0.00027570792,0.0002114663,0.0004895938,0.005340903,0.000032750682,0.00018185144,0.80323976,0.007786617,0.17968252],"study_design_scores_gemma":[0.005219639,0.0033775761,0.002161072,0.0007770792,0.0004409889,0.0020984155,0.0072463783,0.81645715,0.0020400484,0.15201479,0.005505188,0.002661697],"about_ca_topic_score_codex":0.00007264117,"about_ca_topic_score_gemma":0.000017841221,"teacher_disagreement_score":0.81642437,"about_ca_system_score_codex":0.000023043636,"about_ca_system_score_gemma":0.000051282666,"threshold_uncertainty_score":0.53395593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0911321,0.00015228326,0.90662396,0.0000896126,0.00007739158,0.00048415698,0.000032159798,0.00012743115,0.0012808852],"genre_scores_gemma":[0.775598,0.000019120589,0.22391263,0.00004168488,0.00003378928,0.000014758976,0.0002576167,0.000030020965,0.00009240242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811506,0.00042043018,0.00074518664,0.0002814349,0.00022665264,0.0002112233],"domain_scores_gemma":[0.99286747,0.0059184176,0.00026904026,0.0005821858,0.00030721506,0.00005566899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007222299,0.00020907061,0.00028412457,0.00028341296,0.00031436342,0.00009983531,0.00019812078,0.0001235986,0.0000106889565],"category_scores_gemma":[0.0006922804,0.00023235966,0.000043451433,0.000395491,0.000107296226,0.00019561104,0.00014391371,0.00021902494,6.149414e-7],"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.000023111812,0.00012623338,0.0021010987,0.000055831697,0.000010976319,0.0000012914851,0.0004455397,0.92697304,0.00009734864,0.03201211,0.000068514,0.03808488],"study_design_scores_gemma":[0.000752878,0.00003744069,0.0032714605,0.000042452437,0.000031632062,0.0000015144228,0.00008344866,0.91203356,0.0000151474715,0.08250877,0.0009999308,0.00022179338],"about_ca_topic_score_codex":0.00012564311,"about_ca_topic_score_gemma":0.00021605291,"teacher_disagreement_score":0.6844659,"about_ca_system_score_codex":0.00012615508,"about_ca_system_score_gemma":0.000029485827,"threshold_uncertainty_score":0.94753516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93768245,0.0049764477,0.023006998,0.00016249206,0.00020061326,0.0003010829,0.00003302056,0.0000999588,0.033536907],"genre_scores_gemma":[0.9313018,0.00016473696,0.06082956,0.00005112228,0.00022907199,0.000013231451,0.000008118975,0.000033026703,0.0073693595],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985394,0.00013812352,0.00043170466,0.0002860551,0.00031537365,0.0002893408],"domain_scores_gemma":[0.99866647,0.00059770234,0.00024217309,0.0003343334,0.0000786938,0.00008060438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088910037,0.00020196944,0.000416501,0.00036397454,0.000074861484,0.000023513607,0.0001554756,0.00012618581,0.00008154212],"category_scores_gemma":[0.00048012042,0.00017411483,0.00010259842,0.0004624639,0.00012042756,0.0000839753,0.00010901964,0.00013521432,1.2437256e-7],"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.00028692393,0.0018853103,0.17479654,0.0023708232,0.00027446685,0.00014273409,0.0013649596,0.0000050519025,0.01796466,0.24470912,0.083889216,0.47231022],"study_design_scores_gemma":[0.020680977,0.0018010924,0.35895848,0.0016880714,0.0013861805,0.00048431047,0.0042011268,0.0081445705,0.099028595,0.17199814,0.32542524,0.0062032207],"about_ca_topic_score_codex":0.00029432157,"about_ca_topic_score_gemma":0.00016717597,"teacher_disagreement_score":0.46610698,"about_ca_system_score_codex":0.000027861328,"about_ca_system_score_gemma":0.000029901465,"threshold_uncertainty_score":0.71001965},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043635216,0.048413545,0.025587818,0.0021994004,0.10441975,0.005165662,0.0015737218,0.0008786653,0.7681262],"genre_scores_gemma":[0.007272469,0.0027313947,0.10687281,0.0004895297,0.0043744054,0.00013690648,0.0002294558,0.0003584595,0.87753457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958529,0.00032610566,0.0010701778,0.0009990577,0.0009737744,0.00077798095],"domain_scores_gemma":[0.99605817,0.00091690477,0.0008905127,0.0013279484,0.00032488522,0.00048159095],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002062122,0.0008387846,0.0017395971,0.0015277681,0.0001678205,0.00009527205,0.0007690757,0.0015794814,0.00025075034],"category_scores_gemma":[0.003990414,0.00074981013,0.00036174207,0.001096873,0.00024450794,0.00011434615,0.0006280421,0.0021649543,7.0738486e-7],"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.000055147546,0.00020881112,0.00029091374,0.0014422999,0.00014701286,0.000040410654,0.0005172882,5.3287486e-8,0.0004451871,0.0018061923,0.94741124,0.047635466],"study_design_scores_gemma":[0.00085626217,0.00028595916,0.0010632742,0.000890097,0.0003337986,0.000050581806,0.0002839036,0.000116126896,0.0004540682,0.0026784877,0.99182236,0.001165081],"about_ca_topic_score_codex":0.00022595817,"about_ca_topic_score_gemma":0.0008958185,"teacher_disagreement_score":0.109408356,"about_ca_system_score_codex":0.00008213559,"about_ca_system_score_gemma":0.00032814345,"threshold_uncertainty_score":0.9997167},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70302045,0.00006342623,0.2922609,0.00017785677,0.00018036948,0.00014756148,0.0000039012957,0.000019990379,0.00412555],"genre_scores_gemma":[0.8980535,0.000017761142,0.10098395,0.000075638134,0.000568846,0.000002007928,2.2558574e-7,0.000030958374,0.00026711088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805504,0.00013364943,0.0008652355,0.00016208773,0.00047640206,0.00030756005],"domain_scores_gemma":[0.9968433,0.001908107,0.00037505938,0.00023069965,0.0003484088,0.00029444476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032136906,0.00020561827,0.00058499654,0.00006363102,0.00006936527,0.000039317474,0.00016549209,0.00011403147,0.00005906153],"category_scores_gemma":[0.0018376008,0.00013911311,0.00025625934,0.000113792776,0.00037712295,0.00012456565,0.000067979316,0.0003810374,0.0000011424202],"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.0001899956,0.000316414,0.000013179357,0.00019851701,0.000061635954,0.000055846624,0.00059585995,9.797163e-7,0.0012692756,0.99203706,0.0002483894,0.0050128694],"study_design_scores_gemma":[0.00072803383,0.00031719657,0.000016832422,0.00019222338,0.00013017762,0.00018921816,0.0002646785,0.013802578,0.0019914852,0.98198736,0.00020884804,0.0001713647],"about_ca_topic_score_codex":5.0350064e-7,"about_ca_topic_score_gemma":2.0645135e-7,"teacher_disagreement_score":0.19503304,"about_ca_system_score_codex":0.000031348372,"about_ca_system_score_gemma":0.000028405526,"threshold_uncertainty_score":0.5672868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950513,0.00004107539,0.019902987,0.00015763652,0.0001610461,0.00038183905,0.000006401204,0.000008298817,0.028827727],"genre_scores_gemma":[0.94141304,0.000012167022,0.058368765,0.00011951461,0.00003955119,0.000006740823,1.5430545e-7,0.0000124569015,0.000027592112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980879,0.00029379744,0.00077919255,0.0001462047,0.000496196,0.00019674031],"domain_scores_gemma":[0.9951238,0.0032678377,0.00076892617,0.00048107674,0.00026284799,0.00009552495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073106415,0.00014840197,0.00046979982,0.00013929368,0.000067367364,0.000013819736,0.00028124783,0.000048807302,0.000120121425],"category_scores_gemma":[0.005519801,0.00008583424,0.000253926,0.00039829113,0.00013537523,0.0000319205,0.00003062712,0.0004004145,1.2348357e-7],"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.00046144,0.00083009724,0.0005263409,0.00027714283,0.00014841877,0.00000557494,0.00034679633,0.00020685272,0.0013654024,0.9829672,0.0067311134,0.006133647],"study_design_scores_gemma":[0.0006719281,0.00026699263,0.00019519172,0.00003621119,0.00007618643,0.0000314774,0.00019164369,0.00002868314,0.047892094,0.9468125,0.0036622898,0.00013479279],"about_ca_topic_score_codex":0.0000022090253,"about_ca_topic_score_gemma":0.0000020802443,"teacher_disagreement_score":0.046526693,"about_ca_system_score_codex":0.000108093634,"about_ca_system_score_gemma":0.0001189602,"threshold_uncertainty_score":0.6608116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10413415,0.00019083424,0.8949464,0.00028477836,0.000062433406,0.000044222255,0.0000662048,0.0000035484268,0.00026741167],"genre_scores_gemma":[0.49150613,0.00003933818,0.5083071,0.00007982179,0.000049161263,1.37263e-7,0.0000017120464,0.00000298188,0.000013609423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893147,0.00009363394,0.0004973593,0.00006343063,0.00032765194,0.00008647561],"domain_scores_gemma":[0.99732065,0.0016842639,0.00038084888,0.00004083948,0.00047540406,0.00009800933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047959812,0.000083096704,0.00028754663,0.000105838604,0.000038168244,0.000011441136,0.00006726487,0.000042654956,0.000008886655],"category_scores_gemma":[0.00044616743,0.000062258165,0.000070192706,0.00010986913,0.000090109665,0.000042616826,0.000011251092,0.00014472574,9.723732e-9],"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.000114835915,0.00013650265,0.0002480379,0.000029311059,0.00005239222,0.000022148417,0.00017023527,0.00022238708,0.00006997374,0.9606035,0.0023337507,0.035996955],"study_design_scores_gemma":[0.000472597,0.0006655096,0.012610597,0.00004586666,0.000049600592,0.00007654084,0.00006158901,0.0037021195,0.000029262923,0.9817947,0.00042037189,0.00007125843],"about_ca_topic_score_codex":0.0000015545164,"about_ca_topic_score_gemma":0.0000015388521,"teacher_disagreement_score":0.387372,"about_ca_system_score_codex":0.0000070275,"about_ca_system_score_gemma":0.00004084712,"threshold_uncertainty_score":0.25388142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9598997,0.0002976738,0.003024221,0.0015964663,0.00027655685,0.0005589898,0.000005720378,0.000037588994,0.034303043],"genre_scores_gemma":[0.99764997,0.00009219455,0.0006582093,0.000296913,0.000019497043,0.00002379766,0.0000011969123,0.000012617849,0.0012456324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833804,0.00068363897,0.00035817976,0.00023546262,0.00020382441,0.00018086913],"domain_scores_gemma":[0.9953994,0.0037403088,0.00013431649,0.0006148043,0.000066010005,0.000045171342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004599884,0.00015545306,0.00024381628,0.000027085138,0.00030659503,0.00001278892,0.00024937894,0.00028620273,0.00009657355],"category_scores_gemma":[0.0013936337,0.00007393066,0.00013481731,0.00011992212,0.00039168957,0.000036584155,0.000112542526,0.0006675489,2.0023404e-7],"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.00018648183,0.00013305042,0.00028896597,0.00007653762,0.00008639112,0.0000038377093,0.005275617,0.000027243574,0.00008992921,0.99056304,0.00038997416,0.0028789244],"study_design_scores_gemma":[0.00027619122,0.00009613181,0.0002822351,0.000046560453,0.00004793728,0.000034382054,0.00042106546,0.00017904748,0.0010384849,0.99734205,0.00013165688,0.000104269384],"about_ca_topic_score_codex":0.000004673534,"about_ca_topic_score_gemma":0.000011269064,"teacher_disagreement_score":0.037750203,"about_ca_system_score_codex":0.000014305531,"about_ca_system_score_gemma":0.000028361657,"threshold_uncertainty_score":0.3014805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83727103,0.00011507344,0.15436651,0.00028359867,0.00007923757,0.00011061443,0.0000029280375,0.000010409023,0.007760608],"genre_scores_gemma":[0.6976444,0.000019909148,0.30223283,0.000016732149,0.000052365016,0.0000010395984,5.0089778e-8,0.00000606407,0.000026613307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979439,0.00018771389,0.00081752974,0.00015645553,0.0006379191,0.00025651022],"domain_scores_gemma":[0.99574226,0.0030563402,0.0006158787,0.0001942033,0.00020210847,0.00018921049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007794778,0.00015122864,0.0006137882,0.00010633025,0.00012036911,0.000047965572,0.00034917094,0.000070783906,0.00007755843],"category_scores_gemma":[0.005658349,0.00009271057,0.00013980917,0.00018919216,0.00071276014,0.00015887838,0.00010635256,0.0001632965,6.833484e-8],"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.00012264951,0.00096783054,0.0062679145,0.002121173,0.00012139093,0.000017474975,0.0025597075,0.000032039985,0.010279566,0.9251154,0.00036901713,0.05202583],"study_design_scores_gemma":[0.0008541015,0.001650842,0.0007231864,0.0006303294,0.0001938625,0.0004582771,0.0020953193,0.04784131,0.025992922,0.91901344,0.00018938063,0.00035702708],"about_ca_topic_score_codex":0.000004179968,"about_ca_topic_score_gemma":0.000008003313,"teacher_disagreement_score":0.14786632,"about_ca_system_score_codex":0.000028418071,"about_ca_system_score_gemma":0.00007049293,"threshold_uncertainty_score":0.6773981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95333564,0.00003112034,0.02810506,0.000010226538,0.00018597474,0.00019689834,0.0000059650533,0.000037252983,0.018091856],"genre_scores_gemma":[0.97431654,0.000017094742,0.02326463,0.000022768172,0.000060942926,0.00001648864,0.0000032996102,0.000012986539,0.0022852349],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99935234,0.0000674121,0.00019173986,0.00007974922,0.000134394,0.00017435732],"domain_scores_gemma":[0.9993716,0.0001524224,0.00008828667,0.00023995136,0.00006190577,0.00008581843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036629013,0.00009265041,0.00015799838,0.00004218538,0.000019792804,0.0000038915837,0.00007055112,0.000057143225,0.00058877206],"category_scores_gemma":[0.00019743475,0.00006490351,0.000116251525,0.000077640936,0.000018780118,0.000072270814,0.000020229134,0.000046635905,7.142453e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108056396,0.0018234653,0.61078364,0.00014529384,0.00009991362,0.0000025516538,0.0017396996,0.000020252111,0.016033381,0.3292046,0.025066188,0.014972964],"study_design_scores_gemma":[0.0051685814,0.00334766,0.80075544,0.00031909163,0.0008650935,0.00006476189,0.0014327489,0.004832881,0.16144755,0.01045992,0.008724818,0.002581432],"about_ca_topic_score_codex":0.00004055878,"about_ca_topic_score_gemma":0.000005357222,"teacher_disagreement_score":0.31874466,"about_ca_system_score_codex":0.000024480429,"about_ca_system_score_gemma":0.000015936706,"threshold_uncertainty_score":0.6446641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5435808,0.0005122927,0.38547218,0.000060577797,0.0008813834,0.00080100546,0.0001852576,0.00025802868,0.06824851],"genre_scores_gemma":[0.66456234,0.000027468855,0.32904285,0.000051740724,0.00012512058,0.000050510185,0.000042420495,0.000052071482,0.0060455035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979171,0.00015836366,0.0007791572,0.0004798571,0.00040460628,0.00026090804],"domain_scores_gemma":[0.99675965,0.0005667836,0.00061634975,0.0012329149,0.00067741994,0.00014689584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020210063,0.00033385537,0.0014109219,0.00034581064,0.000023152965,0.000037568734,0.00040312807,0.0003657009,0.00008621084],"category_scores_gemma":[0.0025468525,0.00027651375,0.0006318946,0.00034230176,0.000058715836,0.000021452794,0.0007757706,0.00035421137,6.0344355e-8],"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.0015976648,0.005320398,0.018470097,0.054585278,0.1511045,0.00043903798,0.03607446,0.003364338,0.16713399,0.23087236,0.07428201,0.25675586],"study_design_scores_gemma":[0.0014900224,0.0002318565,0.00016661035,0.0006348777,0.027636707,0.0000065438,0.0013513314,0.8900004,0.020873351,0.050740223,0.0046845777,0.0021834744],"about_ca_topic_score_codex":0.00019100463,"about_ca_topic_score_gemma":0.0003533274,"teacher_disagreement_score":0.8866361,"about_ca_system_score_codex":0.00018358095,"about_ca_system_score_gemma":0.00045533702,"threshold_uncertainty_score":0.9999687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017464347,0.0005653377,0.9784058,0.000056094694,0.000018791243,0.00046507586,0.000010583501,0.0000814445,0.0029325718],"genre_scores_gemma":[0.9877861,0.000016458993,0.011693142,0.000064530854,0.00003285343,0.00017608638,0.0000025691816,0.000023532088,0.00020470639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933046,0.000021461097,0.00015920284,0.0002601148,0.00006309564,0.00016564342],"domain_scores_gemma":[0.9987856,0.00078594714,0.000063956046,0.00019024705,0.000084198306,0.000090062036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021878231,0.00015127544,0.00017580134,0.00005363078,0.00023340023,0.000042228934,0.000060470895,0.00005305458,0.0000065080585],"category_scores_gemma":[0.00043636916,0.00011646601,0.000019198678,0.00019057619,0.00006022358,0.000037914684,0.000027910848,0.000096191376,1.5360571e-7],"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.000015248519,0.00016735615,0.000005701153,0.0007656008,0.000075924996,6.1423697e-7,0.0020567412,0.00008617139,0.0015745836,0.96639144,0.000052107906,0.028808482],"study_design_scores_gemma":[0.00090612494,0.00013935968,0.0000045494503,0.00026012713,0.00006985066,0.000059164635,0.0025522718,0.008686755,0.0018982046,0.9816826,0.0031695927,0.0005714201],"about_ca_topic_score_codex":0.0000034887596,"about_ca_topic_score_gemma":0.000003739251,"teacher_disagreement_score":0.9703218,"about_ca_system_score_codex":0.000010446288,"about_ca_system_score_gemma":0.000034096116,"threshold_uncertainty_score":0.4749346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04006958,0.042150732,0.8144857,0.011316589,0.0054253805,0.0017573622,0.00011966178,0.00040068204,0.084274255],"genre_scores_gemma":[0.034994386,0.001262569,0.9197041,0.0004922376,0.00077482144,0.000025999421,0.00000948512,0.00013331755,0.042603105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99295515,0.0026201874,0.0020750691,0.0007959525,0.0005165367,0.0010371216],"domain_scores_gemma":[0.9917527,0.0042918436,0.0014825603,0.0015099834,0.00038897945,0.0005739779],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004126244,0.0008865093,0.001977512,0.0004019601,0.00015612249,0.00015844796,0.0008934046,0.00076140754,0.0011665433],"category_scores_gemma":[0.003178452,0.0009055608,0.0007517536,0.00065534475,0.00015180609,0.00036195686,0.00033745085,0.0013575188,0.0000049712894],"study_design_candidate":"design_other","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.00014705653,0.0005319563,0.00008150479,0.0016108609,0.00034921672,0.000096438394,0.008002271,0.0001703977,0.012801828,0.07691962,0.13954155,0.7597473],"study_design_scores_gemma":[0.0055145607,0.0025620025,0.0006393872,0.01602528,0.0016226167,0.0010992744,0.0077852076,0.30530724,0.08269682,0.07503518,0.49732903,0.0043834085],"about_ca_topic_score_codex":0.00049641094,"about_ca_topic_score_gemma":0.00008481175,"teacher_disagreement_score":0.7553639,"about_ca_system_score_codex":0.00033544216,"about_ca_system_score_gemma":0.00035803724,"threshold_uncertainty_score":0.9997465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.913632,0.00008698324,0.0076814885,0.0008904632,0.000061762556,0.0002925904,0.0000079213505,0.00004622665,0.07730058],"genre_scores_gemma":[0.90874296,0.00018726227,0.07367881,0.00017921219,0.000026236265,0.000022273716,8.055366e-7,0.00003453333,0.017127896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992939,0.00005621608,0.00016644888,0.0001433389,0.00017048327,0.00016961357],"domain_scores_gemma":[0.99890673,0.0005784593,0.00009015296,0.00031104454,0.00006028065,0.00005330878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000321066,0.00012208821,0.00018406559,0.000038907685,0.00009153346,0.00002202238,0.000105907886,0.00005243397,0.00003248672],"category_scores_gemma":[0.00009484868,0.00006340747,0.000040053033,0.000103302875,0.00011871507,0.000024651185,0.000040070343,0.00010042149,7.8489734e-8],"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.00015834336,0.0001995882,0.0026446448,0.00014327864,0.00013304106,0.000015835503,0.0005740376,0.0000029765754,0.00007191246,0.9439975,0.005522285,0.046536572],"study_design_scores_gemma":[0.020280963,0.011083993,0.017136527,0.0011359407,0.001013668,0.0005121817,0.011006626,0.07634767,0.012036872,0.7954971,0.049874783,0.0040736357],"about_ca_topic_score_codex":0.0000491578,"about_ca_topic_score_gemma":0.000797954,"teacher_disagreement_score":0.14850034,"about_ca_system_score_codex":0.000017267075,"about_ca_system_score_gemma":0.000004676467,"threshold_uncertainty_score":0.25856817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8806045,0.00010071722,0.011140359,0.0015111405,0.00012725244,0.00096917344,0.000016492557,0.00010763512,0.105422705],"genre_scores_gemma":[0.94489527,0.000086502914,0.053662457,0.000412234,0.0001282301,0.000089313166,0.0000017947376,0.000025040385,0.0006991387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00018382339,0.00048487895,0.0003129297,0.00031814908,0.00035770057],"domain_scores_gemma":[0.99760556,0.0008340555,0.00026262627,0.00105672,0.00015772683,0.000083282626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038453233,0.0001927922,0.00042006912,0.000035745117,0.0002519865,0.000011649459,0.00044470053,0.00009366473,0.000042869164],"category_scores_gemma":[0.0005868451,0.00013173657,0.00016840835,0.00024543353,0.00039918945,0.00004821148,0.00015440564,0.00021931723,4.3554854e-7],"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.00047079747,0.0004347732,0.00032961371,0.0004838498,0.000106493084,0.0000039845904,0.0050829,0.000026048401,0.003587021,0.9690741,0.0077283066,0.012672147],"study_design_scores_gemma":[0.0005058291,0.000094555326,0.0012574228,0.000046586305,0.000037838745,0.000016905216,0.00023773147,0.00040667754,0.032274053,0.954403,0.010346537,0.00037287132],"about_ca_topic_score_codex":0.000017840805,"about_ca_topic_score_gemma":0.000011973752,"teacher_disagreement_score":0.104723565,"about_ca_system_score_codex":0.000020989337,"about_ca_system_score_gemma":0.00007294416,"threshold_uncertainty_score":0.5372061},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3680313,0.000035004377,0.6281064,0.0012503661,0.00013113233,0.00041959248,0.00016683378,0.00011233539,0.0017470185],"genre_scores_gemma":[0.010819887,0.000026756097,0.98707217,0.0012817399,0.00011174986,0.000038848597,0.00002045559,0.00003744073,0.00059096306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982165,0.00022767614,0.00044134283,0.00044996606,0.00026266588,0.00040183443],"domain_scores_gemma":[0.99808997,0.0010928704,0.000082938466,0.00051998836,0.000065005835,0.00014920278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020938,0.00023560437,0.00034409206,0.00004221603,0.00015114475,0.00006998943,0.00016125025,0.00007694462,0.00029822194],"category_scores_gemma":[0.0008251536,0.00022136937,0.00006566886,0.00010517529,0.00021287291,0.00006549742,0.00004990561,0.00024610216,0.0000014786573],"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.00012781945,0.00024538214,0.002047272,0.0009915559,0.00010889656,0.000038823488,0.0024519279,0.000015986925,0.00433334,0.6364809,0.031042367,0.3221157],"study_design_scores_gemma":[0.00065992284,0.00008270791,0.0010485653,0.000065029526,0.00010644576,0.000021386822,0.00001929959,0.00078727084,0.00019483974,0.9659411,0.030521434,0.0005520186],"about_ca_topic_score_codex":0.000048673344,"about_ca_topic_score_gemma":0.00005009809,"teacher_disagreement_score":0.35896572,"about_ca_system_score_codex":0.000082810075,"about_ca_system_score_gemma":0.000029761719,"threshold_uncertainty_score":0.90271807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96603477,0.00026765393,0.00054890756,0.0023315342,0.000042226533,0.00080821203,0.000022549912,0.00007028632,0.029873865],"genre_scores_gemma":[0.9624584,0.000094853254,0.033824217,0.000103984574,0.00012699407,0.00006578411,0.000005548571,0.000030260955,0.0032900067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981003,0.0004447716,0.00049411855,0.00033964097,0.0003062688,0.00031492443],"domain_scores_gemma":[0.998043,0.00048875686,0.0002792607,0.000791973,0.0003279015,0.00006913058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040986324,0.0001984458,0.00042741175,0.00004590469,0.00011532554,0.000022357066,0.00029447535,0.0001032101,0.000018637957],"category_scores_gemma":[0.0008924244,0.00013012862,0.00014440101,0.00025115465,0.000324481,0.00010330391,0.000114710725,0.00016041099,8.463953e-8],"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.004215366,0.0047767395,0.071078934,0.013612255,0.00053845684,0.000046133184,0.009913674,0.000035374025,0.0120320525,0.69177574,0.10390636,0.088068895],"study_design_scores_gemma":[0.0007317213,0.00023417505,0.0090310965,0.00014349371,0.00009703364,0.000015333702,0.00029001254,0.0005879311,0.014492557,0.973026,0.0010384662,0.00031218954],"about_ca_topic_score_codex":0.0004758287,"about_ca_topic_score_gemma":0.000715408,"teacher_disagreement_score":0.28125024,"about_ca_system_score_codex":0.000017014221,"about_ca_system_score_gemma":0.000065609354,"threshold_uncertainty_score":0.5306491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06659641,0.0000148047,0.92896473,0.00075889303,0.000095526375,0.0005057427,0.00007554913,0.00007393376,0.0029144296],"genre_scores_gemma":[0.45935878,0.000021356107,0.5381335,0.00023422833,0.000081154765,0.00020023795,0.0000023290486,0.000054144955,0.0019142568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986115,0.00018517677,0.0004320641,0.00022698195,0.00026069733,0.00028357332],"domain_scores_gemma":[0.99527884,0.0035139814,0.0003488736,0.0006034834,0.0001699116,0.00008493113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008146501,0.0001881073,0.00049508037,0.000029530485,0.0003311062,0.000024855464,0.00038250073,0.000059659786,0.000048000686],"category_scores_gemma":[0.00048399836,0.00012895274,0.00085371686,0.00041976236,0.0004022826,0.000076668664,0.000031146672,0.00017757375,4.342564e-7],"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.00082988036,0.0068795895,0.0008936352,0.01032905,0.00458657,8.413949e-7,0.023308069,0.002956676,0.032341663,0.7401181,0.03962131,0.13813463],"study_design_scores_gemma":[0.0028638334,0.0012020117,0.00075434253,0.0008849529,0.0035128924,0.000055028435,0.015621551,0.1575023,0.022152383,0.7851037,0.008785887,0.0015611805],"about_ca_topic_score_codex":0.00003936911,"about_ca_topic_score_gemma":0.000009668693,"teacher_disagreement_score":0.39276236,"about_ca_system_score_codex":0.000044473214,"about_ca_system_score_gemma":0.000031840387,"threshold_uncertainty_score":0.525854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2262759,0.00009459973,0.7714603,0.00009214371,0.00006831351,0.0010588133,0.000011707855,0.00008182889,0.0008564175],"genre_scores_gemma":[0.25168258,0.0000018230894,0.74803597,0.00006434342,0.00008405804,0.000081026184,0.0000111129375,0.000016572829,0.000022541362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732774,0.0013777422,0.00034768865,0.0004970298,0.00011332711,0.0003364383],"domain_scores_gemma":[0.99168783,0.0076097264,0.00016905309,0.00040032237,0.00008642667,0.000046608413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070280675,0.000214012,0.00047814427,0.00007019557,0.00022792995,0.000019969852,0.00019500697,0.00018560549,0.0000044544395],"category_scores_gemma":[0.00034696638,0.00013746828,0.000053959197,0.00025720624,0.0002690874,0.000024914272,0.00007592421,0.00028324625,3.709938e-8],"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.003528342,0.0008774785,0.006549399,0.00044290308,0.00019178262,0.000007826222,0.0027390977,0.0016695108,0.0021417278,0.46469626,0.0004817501,0.5166739],"study_design_scores_gemma":[0.0067714667,0.0015991444,0.024412673,0.00009232078,0.00045367886,0.000044671862,0.004199441,0.3534873,0.0060267113,0.59948087,0.0024346688,0.0009970411],"about_ca_topic_score_codex":0.00034667345,"about_ca_topic_score_gemma":0.0004447274,"teacher_disagreement_score":0.51567686,"about_ca_system_score_codex":0.00006309908,"about_ca_system_score_gemma":0.000037600155,"threshold_uncertainty_score":0.56057936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45639434,0.00034398958,0.2213632,0.0021557573,0.00020196848,0.0009796082,0.000008235978,0.00007461298,0.31847826],"genre_scores_gemma":[0.9182141,0.0000148157515,0.08108231,0.000064055035,0.000038097252,0.00003601546,1.5791251e-7,0.000005147715,0.0005453061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901444,0.00012647684,0.00023973838,0.00017970835,0.00019985894,0.00023978094],"domain_scores_gemma":[0.99810123,0.0015005317,0.00014160287,0.00016681597,0.000021498883,0.000068304405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005780085,0.000089656874,0.00022334716,0.00008012917,0.000111228874,0.000041396437,0.00033064914,0.0000167986,0.000047981095],"category_scores_gemma":[0.00043217101,0.000058883765,0.00009406553,0.00009936741,0.00049495854,0.00015593963,0.000051004965,0.000055063665,2.3263705e-7],"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.000035101548,0.00014940162,0.015484318,0.0002977386,0.00010424822,0.0000020322946,0.0066879387,0.00016846064,0.16961834,0.5365853,0.00083334633,0.2700338],"study_design_scores_gemma":[0.0016845963,0.00050132803,0.005237975,0.0002175205,0.000051569143,0.000007110779,0.0014307657,0.053640988,0.004338048,0.9299965,0.0024802594,0.00041335507],"about_ca_topic_score_codex":0.00008784997,"about_ca_topic_score_gemma":0.000021499429,"teacher_disagreement_score":0.46181974,"about_ca_system_score_codex":0.0000021421856,"about_ca_system_score_gemma":0.000029419316,"threshold_uncertainty_score":0.24012102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.857923,0.00034876895,0.020717181,0.0033277336,0.00011982691,0.0032168364,0.000021405196,0.00015877043,0.114166506],"genre_scores_gemma":[0.53450596,0.000051346833,0.4646283,0.00028238172,0.000027723854,0.0002024636,0.0000018592225,0.000027511527,0.00027240746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981203,0.000529027,0.00052364246,0.00033701383,0.00018883063,0.00030119717],"domain_scores_gemma":[0.9964309,0.0021554069,0.00027399842,0.00080198055,0.00022864842,0.00010907792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053728,0.00020637692,0.00046412504,0.00003893613,0.00010687137,0.000022287239,0.0002747649,0.00013157217,0.00013967726],"category_scores_gemma":[0.00075750815,0.00013146052,0.00012610735,0.00020189305,0.00043467115,0.00006950264,0.00020123788,0.0002499632,6.070173e-7],"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.00028048916,0.0002316656,0.000063394014,0.00033218527,0.00026540147,3.4881853e-7,0.005631213,0.000021961172,0.0064217434,0.7190751,0.0047885487,0.26288795],"study_design_scores_gemma":[0.00022880589,0.00007756406,0.00056379224,0.000015937965,0.0000383561,0.0000020466105,0.0005993066,0.000578624,0.0112897195,0.98540574,0.0010399788,0.00016012788],"about_ca_topic_score_codex":0.00009799259,"about_ca_topic_score_gemma":0.000008029573,"teacher_disagreement_score":0.44391114,"about_ca_system_score_codex":0.000013186817,"about_ca_system_score_gemma":0.000034757264,"threshold_uncertainty_score":0.5360804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550839,0.0004412892,0.0151923,0.00068134244,0.0002773092,0.0019331841,0.0000798129,0.00011353371,0.026197294],"genre_scores_gemma":[0.9171808,0.00040739623,0.08150614,0.00036840505,0.00005248499,0.00030266514,0.000004480395,0.00003967628,0.00013799162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716127,0.00034627723,0.00076473266,0.00073178124,0.00041746988,0.00057846785],"domain_scores_gemma":[0.99643743,0.0017892646,0.00040082412,0.0011559792,0.00011715757,0.00009932816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030897,0.0004003951,0.0006680496,0.00010078819,0.00015937554,0.000039631588,0.0005389691,0.000110402536,0.000044868157],"category_scores_gemma":[0.0010194269,0.00028628984,0.00013543552,0.0006328049,0.0007393977,0.00016429056,0.000114495946,0.00046676034,0.0000014091373],"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.000433568,0.0005587875,0.00023662832,0.00038061503,0.000037590857,0.0000048844067,0.0016625989,0.010822761,0.0009302241,0.97612834,0.00005845158,0.008745577],"study_design_scores_gemma":[0.0010310232,0.0002306293,0.000037643487,0.00011428658,0.000016487777,0.0000011951705,0.0007278685,0.00047266096,0.044310194,0.9483437,0.004381696,0.0003326346],"about_ca_topic_score_codex":0.000084164305,"about_ca_topic_score_gemma":0.0002161296,"teacher_disagreement_score":0.06631384,"about_ca_system_score_codex":0.00036854038,"about_ca_system_score_gemma":0.00012840047,"threshold_uncertainty_score":0.99995893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044788956,0.0015657595,0.99143356,0.00019572057,0.00003690408,0.0009957136,0.00014280269,0.000106807034,0.0010438251],"genre_scores_gemma":[0.6081337,0.00010473059,0.38697302,0.00013490398,0.00039746004,0.0032914209,0.000033595414,0.00006409174,0.0008671326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989768,0.000015678339,0.00026531718,0.000357774,0.000097064556,0.0002873521],"domain_scores_gemma":[0.9981341,0.001014906,0.00014261642,0.00029084762,0.00030103046,0.000116499476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021895759,0.00021564976,0.0002986227,0.00007471542,0.0005259431,0.000038673064,0.00020709488,0.000072772316,0.000009287648],"category_scores_gemma":[0.00043710312,0.00017078697,0.00006874477,0.00029663532,0.00016636595,0.00011033186,0.00007061732,0.000097198674,1.6470794e-7],"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.00017056796,0.0009072729,0.000036934896,0.003248736,0.00049029494,0.000002460239,0.010899252,0.00018673064,0.004222542,0.8550706,0.0050336444,0.11973097],"study_design_scores_gemma":[0.0034800495,0.00057803676,0.000029556182,0.0002637555,0.00042765864,0.00028419116,0.014571452,0.05311274,0.015324776,0.88535696,0.024326757,0.0022440725],"about_ca_topic_score_codex":0.000008982441,"about_ca_topic_score_gemma":0.000012223421,"teacher_disagreement_score":0.60446054,"about_ca_system_score_codex":0.000025062325,"about_ca_system_score_gemma":0.00011083127,"threshold_uncertainty_score":0.696449},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026671754,0.0002148415,0.99246085,0.0010703665,0.00003643732,0.0024236778,0.00011033344,0.00019763091,0.00081870204],"genre_scores_gemma":[0.70896333,0.000010437088,0.28258607,0.00015258949,0.00021841859,0.0077173514,0.00004599622,0.000057386944,0.00024841932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987359,0.00001546934,0.00036247796,0.0004392495,0.000120913304,0.00032598662],"domain_scores_gemma":[0.9975166,0.00136674,0.00016082841,0.00032236654,0.00046738776,0.00016607535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036661874,0.00024233032,0.00026888927,0.00015545965,0.0007335685,0.00009884847,0.00020719925,0.00007587654,0.0000034808413],"category_scores_gemma":[0.0025391085,0.00020336083,0.000049736605,0.0007298239,0.000052131316,0.00011811271,0.000108043896,0.000102363585,2.9903893e-7],"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.00010225504,0.0008322298,0.0000033561428,0.00737803,0.00012761967,3.2887206e-7,0.017243095,0.00090938475,0.020807028,0.8805589,0.00014740058,0.07189037],"study_design_scores_gemma":[0.0014015043,0.00027049048,0.0000027034328,0.00072348345,0.00013915352,0.000024664327,0.00576976,0.004580175,0.004864983,0.97894126,0.0024454873,0.0008363113],"about_ca_topic_score_codex":0.0000118467215,"about_ca_topic_score_gemma":0.00014867687,"teacher_disagreement_score":0.70987475,"about_ca_system_score_codex":0.000058615773,"about_ca_system_score_gemma":0.00022039512,"threshold_uncertainty_score":0.82928145},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11333621,0.00014720816,0.20159279,0.009912614,0.00051950885,0.001194477,0.0001786049,0.00013458516,0.672984],"genre_scores_gemma":[0.93769217,0.000005791816,0.05957335,0.0010034902,0.000076628785,0.000043606433,0.0000114666955,0.000018692293,0.0015747934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986567,0.00034111386,0.00023458443,0.0001884705,0.0003135298,0.00026560054],"domain_scores_gemma":[0.9946595,0.0048986124,0.00004216472,0.00034176864,0.000026503703,0.000031467585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503752,0.00013630932,0.00014275947,0.000039549966,0.00017841498,0.000045017372,0.0001999939,0.00005503503,0.00003747204],"category_scores_gemma":[0.0018707465,0.00006951211,0.0000611418,0.00017897146,0.00013116683,0.00001934026,0.00002421347,0.00038086646,5.507811e-7],"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.000019942296,0.00007145713,0.000017118542,0.000009586121,0.0000058076503,0.000019539122,0.00015670805,0.00010244328,0.00020740894,0.96894103,0.028686712,0.0017622644],"study_design_scores_gemma":[0.00049036555,0.00008229948,0.0012307152,0.000041624953,0.000060386174,0.000011696028,0.0007787783,0.07999537,0.000030386778,0.9121666,0.004832915,0.00027886158],"about_ca_topic_score_codex":0.00012868902,"about_ca_topic_score_gemma":0.0003269468,"teacher_disagreement_score":0.82435596,"about_ca_system_score_codex":0.000052076608,"about_ca_system_score_gemma":0.00003277205,"threshold_uncertainty_score":0.28346217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11581356,0.00074649474,0.882283,0.0001632145,0.000011345879,0.0007637169,0.00005345707,0.000041074007,0.0001241864],"genre_scores_gemma":[0.80880123,0.00003307194,0.18992528,0.000028071025,0.00012133047,0.0009449052,0.000008302756,0.00002308274,0.00011469539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991045,0.000013187764,0.00025112377,0.00029951482,0.00007027603,0.00026137393],"domain_scores_gemma":[0.99903697,0.0005327127,0.00009902913,0.00014929251,0.000095378666,0.000086618165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034070533,0.00016097577,0.0002296068,0.00015530072,0.00017102918,0.000051675397,0.00009533506,0.00005152583,0.0000014902988],"category_scores_gemma":[0.00018527043,0.00013836724,0.00002994559,0.0002832397,0.000049694307,0.00014230126,0.00008647276,0.000088791894,2.0614305e-8],"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.00040345994,0.0009950344,0.000047440597,0.0054289456,0.00021676048,0.0000012347606,0.01618087,0.034781527,0.016393086,0.45498455,0.00037866304,0.47018844],"study_design_scores_gemma":[0.001804443,0.00013317424,0.0000132666855,0.00014595095,0.000064702384,0.000025131656,0.0013649068,0.74713546,0.004165272,0.24342468,0.0010891283,0.0006338673],"about_ca_topic_score_codex":0.000015336089,"about_ca_topic_score_gemma":0.00006262894,"teacher_disagreement_score":0.71235394,"about_ca_system_score_codex":0.000024523855,"about_ca_system_score_gemma":0.00004202795,"threshold_uncertainty_score":0.5642452},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9230034,0.000054614313,0.0013335199,0.00052221224,0.000016295182,0.0006303749,0.00007451283,0.000031465683,0.07433361],"genre_scores_gemma":[0.96789134,0.00006996184,0.030966738,0.00025082516,0.000028567647,0.00005006465,0.000009685069,0.000016511465,0.00071628304],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982943,0.00022928232,0.00060752506,0.0002874178,0.00031670852,0.00026477623],"domain_scores_gemma":[0.99732774,0.0009897857,0.00026278023,0.0011841033,0.00016934254,0.00006621854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045344513,0.00017055469,0.00070515927,0.00011138231,0.00006010489,0.000007581677,0.00041426063,0.00009063868,0.0011817631],"category_scores_gemma":[0.00022306263,0.00011624886,0.00042261046,0.0009627095,0.00024464054,0.000031247226,0.00008037588,0.00013006805,3.6572513e-7],"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.006226146,0.0039060048,0.004249484,0.00266206,0.010047714,0.0000024655824,0.018865492,0.0031543674,0.009085254,0.44309285,0.01502049,0.48368767],"study_design_scores_gemma":[0.0013384733,0.00031089727,0.0096839,0.00007946454,0.0032977976,0.000001467015,0.00093548273,0.00552139,0.05588131,0.9043581,0.01772046,0.00087125826],"about_ca_topic_score_codex":0.00008985603,"about_ca_topic_score_gemma":0.00007968281,"teacher_disagreement_score":0.4828164,"about_ca_system_score_codex":0.000012452419,"about_ca_system_score_gemma":0.000038650298,"threshold_uncertainty_score":0.9997313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032804977,0.00051556836,0.9321547,0.00084795436,0.0016693207,0.007443134,0.0006631584,0.00040907608,0.023492096],"genre_scores_gemma":[0.27020714,0.00029096584,0.7074411,0.00041035144,0.00067112455,0.0011219576,0.00006533203,0.0005705203,0.01922156],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99372584,0.0002553209,0.0019695824,0.001219469,0.0009808154,0.0018490009],"domain_scores_gemma":[0.9934178,0.0019533264,0.001369982,0.0019484046,0.00050486776,0.0008056298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004342352,0.0012066178,0.0017952282,0.0009942092,0.0006281609,0.00030244692,0.0011438135,0.00067787047,0.0004036018],"category_scores_gemma":[0.003958704,0.0011109115,0.0009388936,0.0013925822,0.00018029977,0.00033913247,0.00063895405,0.0005544511,0.000021357444],"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.0012196935,0.008585875,0.005687084,0.1484119,0.004152457,0.00018346576,0.39652622,0.00022954286,0.0012263083,0.34425265,0.036685627,0.052839197],"study_design_scores_gemma":[0.019709842,0.009503332,0.0015121654,0.027035194,0.008910099,0.0005314768,0.096422486,0.5437291,0.023426164,0.15624876,0.096353315,0.016618028],"about_ca_topic_score_codex":0.000120574645,"about_ca_topic_score_gemma":0.00062389654,"teacher_disagreement_score":0.5434996,"about_ca_system_score_codex":0.00038341602,"about_ca_system_score_gemma":0.000116265386,"threshold_uncertainty_score":0.9991341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8917561,0.00018885583,0.083052695,0.0017000792,0.00041370717,0.0007651106,0.000004324564,0.000027000016,0.02209213],"genre_scores_gemma":[0.9013206,0.000042725835,0.09818487,0.00013115296,0.00022373602,0.000016151504,3.741884e-7,0.000011245287,0.000069165566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988564,0.0001613494,0.00047241882,0.000109895074,0.00025708604,0.00014279697],"domain_scores_gemma":[0.9979732,0.0011727195,0.00039465335,0.00022312392,0.00014298644,0.00009329002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053351857,0.00010047313,0.0002526244,0.00001910704,0.0001414923,0.000045678615,0.00012582484,0.000056317705,0.0000068005875],"category_scores_gemma":[0.0004973224,0.000058137466,0.00007468704,0.00004123042,0.00012988788,0.00004248545,0.00004438227,0.00020743019,4.9377913e-8],"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.00042158074,0.0001876936,0.00028636647,0.00016769243,0.000102209866,0.00000217502,0.0008946506,0.000011454194,0.0015631514,0.74660265,0.0028821751,0.24687822],"study_design_scores_gemma":[0.0010416177,0.00026081665,0.0004300305,0.000024494388,0.0000635256,0.000032201104,0.00046018115,0.0006509136,0.0023271588,0.95127505,0.043314386,0.00011962604],"about_ca_topic_score_codex":0.0000012196236,"about_ca_topic_score_gemma":0.000009258054,"teacher_disagreement_score":0.2467586,"about_ca_system_score_codex":0.00006673785,"about_ca_system_score_gemma":0.000031971893,"threshold_uncertainty_score":0.23707771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961322,0.012648543,0.003688768,0.01014636,0.0013423376,0.0006860714,0.0000015669732,0.000019740244,0.010144577],"genre_scores_gemma":[0.9933316,0.0006060622,0.000064740154,0.00011379318,0.000102382626,0.000004594905,6.578676e-8,0.000023839812,0.005752886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980259,0.00049426814,0.00049509865,0.00006625848,0.0004930785,0.00042542623],"domain_scores_gemma":[0.9968634,0.0014220297,0.00065675256,0.0005571298,0.00045083757,0.000049830764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002810583,0.00014239499,0.00029109526,0.000028030356,0.00022573514,0.000034497232,0.001091027,0.000078119185,0.000020269663],"category_scores_gemma":[0.0008098973,0.00005510817,0.00027824176,0.0002691402,0.00013354348,0.00007193027,0.00010564332,0.0008785805,5.9393045e-7],"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.00002415254,0.00009318569,0.000052927397,0.000018816543,0.0001674234,8.982746e-7,0.0007976874,0.0000054863326,0.0022883748,0.9748819,0.019826062,0.0018430944],"study_design_scores_gemma":[0.00047401641,0.00020034683,0.000115209594,0.00003809605,0.00012989304,0.00016374358,0.0005577296,0.00021267659,0.0029387039,0.98042613,0.014645984,0.000097465985],"about_ca_topic_score_codex":0.000013126286,"about_ca_topic_score_gemma":0.0000058775845,"teacher_disagreement_score":0.0320096,"about_ca_system_score_codex":0.0001553105,"about_ca_system_score_gemma":0.0003026595,"threshold_uncertainty_score":0.3817044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026771713,0.00016639588,0.9952717,0.00012206491,0.00008074902,0.00043868303,0.000006705706,0.000016835367,0.0012197274],"genre_scores_gemma":[0.21266751,0.00011762772,0.7851022,0.00017127584,0.0006118842,0.00006771187,0.0000140892835,0.000036412937,0.0012113238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00012592995,0.00046829882,0.00009859315,0.00014046616,0.00011959906],"domain_scores_gemma":[0.9978829,0.000997256,0.0004823787,0.00013479406,0.0004110576,0.000091622365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427645,0.00009472885,0.00018852319,0.00013663541,0.00016373086,0.000029475415,0.00009548909,0.00007335388,0.000016784443],"category_scores_gemma":[0.00061282935,0.00007838343,0.00009821677,0.00013701105,0.0000385165,0.000104408304,0.0000135397,0.000089046756,1.9001845e-8],"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.0002688144,0.00014352701,0.000041142448,0.00006043715,0.00006417853,3.522044e-7,0.0003006449,0.0006783868,0.0008971355,0.96559155,0.00024675563,0.031707086],"study_design_scores_gemma":[0.008425003,0.00072206324,0.0006180404,0.0003167078,0.0014253879,0.0002520465,0.0044819387,0.061854556,0.0133988345,0.8868876,0.020471236,0.0011465824],"about_ca_topic_score_codex":1.236798e-7,"about_ca_topic_score_gemma":8.8292046e-7,"teacher_disagreement_score":0.21016951,"about_ca_system_score_codex":0.00002871722,"about_ca_system_score_gemma":0.000025159541,"threshold_uncertainty_score":0.31963834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18375148,0.000016110731,0.8147808,0.00001172989,0.00013831901,0.00013441964,0.000096502146,0.00004604902,0.0010246135],"genre_scores_gemma":[0.5293062,0.000002241859,0.47055978,0.000006786047,0.000045108514,0.0000029940259,0.00001295022,0.0000119378155,0.000052047322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.00007095529,0.0002267119,0.00020085703,0.000109210996,0.00022587435],"domain_scores_gemma":[0.99886936,0.00068459375,0.0001324654,0.00013655472,0.000087929024,0.000089112014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021365224,0.00014668479,0.000201966,0.000028405517,0.0002076408,0.000042876454,0.00006855079,0.000032877415,0.000010380597],"category_scores_gemma":[0.00031179583,0.000106605905,0.000022018008,0.00005034356,0.00005889548,0.000028701787,0.00010054826,0.00016871713,4.5023356e-8],"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.00011733298,0.0005099805,0.022481402,0.00047554338,0.00020200406,0.00012900954,0.00939573,0.0000035937976,0.0003214742,0.6204279,0.0010976763,0.34483835],"study_design_scores_gemma":[0.004599623,0.001531918,0.018542243,0.0012257276,0.00049315556,0.0003560335,0.009532029,0.8202724,0.005023808,0.13523889,0.0012078966,0.0019762793],"about_ca_topic_score_codex":0.000046432484,"about_ca_topic_score_gemma":0.00006332197,"teacher_disagreement_score":0.8202688,"about_ca_system_score_codex":0.000020557523,"about_ca_system_score_gemma":0.000020932803,"threshold_uncertainty_score":0.43472627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007257969,0.00008100194,0.9905249,0.001181014,0.00018232601,0.0002656485,0.000010990076,0.000017682134,0.00047845746],"genre_scores_gemma":[0.07870542,0.000011793177,0.9198783,0.0002260014,0.0011136874,0.000002831987,0.000002575616,0.00002456768,0.00003478846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986327,0.00016961359,0.0005556734,0.00009915079,0.00032072965,0.00022210089],"domain_scores_gemma":[0.9977155,0.0011143944,0.000478396,0.0002332721,0.00029043807,0.00016800863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012003538,0.00015934485,0.0004696285,0.000012706836,0.000049105543,0.00003530447,0.00033616714,0.00008819221,0.0000030184747],"category_scores_gemma":[0.00086060626,0.00010339812,0.000262576,0.00015286209,0.000057182784,0.00008032909,0.00005366278,0.00021187747,5.658313e-8],"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.0020644742,0.0013308648,0.00001614865,0.0007213011,0.0009393877,0.000013662734,0.0019434567,0.29241002,0.22977854,0.41086254,0.03529975,0.024619864],"study_design_scores_gemma":[0.012788605,0.0006612147,0.000005174989,0.000742832,0.0016594713,0.0006705516,0.0007326617,0.40057594,0.07553857,0.49743423,0.008323864,0.0008668883],"about_ca_topic_score_codex":0.000022970167,"about_ca_topic_score_gemma":4.768111e-7,"teacher_disagreement_score":0.15423998,"about_ca_system_score_codex":0.00020967657,"about_ca_system_score_gemma":0.00021010858,"threshold_uncertainty_score":0.42164528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6735899,0.000086929445,0.3078623,0.0010555288,0.0019102087,0.0049158046,0.0005000526,0.00009941224,0.009979875],"genre_scores_gemma":[0.89830005,0.00004502551,0.09963188,0.00069859816,0.00008324559,0.00013881481,8.636285e-7,0.000050662362,0.001050841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997526,0.00009317905,0.00086223934,0.00050090544,0.00058189605,0.000435795],"domain_scores_gemma":[0.995823,0.0011673747,0.00077327667,0.00040814068,0.0016635741,0.00016463072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018401098,0.0004007842,0.00083468633,0.00011018361,0.00027207364,0.00009091073,0.0006334839,0.00021390642,0.00002307422],"category_scores_gemma":[0.0034230575,0.00023189491,0.00034314895,0.0002614263,0.0004362959,0.00010206475,0.0000933903,0.00023897381,3.9257745e-7],"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.0018537197,0.00082746637,0.00010937306,0.000423577,0.00028194822,0.0000012772384,0.0010826322,0.000029062563,0.10776182,0.8386451,0.001473804,0.047510196],"study_design_scores_gemma":[0.014066967,0.0016792149,0.000085437874,0.0022536202,0.0006020932,0.000057115783,0.001288313,0.6993204,0.042333353,0.23557849,0.0017786309,0.00095640257],"about_ca_topic_score_codex":0.00001680562,"about_ca_topic_score_gemma":0.000011913311,"teacher_disagreement_score":0.6992913,"about_ca_system_score_codex":0.00005074504,"about_ca_system_score_gemma":0.00014768068,"threshold_uncertainty_score":0.94564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975598,0.0005910933,0.015938073,0.00041482356,0.00090635434,0.001584422,0.000088290355,0.000047661917,0.004831294],"genre_scores_gemma":[0.91503817,0.00046838558,0.08066928,0.00036361607,0.00039349953,0.00014864957,0.000013898378,0.000098758595,0.002805771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988031,0.00010543484,0.0003218844,0.00026383795,0.00023172144,0.00027403206],"domain_scores_gemma":[0.9986822,0.0006531857,0.00017972682,0.00032610557,0.00009449555,0.00006428432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005689278,0.00022344152,0.00044329595,0.00006220293,0.00023363189,0.000047811613,0.00018854457,0.00011874863,0.000013126765],"category_scores_gemma":[0.00031202528,0.00012736379,0.0002483181,0.00013437984,0.00014351051,0.000049820355,0.00006991361,0.00016563982,1.0403394e-8],"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.0040990873,0.00019573854,0.0021474527,0.0010263063,0.0005957334,0.00001610763,0.0016539496,0.000040474177,0.0020274601,0.5000281,0.0026951164,0.4854745],"study_design_scores_gemma":[0.042725496,0.0013392022,0.0044800933,0.0006814577,0.0007894751,0.00027193472,0.0016112848,0.035768636,0.012248429,0.83864623,0.05982487,0.0016129122],"about_ca_topic_score_codex":0.000032325457,"about_ca_topic_score_gemma":0.000052670475,"teacher_disagreement_score":0.4838616,"about_ca_system_score_codex":0.00003067555,"about_ca_system_score_gemma":0.000026876065,"threshold_uncertainty_score":0.51937443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4038319,0.00006415478,0.59387475,0.00008842476,0.00013489023,0.00065661623,0.0000027952142,0.000040478044,0.0013059938],"genre_scores_gemma":[0.47313842,0.0000049291743,0.5266603,0.00012538159,0.000020033662,0.00002758961,0.0000014279494,0.000006091369,0.000015820817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973666,0.00082446955,0.00056529604,0.0006563247,0.0001455087,0.00044177406],"domain_scores_gemma":[0.98767656,0.011575158,0.00021961493,0.00033929892,0.00010585238,0.0000835083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012549126,0.00022948367,0.00064366154,0.000189683,0.00019662066,0.000024028168,0.0002413132,0.00026522964,0.0000048836387],"category_scores_gemma":[0.0043627415,0.00021485968,0.00008103298,0.00055632,0.0002400144,0.000034200835,0.000093304996,0.00038072464,6.556045e-8],"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.0009048807,0.00033934435,0.010473033,0.00054143195,0.000047600017,0.0000035782436,0.0036161907,0.00030915998,0.004481918,0.8386026,0.0001295989,0.14055066],"study_design_scores_gemma":[0.001111662,0.0004399523,0.014023434,0.000033418175,0.000032322987,0.000010661448,0.0005088948,0.012432758,0.0030226232,0.96788937,0.0001404388,0.000354472],"about_ca_topic_score_codex":0.000030188981,"about_ca_topic_score_gemma":0.000028740847,"teacher_disagreement_score":0.14019619,"about_ca_system_score_codex":0.0000645145,"about_ca_system_score_gemma":0.00006611005,"threshold_uncertainty_score":0.87617236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026817028,0.00004686844,0.9757818,0.0004178873,0.0001061237,0.00146154,0.000053721586,0.00033911396,0.01911127],"genre_scores_gemma":[0.010253102,0.00002300346,0.9842969,0.00022254027,0.00039753,0.00054498255,0.0001866515,0.0000597353,0.0040155323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829507,0.00012931632,0.0005207548,0.00040827107,0.00030623158,0.00034036653],"domain_scores_gemma":[0.998314,0.00037143295,0.00021667543,0.0004701987,0.00048887235,0.00013878655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015635696,0.00025095002,0.0003544813,0.00012289354,0.00015692257,0.00010096238,0.00023435833,0.0001657124,0.00007096063],"category_scores_gemma":[0.001011762,0.00021038577,0.00008972362,0.00025551702,0.000033932203,0.00040961598,0.000031464468,0.00009821254,4.2875354e-7],"study_design_candidate":"design_other","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.00005073335,0.00047934413,0.0000035664907,0.0010296118,0.000040921994,7.1399865e-7,0.0013263685,0.00002509212,0.00074875227,0.047774453,0.005442651,0.9430778],"study_design_scores_gemma":[0.0017416149,0.00024984166,0.000004860023,0.00006581661,0.00012396422,0.0000126696295,0.0008309221,0.94318825,0.009486411,0.03149166,0.012298757,0.0005052541],"about_ca_topic_score_codex":0.000023016384,"about_ca_topic_score_gemma":0.00008697148,"teacher_disagreement_score":0.94316316,"about_ca_system_score_codex":0.00010822127,"about_ca_system_score_gemma":0.0001205874,"threshold_uncertainty_score":0.8579283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83164763,0.00079035806,0.16298132,0.0005773748,0.0005442583,0.00050077686,0.00003623672,0.000037947913,0.002884072],"genre_scores_gemma":[0.8732114,0.0005894402,0.106253386,0.0002164046,0.00090040726,0.00002422752,0.0000047884623,0.000073345,0.018726602],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984165,0.00025994622,0.0005351389,0.00014157087,0.00027290362,0.00037395424],"domain_scores_gemma":[0.99776906,0.0010295617,0.00044425103,0.0003123275,0.00032515326,0.00011966357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198595,0.00017996259,0.00048737144,0.00006919031,0.0003726398,0.000026036623,0.00042233395,0.00007156574,0.00016188907],"category_scores_gemma":[0.00044317174,0.000117960895,0.0002591646,0.00011440303,0.00019397886,0.0000934888,0.00006916264,0.00026378134,6.240331e-7],"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.0027332169,0.0019185267,0.014253375,0.0009774183,0.0020364402,0.00027338607,0.014830023,0.0010794232,0.07094146,0.08101633,0.78145355,0.028486839],"study_design_scores_gemma":[0.03628734,0.009126751,0.008146827,0.0024411436,0.002386011,0.018841604,0.011895874,0.35858196,0.17791538,0.11992649,0.24902159,0.0054290476],"about_ca_topic_score_codex":0.000010479352,"about_ca_topic_score_gemma":0.0000034119068,"teacher_disagreement_score":0.53243196,"about_ca_system_score_codex":0.00003385636,"about_ca_system_score_gemma":0.00012705055,"threshold_uncertainty_score":0.48103058},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0235213,0.00025229107,0.97404987,0.00023560782,0.00021782522,0.0004928559,0.000017267843,0.000019952804,0.0011930407],"genre_scores_gemma":[0.27233127,0.00063261983,0.7255515,0.00007808129,0.0004507093,0.000059901402,0.000028385644,0.00004783112,0.00081972906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990301,0.00010205004,0.0004506441,0.000108406864,0.00017321356,0.00013559009],"domain_scores_gemma":[0.9986474,0.00052142335,0.00039309237,0.00009734524,0.0002644861,0.0000762491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610087,0.000118639655,0.00029405003,0.000075942306,0.000114207636,0.000047143618,0.000049476843,0.00007694912,0.000040445237],"category_scores_gemma":[0.00026510676,0.000095033785,0.00007107047,0.000057995978,0.00003098342,0.00012677198,0.000010038868,0.00009263307,1.17127314e-7],"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.0009493953,0.00034159952,0.00020909424,0.0005898419,0.00022509445,0.0000044604653,0.0007950236,0.9318952,0.00072907354,0.054002497,0.0038179553,0.0064407466],"study_design_scores_gemma":[0.005869648,0.00029503243,0.0000037649427,0.0003759598,0.00013792957,0.00014102715,0.00020598044,0.984844,0.0032320854,0.0013534841,0.003364315,0.00017671786],"about_ca_topic_score_codex":8.483772e-7,"about_ca_topic_score_gemma":7.439146e-7,"teacher_disagreement_score":0.24880996,"about_ca_system_score_codex":0.00006566478,"about_ca_system_score_gemma":0.00003230736,"threshold_uncertainty_score":0.38753653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13470566,0.00097061426,0.85892165,0.0002621738,0.00030723252,0.00012243091,0.00008899599,0.000018343993,0.0046028765],"genre_scores_gemma":[0.45808497,0.002055462,0.53833765,0.00013337102,0.00040026012,0.000002282491,0.0000021781675,0.000037251717,0.0009465914],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.00012307307,0.00045632618,0.00010304843,0.00024335415,0.0002693839],"domain_scores_gemma":[0.99816775,0.0007208076,0.00040111333,0.0001104346,0.00037156494,0.00022831396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010074201,0.00014500206,0.00032839982,0.00013780053,0.000106716114,0.000066836656,0.00013114091,0.00006097089,0.000044206514],"category_scores_gemma":[0.0020239684,0.00012265336,0.00004161417,0.0001699689,0.00009260129,0.00010296354,0.00003059825,0.00021563016,4.802466e-8],"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.001194704,0.0007110594,0.11368785,0.004285415,0.0006609977,0.0076335073,0.016854595,0.000012710826,0.001879458,0.3226856,0.06967953,0.46071458],"study_design_scores_gemma":[0.011064282,0.0043125306,0.012665371,0.006076185,0.0017546142,0.03122428,0.0148836905,0.00304676,0.0027716258,0.84043926,0.06911275,0.0026486788],"about_ca_topic_score_codex":0.00000592326,"about_ca_topic_score_gemma":0.000022221422,"teacher_disagreement_score":0.51775366,"about_ca_system_score_codex":0.0000618077,"about_ca_system_score_gemma":0.00013952666,"threshold_uncertainty_score":0.5001659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14726146,0.000053251086,0.7742626,0.0005053297,0.0009340091,0.0006168498,0.000013464464,0.00020024223,0.076152764],"genre_scores_gemma":[0.099523716,0.000036329562,0.893987,0.00018241718,0.0005037267,0.00008158786,0.00004572268,0.00006407998,0.005575424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985923,0.00019788039,0.00042431027,0.00036631137,0.00019537145,0.00022382585],"domain_scores_gemma":[0.99865294,0.00043317338,0.00017928165,0.00061418954,0.00006207092,0.000058352798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364917,0.00023088274,0.00044316903,0.00016092668,0.000019310097,0.00004905757,0.00023604321,0.00032288302,0.00009214873],"category_scores_gemma":[0.0008997872,0.00020928521,0.00013008573,0.000057412908,0.000013985192,0.000026701024,0.0005349141,0.00047443385,4.9950205e-7],"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.00026417265,0.0014223362,0.0030673447,0.016723258,0.0004349633,0.00018284563,0.009715899,0.006814006,0.008568139,0.45518145,0.024749717,0.4728759],"study_design_scores_gemma":[0.0013935068,0.0000950676,0.00013449839,0.0016437906,0.00009679199,0.000008884428,0.00031973733,0.73584646,0.0066082007,0.22207558,0.030183356,0.0015941131],"about_ca_topic_score_codex":0.00013818796,"about_ca_topic_score_gemma":0.00021303666,"teacher_disagreement_score":0.72903246,"about_ca_system_score_codex":0.00008670234,"about_ca_system_score_gemma":0.00004380667,"threshold_uncertainty_score":0.85344034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16928072,0.0002474917,0.8252416,0.000010824024,0.00065268524,0.0006777142,0.000037901886,0.00014106592,0.0037099714],"genre_scores_gemma":[0.70369524,0.0003041867,0.292335,0.000023514536,0.00032083844,0.000002316073,0.00001580303,0.00006570184,0.003237408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794203,0.00010168975,0.00036714107,0.0008624771,0.000136353,0.0005903046],"domain_scores_gemma":[0.9960464,0.0017359117,0.0005204702,0.0008937993,0.0005141169,0.00028926408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007960053,0.0004985621,0.00066318177,0.0003023642,0.00025477703,0.0001747944,0.0007794577,0.00053158327,0.00010516556],"category_scores_gemma":[0.0011142336,0.000539003,0.00031030056,0.00044037425,0.00007131693,0.0005664751,0.0010156429,0.00049810903,7.154358e-7],"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.0022434467,0.0009844755,0.009528873,0.027936554,0.001566118,0.00029986404,0.0073681395,0.08181037,0.0028610223,0.80972546,0.030144872,0.025530802],"study_design_scores_gemma":[0.00195807,0.0001182523,0.000056437733,0.003062162,0.0014318154,0.000012004612,0.0036762704,0.093927726,0.0011433489,0.8884119,0.0042017694,0.0020002504],"about_ca_topic_score_codex":0.00025004026,"about_ca_topic_score_gemma":0.00029730969,"teacher_disagreement_score":0.5344145,"about_ca_system_score_codex":0.00029529113,"about_ca_system_score_gemma":0.0013855874,"threshold_uncertainty_score":0.99970615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32601842,0.00022244817,0.57037497,0.00009415329,0.0003246194,0.0010043413,0.000057635552,0.000106454965,0.10179698],"genre_scores_gemma":[0.7243056,0.000018226501,0.27548218,0.000048945403,0.000033102486,0.00007430355,0.000007146152,0.000009705985,0.00002076508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853146,0.00013646494,0.0005079725,0.0003389611,0.00024591558,0.00023925064],"domain_scores_gemma":[0.99770796,0.0015239548,0.00023575824,0.00039273102,0.000077975055,0.00006159942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017259627,0.00015103209,0.00038573044,0.00005871375,0.000038702434,0.00000493991,0.00021064932,0.00006867528,0.00008804864],"category_scores_gemma":[0.001576439,0.00013782836,0.000068775145,0.00022831565,0.00033298385,0.00008636814,0.00007004705,0.00015058657,2.1415539e-7],"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.000058145943,0.0001254053,0.004360998,0.00041904356,0.0000067791716,1.6345547e-7,0.00016376916,0.00017126564,0.0011349015,0.98005205,0.00006329592,0.013444208],"study_design_scores_gemma":[0.0004928252,0.00004338935,0.0004147935,0.00002406283,0.000010617335,9.1582604e-7,0.00011779419,0.0006296686,0.0070411484,0.9806913,0.010366729,0.00016673433],"about_ca_topic_score_codex":0.000017265666,"about_ca_topic_score_gemma":0.00009261103,"teacher_disagreement_score":0.3982872,"about_ca_system_score_codex":0.00007398584,"about_ca_system_score_gemma":0.000029655701,"threshold_uncertainty_score":0.5620478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98809487,0.00003876026,0.009125007,0.0009930569,0.000055765333,0.00059495284,0.000007109732,0.000021375481,0.0010691],"genre_scores_gemma":[0.9436932,0.000014312194,0.055980008,0.00009341457,0.000023910963,0.00018241415,0.000001914102,0.0000026094283,0.000008215029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923116,0.000023098155,0.00027815558,0.00010733928,0.00016998591,0.00019024161],"domain_scores_gemma":[0.99924016,0.00057035155,0.000043312746,0.00009728632,0.000024062714,0.000024811883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037630699,0.00008401934,0.00011870405,0.00008795713,0.00008180999,0.000045432498,0.00018474524,0.000038703623,0.0000010997553],"category_scores_gemma":[0.00095660257,0.00005662962,0.00003090885,0.00025008814,0.00008373797,0.0002644129,0.000032085838,0.000097877186,3.387124e-8],"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.000021376623,0.00011506689,0.00094555324,0.0003700799,0.000004401844,3.6984622e-7,0.009317211,0.19443849,0.00007459637,0.7909368,0.00002170867,0.0037543455],"study_design_scores_gemma":[0.0011405083,0.0001540635,0.0041839243,0.00013060047,0.000005132913,0.000014315899,0.0010432812,0.7555709,0.0003867571,0.23584178,0.0012337553,0.00029498577],"about_ca_topic_score_codex":0.000043473272,"about_ca_topic_score_gemma":0.00008375759,"teacher_disagreement_score":0.56113243,"about_ca_system_score_codex":0.00006503588,"about_ca_system_score_gemma":0.000046564495,"threshold_uncertainty_score":0.23092888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5275712,0.00006421452,0.47072136,0.00002592871,0.0003276041,0.000112339934,0.00007413271,0.000029507366,0.0010737336],"genre_scores_gemma":[0.511427,0.000009157909,0.48832795,0.00001887835,0.00011398103,0.0000013658889,0.000002550736,0.000019287807,0.000079839265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865925,0.00007516014,0.0004616062,0.00025487487,0.00023851912,0.00031061223],"domain_scores_gemma":[0.9984688,0.00069785846,0.00024477777,0.00026146806,0.00020078143,0.00012630508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791323,0.0001917432,0.00042735602,0.000093336865,0.00013899911,0.000049427596,0.00014939239,0.00009260619,0.000018046956],"category_scores_gemma":[0.00096217624,0.00017547794,0.0000637878,0.00011890495,0.00012308657,0.000027078826,0.00017748907,0.00030325574,3.411957e-8],"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.00007270997,0.00016007369,0.0010917243,0.00084300834,0.00018819013,0.000050942414,0.0037936459,0.00019289482,0.012072852,0.6370547,0.0013344431,0.3431448],"study_design_scores_gemma":[0.00081613247,0.000116028015,0.00052991346,0.00009578754,0.00010797935,0.000027447048,0.0010108396,0.98413414,0.0016481767,0.010615111,0.00050981273,0.00038863628],"about_ca_topic_score_codex":0.0002956309,"about_ca_topic_score_gemma":0.00007099527,"teacher_disagreement_score":0.98394126,"about_ca_system_score_codex":0.000014400277,"about_ca_system_score_gemma":0.000048483624,"threshold_uncertainty_score":0.71557826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4043755,0.000030801722,0.59433204,0.000088750036,0.00007556143,0.0005893231,0.00004090845,0.00008783259,0.00037928484],"genre_scores_gemma":[0.96593887,0.000036795605,0.03351171,0.000053860855,0.000009190793,0.00020862432,0.0000016571528,0.000026210704,0.00021310258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733967,0.00048292213,0.0010337068,0.0003747204,0.00045015165,0.00031880842],"domain_scores_gemma":[0.9929972,0.00568187,0.0003016813,0.00067825045,0.00023266513,0.00010831766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020721953,0.00026916695,0.0009976138,0.0009213016,0.0000727288,0.000028945873,0.00024606808,0.00014197441,0.0002420119],"category_scores_gemma":[0.001148838,0.0002277557,0.00035809167,0.0025539764,0.00007966326,0.00009612627,0.0000017472092,0.00017304969,3.6075073e-7],"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.0023579418,0.009534644,0.0025810173,0.0036750934,0.0058779637,0.0001487247,0.005657289,0.22408508,0.0025372405,0.002632489,0.00017254603,0.74073994],"study_design_scores_gemma":[0.0029212574,0.00017905979,0.0010461573,0.00037110457,0.0022704657,0.0000111732925,0.00029765262,0.98881114,0.0005917626,0.003103806,0.000050654493,0.0003457732],"about_ca_topic_score_codex":0.00010466244,"about_ca_topic_score_gemma":0.0025500606,"teacher_disagreement_score":0.76472604,"about_ca_system_score_codex":0.00013931833,"about_ca_system_score_gemma":0.00014519243,"threshold_uncertainty_score":0.9287608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08978488,0.000016488713,0.9086564,0.00013845232,0.00045321212,0.0004683652,0.00000488859,0.00022930377,0.000247998],"genre_scores_gemma":[0.88069695,0.000017288305,0.11889057,0.00010297017,0.00013544604,0.000038529626,0.00000813176,0.000029335111,0.00008076169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987278,0.00022621197,0.00035796908,0.00030309634,0.00019408822,0.00019085429],"domain_scores_gemma":[0.99809057,0.0011850446,0.00007526118,0.00041565666,0.00014886897,0.000084576364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004190869,0.00020636004,0.000280683,0.0001579952,0.00031890676,0.0001521555,0.00012903192,0.000116055475,0.0000075773605],"category_scores_gemma":[0.00003253476,0.00018167385,0.00009716894,0.00009947049,0.00001198899,0.00014990696,0.000008715184,0.0002772579,0.0000011135338],"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.00003588944,0.00009202503,0.0000040277846,0.00007407966,0.00004826267,3.3690483e-7,0.00047189175,0.96645516,0.00000916191,0.0026051681,0.000019771876,0.030184219],"study_design_scores_gemma":[0.00097207015,0.00010503876,0.0000028481927,0.00010240531,0.000044008815,0.0000037615637,0.00016237376,0.99266946,0.0000055197497,0.00567304,0.00006787187,0.00019157311],"about_ca_topic_score_codex":0.000054267344,"about_ca_topic_score_gemma":0.000006641483,"teacher_disagreement_score":0.7909121,"about_ca_system_score_codex":0.0000856834,"about_ca_system_score_gemma":0.000009793857,"threshold_uncertainty_score":0.7408445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021317597,0.00045570495,0.991588,0.003437447,0.00099211,0.0005061511,0.0007355589,0.000020051823,0.00013319441],"genre_scores_gemma":[0.030643754,0.00006398525,0.9675314,0.000598531,0.0007957929,0.000023174112,0.0000043572973,0.00005692779,0.00028211132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947593,0.0016545578,0.001779363,0.0003252066,0.0007922963,0.00068927964],"domain_scores_gemma":[0.950746,0.046943143,0.0009349091,0.00038478104,0.0006798537,0.00031130968],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008196622,0.00038823264,0.0012444711,0.000040679606,0.00043663802,0.000049673745,0.00075935177,0.000277663,0.0001588979],"category_scores_gemma":[0.023259588,0.00021285466,0.00084979925,0.00025385545,0.0018187367,0.00009725053,0.0001357293,0.0009470602,1.7182262e-7],"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.0020177804,0.00082869286,0.00001577328,0.0005860336,0.0011429528,0.000016842672,0.002174525,0.0015133673,0.0010957848,0.5367935,0.047147118,0.40666765],"study_design_scores_gemma":[0.014670941,0.0065257386,0.00077523285,0.0005512995,0.0074738287,0.0006202105,0.014899784,0.41878152,0.018979756,0.38096875,0.13412416,0.001628777],"about_ca_topic_score_codex":0.00003653993,"about_ca_topic_score_gemma":0.000021695661,"teacher_disagreement_score":0.41726816,"about_ca_system_score_codex":0.00019455349,"about_ca_system_score_gemma":0.00018661,"threshold_uncertainty_score":0.9849679},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033249963,0.00010817553,0.10127691,0.00015756988,0.00024968755,0.00028755955,0.0000094942125,0.000100659134,0.86456],"genre_scores_gemma":[0.85377777,0.000004248624,0.022683047,0.0017250002,0.00070424925,0.00003990803,0.000004393557,0.000041542306,0.12101982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924695,0.00008059481,0.00018039683,0.00011369489,0.00017720995,0.00020114957],"domain_scores_gemma":[0.99822277,0.0012720814,0.00006275757,0.00034415047,0.000044617485,0.000053644617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011318399,0.000094760646,0.00011686345,0.000020195876,0.000099853285,0.000020837244,0.00021490728,0.00006234958,0.00003434988],"category_scores_gemma":[0.00017114713,0.00006153172,0.00007851569,0.000008252018,0.000054364205,0.000015353555,0.000073024145,0.0001538057,2.2506825e-7],"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.000054800377,0.000025650173,0.000010155996,0.000036648285,0.00006275099,0.000015815034,0.0020107073,6.226835e-7,0.0019050787,0.95347506,0.0228471,0.019555606],"study_design_scores_gemma":[0.0008489545,0.00011497997,0.00005668245,0.000057548183,0.00014304314,0.000052390664,0.0004027137,0.00019190556,0.22096798,0.23909883,0.5376825,0.00038248967],"about_ca_topic_score_codex":0.0000501321,"about_ca_topic_score_gemma":0.00007695436,"teacher_disagreement_score":0.82052785,"about_ca_system_score_codex":0.000011615601,"about_ca_system_score_gemma":0.0000096979575,"threshold_uncertainty_score":0.25091907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36904472,0.001259098,0.5182913,0.010020254,0.00037004345,0.008390993,0.0001486039,0.00050886476,0.09196614],"genre_scores_gemma":[0.858215,0.00007079901,0.14007702,0.00019703507,0.000029200995,0.00068288925,0.00004382402,0.000025912941,0.00065836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792784,0.00042844302,0.00057821505,0.00033575148,0.00014139185,0.00058837456],"domain_scores_gemma":[0.9910162,0.0059061907,0.00015623588,0.0027058988,0.00014944898,0.000066043714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007205604,0.00017251133,0.0002720759,0.00012677212,0.0002660348,0.000018484747,0.00083487196,0.00012860645,0.000025127933],"category_scores_gemma":[0.0032976728,0.00017649673,0.00012761868,0.00040117613,0.00018292507,0.00006759358,0.00016197757,0.0005291136,3.1152067e-7],"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.00008566533,0.00066387496,0.00019558017,0.00005253642,0.000018366756,2.2081589e-7,0.00025976574,0.0000062760064,0.00019763691,0.98769057,0.0007021505,0.010127367],"study_design_scores_gemma":[0.00077649363,0.00017229113,0.0005983278,0.000048437472,0.000018163662,0.0000033413453,0.00007332058,0.0018999395,0.00033554924,0.97928405,0.016586391,0.00020368067],"about_ca_topic_score_codex":0.000025257463,"about_ca_topic_score_gemma":0.0038179068,"teacher_disagreement_score":0.48917025,"about_ca_system_score_codex":0.0007379062,"about_ca_system_score_gemma":0.00020025921,"threshold_uncertainty_score":0.7197328},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4615188,0.00021947436,0.5196953,0.015721314,0.00032500355,0.00022913728,0.00013575892,0.00002575143,0.002129487],"genre_scores_gemma":[0.71790427,0.00012103369,0.27912864,0.0017723177,0.00040796876,0.0000013994253,0.0000023888772,0.000015027409,0.0006469241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981598,0.00058075436,0.00042847704,0.00011826882,0.000527737,0.00018495809],"domain_scores_gemma":[0.99529564,0.0028883452,0.0013822548,0.00012443922,0.00020233386,0.00010698311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097221904,0.00012100788,0.00041856623,0.00004079277,0.000090316644,0.000037748534,0.00014451072,0.000047518446,0.00001330773],"category_scores_gemma":[0.0029606328,0.00007983703,0.00011828785,0.00013033915,0.00008225912,0.00007202941,0.000030577427,0.00034684205,1.5438384e-7],"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.0017794559,0.00068300386,0.020295708,0.000018085866,0.00092924957,0.00007478034,0.002830081,0.00008208895,0.002599998,0.44247752,0.16253662,0.3656934],"study_design_scores_gemma":[0.0015304686,0.0013135892,0.21562915,0.00010013636,0.00041694695,0.000038589635,0.0012791376,0.004032787,0.00006738515,0.7686715,0.006575422,0.0003448614],"about_ca_topic_score_codex":0.000060590763,"about_ca_topic_score_gemma":0.000021219523,"teacher_disagreement_score":0.36534855,"about_ca_system_score_codex":0.0002478432,"about_ca_system_score_gemma":0.000054763164,"threshold_uncertainty_score":0.35443678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9338201,0.000051338135,0.007999471,0.0000960454,0.000050908056,0.0001947964,0.000015422316,0.000023209706,0.057748683],"genre_scores_gemma":[0.9317412,0.00003866585,0.05896808,0.000028088945,0.00003738527,0.0000063422663,0.0000034393474,0.000014336053,0.009162485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987062,0.0001684939,0.0005836018,0.00016492096,0.00017431082,0.00020245282],"domain_scores_gemma":[0.9989365,0.0004041833,0.00020655034,0.00032238598,0.0000992246,0.000031201056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000976712,0.00013500711,0.0004777156,0.00019452619,0.000020089145,0.0000041254702,0.00014957735,0.00007825805,0.00009293189],"category_scores_gemma":[0.0002879803,0.00010931916,0.0001312226,0.00027606142,0.000078559104,0.00004190062,0.0000889499,0.00008133045,3.8661128e-8],"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.0001420807,0.0012372037,0.05008474,0.00095519796,0.00011654844,0.00001718858,0.0015755853,0.000032067295,0.09864,0.82828456,0.008529173,0.010385656],"study_design_scores_gemma":[0.008249513,0.0009204617,0.0830064,0.0006252616,0.000375365,0.000008712252,0.0059806686,0.039247938,0.69069844,0.16471198,0.004570958,0.0016043094],"about_ca_topic_score_codex":0.00091078144,"about_ca_topic_score_gemma":0.0012943051,"teacher_disagreement_score":0.66357255,"about_ca_system_score_codex":0.000031855045,"about_ca_system_score_gemma":0.00003157345,"threshold_uncertainty_score":0.4457906},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16882476,0.00034871022,0.2978746,0.0010343892,0.00035564406,0.0003841302,0.000003938284,0.00047518517,0.53069866],"genre_scores_gemma":[0.07605662,0.00004187091,0.8607196,0.00044124402,0.00016889052,0.000017896975,0.0000012804476,0.000034255918,0.062518336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.00004736688,0.00024293175,0.0001899455,0.00015017565,0.0002139622],"domain_scores_gemma":[0.9991453,0.00024863458,0.000071956965,0.00041318557,0.00004435186,0.00007652135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004715991,0.0001126376,0.00020095133,0.000037589907,0.00006135644,0.000022794207,0.00012422902,0.000066558634,0.001209314],"category_scores_gemma":[0.0004289282,0.00009055624,0.00009248657,0.00010819693,0.000023627908,0.000053567455,0.000040096093,0.00009457459,0.0000010423489],"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.000022641048,0.0002568353,0.0025975984,0.00017139848,0.00009385743,0.000043673157,0.0010604999,0.0000016564605,0.013389149,0.8343684,0.097152084,0.05084218],"study_design_scores_gemma":[0.0064279316,0.000315135,0.0005831779,0.00023538168,0.0002647425,0.00023471833,0.0016373193,0.054296494,0.013251258,0.48124662,0.43884212,0.0026651279],"about_ca_topic_score_codex":0.0000064658057,"about_ca_topic_score_gemma":0.000027762642,"teacher_disagreement_score":0.562845,"about_ca_system_score_codex":0.000021883965,"about_ca_system_score_gemma":0.0000036010833,"threshold_uncertainty_score":0.9997037},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994658,0.0010186937,0.00037889503,0.0016102009,0.00021468037,0.00075339456,0.0000637695,0.000019892203,0.0012824942],"genre_scores_gemma":[0.9962883,0.00009785646,0.0028798503,0.00029280075,0.000016691738,0.00003368267,0.000021335503,0.000015449848,0.0003540225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702275,0.0008942537,0.0010510655,0.00036285724,0.00039194187,0.00027714582],"domain_scores_gemma":[0.99133825,0.0066633904,0.00067876413,0.0004973965,0.00075367733,0.000068546266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033110364,0.0002571883,0.00065239874,0.00006541437,0.00080724864,0.000051417683,0.00019147646,0.00021144233,0.000014303384],"category_scores_gemma":[0.0038835115,0.000119730015,0.00037610513,0.00075019023,0.0010561951,0.000101096986,0.0002118596,0.0003970135,3.7658932e-8],"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.00031104125,0.0002475991,0.0016169276,0.00035405892,0.0009678329,0.0000010231875,0.0017407099,0.0002870925,0.0001706841,0.9940682,0.000031585776,0.00020324587],"study_design_scores_gemma":[0.005529871,0.0002371123,0.0007854541,0.0005731604,0.00368666,0.00006159264,0.0015684721,0.07528888,0.0026833543,0.8949628,0.01402452,0.0005981159],"about_ca_topic_score_codex":0.00023574858,"about_ca_topic_score_gemma":0.0008894831,"teacher_disagreement_score":0.09910539,"about_ca_system_score_codex":0.000020706444,"about_ca_system_score_gemma":0.000080389866,"threshold_uncertainty_score":0.6208786},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80307674,0.0006661806,0.19366801,0.00012819488,0.0004751843,0.00065326225,0.00007440277,0.000089913075,0.001168094],"genre_scores_gemma":[0.11061946,0.00078279944,0.8841713,0.00026123069,0.0010501016,0.0000350685,0.000021467655,0.00006983027,0.0029887066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984624,0.0001616938,0.0004049907,0.00040373264,0.000262874,0.00030433031],"domain_scores_gemma":[0.9990152,0.00030466824,0.00010155976,0.00032124534,0.00009531929,0.00016201948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006385744,0.00025363782,0.0005690079,0.00012199872,0.00017962512,0.00003852007,0.00010521342,0.00013271284,0.00017612703],"category_scores_gemma":[0.00017879254,0.0001951812,0.00016206299,0.00018508198,0.000053503918,0.00006152897,0.000047646092,0.00016460115,1.1412275e-7],"study_design_candidate":"design_other","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.0002514774,0.000026923126,0.000014596538,0.00007082807,0.00005062634,0.0000065804306,0.0006753643,0.00016409488,0.0054348335,0.0015160625,0.0004519765,0.99133664],"study_design_scores_gemma":[0.06237288,0.004463271,0.010652217,0.0016476649,0.0013597098,0.0017387717,0.0025526648,0.51200354,0.11598269,0.14060798,0.14057757,0.00604104],"about_ca_topic_score_codex":0.00014859291,"about_ca_topic_score_gemma":0.000012201868,"teacher_disagreement_score":0.9852956,"about_ca_system_score_codex":0.000023756553,"about_ca_system_score_gemma":0.000017532031,"threshold_uncertainty_score":0.79592586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94590604,0.00025181854,0.002951192,0.0004916916,0.000021142385,0.000541189,0.0000063086673,0.000064152584,0.04976649],"genre_scores_gemma":[0.9398203,0.000032106902,0.059697017,0.00007358141,0.0000684585,0.0000330988,0.000002353316,0.000020064652,0.00025301476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986812,0.00018899768,0.00038154508,0.0002733491,0.00021705007,0.00025788348],"domain_scores_gemma":[0.9985102,0.00061175105,0.00019895943,0.00050152943,0.00013486258,0.00004270913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002817224,0.00017419216,0.00035682257,0.000034191376,0.00014875799,0.000025625262,0.00018621208,0.00008673501,0.000008386777],"category_scores_gemma":[0.00017547037,0.000120657634,0.00010157318,0.00011721589,0.00029444593,0.000045770037,0.00016028156,0.00019607911,6.9504594e-8],"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.0005624848,0.00036132734,0.0005200673,0.00087855116,0.00012714064,0.0000018999447,0.0035579384,0.0007699524,0.013067852,0.8844029,0.0021240916,0.09362583],"study_design_scores_gemma":[0.00018768942,0.000047335132,0.0002388688,0.000017103835,0.000032354477,0.000002173132,0.00023474803,0.0017266468,0.013634012,0.9831763,0.0005547176,0.00014802965],"about_ca_topic_score_codex":0.00006588917,"about_ca_topic_score_gemma":0.000027503836,"teacher_disagreement_score":0.09877345,"about_ca_system_score_codex":0.000008788647,"about_ca_system_score_gemma":0.000024293611,"threshold_uncertainty_score":0.49202758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055425074,0.00009017729,0.9101408,0.00012941391,0.00015488752,0.00038923314,0.00003175498,0.000064352535,0.033574305],"genre_scores_gemma":[0.45755515,0.0000019085273,0.5411208,0.00001974722,0.000121349236,0.000029169782,0.000024042914,0.000018245944,0.0011095654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899715,0.000073149444,0.00043414583,0.00015733296,0.00015353475,0.00018471373],"domain_scores_gemma":[0.9988255,0.0006031471,0.00017225568,0.00023757562,0.00012255405,0.000038957493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569264,0.00012363763,0.00037679743,0.00007186646,0.000055346427,0.000015499056,0.00010216791,0.000068662266,0.0000430957],"category_scores_gemma":[0.00010392342,0.00009462291,0.00018521538,0.00008562026,0.000052544085,0.00004109449,0.000030179672,0.00005275544,6.9311405e-8],"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.000042897795,0.0004381568,0.0004480503,0.00013401674,0.000036081175,3.5816973e-7,0.00015692835,0.0000173367,0.008793176,0.963224,0.015348019,0.011361001],"study_design_scores_gemma":[0.0015348346,0.00048392147,0.00023106266,0.00006301867,0.00018484287,0.0000049086466,0.0013549249,0.05434305,0.50613856,0.4250778,0.010166573,0.000416498],"about_ca_topic_score_codex":0.00017369469,"about_ca_topic_score_gemma":0.00009041745,"teacher_disagreement_score":0.5381462,"about_ca_system_score_codex":0.000042151627,"about_ca_system_score_gemma":0.000010970488,"threshold_uncertainty_score":0.385861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72884053,0.00341147,0.19573003,0.010574101,0.0006910206,0.009276968,0.00015796065,0.00059457414,0.050723366],"genre_scores_gemma":[0.64855224,0.00006874709,0.34944794,0.000059425947,0.00006593323,0.0006266448,0.000037996262,0.00003621316,0.0011048929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975616,0.0005426035,0.0005780094,0.00039927443,0.0002112556,0.0007072857],"domain_scores_gemma":[0.995224,0.0012823234,0.00016476565,0.0029161302,0.00026885158,0.0001439529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038167823,0.00023484549,0.00041060234,0.000118499906,0.00019328175,0.000050254024,0.0012498691,0.0001253283,0.000019906453],"category_scores_gemma":[0.0018352664,0.00023400765,0.00017752354,0.0004544343,0.00020256607,0.00016467003,0.0003615082,0.00057806965,5.269061e-7],"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.00031416406,0.002865156,0.0058684545,0.00031242895,0.00018333664,0.0000012085977,0.006639868,0.00009441263,0.00071268174,0.92035425,0.0065828725,0.056071196],"study_design_scores_gemma":[0.002792578,0.00037195516,0.00023713979,0.000040001873,0.000050108978,0.000007996859,0.00046113582,0.024914524,0.00090140227,0.91672415,0.053042892,0.00045611573],"about_ca_topic_score_codex":0.0002652296,"about_ca_topic_score_gemma":0.0059873424,"teacher_disagreement_score":0.1537179,"about_ca_system_score_codex":0.0015724965,"about_ca_system_score_gemma":0.00086702645,"threshold_uncertainty_score":0.95425546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63516825,0.00025945937,0.3631664,0.00029044572,0.0006337076,0.00011676724,0.00016256874,0.000005655201,0.0001967803],"genre_scores_gemma":[0.85751003,0.00007106728,0.14221476,0.00005686033,0.00009442446,0.0000012313382,0.0000025486838,0.000008586617,0.00004051461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985027,0.00014556776,0.0006310548,0.000110219924,0.00049847265,0.00011204059],"domain_scores_gemma":[0.99738574,0.00039756432,0.0004742638,0.00011326321,0.0015035303,0.00012563018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803069,0.000103036466,0.00027426524,0.00006947099,0.000026428368,0.000038756236,0.00019978662,0.000043846896,0.00001570262],"category_scores_gemma":[0.0019658345,0.00007941539,0.00005263835,0.00004127187,0.00016888874,0.00014125578,0.00007419825,0.00013426188,3.2893563e-8],"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.0011330356,0.00076127873,0.020904621,0.0006524619,0.00080171385,0.000072241375,0.007584269,0.00093219586,0.005189475,0.92915434,0.0063908207,0.026423538],"study_design_scores_gemma":[0.0009025059,0.00023674035,0.0010374187,0.0001200494,0.00006284973,0.00009806027,0.000583135,0.0019277567,0.0020604446,0.9912831,0.0015340343,0.00015387253],"about_ca_topic_score_codex":0.00021293078,"about_ca_topic_score_gemma":0.00008533247,"teacher_disagreement_score":0.22234178,"about_ca_system_score_codex":0.000104035826,"about_ca_system_score_gemma":0.0002687313,"threshold_uncertainty_score":0.32384655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35380757,0.00006162879,0.6366877,0.00007185199,0.00008527265,0.00007802323,0.009172331,0.000018421517,0.000017191822],"genre_scores_gemma":[0.4784056,0.000018107246,0.51103806,0.000027661308,0.00005185683,0.00004455112,0.010374725,0.000026153502,0.00001326084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976899,0.00011740639,0.0008455112,0.00039276783,0.00069098093,0.00026344453],"domain_scores_gemma":[0.995565,0.0022419796,0.00085850817,0.0008342972,0.000365606,0.00013461814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461386,0.00020758875,0.00033512907,0.00013526136,0.00026237956,0.00010828188,0.00042985997,0.00014472853,0.000008050257],"category_scores_gemma":[0.0028976942,0.00020975943,0.00026199222,0.0005228506,0.00016104485,0.0002604958,0.0002690136,0.00015667062,0.0000014213447],"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.0000979262,0.00014229876,0.000102527796,0.00020119415,0.0009525571,0.0000048714583,0.00019856975,0.15468602,0.000012507411,0.8406977,0.0012548908,0.0016489443],"study_design_scores_gemma":[0.00044357523,0.000108161024,0.00021166651,0.00006180511,0.0021511281,0.000005954733,0.00017882127,0.9889623,0.00007799068,0.0074346527,0.00019380257,0.00017013562],"about_ca_topic_score_codex":0.0013068314,"about_ca_topic_score_gemma":0.00061176583,"teacher_disagreement_score":0.83427626,"about_ca_system_score_codex":0.00003122572,"about_ca_system_score_gemma":0.0002326831,"threshold_uncertainty_score":0.8553741},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07671965,0.00005448379,0.92263275,0.00010526651,0.00028564624,0.000112034984,0.00006454003,0.000009937238,0.000015658256],"genre_scores_gemma":[0.35165203,0.0000074375266,0.6480037,0.00005405606,0.00025236997,0.000002661828,0.0000132650375,0.000008308767,0.0000061630535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886036,0.00015925265,0.00047352863,0.00007724095,0.0002739933,0.00015561613],"domain_scores_gemma":[0.9961054,0.0026879017,0.00041485266,0.000047169222,0.00055229466,0.00019241973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010563566,0.000110278175,0.00026501884,0.00010387311,0.0001265542,0.000044074277,0.000058106874,0.00005375774,0.000006074295],"category_scores_gemma":[0.00057342066,0.000086308646,0.00006872655,0.00007882809,0.00004971303,0.00035785735,0.00001515463,0.0001656317,3.5123627e-8],"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.00017924584,0.0005777957,0.0010525604,0.0001453718,0.00021877936,0.0000151719405,0.0024271568,0.00033004925,0.00006684643,0.32404813,0.002890035,0.66804886],"study_design_scores_gemma":[0.00065804383,0.0005906207,0.0020879325,0.00005790168,0.00011035814,0.00011461614,0.00047661498,0.47731492,0.000034471628,0.5181554,0.0002645536,0.00013455172],"about_ca_topic_score_codex":0.0000021407377,"about_ca_topic_score_gemma":0.0000029142964,"teacher_disagreement_score":0.66791433,"about_ca_system_score_codex":0.000023761962,"about_ca_system_score_gemma":0.000034809203,"threshold_uncertainty_score":0.35195643},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050322054,0.00039238768,0.54306823,0.000247893,0.00020428875,0.0020143914,0.00013369945,0.00015019209,0.45328566],"genre_scores_gemma":[0.007742176,0.0010355882,0.15271486,0.00005347652,0.00025032202,0.00024362626,0.0003642293,0.00014414582,0.8374516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889356,0.000016527089,0.00038406425,0.0003467594,0.00019392905,0.00016518105],"domain_scores_gemma":[0.99897224,0.00035244267,0.00024507812,0.00023732036,0.00011302735,0.00007990457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017504508,0.00030759332,0.00040543455,0.00010336688,0.00009129825,0.000051156512,0.00008238281,0.00021639945,0.0001269145],"category_scores_gemma":[0.00014520288,0.00024332102,0.00012461492,0.00001430026,0.000035174908,0.000067075096,0.000037341015,0.00010630446,2.1109649e-7],"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.00005667046,0.000034563465,0.0000048593774,0.0021293836,0.0001324613,8.7866374e-7,0.00036936993,0.000013609818,0.000016553693,0.92917794,0.0033720748,0.06469166],"study_design_scores_gemma":[0.0007814769,0.00025493282,0.000010796023,0.0008735334,0.000552325,0.000010010539,0.000038979524,0.016843252,0.00019785916,0.8753564,0.10437917,0.00070129667],"about_ca_topic_score_codex":0.0000034437169,"about_ca_topic_score_gemma":0.000089123045,"teacher_disagreement_score":0.39035338,"about_ca_system_score_codex":0.000053155636,"about_ca_system_score_gemma":0.00003907205,"threshold_uncertainty_score":0.9922343},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5726591,0.00018673946,0.40717295,0.00010351585,0.00004029336,0.0003664565,0.000008277092,0.000056329543,0.019406356],"genre_scores_gemma":[0.49532655,0.00008085535,0.5032446,0.000032387954,0.000015058583,0.000017513768,0.0000045373927,0.000020214608,0.0012583096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991014,0.00006171298,0.00023737639,0.00018228419,0.00028286298,0.00013436153],"domain_scores_gemma":[0.9978853,0.0012324057,0.00016379096,0.00021115768,0.0004005241,0.00010682184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075835694,0.00013254357,0.00024598383,0.00008326331,0.000031370142,0.000048780552,0.00007921491,0.000050283954,0.0000057550656],"category_scores_gemma":[0.0025008726,0.000085671156,0.000016955799,0.0002204273,0.00007389742,0.00014538845,0.000050914474,0.000054799493,5.769099e-8],"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.00908995,0.0024968865,0.03078919,0.014347709,0.00064495596,0.00014712304,0.03801301,0.00042289478,0.0023247302,0.19790404,0.040705476,0.663114],"study_design_scores_gemma":[0.027117465,0.006314476,0.0013047404,0.0051456047,0.00074855494,0.00033504094,0.03565251,0.08447747,0.12072278,0.6913381,0.023015844,0.003827398],"about_ca_topic_score_codex":0.00004462672,"about_ca_topic_score_gemma":0.0004995375,"teacher_disagreement_score":0.6592866,"about_ca_system_score_codex":0.000027463111,"about_ca_system_score_gemma":0.00012828522,"threshold_uncertainty_score":0.34935686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9612977,0.00059334055,0.018406486,0.00011779648,0.000055982982,0.0009484474,0.00011840794,0.00006627433,0.018395549],"genre_scores_gemma":[0.7955196,0.0005972933,0.19987217,0.000006952601,0.000015480811,8.2037633e-7,0.0000093774825,0.00004377821,0.0039345515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9954607,0.0010683174,0.00045315275,0.00061700604,0.0016575779,0.00074324606],"domain_scores_gemma":[0.99462754,0.0014496738,0.00066108024,0.0012959063,0.0015235981,0.00044222354],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004992447,0.00032641127,0.00091159315,0.00036353967,0.00035971968,0.000014712357,0.001597132,0.00030988417,0.001717483],"category_scores_gemma":[0.00079528615,0.00034947618,0.0003276225,0.0006918734,0.0011393983,0.0011799497,0.0006977719,0.00084428606,0.0000046115288],"study_design_candidate":"qualitative","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.01931631,0.012667597,0.06753727,0.01128905,0.0046519474,0.0031043966,0.1654493,0.00005404559,0.07489228,0.59361404,0.013880169,0.03354356],"study_design_scores_gemma":[0.029194068,0.020205589,0.12890089,0.012210326,0.0036056999,0.00057375093,0.5767526,0.002913299,0.082002096,0.11944356,0.018344723,0.0058534206],"about_ca_topic_score_codex":0.0048085116,"about_ca_topic_score_gemma":0.009931088,"teacher_disagreement_score":0.4741705,"about_ca_system_score_codex":0.00031013959,"about_ca_system_score_gemma":0.00045330022,"threshold_uncertainty_score":0.99989575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13614137,0.00012273056,0.8629355,0.0001997298,0.00025149787,0.00006505547,0.00013029309,0.000009340689,0.0001445183],"genre_scores_gemma":[0.46962768,0.000022956705,0.52991545,0.00012232242,0.00028142586,5.7830255e-7,0.00000468057,0.000009587677,0.000015286132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849814,0.00015612032,0.00059448363,0.00012538552,0.00045082986,0.0001750596],"domain_scores_gemma":[0.99507046,0.0033892994,0.00040901778,0.00006803494,0.0008515421,0.00021165652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251179,0.00014551294,0.00035592847,0.0001774373,0.00016490214,0.000042594304,0.0001103666,0.00006976757,0.000022888986],"category_scores_gemma":[0.000975493,0.00011347636,0.000097669,0.00017081492,0.00031107297,0.00007278622,0.00004943564,0.0002657072,1.3753943e-7],"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.0005916667,0.00037623142,0.003965838,0.00010601085,0.00038912313,0.000075796896,0.00062277267,0.00032288578,0.00020012747,0.95009315,0.008747424,0.03450895],"study_design_scores_gemma":[0.0013365127,0.0007210493,0.010164622,0.00008759873,0.00012526296,0.0001952849,0.00022849366,0.045330945,0.000040388506,0.93915886,0.0023980355,0.00021292832],"about_ca_topic_score_codex":0.0000091156935,"about_ca_topic_score_gemma":0.00001251548,"teacher_disagreement_score":0.33348632,"about_ca_system_score_codex":0.000026587108,"about_ca_system_score_gemma":0.000051903186,"threshold_uncertainty_score":0.46274316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5321456,0.00039395932,0.42730263,0.01509403,0.01596068,0.0011681477,0.000035693127,0.0011507128,0.0067485576],"genre_scores_gemma":[0.956454,0.000071256996,0.034321867,0.0011165881,0.004278807,0.00017265533,0.000005711596,0.00007214625,0.0035069918],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850386,0.00019173123,0.00033113515,0.00039031738,0.00021539816,0.00036754107],"domain_scores_gemma":[0.99801445,0.00094562856,0.0001528029,0.0006754772,0.00013894166,0.000072683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014389507,0.00023375076,0.00035729108,0.00011057457,0.00017896923,0.000030640225,0.0002975848,0.0004413881,0.000050310457],"category_scores_gemma":[0.0019221104,0.000169256,0.00008721053,0.0002202171,0.00041067268,0.00006769972,0.00015132889,0.00048213237,0.000003949189],"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.0003004932,0.00039971346,0.0011316796,0.00035403908,0.0002569023,0.00003539332,0.00034242723,0.000018696725,0.08716606,0.14710842,0.5673727,0.19551346],"study_design_scores_gemma":[0.0014180975,0.00027203222,0.0002927872,0.000058441026,0.00012458982,0.00010264895,0.000090835616,0.0021346968,0.013336384,0.058425553,0.92326736,0.0004765489],"about_ca_topic_score_codex":0.000008108871,"about_ca_topic_score_gemma":0.000054361586,"teacher_disagreement_score":0.4243084,"about_ca_system_score_codex":0.000048635604,"about_ca_system_score_gemma":0.000027927475,"threshold_uncertainty_score":0.690206},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.9419297e-7,0.0004746643,0.0000034450836,0.00010015114,0.00026754945,0.00097514095,0.99671525,0.00013748108,0.0013254161],"genre_scores_gemma":[0.00000740621,0.000030738236,0.0032160734,0.00086564553,0.0011728697,0.00055583124,0.9929884,0.00010595575,0.0010570441],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99708617,0.00037329295,0.00054903765,0.0008031939,0.0006462628,0.0005420599],"domain_scores_gemma":[0.9974534,0.000524557,0.00051577797,0.0009909971,0.00017695157,0.00033830656],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021118326,0.0007569813,0.0009586668,0.00014411124,0.0001316447,0.00010086916,0.00092181197,0.000785472,0.06140231],"category_scores_gemma":[0.0040842094,0.000703729,0.00044504978,0.00025079507,0.00001442041,0.00008681893,0.00085235044,0.0012355705,0.00011185747],"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.00005372088,0.000056077206,9.0152035e-8,0.0014479326,0.00017139845,0.00031606096,0.00008511444,3.8109064e-7,0.0000033057809,0.000006786031,0.99707,0.00078914134],"study_design_scores_gemma":[0.0004018565,0.00013821461,8.434817e-7,0.002672415,0.0001264107,0.000020990086,0.00013563503,0.00013424389,0.00004014227,0.0000452107,0.9955675,0.0007165293],"about_ca_topic_score_codex":0.000066476285,"about_ca_topic_score_gemma":0.00030035322,"teacher_disagreement_score":0.06129045,"about_ca_system_score_codex":0.00019592648,"about_ca_system_score_gemma":0.00018176618,"threshold_uncertainty_score":0.9995414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026511066,0.00087495486,0.98683584,0.00017517272,0.0036356405,0.00020173384,0.002036509,0.000010535329,0.003578494],"genre_scores_gemma":[0.008105971,0.0001260036,0.9898204,0.00007293073,0.0013782827,0.0000032281162,0.000028408744,0.00008252923,0.00038222433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977031,0.00014685772,0.0010322939,0.00022366647,0.00034803606,0.0005460577],"domain_scores_gemma":[0.9943519,0.0007648684,0.0020710495,0.0006551102,0.0010596093,0.001097454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019091809,0.00034180842,0.00082915573,0.0003884663,0.00035206802,0.00041342367,0.0007910867,0.0003630547,0.00006211812],"category_scores_gemma":[0.0062175463,0.00033958367,0.00021217868,0.000040902898,0.00013164089,0.000073627925,0.00014019488,0.0015607077,2.2812058e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010835102,0.000028772085,0.001043636,0.0011964737,0.0005904174,0.0024266716,0.003420867,0.00015443249,0.000024911975,0.027436713,0.050983395,0.9126829],"study_design_scores_gemma":[0.0010586317,0.00022038734,0.00046160133,0.003873391,0.00088937953,0.00056476257,0.0008596821,0.00837081,0.00008657784,0.9086355,0.07365537,0.0013239288],"about_ca_topic_score_codex":0.0030967013,"about_ca_topic_score_gemma":0.019108756,"teacher_disagreement_score":0.91135895,"about_ca_system_score_codex":0.0003805475,"about_ca_system_score_gemma":0.004698711,"threshold_uncertainty_score":0.99990565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912106,0.00006874328,0.0010311396,0.0024677187,0.00008243737,0.0012208095,0.00028756406,0.000026640255,0.0036043513],"genre_scores_gemma":[0.9590954,0.000008929126,0.039738413,0.00070525386,0.00009321035,0.000057080888,0.000006118836,0.000045622586,0.00024992687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741644,0.00090041524,0.0005523301,0.0004300879,0.00044766444,0.0002530393],"domain_scores_gemma":[0.99444723,0.002989367,0.000667919,0.0013748755,0.00045566587,0.0000649353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00616723,0.00031190706,0.0006780388,0.000042870408,0.000094364535,0.000014836588,0.0004528713,0.00018611325,0.00027886045],"category_scores_gemma":[0.0016741923,0.00014986914,0.0001786263,0.000073364565,0.0019275185,0.000019670599,0.0005007923,0.00040899002,2.980089e-7],"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.004839349,0.0025199873,0.0023499655,0.0081820125,0.0036354517,0.0000074534446,0.015887605,0.000590943,0.0055663534,0.9057918,0.03290842,0.017720625],"study_design_scores_gemma":[0.0003738949,0.00036428287,0.00071112765,0.0010074776,0.00013654429,0.000006621255,0.00011323627,0.0004615793,0.011381734,0.984938,0.00020306061,0.00030240242],"about_ca_topic_score_codex":0.00016746906,"about_ca_topic_score_gemma":0.00003841325,"teacher_disagreement_score":0.07914621,"about_ca_system_score_codex":0.000018221082,"about_ca_system_score_gemma":0.00015959541,"threshold_uncertainty_score":0.7102023},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32856014,0.013827891,0.028799172,0.0021632041,0.0009254088,0.002102778,0.00013058582,0.0016406182,0.6218502],"genre_scores_gemma":[0.106672525,0.007845004,0.851421,0.011820897,0.00046709343,0.00019205188,0.00005074645,0.00065444387,0.020876251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841344,0.000041139338,0.00054424786,0.00037321734,0.00025130805,0.00037664984],"domain_scores_gemma":[0.9982704,0.00050634745,0.00019847558,0.00072592066,0.00003593807,0.00026291743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021275776,0.00035537255,0.0005259359,0.00011721755,0.0000803819,0.0012529629,0.00037094238,0.00016449716,0.00039644894],"category_scores_gemma":[0.00017736155,0.00029196672,0.00016914678,0.00021457374,0.00013513763,0.0070026685,0.00042761027,0.00018438709,0.000005057298],"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.00005737688,0.0013612511,0.00032942466,0.0050485344,0.00030832304,0.00014936442,0.023065042,2.1381457e-8,0.00027799708,0.5755462,0.10565373,0.28820276],"study_design_scores_gemma":[0.0004600807,0.00016093848,0.000014475484,0.0010176857,0.00008404491,0.00013358639,0.0051823054,0.00033502595,0.0066518574,0.90707064,0.078164116,0.0007252678],"about_ca_topic_score_codex":8.9558904e-7,"about_ca_topic_score_gemma":2.6361548e-7,"teacher_disagreement_score":0.8226218,"about_ca_system_score_codex":0.0000094359175,"about_ca_system_score_gemma":0.000031239342,"threshold_uncertainty_score":0.99995327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012461827,0.0009237294,0.98219097,0.0002869051,0.00007967782,0.0023430348,0.00026657473,0.00016850061,0.012494441],"genre_scores_gemma":[0.63499177,0.000053070347,0.35333827,0.00013395381,0.000740315,0.009504335,0.00013448556,0.00013275797,0.00097105134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981289,0.000025557409,0.0004141447,0.0008398983,0.00019208457,0.00039943328],"domain_scores_gemma":[0.9973169,0.00044039104,0.00038290172,0.0012193924,0.00036186652,0.00027852293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056340016,0.000474763,0.0006530384,0.00014146972,0.00057378504,0.00029691655,0.0007808115,0.00028132307,0.0000027447254],"category_scores_gemma":[0.0006776268,0.00037718794,0.00012432423,0.00014852412,0.00012960349,0.000062102394,0.0011426426,0.0004695507,4.1840963e-7],"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.00016941132,0.0017287496,0.0000065681097,0.022721807,0.0008542236,0.0000017571102,0.024458392,0.0012653131,0.00038512595,0.73157936,0.0032025252,0.21362674],"study_design_scores_gemma":[0.00068562623,0.000091014495,0.000005304303,0.0011270633,0.00045114392,0.00005229988,0.0028679061,0.03176094,0.00027550833,0.95193326,0.008987856,0.0017620453],"about_ca_topic_score_codex":0.000024144261,"about_ca_topic_score_gemma":0.00001258033,"teacher_disagreement_score":0.63374555,"about_ca_system_score_codex":0.000047632253,"about_ca_system_score_gemma":0.0002596598,"threshold_uncertainty_score":0.999868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6559533,0.000106420106,0.3369822,0.0013609008,0.00076639216,0.0015426383,0.000064509484,0.000062816864,0.0031608352],"genre_scores_gemma":[0.5129926,0.00003155517,0.4858691,0.00011227251,0.0005096761,0.00006970524,9.322672e-7,0.00004714987,0.0003669577],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732035,0.00019157595,0.001155174,0.00036214886,0.0005158542,0.00045492078],"domain_scores_gemma":[0.996173,0.0014867387,0.0009116749,0.00058865704,0.0005630772,0.00027684754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050418745,0.00031281408,0.0008307955,0.000108268636,0.00017429014,0.000042024098,0.0004173326,0.00020832177,0.000035543668],"category_scores_gemma":[0.00095447066,0.00019106855,0.0004530883,0.00014119947,0.0002341606,0.00012942786,0.00011111987,0.00027137148,1.6935435e-7],"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.0043954486,0.002282802,0.0015662505,0.0014590565,0.00043970245,0.000020963891,0.002084513,0.000011924961,0.052123554,0.085066155,0.007642491,0.84290713],"study_design_scores_gemma":[0.005949545,0.00083871576,0.0010046603,0.000235035,0.0002194001,0.00006654951,0.00018727817,0.0021134291,0.009316533,0.9611949,0.018232705,0.0006412897],"about_ca_topic_score_codex":0.0000063078996,"about_ca_topic_score_gemma":0.00004263107,"teacher_disagreement_score":0.8761287,"about_ca_system_score_codex":0.00035035872,"about_ca_system_score_gemma":0.00012292874,"threshold_uncertainty_score":0.77915496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28777096,0.00006322597,0.7114194,0.00016099423,0.000041095132,0.00021516166,0.000023232635,0.000020935613,0.0002849908],"genre_scores_gemma":[0.9507355,0.000008073988,0.048693422,0.000088995774,0.00002971075,0.000012731479,0.0000030549493,0.00002590208,0.0004026017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812067,0.0010598338,0.00026766368,0.00022686223,0.0001418723,0.0001831297],"domain_scores_gemma":[0.9986745,0.0008399377,0.00009329865,0.00028441206,0.000060227587,0.000047607653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318472,0.0001422221,0.00016436956,0.000102328275,0.00021715376,0.000042506555,0.00009760373,0.00008038043,0.000018017965],"category_scores_gemma":[0.00055672706,0.00008840147,0.00006638569,0.00015838424,0.00008326696,0.00014363827,0.00006066787,0.00007769162,2.701202e-8],"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.00008004218,0.000059679354,0.00022393746,0.000033978024,0.000041396386,0.000009647067,0.0030305556,0.034909993,0.17246114,0.77439386,0.0000058174,0.014749961],"study_design_scores_gemma":[0.00046927945,0.000011763725,0.000018440864,0.000050661023,0.00007412063,0.00000821492,0.00024912469,0.76632845,0.006480569,0.22614141,0.000026324466,0.0001416468],"about_ca_topic_score_codex":0.000018118459,"about_ca_topic_score_gemma":0.00007906355,"teacher_disagreement_score":0.73141843,"about_ca_system_score_codex":0.00004531506,"about_ca_system_score_gemma":0.000030444711,"threshold_uncertainty_score":0.36049074},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026946806,0.00016573856,0.017494807,0.0003390751,0.00017209613,0.001115178,0.00008232119,0.00051394245,0.9798474],"genre_scores_gemma":[0.00058914657,0.00018727263,0.15276362,0.0011988484,0.0006643537,0.00012963558,0.000009077182,0.00045991963,0.84399813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530315,0.00013153504,0.0013352757,0.0010763415,0.001115542,0.0010381322],"domain_scores_gemma":[0.9945661,0.0018577727,0.0010675364,0.0016976774,0.00023107522,0.0005798375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013673047,0.001256774,0.002415713,0.000099225326,0.00025899403,0.00010841362,0.00077657955,0.00069932506,0.0007296818],"category_scores_gemma":[0.00035073943,0.0011060331,0.0022175738,0.00006722571,0.0014349972,0.000042818097,0.00046291505,0.0013718854,0.000015166926],"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.00003359965,0.00009651074,0.000002230978,0.0008231371,0.0008844938,0.000097362456,0.002058039,4.277838e-7,0.000040557163,0.861326,0.06311652,0.07152112],"study_design_scores_gemma":[0.00057811325,0.00027373407,5.167277e-7,0.00077610795,0.0007113981,0.00011863416,0.0009371588,0.0010109826,0.00003496051,0.5605273,0.43328345,0.0017476341],"about_ca_topic_score_codex":0.000038383085,"about_ca_topic_score_gemma":0.00002163238,"teacher_disagreement_score":0.37016693,"about_ca_system_score_codex":0.0003667232,"about_ca_system_score_gemma":0.00016162962,"threshold_uncertainty_score":0.999139},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000101165615,0.00025101955,0.014009803,0.00005698215,0.00014882215,0.00019943007,0.000011664584,0.00005601637,0.98525614],"genre_scores_gemma":[0.0000056281674,0.00007446534,0.05480071,0.000241376,0.00010517135,0.000009120566,0.000011778952,0.000035164627,0.9447166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931604,0.00004062933,0.00021888682,0.00018516765,0.00011830321,0.000120979035],"domain_scores_gemma":[0.9990545,0.00047362768,0.000113651695,0.00022402905,0.00008170176,0.000052485226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041229354,0.00016704758,0.0002837704,0.000051408897,0.000067028835,0.00004331117,0.00005059829,0.00021276434,0.00032183065],"category_scores_gemma":[0.0002766397,0.00014272374,0.000057102046,0.000016424965,0.000041816053,0.000024488467,0.000022474876,0.000181057,2.6485586e-7],"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":[3.9967176e-7,0.0000034833176,6.205858e-7,0.000097100834,0.000019075074,0.0000023613943,0.000036846755,9.317326e-9,0.000014154683,0.63161117,0.3671217,0.001093099],"study_design_scores_gemma":[0.00010279772,0.000010165762,1.9029247e-7,0.00006518298,0.00006055752,0.000015093418,0.00003155578,0.000029107787,0.000028840925,0.13195783,0.86751986,0.00017880053],"about_ca_topic_score_codex":0.0000015455229,"about_ca_topic_score_gemma":0.000017105198,"teacher_disagreement_score":0.5003982,"about_ca_system_score_codex":0.00003574236,"about_ca_system_score_gemma":0.00013991003,"threshold_uncertainty_score":0.5820105},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001880895,0.00034314115,0.0014327861,0.00004080585,0.0004125309,0.00076826086,0.00042790454,0.00032647935,0.99606],"genre_scores_gemma":[0.00023245031,0.00024720933,0.007110373,0.000118781856,0.0005960228,0.0000022701752,0.00001836071,0.00016554458,0.99150896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976299,0.00013721909,0.00040564663,0.0008084541,0.00047727613,0.00054153625],"domain_scores_gemma":[0.9973392,0.00034526366,0.00045030654,0.0012592952,0.00025313377,0.00035283787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046836297,0.00074502086,0.000954743,0.0002961602,0.00022074691,0.000052799238,0.000778016,0.00079780974,0.000017000446],"category_scores_gemma":[0.00006918633,0.000852042,0.0006254701,0.000011296734,0.00024154826,0.00008418164,0.000611699,0.00087344996,0.0000010823775],"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.00010745785,0.00001733517,5.486254e-7,0.00021656106,0.00024461022,0.00044356807,0.00009311671,0.0000011564989,0.000022719767,0.84282976,0.14671184,0.0093113],"study_design_scores_gemma":[0.0008045328,0.000055569708,8.7526087e-7,0.00029241518,0.00045467852,0.00003364526,0.000059246402,0.00021832412,0.00012764633,0.000049114915,0.9970552,0.00084879517],"about_ca_topic_score_codex":0.00011274513,"about_ca_topic_score_gemma":0.000023758541,"teacher_disagreement_score":0.8503433,"about_ca_system_score_codex":0.0004349814,"about_ca_system_score_gemma":0.00013307814,"threshold_uncertainty_score":0.99939305},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022644961,0.000028437507,0.0076039378,0.00026427594,0.00065075944,0.0005321872,0.00025182005,0.0001428864,0.9902992],"genre_scores_gemma":[0.000103784776,0.00006120365,0.0010371908,0.00007801822,0.0012105509,0.0000020793666,0.0000122139845,0.000059726568,0.9974352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998729,0.00006054137,0.00017007462,0.00060130126,0.00020202539,0.00023707341],"domain_scores_gemma":[0.9985246,0.0002569222,0.00014219087,0.00067903317,0.00014779068,0.00024947728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002149255,0.00034786848,0.00040127864,0.00022018995,0.00017723683,0.000032131975,0.00019096993,0.00030212002,0.00000969356],"category_scores_gemma":[0.00008192145,0.00032679198,0.00015706856,0.000007724456,0.00012561512,0.000044266482,0.00025463506,0.0003073676,0.0000027735136],"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.00008999972,0.0000084235335,3.1493724e-7,0.00006122805,0.00007738378,0.000028921695,0.00003166347,1.519332e-7,0.000085602136,0.7584681,0.23055787,0.010590342],"study_design_scores_gemma":[0.0003640675,0.00013388704,0.0000011718831,0.00015041053,0.00019094536,0.000011943074,0.00003315391,0.0000036444892,0.00021649821,0.00015939865,0.99836,0.00037487588],"about_ca_topic_score_codex":0.000010956385,"about_ca_topic_score_gemma":0.0000045595707,"teacher_disagreement_score":0.7678021,"about_ca_system_score_codex":0.00017899122,"about_ca_system_score_gemma":0.000033357424,"threshold_uncertainty_score":0.9999184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000288722,0.00031379767,0.994642,0.00029171284,0.0007543841,0.00048122343,0.000008928774,0.00010396993,0.0031152193],"genre_scores_gemma":[0.022054266,0.000029603223,0.97282535,0.00032440413,0.0013691739,0.00002118568,0.0000039205806,0.000068515335,0.003303595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974331,0.00006921653,0.00056714413,0.0009128532,0.0005630305,0.00045461365],"domain_scores_gemma":[0.9968205,0.0016070443,0.0004040767,0.000844094,0.00020823549,0.00011604306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016078495,0.0004412819,0.0005948833,0.00040033078,0.00023852482,0.00016656269,0.0007582091,0.00030475995,0.000022244816],"category_scores_gemma":[0.000475454,0.0003271676,0.00016495172,0.00015579989,0.00032106272,0.00015919923,0.00038557834,0.0004303401,0.0000011483551],"study_design_candidate":"design_other","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.000017977685,0.000013462846,0.000018578348,0.00006692226,0.000013640193,0.000016040747,0.00067124993,0.0030966199,0.008136927,0.006273709,0.000031402236,0.9816435],"study_design_scores_gemma":[0.0015617382,0.00010862128,0.000008103139,0.0013186791,0.0000439161,0.00007135821,6.6299435e-7,0.8306846,0.0062384983,0.1563949,0.0025157514,0.0010531928],"about_ca_topic_score_codex":0.000010522146,"about_ca_topic_score_gemma":0.00009844081,"teacher_disagreement_score":0.9805903,"about_ca_system_score_codex":0.0002026477,"about_ca_system_score_gemma":0.00012988299,"threshold_uncertainty_score":0.99991804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3234295,0.000023012302,0.66777164,0.000064796746,0.00082663156,0.0007001948,0.00006797531,0.00018687322,0.006929371],"genre_scores_gemma":[0.95775837,0.00007411709,0.032155517,0.0001296868,0.00040230525,0.000006058896,0.00008391536,0.000078909245,0.009311098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778026,0.00030944438,0.0003323604,0.0009974795,0.00010753188,0.00047294897],"domain_scores_gemma":[0.9969281,0.0008199157,0.00044360885,0.0012812879,0.00028838025,0.00023870292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088359445,0.00047476217,0.00080113043,0.00020154833,0.00027801972,0.00006346632,0.0007700162,0.0005668789,0.00004716942],"category_scores_gemma":[0.00037008955,0.0005116174,0.00058066746,0.00017065376,0.00019716127,0.000070131144,0.00086316577,0.00055217167,0.0000012456175],"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.00047668256,0.0006065746,0.0011817865,0.0025600714,0.00039412407,0.00007959213,0.0005127859,0.0020358271,0.000617322,0.9767822,0.0107679535,0.003985077],"study_design_scores_gemma":[0.0014889651,0.00015131236,0.0001411608,0.00024175791,0.0004528882,0.000004771986,0.00012305134,0.283467,0.00029375532,0.69509786,0.017642781,0.00089469145],"about_ca_topic_score_codex":0.00009165772,"about_ca_topic_score_gemma":0.00022292917,"teacher_disagreement_score":0.6356161,"about_ca_system_score_codex":0.00023567975,"about_ca_system_score_gemma":0.00009052986,"threshold_uncertainty_score":0.99973357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9461507,0.00031484707,0.028161721,0.00048043267,0.00024042629,0.00040630164,0.000021022423,0.000056144832,0.024168365],"genre_scores_gemma":[0.97019994,0.0001358195,0.017326336,0.00004196564,0.00007071942,0.0000014092321,0.0000051331804,0.000028324266,0.012190335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839836,0.00028638222,0.0002795256,0.00026080752,0.00040158624,0.00037332252],"domain_scores_gemma":[0.9968973,0.0014780912,0.00040539622,0.00075347826,0.0003326226,0.00013310948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566286,0.0002017051,0.00043154473,0.00016709858,0.0003854636,0.00004093099,0.00069455063,0.00016251465,0.00033093774],"category_scores_gemma":[0.00062735064,0.00017384406,0.00032661052,0.0003745411,0.0005969828,0.00021277074,0.0002861228,0.00022355827,0.0000034738807],"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.000048209193,0.00008686608,0.0012695821,0.00012958901,0.00015968746,0.000003595025,0.0016348585,0.000002357872,0.00012054889,0.9895046,0.0057366258,0.0013035041],"study_design_scores_gemma":[0.00050058035,0.000086662956,0.0006662821,0.000032417625,0.0000748441,0.0000051274114,0.012365353,0.00032759464,0.000014350147,0.9840397,0.0017025894,0.00018447221],"about_ca_topic_score_codex":0.00041556056,"about_ca_topic_score_gemma":0.00032805797,"teacher_disagreement_score":0.024049217,"about_ca_system_score_codex":0.00006779053,"about_ca_system_score_gemma":0.000053161733,"threshold_uncertainty_score":0.70891553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788407,0.0026388846,0.0090287905,0.0004974605,0.0011558761,0.00036090467,0.00006007839,0.000048799757,0.007368526],"genre_scores_gemma":[0.9544271,0.0012779243,0.041188393,0.000024855022,0.00022770233,0.0000041592452,0.0000022649374,0.000051885236,0.0027956998],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962632,0.00019201213,0.0022413414,0.00024340364,0.0006836123,0.00037640476],"domain_scores_gemma":[0.99288875,0.0030371218,0.0025018174,0.0005341896,0.00075601425,0.00028212398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031093236,0.000352067,0.0012288387,0.00052053796,0.0000929518,0.00006710051,0.00033645274,0.00044602135,0.000113788316],"category_scores_gemma":[0.0050258343,0.00021084804,0.00042053353,0.00044773842,0.00026735308,0.0004694591,0.00012708218,0.00050851476,3.670373e-7],"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.0018388367,0.010575511,0.012720608,0.020817997,0.010867842,0.0012104023,0.014765154,0.00012572441,0.0856451,0.28615162,0.017941464,0.53733975],"study_design_scores_gemma":[0.026757836,0.007815311,0.0068560173,0.01978488,0.0054616304,0.012267465,0.014452191,0.010646839,0.047672827,0.80137,0.041132342,0.0057826103],"about_ca_topic_score_codex":0.00000650172,"about_ca_topic_score_gemma":7.923759e-7,"teacher_disagreement_score":0.53155714,"about_ca_system_score_codex":0.000055725966,"about_ca_system_score_gemma":0.00009712152,"threshold_uncertainty_score":0.85981333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024040316,0.00006905734,0.99430853,0.00046137325,0.00039018577,0.0003561003,0.0005325735,0.00017083614,0.0013073212],"genre_scores_gemma":[0.017287267,0.00003788957,0.97784764,0.00038184476,0.00038243117,0.00002421499,0.000059526334,0.00006036866,0.0039188094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978837,0.00020505626,0.0006107636,0.00035892462,0.0005637203,0.00037785317],"domain_scores_gemma":[0.9911335,0.0075698067,0.00023550082,0.00028664447,0.0004386612,0.00033588518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003723544,0.00028922752,0.0003921216,0.000094626805,0.0001341255,0.00004837914,0.00024066881,0.00011281262,0.00025710557],"category_scores_gemma":[0.0025758073,0.00021560311,0.00008809115,0.00015889185,0.00013509304,0.000089338326,0.0001194127,0.00012219083,0.00001202874],"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.000039301445,0.00012380675,0.00012370071,0.000033539305,0.00007854005,0.00005706826,0.00016842491,0.00027104016,0.00018848605,0.7456005,0.10809633,0.1452192],"study_design_scores_gemma":[0.0012128539,0.00020044012,0.0009575737,0.00009057159,0.00008882362,0.000028826504,0.000015944079,0.081139915,0.00015851208,0.90936416,0.00632997,0.0004123858],"about_ca_topic_score_codex":0.000018907056,"about_ca_topic_score_gemma":0.000021965618,"teacher_disagreement_score":0.16376364,"about_ca_system_score_codex":0.000141029,"about_ca_system_score_gemma":0.00026479774,"threshold_uncertainty_score":0.879204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93837714,0.00011077262,0.056226894,0.00012233248,0.000118198725,0.0005069368,0.000006074455,0.00014198614,0.00438965],"genre_scores_gemma":[0.9930647,0.0000069347802,0.006503807,0.0002353362,0.000038528375,0.000058005568,0.00001392268,0.000009552232,0.00006921065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988266,0.00006315264,0.00059189816,0.000120060206,0.00021681731,0.00018146889],"domain_scores_gemma":[0.99906856,0.00013693015,0.00032449843,0.00015772418,0.0002213627,0.00009092074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994572,0.0001365415,0.00024816373,0.00015342927,0.00010189973,0.00009350159,0.00009228152,0.00008854476,0.0000014380496],"category_scores_gemma":[0.00034601355,0.00011498332,0.000028812494,0.00032296428,0.000042632448,0.0007135196,0.000028418177,0.00009917928,2.887317e-7],"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.000972783,0.0009183681,0.012044006,0.010927672,0.00011753768,0.0000021870078,0.057392422,0.06583576,0.00762218,0.67309874,0.002656436,0.1684119],"study_design_scores_gemma":[0.0005957509,0.00018439985,0.00043267186,0.00022403864,0.000025277155,0.000020357213,0.001362096,0.99128366,0.004065497,0.000359999,0.0012099826,0.00023625715],"about_ca_topic_score_codex":0.000019020874,"about_ca_topic_score_gemma":0.000004540982,"teacher_disagreement_score":0.92544794,"about_ca_system_score_codex":0.00002878394,"about_ca_system_score_gemma":0.00003488267,"threshold_uncertainty_score":0.46888834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014324178,0.000076347635,0.9833002,0.000805436,0.0001581965,0.00037230013,0.013649149,0.00006560737,0.00014032485],"genre_scores_gemma":[0.09987194,0.00004597097,0.89664125,0.0001395044,0.00015530345,0.000044074193,0.0026628945,0.00004139807,0.00039764523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968522,0.00032099982,0.00089875184,0.0009104825,0.0006459425,0.00037158004],"domain_scores_gemma":[0.9934542,0.0046364274,0.00040770398,0.00078065664,0.00046074417,0.00026027273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018829157,0.00032799537,0.00069735973,0.0003046361,0.00027956633,0.00015043498,0.0005592783,0.00012853403,0.000056979967],"category_scores_gemma":[0.00149997,0.00023352134,0.00013101389,0.00047879154,0.00032926575,0.00033731834,0.00043697585,0.0001654443,6.670984e-7],"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.00013078474,0.00014655411,0.00030898326,0.0001653999,0.0015226812,0.000018802837,0.00034866348,0.015612069,0.000012921194,0.9420018,0.006614465,0.033116844],"study_design_scores_gemma":[0.00047176387,0.0000503972,0.0001105326,0.000025155547,0.0010252298,0.000006325849,0.00003556439,0.5571263,0.000006007924,0.44034365,0.0005859312,0.00021318869],"about_ca_topic_score_codex":0.00008675907,"about_ca_topic_score_gemma":0.00061680825,"teacher_disagreement_score":0.54151416,"about_ca_system_score_codex":0.00007242911,"about_ca_system_score_gemma":0.0003360786,"threshold_uncertainty_score":0.95227236},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08331561,0.000028233051,0.90899503,0.0014152145,0.00049346854,0.0013228595,0.0002242072,0.00007502576,0.0041303546],"genre_scores_gemma":[0.3418782,0.000059267746,0.652512,0.00082263217,0.0011129527,0.0003242265,0.00012841192,0.00034170502,0.0028206022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997449,0.00019334485,0.0009104993,0.00033115962,0.0005949667,0.0005210192],"domain_scores_gemma":[0.9964278,0.0018909413,0.00060814095,0.00055674644,0.0002480844,0.00026833892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030189946,0.00042700663,0.00072780304,0.0002159182,0.00033892618,0.00016578901,0.00032880163,0.00023423597,0.000022774551],"category_scores_gemma":[0.0013234124,0.0003256005,0.00064411125,0.0001009753,0.0000547091,0.00012499104,0.000022552795,0.00037777168,6.079913e-7],"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.0014190093,0.003101454,0.000002332223,0.0023257502,0.00044909085,0.000018925199,0.0038955852,0.00052681856,0.0011006607,0.9333127,0.01053545,0.04331222],"study_design_scores_gemma":[0.009624915,0.0046741706,0.0000015434168,0.0009069272,0.00041495633,0.00015247006,0.0013307445,0.38231352,0.0022704788,0.58855504,0.009100411,0.0006548325],"about_ca_topic_score_codex":4.6557366e-7,"about_ca_topic_score_gemma":0.000019301304,"teacher_disagreement_score":0.3817867,"about_ca_system_score_codex":0.00020831358,"about_ca_system_score_gemma":0.000044372875,"threshold_uncertainty_score":0.9999196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160548,0.0003016661,0.1816553,0.000039701103,0.00048758,0.00019903976,0.000026178397,0.00004024072,0.0011954556],"genre_scores_gemma":[0.9100155,0.00006563147,0.08950148,0.00004491562,0.00020853414,0.00000571974,0.000008265054,0.000016520198,0.00013340576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.0000759331,0.00030414562,0.00020722409,0.00015043329,0.00019021532],"domain_scores_gemma":[0.9987505,0.0006418135,0.00016868162,0.00028842955,0.00006362826,0.00008692819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064538734,0.0001513493,0.0006164003,0.00015149802,0.00007411264,0.000027728902,0.0001082953,0.00012365244,0.00007650839],"category_scores_gemma":[0.00026013926,0.00010754725,0.00021275674,0.00031332966,0.00007802493,0.000031327985,0.000046478213,0.00021783792,3.6931098e-9],"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.0009672211,0.00016075734,0.021245519,0.00044495342,0.007973825,0.0000444923,0.003740007,0.0019170033,0.03885026,0.23433617,0.0015352198,0.6887846],"study_design_scores_gemma":[0.014060612,0.00015350911,0.0253855,0.000058714882,0.006110873,0.00005023417,0.00060797826,0.86766315,0.005458587,0.07413244,0.005174494,0.001143935],"about_ca_topic_score_codex":0.000059985807,"about_ca_topic_score_gemma":0.00012423418,"teacher_disagreement_score":0.86574614,"about_ca_system_score_codex":0.0000036764254,"about_ca_system_score_gemma":0.000009902756,"threshold_uncertainty_score":0.43856493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021378107,0.00021573808,0.9729448,0.000130572,0.0022609357,0.0021841917,0.00027862683,0.0005766676,0.000030370193],"genre_scores_gemma":[0.14061718,0.00002564159,0.8572923,0.00009457985,0.00089987135,0.0007858382,0.0000013721477,0.00026960563,0.000013590013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616075,0.00022424379,0.0009438085,0.001277034,0.0004446548,0.0009495307],"domain_scores_gemma":[0.99505824,0.0006105832,0.0015105043,0.0018354638,0.00065029855,0.0003348836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029380403,0.0008368609,0.0012014704,0.00017774859,0.000631314,0.00059191184,0.0008649344,0.0007663498,0.0000018567149],"category_scores_gemma":[0.0016321666,0.00089639024,0.0004303063,0.00014234037,0.00013960534,0.00018296335,0.0006055183,0.0007708004,2.5119942e-7],"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.0004627357,0.0011873201,0.0007683074,0.02421566,0.0029326335,0.00017034016,0.0004470587,0.85180706,0.036750432,0.05638086,0.023637012,0.0012405596],"study_design_scores_gemma":[0.00064949115,0.000042331885,0.000024083636,0.0009408607,0.00030173484,1.9792745e-8,0.000003076976,0.9915659,0.0033548388,0.0020268243,0.00012407075,0.00096680736],"about_ca_topic_score_codex":0.000019777743,"about_ca_topic_score_gemma":0.0000021851733,"teacher_disagreement_score":0.13975878,"about_ca_system_score_codex":0.0002745326,"about_ca_system_score_gemma":0.00044292057,"threshold_uncertainty_score":0.9993487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962332,0.00010694929,0.30034578,0.00003488812,0.000058872123,0.00022176815,0.00012413348,0.000019118756,0.0028552937],"genre_scores_gemma":[0.72589725,0.00002921949,0.27361694,0.00000734604,0.000005174738,0.000013066753,0.000005692482,0.0000090500325,0.00041626306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.000124451,0.00020013415,0.0001512735,0.00013153913,0.00012700264],"domain_scores_gemma":[0.99811155,0.001132489,0.00028893736,0.00024311461,0.00020646524,0.000017463257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047345684,0.00009505415,0.00025323904,0.000043966775,0.00004183643,0.0000059129143,0.000077046476,0.00004034157,0.000017270431],"category_scores_gemma":[0.0011744762,0.00007354551,0.00004796905,0.00019076499,0.00006749161,0.0000922604,0.00001569908,0.00009890065,0.000001614416],"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.00009768912,0.00007204802,0.0016938212,0.00008059271,0.000028388515,0.0000013171798,0.0012369616,0.0009236286,0.0004076709,0.99092984,0.0003400045,0.004188056],"study_design_scores_gemma":[0.010432449,0.0050637103,0.04324879,0.0024794405,0.00051513064,0.000026681575,0.0037322505,0.41746503,0.08666592,0.40911636,0.019302906,0.0019513287],"about_ca_topic_score_codex":0.000026364592,"about_ca_topic_score_gemma":0.000022555692,"teacher_disagreement_score":0.58181345,"about_ca_system_score_codex":0.000022313856,"about_ca_system_score_gemma":0.00003872176,"threshold_uncertainty_score":0.2999099},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043995988,0.001678356,0.901667,0.0021187332,0.0059595783,0.00076864543,0.00003947715,0.00021097895,0.043561246],"genre_scores_gemma":[0.43702924,0.000032829626,0.55999887,0.00046316275,0.0017622163,0.000008291532,0.0000027954052,0.0000794158,0.00062317995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229604,0.00068852614,0.0015290324,0.0009583892,0.0016346582,0.002893327],"domain_scores_gemma":[0.99238366,0.0033564991,0.00058090594,0.0017937098,0.00040936045,0.0014758817],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.013851817,0.0008493578,0.001255648,0.00032963726,0.0009883578,0.0007904447,0.0020446123,0.00034911733,0.00059294916],"category_scores_gemma":[0.0018958728,0.0007317603,0.0004995377,0.0012863663,0.0077484255,0.00091322354,0.002248302,0.0007935885,0.000041442672],"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.00001004848,0.00055551203,0.00007504384,0.00071790075,0.000057974936,0.000013570801,0.009388312,0.00001836568,0.0007934242,0.9649237,0.0010988475,0.02234731],"study_design_scores_gemma":[0.000795051,0.00031435952,0.00005932731,0.0016744814,0.00042257708,0.00045188717,0.0011672643,0.67142,0.006247325,0.31018135,0.005551883,0.0017145269],"about_ca_topic_score_codex":0.000009605249,"about_ca_topic_score_gemma":9.799295e-7,"teacher_disagreement_score":0.6714016,"about_ca_system_score_codex":0.0002660606,"about_ca_system_score_gemma":0.00023241415,"threshold_uncertainty_score":0.9995133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02274192,0.000042029304,0.97635114,0.0001020716,0.00012713418,0.00027080663,0.00006150461,0.0000075514754,0.0002958398],"genre_scores_gemma":[0.53435475,0.000004169517,0.46555978,0.000012955459,0.000036594385,0.000001743667,0.000016706876,0.0000049905148,0.000008314736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828064,0.00032556432,0.00088734,0.00015441577,0.00023374832,0.000118261894],"domain_scores_gemma":[0.9907664,0.006110916,0.0016481548,0.0001055584,0.001257205,0.00011178001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412046,0.00013657002,0.0007301517,0.00032470564,0.0002337668,0.00011484417,0.00009995041,0.00007674447,0.0000073256856],"category_scores_gemma":[0.0032250145,0.00011380757,0.00012498935,0.00019427008,0.00012727578,0.0002297976,0.000023340184,0.00010966398,1.2399924e-8],"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.0012961315,0.00049597246,0.002513663,0.0013979317,0.0023425824,0.000006256466,0.0071547516,0.72044945,0.00039403353,0.08235345,0.0005308719,0.18106489],"study_design_scores_gemma":[0.0010523888,0.00031892132,0.005986132,0.00005873515,0.0010428382,0.000003166975,0.00036511364,0.9349261,0.00006152652,0.05598031,0.00009500106,0.00010978482],"about_ca_topic_score_codex":0.0000065072827,"about_ca_topic_score_gemma":0.000018688344,"teacher_disagreement_score":0.51161283,"about_ca_system_score_codex":0.000033853863,"about_ca_system_score_gemma":0.00007844358,"threshold_uncertainty_score":0.46409377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02769509,0.00008996756,0.97066754,0.000044796616,0.00008716387,0.00035960288,0.000056636123,0.00003423711,0.0009649553],"genre_scores_gemma":[0.79414916,0.000013885782,0.20566216,0.000012503738,0.000017988767,0.0000125796805,0.00006611754,0.000018703913,0.00004691317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984059,0.00042274085,0.0006390896,0.00019620512,0.0001986907,0.0001374253],"domain_scores_gemma":[0.99388456,0.0042120037,0.000669356,0.0008188214,0.00036616187,0.000049076538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011552746,0.00014260355,0.00026719397,0.0001758602,0.0003757764,0.00010195547,0.00034873688,0.0000896014,0.000004210044],"category_scores_gemma":[0.0020411275,0.00016085035,0.000036012156,0.00008751372,0.00023987769,0.00028913654,0.00025778793,0.00017000898,1.1765388e-7],"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.00002530353,0.00005693363,0.00011119134,0.00004575482,0.000011520149,2.887304e-7,0.0009793638,0.6719955,0.000014153916,0.28276244,0.0000041755547,0.043993372],"study_design_scores_gemma":[0.0005034035,0.000019871497,0.0006244118,0.00007011172,0.000032554242,5.18261e-7,0.00012650741,0.7137827,0.0000045568927,0.28471836,0.000012403996,0.00010457842],"about_ca_topic_score_codex":0.0000296453,"about_ca_topic_score_gemma":0.0000758687,"teacher_disagreement_score":0.76645404,"about_ca_system_score_codex":0.000055328874,"about_ca_system_score_gemma":0.000041792806,"threshold_uncertainty_score":0.6559287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78415155,0.0059021953,0.2002143,0.0030679717,0.0043027527,0.0006417639,0.00048761253,0.00005760277,0.0011742413],"genre_scores_gemma":[0.9047808,0.006776562,0.08325598,0.00018321512,0.00063047966,0.000009387215,0.0000223728,0.00013006607,0.0042111254],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99609417,0.00023038016,0.0020088758,0.00034163837,0.00082056125,0.00050440175],"domain_scores_gemma":[0.9953634,0.0008302704,0.0021922102,0.00041555538,0.00081420457,0.00038434833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012422808,0.00044728577,0.00094233593,0.00024141239,0.00010541547,0.000039254028,0.0003755917,0.0002954099,0.00026874663],"category_scores_gemma":[0.0004719505,0.00031094425,0.0005993539,0.00028662826,0.000112088375,0.00088478404,0.000005687729,0.00039908392,0.0000012933434],"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.0034264533,0.0013148217,0.001179468,0.0010445665,0.0009994281,0.00042984379,0.0117341,0.00026860772,0.6847057,0.006919683,0.024537297,0.26344007],"study_design_scores_gemma":[0.04774271,0.007380923,0.014940066,0.01162821,0.0039936537,0.0003199554,0.013353958,0.00007948219,0.23255177,0.028970959,0.6350251,0.0040132417],"about_ca_topic_score_codex":0.00000455864,"about_ca_topic_score_gemma":0.000047401212,"teacher_disagreement_score":0.61048776,"about_ca_system_score_codex":0.0002145483,"about_ca_system_score_gemma":0.0001689443,"threshold_uncertainty_score":0.99993426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52591777,0.0057187285,0.07221965,0.003001299,0.007307558,0.015419633,0.0018361409,0.0009044175,0.36767483],"genre_scores_gemma":[0.6939642,0.0010242406,0.18012673,0.00008443167,0.006558978,0.0028002388,0.0005008794,0.0007891817,0.11415114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942437,0.00052023935,0.0008794118,0.0011328972,0.0016910974,0.0015326991],"domain_scores_gemma":[0.9934274,0.0019175502,0.0005997882,0.002490292,0.00115275,0.0004122436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01274877,0.00057264784,0.0011088197,0.00046504106,0.0010181393,0.00086825475,0.0015490301,0.00080974924,0.00024449694],"category_scores_gemma":[0.0049094562,0.0005196882,0.0007011354,0.00011137382,0.000527652,0.00015499956,0.001845499,0.0021447076,0.0000039075544],"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.0016668694,0.0018017567,0.0015812501,0.022209,0.0024887838,0.0023712777,0.004267961,0.000024842027,0.00859657,0.106777765,0.7839334,0.0642805],"study_design_scores_gemma":[0.004693158,0.00066445535,0.00046410988,0.0040329318,0.00051460596,0.00020954541,0.0009575778,0.015076787,0.003620391,0.44921196,0.51725155,0.0033029628],"about_ca_topic_score_codex":0.00046403712,"about_ca_topic_score_gemma":0.00068099634,"teacher_disagreement_score":0.3424342,"about_ca_system_score_codex":0.00018107414,"about_ca_system_score_gemma":0.00094199745,"threshold_uncertainty_score":0.99972546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900444,0.0000072130983,0.0022198837,0.00034149148,0.00023488558,0.0001938159,0.000021255231,0.0000069030298,0.0069301594],"genre_scores_gemma":[0.99653614,0.0000046833584,0.0031340856,0.00008257828,0.000034429584,0.0000056980957,0.0000010568195,0.0000060999046,0.00019524226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993003,0.000071516115,0.00023980708,0.000047737132,0.00023621319,0.000104442304],"domain_scores_gemma":[0.9984217,0.00037095303,0.0005329504,0.00060074165,0.000056016965,0.000017625729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066186493,0.0000705502,0.00012422282,0.000025683928,0.0002026204,0.00003435664,0.00035620664,0.00003887306,0.000030140014],"category_scores_gemma":[0.001506406,0.00003771789,0.000108925626,0.000034072087,0.00009206304,0.00009728174,0.0001322198,0.00011572121,1.797338e-7],"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.00004028456,0.00010639733,0.031348784,0.0001112533,0.00004614137,4.6867405e-7,0.0016506874,0.0000084685435,0.0030875914,0.9536485,0.0026128753,0.007338566],"study_design_scores_gemma":[0.005251891,0.0008893181,0.19590482,0.001493405,0.0006083557,0.000022423525,0.012780386,0.0071445927,0.6118792,0.15475754,0.00824799,0.0010200271],"about_ca_topic_score_codex":0.000028061213,"about_ca_topic_score_gemma":0.0000037218892,"teacher_disagreement_score":0.79889095,"about_ca_system_score_codex":0.000023226587,"about_ca_system_score_gemma":0.000017079168,"threshold_uncertainty_score":0.18034175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015274418,0.00039956797,0.96325934,0.0025421006,0.0006865184,0.0012739196,0.00019503402,0.00021152587,0.016157575],"genre_scores_gemma":[0.018270679,0.00022175889,0.97023916,0.000075992204,0.00007836126,0.00034391935,0.00051937916,0.00010471029,0.01014601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98860025,0.008578511,0.0007759444,0.00112882,0.0004008874,0.00051559595],"domain_scores_gemma":[0.9873988,0.0051795705,0.00086632144,0.0044312025,0.0018894278,0.00023468785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.024361035,0.00046578894,0.0008644289,0.00026137583,0.00044238236,0.00040886732,0.001715396,0.0006187016,0.000046974354],"category_scores_gemma":[0.006701996,0.00047830632,0.00026132778,0.0001657521,0.00012596366,0.00018561751,0.001286373,0.0007891084,4.6596395e-7],"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.000074897864,0.0018319635,0.00043872843,0.0012973194,0.00016433773,0.000014031093,0.008399013,0.00017751065,0.0077019027,0.77982366,0.0031678576,0.19690877],"study_design_scores_gemma":[0.0025988552,0.0000030125316,0.00045969503,0.0049869586,0.00025000324,0.000016211821,0.00029464546,0.39680514,0.049265873,0.516289,0.027555795,0.0014748563],"about_ca_topic_score_codex":0.0032600386,"about_ca_topic_score_gemma":0.002030484,"teacher_disagreement_score":0.3966276,"about_ca_system_score_codex":0.00018731519,"about_ca_system_score_gemma":0.00036676164,"threshold_uncertainty_score":0.9997669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6559316,0.000059667414,0.1657099,0.00013065706,0.0008517143,0.0012960142,0.00135584,0.00031002169,0.17435458],"genre_scores_gemma":[0.91297203,0.0003254593,0.0037423803,0.000038763177,0.000101602214,8.6896046e-7,0.000092248185,0.000087227185,0.08263944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580497,0.0005825417,0.00053815823,0.0013194504,0.00083742506,0.00091748254],"domain_scores_gemma":[0.99510264,0.0009625966,0.0010277174,0.0020668877,0.00048338267,0.00035678342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041644505,0.0008751476,0.0009811324,0.0009424324,0.0010013077,0.0009395471,0.003009864,0.0004676712,0.00000387644],"category_scores_gemma":[0.00039609222,0.0009103159,0.00060386094,0.0003469076,0.00062197616,0.0010399321,0.0028866103,0.0015710139,0.0000013926592],"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.009823153,0.0066529987,0.030296989,0.006963733,0.0047904174,0.16503678,0.1399674,0.35098654,0.002757926,0.043591138,0.015383987,0.22374895],"study_design_scores_gemma":[0.027318753,0.0026517261,0.0044416487,0.01006234,0.0049131876,0.0009983152,0.09721682,0.38591388,0.0053010606,0.18688641,0.24914268,0.025153175],"about_ca_topic_score_codex":0.001723696,"about_ca_topic_score_gemma":0.0022286475,"teacher_disagreement_score":0.2570404,"about_ca_system_score_codex":0.0012235323,"about_ca_system_score_gemma":0.0010461466,"threshold_uncertainty_score":0.99933475},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6319699,0.00009550718,0.2159703,0.0015623372,0.00034976922,0.0010214036,0.00003409523,0.000092482034,0.1489042],"genre_scores_gemma":[0.95133185,0.000046497153,0.041692395,0.00020309373,0.00007856151,0.00003732544,0.0000010599572,0.000024116192,0.0065851095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981427,0.00016425937,0.00061742484,0.00033578987,0.0003226882,0.00041714692],"domain_scores_gemma":[0.9966443,0.0014019273,0.0004246754,0.0012452542,0.00016784105,0.00011595737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023933202,0.00022275507,0.00061282126,0.000107082444,0.00013165173,0.00005072808,0.00063953927,0.0001801511,0.00012697949],"category_scores_gemma":[0.0052876608,0.00018011442,0.00017316767,0.000061799285,0.0001224679,0.00013978295,0.00017922286,0.00025368296,2.3126255e-7],"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.006608699,0.0023361144,0.030938778,0.0023196673,0.00062625215,0.00030579083,0.010911995,0.00016621468,0.11028218,0.7437363,0.020854788,0.07091321],"study_design_scores_gemma":[0.039849035,0.0026121817,0.007040917,0.0019307586,0.0004470436,0.000065427244,0.007700397,0.83220834,0.07546604,0.02464077,0.0049451203,0.0030939868],"about_ca_topic_score_codex":0.0008559952,"about_ca_topic_score_gemma":0.0012746998,"teacher_disagreement_score":0.8320421,"about_ca_system_score_codex":0.000049274437,"about_ca_system_score_gemma":0.00006838043,"threshold_uncertainty_score":0.7344853},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062728423,0.0032583582,0.03636701,0.00064697064,0.0029182897,0.0015075026,0.00054961443,0.0010272731,0.9530977],"genre_scores_gemma":[0.0072887787,0.0058421968,0.35045388,0.0005647023,0.0044254125,0.00038368488,0.0001538857,0.0006475415,0.6302399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99345547,0.0007655982,0.0015377775,0.0013505325,0.0018022147,0.0010883906],"domain_scores_gemma":[0.9938961,0.0013180538,0.0010281835,0.0024572213,0.00070450816,0.00059587765],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028626323,0.0012439609,0.002256704,0.000779712,0.00020228705,0.00031714857,0.0012322444,0.0015259886,0.003592303],"category_scores_gemma":[0.0046258364,0.0009944148,0.0009579407,0.0006920581,0.00026602385,0.00037469287,0.00097222254,0.0012090581,0.0000027046503],"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.00004194198,0.00014584587,0.00039386304,0.0017548712,0.000681022,0.00021298516,0.00034250764,2.007784e-7,0.000013665705,0.010058665,0.96147114,0.024883308],"study_design_scores_gemma":[0.0005347269,0.00030128204,0.000032255604,0.0011150521,0.00077248435,0.00015654846,0.0005825275,0.00070528383,0.0005092967,0.010834815,0.98261577,0.0018399755],"about_ca_topic_score_codex":0.0011781051,"about_ca_topic_score_gemma":0.0010357503,"teacher_disagreement_score":0.3228578,"about_ca_system_score_codex":0.00038315216,"about_ca_system_score_gemma":0.0019110547,"threshold_uncertainty_score":0.9997702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5953149,0.00026704936,0.4012978,0.0000492145,0.0009140811,0.0017651033,0.00005767235,0.00026164047,0.000072535564],"genre_scores_gemma":[0.61992735,0.00054921507,0.37754554,0.000066585155,0.00034885702,0.0012705137,8.9195095e-7,0.00028074125,0.000010295269],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964048,0.00020050093,0.0009311871,0.0012401623,0.00040754874,0.0008157601],"domain_scores_gemma":[0.996984,0.0002801621,0.00076262467,0.0011109399,0.0005990803,0.00026321178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022437668,0.0008020036,0.0010271019,0.00086549023,0.00014884603,0.000114097056,0.00052404945,0.00041447865,0.000009026927],"category_scores_gemma":[0.00035362566,0.0008406873,0.00022534041,0.00039684484,0.00019535694,0.00026212164,0.00039902475,0.00072397647,2.2255703e-7],"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.004829467,0.0032130952,0.05920691,0.046967085,0.0038521497,0.00040236436,0.0035378064,0.027011827,0.81689173,0.025460165,0.00817392,0.00045349493],"study_design_scores_gemma":[0.008494273,0.00076751865,0.04617968,0.009475689,0.0012787384,2.1753259e-7,0.00021188267,0.8670675,0.048305947,0.00052430964,0.009622713,0.008071539],"about_ca_topic_score_codex":0.00003395076,"about_ca_topic_score_gemma":0.000041377494,"teacher_disagreement_score":0.84005564,"about_ca_system_score_codex":0.0016989643,"about_ca_system_score_gemma":0.0006595908,"threshold_uncertainty_score":0.9994044},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042021503,0.00012256553,0.9378813,0.049495645,0.0019088895,0.0026610228,0.00010723014,0.000312648,0.0033085414],"genre_scores_gemma":[0.02234614,0.000024043444,0.9722773,0.00091328507,0.00317873,0.00091354665,0.000110721754,0.00006732193,0.00016895386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594027,0.00024517314,0.00085961254,0.0013433732,0.000863014,0.00074856525],"domain_scores_gemma":[0.9965552,0.0013239371,0.0003641867,0.0011123834,0.00024124284,0.000403048],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037158788,0.0006144806,0.0009088859,0.00010516776,0.0012620073,0.0008488503,0.0015675465,0.00042373483,0.000014173613],"category_scores_gemma":[0.013659736,0.0003713842,0.00033071256,0.0006194746,0.0010755594,0.00033268266,0.0008158425,0.0007203036,7.955337e-7],"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.00007649807,0.00014614456,9.956923e-7,0.0010792053,0.00006788839,0.0000011805541,0.0020204228,0.0009769973,0.00027092258,0.9866036,0.002138536,0.0066175866],"study_design_scores_gemma":[0.00012956907,0.00034735422,0.0000014682116,0.000077739765,0.00012740708,0.000033958382,0.00023339385,0.006825121,0.0013879167,0.9166403,0.07366279,0.00053300796],"about_ca_topic_score_codex":0.000032646127,"about_ca_topic_score_gemma":0.00032138976,"teacher_disagreement_score":0.071524255,"about_ca_system_score_codex":0.00012698186,"about_ca_system_score_gemma":0.00037978674,"threshold_uncertainty_score":0.9998738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05879553,0.000016581145,0.93868357,0.00015408383,0.0009886124,0.00011906206,0.0006469755,0.0000063213574,0.0005892488],"genre_scores_gemma":[0.20529598,0.000005517543,0.7943036,0.000032463962,0.0003311053,0.0000016054438,0.000004113632,0.000009561786,0.000016049176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984329,0.00025757673,0.0006034788,0.00016268493,0.00039690497,0.00014650733],"domain_scores_gemma":[0.9960703,0.0016496275,0.00052539195,0.00013617467,0.001503167,0.0001152874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437991,0.0001400649,0.00029318873,0.00007791084,0.00013161718,0.00007984389,0.00019104223,0.00005389333,0.000041982163],"category_scores_gemma":[0.00429614,0.00010969434,0.00007838645,0.00006502196,0.00024122678,0.00010306258,0.000088618086,0.00022704068,5.9049555e-8],"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.0010883672,0.00021270906,0.0007253834,0.00009183923,0.00043276974,0.000051735784,0.001239712,0.00015849652,0.0009809489,0.85117584,0.0020935046,0.14174871],"study_design_scores_gemma":[0.00061153725,0.00067657774,0.00029609306,0.00021595415,0.000084438805,0.00009157842,0.00008258041,0.07803702,0.0010328573,0.9181145,0.0006037454,0.00015314035],"about_ca_topic_score_codex":0.000017728402,"about_ca_topic_score_gemma":0.00001405584,"teacher_disagreement_score":0.14650044,"about_ca_system_score_codex":0.00018568146,"about_ca_system_score_gemma":0.000117126474,"threshold_uncertainty_score":0.5143191},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054834937,0.0017590459,0.99173343,0.00021465855,0.00038578862,0.00017405904,0.00006812033,0.000019427638,0.00016197377],"genre_scores_gemma":[0.5239982,0.00021707822,0.47510234,0.00006106108,0.00037579547,0.0000059934223,0.000015451744,0.000026524765,0.00019759641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987013,0.00007512608,0.0004801822,0.00010673392,0.00027786833,0.00035883032],"domain_scores_gemma":[0.99750245,0.0017493559,0.00020084658,0.00007244904,0.00041078118,0.000064104475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294462,0.000115116745,0.00022721938,0.00007831801,0.00006495494,0.000064211345,0.00010800454,0.000047162946,0.00000769218],"category_scores_gemma":[0.00021666918,0.00009559307,0.00010064757,0.00011398216,0.000022376944,0.0000561761,0.000016358008,0.0002873036,1.0174137e-7],"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.00004739155,0.000040759292,0.000001634059,0.00012067628,0.000111026275,0.000014716131,0.00020686495,0.11905901,0.000070792696,0.8650755,0.0064688725,0.008782703],"study_design_scores_gemma":[0.00019458361,0.00028641042,0.000004221785,0.00011496542,0.00008710874,0.000056571662,0.000014074498,0.4427859,0.000022491175,0.55550414,0.0008613234,0.000068189795],"about_ca_topic_score_codex":0.0000010055228,"about_ca_topic_score_gemma":0.0000070180386,"teacher_disagreement_score":0.5185147,"about_ca_system_score_codex":0.00024125917,"about_ca_system_score_gemma":0.0005255757,"threshold_uncertainty_score":0.3898172},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027941217,0.002222919,0.59059495,0.000023958066,0.0020642062,0.002575112,0.0002269979,0.00016272029,0.40184972],"genre_scores_gemma":[0.15632944,0.00048288092,0.028828735,0.00007231122,0.003487066,0.00045194812,0.00011945845,0.0004361847,0.809792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974498,0.00012749636,0.0011204905,0.00044519352,0.00062035833,0.00023664754],"domain_scores_gemma":[0.9945714,0.0021210595,0.0014294548,0.00071811746,0.0010691538,0.00009080996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014994282,0.0004382756,0.0011438908,0.00026948182,0.000075796735,0.000055851804,0.00024322337,0.000613765,0.0001478725],"category_scores_gemma":[0.0017490679,0.00036836934,0.00024233022,0.00005755352,0.0000817904,0.00010967917,0.000042366108,0.00023908865,0.0000034436548],"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.003399487,0.00047122204,0.000063569096,0.067021005,0.0028730044,0.00006665465,0.0031230776,0.0001188646,0.0028768862,0.6321645,0.10793625,0.17988548],"study_design_scores_gemma":[0.0070390897,0.0012401243,0.0000056237473,0.015856704,0.0018854756,0.000102156744,0.0006275517,0.018404761,0.00082866737,0.14113991,0.8105057,0.0023642252],"about_ca_topic_score_codex":0.000022317587,"about_ca_topic_score_gemma":0.000051105926,"teacher_disagreement_score":0.7025695,"about_ca_system_score_codex":0.00011727447,"about_ca_system_score_gemma":0.00016643999,"threshold_uncertainty_score":0.9998768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2242111,0.000026849788,0.77423334,0.0003840486,0.00008104875,0.0004209606,0.0000070803962,0.00011068893,0.0005248868],"genre_scores_gemma":[0.3552611,0.000012875053,0.6441678,0.0002878742,0.0001019981,0.000030066143,0.000013622039,0.000019501553,0.00010515876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983208,0.0002863438,0.0006053095,0.00036803618,0.00009587863,0.0003236],"domain_scores_gemma":[0.9959664,0.003379979,0.00026451287,0.00018381755,0.00011758377,0.00008775318],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0053839334,0.00018018279,0.0004803223,0.0000809175,0.00012942599,0.000020585838,0.00008325445,0.00020592645,0.0000013121027],"category_scores_gemma":[0.010583409,0.00015876153,0.00007172026,0.00011260924,0.00009724032,0.00011439907,0.00007513878,0.00017132104,8.148495e-8],"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.0007213644,0.0004031048,0.030599948,0.002089638,0.0000890348,0.000008764324,0.0074766036,0.085117556,0.0028869917,0.5791861,0.017287318,0.2741336],"study_design_scores_gemma":[0.00030442319,0.0000465451,0.00013301958,0.00005679907,0.000012614293,0.000004516947,0.0000640918,0.6895021,0.0002974877,0.30943528,0.000027126596,0.00011597831],"about_ca_topic_score_codex":0.000020871936,"about_ca_topic_score_gemma":0.000034044682,"teacher_disagreement_score":0.60438454,"about_ca_system_score_codex":0.000070754584,"about_ca_system_score_gemma":0.000023459499,"threshold_uncertainty_score":0.9977509},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811757,0.00024668477,0.013082523,0.0011516853,0.000044741948,0.0007626646,0.000036650952,0.000029823033,0.003469521],"genre_scores_gemma":[0.9958543,0.00014597457,0.00304055,0.00030021602,0.000098186705,0.00018248254,0.0000067720566,0.00002030766,0.00035122057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909955,0.000090429305,0.000287121,0.00021615803,0.00014707909,0.0001596828],"domain_scores_gemma":[0.9988731,0.0005972876,0.00005349663,0.00028596,0.00013167884,0.00005844756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036974385,0.000129872,0.000188446,0.00008759982,0.00015097784,0.0000180907,0.00014785501,0.000058949936,0.000062620034],"category_scores_gemma":[0.000077167024,0.00008412471,0.00005366123,0.00028222642,0.00009988334,0.000044806737,0.000041888426,0.00014600714,0.0000022099744],"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.000032685213,0.00030649678,0.000901589,0.000073913354,0.000044764278,6.389367e-7,0.001433454,0.0000010449899,0.01161593,0.9828519,0.0007613243,0.0019762581],"study_design_scores_gemma":[0.0054546227,0.00090091187,0.011455849,0.0004929536,0.00059266906,0.000059139456,0.0028934516,0.034312245,0.33180228,0.5564136,0.053745184,0.0018770812],"about_ca_topic_score_codex":0.000031613163,"about_ca_topic_score_gemma":0.000115262716,"teacher_disagreement_score":0.4264383,"about_ca_system_score_codex":0.000010658769,"about_ca_system_score_gemma":0.00002152142,"threshold_uncertainty_score":0.3430506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1836848,0.000027153646,0.8144884,0.0003192941,0.0001201637,0.00047328416,0.000011917443,0.00016326956,0.0007116989],"genre_scores_gemma":[0.89750004,0.0000014628483,0.10065579,0.00072240643,0.00005001353,0.00005983506,0.0000017415421,0.00007157361,0.0009371529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808145,0.00013190217,0.0003376886,0.00052632025,0.00048942195,0.000433244],"domain_scores_gemma":[0.99892664,0.000119584285,0.00010516621,0.0003873604,0.0002001746,0.0002610989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830915,0.00030654602,0.00035533056,0.00016468937,0.00025649817,0.000113217226,0.00016237766,0.00014651057,0.00012821658],"category_scores_gemma":[0.000006225185,0.00024186756,0.00012882882,0.0004763766,0.000045892888,0.00033801008,0.000002090813,0.0003554075,0.000004177299],"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.002044086,0.00080203335,0.000024774796,0.00087962294,0.00008339002,0.000049450548,0.0021327531,0.59593576,0.26359007,0.0002449323,0.0002433847,0.13396974],"study_design_scores_gemma":[0.0012611187,0.0004343431,0.0000026504165,0.00064906105,0.00010656719,0.000016758988,0.00021979085,0.71544737,0.28047183,0.00082630775,0.00014212192,0.0004220395],"about_ca_topic_score_codex":0.000022583105,"about_ca_topic_score_gemma":0.000049605722,"teacher_disagreement_score":0.7138326,"about_ca_system_score_codex":0.00009602883,"about_ca_system_score_gemma":0.00019259981,"threshold_uncertainty_score":0.98630726},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010573063,0.6976963,0.29749918,0.0000021114224,0.0026137417,0.001976759,0.000038275084,0.000027519387,0.0000403502],"genre_scores_gemma":[0.000025305975,0.67304254,0.32472464,8.3092647e-7,0.00035973775,0.0003327239,0.0014073984,0.000087051405,0.000019743611],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967119,0.00022554967,0.0019143886,0.0005190078,0.00028477845,0.0003443361],"domain_scores_gemma":[0.99788105,0.00029350808,0.0012082985,0.00033857263,0.00019507813,0.00008347339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013199836,0.00047047052,0.0013456636,0.00044764663,0.000117139905,0.000033996705,0.000301881,0.00026939868,0.0000036872887],"category_scores_gemma":[0.00012639475,0.0004594907,0.0002612225,0.00024846705,0.000038673592,0.000025612657,0.00017993532,0.0002079635,1.3486753e-7],"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.0000040313325,0.000114224524,0.000044150333,0.055172045,0.0000578102,7.01567e-8,0.0005543285,0.000015078,0.0000011054593,0.0022667411,0.00054740347,0.941223],"study_design_scores_gemma":[0.0005457325,0.000072176306,0.000023995652,0.023778947,0.000153375,0.0000030447643,0.000026049924,0.0024221453,0.00001821675,0.0061977683,0.96603996,0.00071859866],"about_ca_topic_score_codex":0.000001966169,"about_ca_topic_score_gemma":0.0000122778065,"teacher_disagreement_score":0.96549255,"about_ca_system_score_codex":0.00040084886,"about_ca_system_score_gemma":0.0003095751,"threshold_uncertainty_score":0.99978566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9311735,0.00010397484,0.05969215,0.00030720935,0.00024226822,0.0009591282,0.00025594002,0.000021216856,0.0072446247],"genre_scores_gemma":[0.75992537,0.0000087012895,0.23970911,0.0000631292,0.00011649598,0.00004240854,0.0000098027795,0.000019577868,0.00010538993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976843,0.00022513619,0.0012655136,0.00024612495,0.00032488347,0.00025404492],"domain_scores_gemma":[0.995037,0.002032089,0.00092266535,0.00055613695,0.0013065118,0.00014557042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00455265,0.00017988635,0.00092255115,0.00006160519,0.00007942584,0.00001952138,0.00021042877,0.00011670233,0.000119358425],"category_scores_gemma":[0.002926761,0.00015030599,0.0005281747,0.00020549174,0.00016187417,0.00007096251,0.00007757033,0.00024605374,3.1044546e-8],"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.002089372,0.0047817114,0.003823335,0.0046638325,0.0011239168,0.000026482929,0.0024230042,0.00011465658,0.11566677,0.8296355,0.012114631,0.023536798],"study_design_scores_gemma":[0.0022894184,0.0002892379,0.0007257692,0.000046754245,0.0003990888,0.000044963635,0.001202024,0.00022048737,0.08518157,0.9002683,0.009080621,0.0002517236],"about_ca_topic_score_codex":0.000002109994,"about_ca_topic_score_gemma":0.00003494735,"teacher_disagreement_score":0.18001696,"about_ca_system_score_codex":0.00010621576,"about_ca_system_score_gemma":0.00033366002,"threshold_uncertainty_score":0.61293006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962853,0.00008599118,0.29535097,0.000021222639,0.00029026152,0.0001469906,0.000014898411,0.00006834509,0.007736049],"genre_scores_gemma":[0.73849964,0.000008596505,0.2606992,0.00004319641,0.00007003569,3.4493513e-7,0.0000035887715,0.000020471443,0.00065492606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991595,0.00006000012,0.00022895721,0.00020495163,0.00012488378,0.00022169684],"domain_scores_gemma":[0.99868375,0.0008943829,0.00008743042,0.00020116703,0.000066643355,0.00006663421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041214275,0.00012008747,0.00021351337,0.00004048925,0.0001038222,0.000059006343,0.00009495387,0.00004399855,0.000043358323],"category_scores_gemma":[0.00023961373,0.00010971388,0.00002379208,0.000070154936,0.000016439408,0.00002940043,0.00019212629,0.00012480313,4.060807e-7],"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.000039728082,0.00009000979,0.021581985,0.0015616083,0.00016815367,0.00006888161,0.0036701348,0.0011044025,0.007576619,0.826613,0.0045481347,0.13297734],"study_design_scores_gemma":[0.00070960826,0.00007771444,0.0006233382,0.0002056482,0.000031681375,0.000012414547,0.0004104572,0.95013034,0.00039328667,0.042396605,0.004640399,0.00036851395],"about_ca_topic_score_codex":0.000024604104,"about_ca_topic_score_gemma":0.0000044960157,"teacher_disagreement_score":0.9490259,"about_ca_system_score_codex":0.000013721132,"about_ca_system_score_gemma":0.000012841895,"threshold_uncertainty_score":0.44740024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272046,0.000836665,0.006775653,0.00044689223,0.0007378186,0.0021561133,0.00043562116,0.000100411526,0.06130621],"genre_scores_gemma":[0.93160594,0.000076828495,0.05214746,0.000046928602,0.00007963239,0.0003775333,0.000026177084,0.00012203518,0.015517471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948007,0.0008629735,0.0021354512,0.00047951427,0.001245145,0.00047625243],"domain_scores_gemma":[0.9955067,0.00078263227,0.0019710544,0.0011998625,0.0003896629,0.0001500863],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041182865,0.00042551043,0.0014181115,0.00032371606,0.00029088432,0.000026521735,0.0007605652,0.00015228863,0.003420827],"category_scores_gemma":[0.0009692016,0.00040454697,0.0007830372,0.0007052743,0.00038305207,0.0001451312,0.00093679124,0.00046251545,0.0000025856125],"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.00019003522,0.004679256,0.00024074505,0.016164009,0.0006025713,0.00002235091,0.006792595,0.000063350184,0.016218474,0.94723284,0.0066308975,0.0011628802],"study_design_scores_gemma":[0.006607345,0.0035225446,0.00038402138,0.0036731344,0.0033393786,0.00036394576,0.02539091,0.013776336,0.08714607,0.77272326,0.08049167,0.0025813968],"about_ca_topic_score_codex":0.000050314724,"about_ca_topic_score_gemma":0.000008061205,"teacher_disagreement_score":0.17450958,"about_ca_system_score_codex":0.00015306522,"about_ca_system_score_gemma":0.0002052378,"threshold_uncertainty_score":0.9998406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20823038,0.00007914597,0.7909224,0.00008889453,0.00008172449,0.00035404428,0.000034692894,0.00003382138,0.00017491773],"genre_scores_gemma":[0.6769544,0.0000011999288,0.3224039,0.00007414079,0.000098491975,0.000055831566,0.00031959542,0.000010780311,0.00008166733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988432,0.00017629015,0.00026635168,0.0003722082,0.0000875419,0.0002544333],"domain_scores_gemma":[0.99947876,0.00010369272,0.000106545944,0.0000884079,0.00015672749,0.000065889886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005972733,0.0001437735,0.0002013982,0.00010385914,0.00020251483,0.000017324714,0.000048804108,0.00022421073,0.000007831586],"category_scores_gemma":[0.00012319502,0.00014120853,0.00005487697,0.00015552714,0.00012674298,0.00010187802,0.000034421235,0.00010405699,2.0263396e-7],"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.00053003686,0.0002659775,0.0023516505,0.00015681914,0.00011021076,0.0000058711844,0.00088974176,0.008362086,0.023944931,0.9557167,0.0010133577,0.0066525857],"study_design_scores_gemma":[0.001012172,0.00012800461,0.00045588668,0.000009118075,0.000017584764,0.000043737968,0.000032793687,0.47869286,0.0006430379,0.5188303,0.000010669144,0.00012380122],"about_ca_topic_score_codex":0.00009430258,"about_ca_topic_score_gemma":0.0001023224,"teacher_disagreement_score":0.47033077,"about_ca_system_score_codex":0.0000726814,"about_ca_system_score_gemma":0.00006640312,"threshold_uncertainty_score":0.57583165},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8725647,0.0023479343,0.11332272,0.0015465139,0.0006870127,0.00087459007,0.000040364444,0.00020939832,0.008406813],"genre_scores_gemma":[0.014381085,0.00041708467,0.9781319,0.00009918019,0.00061786507,0.00001756738,0.0000021897056,0.00008742308,0.006245711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982828,0.000068864916,0.00083645975,0.00014613254,0.0003420137,0.00032373852],"domain_scores_gemma":[0.9956547,0.0028307221,0.0007467142,0.00019145058,0.0004496426,0.00012674124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002812715,0.00021377209,0.0005803062,0.00023834597,0.00013325733,0.00009385766,0.00022769379,0.00010054843,0.000011118122],"category_scores_gemma":[0.0047103185,0.00016448878,0.00016973757,0.00026601317,0.000052805834,0.00013014673,0.00009189645,0.00016898706,3.0560273e-7],"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.00050048035,0.002046374,0.003135008,0.085648015,0.0030050185,0.00062795536,0.048315834,0.00018355958,0.026344998,0.34268478,0.27110657,0.21640138],"study_design_scores_gemma":[0.005868028,0.0011744692,0.000077247685,0.005204793,0.0013998799,0.0021669746,0.029503183,0.06957238,0.023173738,0.82914215,0.030975142,0.0017420113],"about_ca_topic_score_codex":0.0000011684514,"about_ca_topic_score_gemma":0.0000033766592,"teacher_disagreement_score":0.86480916,"about_ca_system_score_codex":0.000027459691,"about_ca_system_score_gemma":0.00010403306,"threshold_uncertainty_score":0.67076576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073668576,0.00021246269,0.7256223,0.0001494223,0.0013804173,0.028348938,0.0007576096,0.000567899,0.24222425],"genre_scores_gemma":[0.00008198529,0.000021491685,0.6701786,0.0001051529,0.0017804817,0.0013694162,0.00011330748,0.00038301782,0.32596657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969695,0.000007486515,0.0011991644,0.0007766272,0.00033907066,0.0007081159],"domain_scores_gemma":[0.99528044,0.0026365248,0.0010877341,0.0005624066,0.0002288131,0.00020410103],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021938556,0.0008703736,0.0017954137,0.000071053095,0.00046485366,0.00018012658,0.00031708475,0.0017266994,0.0000076414535],"category_scores_gemma":[0.00022291232,0.00077467127,0.0015549537,0.000022629714,0.00022873693,0.000032180393,0.0002164361,0.0008074653,2.1742976e-7],"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.0005077296,0.00006520746,6.016715e-8,0.004396945,0.0010735696,2.6335167e-7,0.0017545499,7.32678e-7,0.0020761616,0.92747253,0.003210208,0.059442066],"study_design_scores_gemma":[0.011965606,0.0004484732,2.2722024e-9,0.0007094872,0.0017496111,0.000008678801,0.00068712496,0.0018638314,0.0017176165,0.43463212,0.5449114,0.0013060574],"about_ca_topic_score_codex":0.000002218843,"about_ca_topic_score_gemma":0.000004209292,"teacher_disagreement_score":0.5417012,"about_ca_system_score_codex":0.00013158652,"about_ca_system_score_gemma":0.000258083,"threshold_uncertainty_score":0.9995693},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95195913,0.00006360015,0.02203104,0.000046256333,0.0009371025,0.00039458703,0.000026098278,0.0000934021,0.024448756],"genre_scores_gemma":[0.9824974,0.00051613565,0.0048710955,0.000023163077,0.00010282111,9.801245e-7,0.000007974042,0.000040634706,0.011939791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983565,0.00036481456,0.00028741395,0.0005691018,0.00012348541,0.0002986563],"domain_scores_gemma":[0.9969886,0.0006011955,0.0004893853,0.001466812,0.0003416092,0.00011243323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040906,0.0002904318,0.00042725768,0.00009398192,0.00021192062,0.000026660051,0.00086772075,0.00037870996,0.00007903058],"category_scores_gemma":[0.00023974042,0.00024147179,0.0004543021,0.00027494025,0.00042629743,0.00005876272,0.0010540875,0.0004215962,0.0000021931646],"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.00019633737,0.00011390529,0.0038056835,0.00052633724,0.00034845914,0.000072010545,0.00030171123,0.00012576424,0.00008477089,0.9793829,0.014556914,0.00048525646],"study_design_scores_gemma":[0.0006989081,0.000057901387,0.00012481607,0.0002891881,0.0004283432,0.000006590574,0.00059069594,0.008144351,0.0022443782,0.97560436,0.011295351,0.00051511126],"about_ca_topic_score_codex":0.00007539481,"about_ca_topic_score_gemma":0.00003181423,"teacher_disagreement_score":0.030538248,"about_ca_system_score_codex":0.00009424962,"about_ca_system_score_gemma":0.00008421939,"threshold_uncertainty_score":0.9846934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6133075,0.000032697462,0.37727302,0.00081124593,0.0013439634,0.0005949547,0.00005967374,0.0002024259,0.0063745407],"genre_scores_gemma":[0.98258924,0.000004180869,0.012285727,0.00055033853,0.0013814084,0.000012304219,0.00004315444,0.000045694018,0.0030879346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787295,0.00041445912,0.00054610334,0.00045943042,0.00039594815,0.00031108124],"domain_scores_gemma":[0.99575007,0.002304987,0.0003607219,0.0008738779,0.00059982686,0.00011049125],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068806106,0.00030356774,0.00033797036,0.00007118066,0.00026548127,0.00015260479,0.0003806517,0.00021333936,0.0010296106],"category_scores_gemma":[0.0013334214,0.00019853687,0.00014734664,0.00014696436,0.0001596481,0.00031634513,0.00018498728,0.00022962298,0.000023310735],"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.0040568537,0.0011792574,0.034807734,0.00034851694,0.00096946716,0.000045630954,0.06531314,0.022146942,0.044874895,0.010562569,0.037711177,0.77798384],"study_design_scores_gemma":[0.00094329304,0.00021973441,0.0027721324,0.00037503862,0.00007910956,0.0000015569344,0.00036967464,0.9402023,0.0023765482,0.005540344,0.046730094,0.00039016394],"about_ca_topic_score_codex":0.000054382617,"about_ca_topic_score_gemma":0.00019203855,"teacher_disagreement_score":0.91805536,"about_ca_system_score_codex":0.00006822473,"about_ca_system_score_gemma":0.000061979954,"threshold_uncertainty_score":0.9998836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92799026,0.00010668153,0.024270762,0.002838593,0.00019915057,0.0033114322,0.0002502021,0.00040927142,0.04062363],"genre_scores_gemma":[0.9866048,0.00003566335,0.011687393,0.00019647613,0.00014380764,0.00061446254,0.000018125136,0.000039257775,0.0006600114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998031,0.00021299045,0.0006087478,0.00033553917,0.00036679674,0.00044491692],"domain_scores_gemma":[0.99621594,0.0021730002,0.00025514574,0.0009691554,0.0003125315,0.00007423808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072419606,0.0002238175,0.0005243535,0.000067668116,0.00015091238,0.00002441535,0.00046606548,0.00012020169,0.000010867191],"category_scores_gemma":[0.0012066961,0.0001499965,0.0002523352,0.0002710981,0.00024613523,0.000041259922,0.00016000631,0.00015298146,4.6147878e-7],"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.0006045564,0.0001408015,0.000021945087,0.000878527,0.000116065254,2.1608209e-7,0.002565979,0.00055323495,0.0017644434,0.97123307,0.010168327,0.011952837],"study_design_scores_gemma":[0.0003975666,0.00008637564,0.00008684491,0.000023052546,0.0000396547,2.4498434e-7,0.00085615594,0.0008232145,0.027494956,0.96668226,0.0033207578,0.00018889514],"about_ca_topic_score_codex":0.000026817335,"about_ca_topic_score_gemma":0.000031425305,"teacher_disagreement_score":0.058614526,"about_ca_system_score_codex":0.000015958849,"about_ca_system_score_gemma":0.00006654795,"threshold_uncertainty_score":0.611668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720347,0.0001736085,0.08219534,0.00019347666,0.0009823213,0.00056278263,0.000002811812,0.00053351256,0.043321438],"genre_scores_gemma":[0.90766704,0.0000014204946,0.09135647,0.000036345198,0.00021929988,0.000009312711,0.000005256998,0.00003989824,0.0006649599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976681,0.00030974156,0.00064895564,0.0004979342,0.00036399218,0.00051128643],"domain_scores_gemma":[0.9977181,0.0009601904,0.00022391193,0.0007314576,0.00026495708,0.00010138289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022864859,0.00027212343,0.0004399732,0.00008252117,0.00026543433,0.00007712124,0.00036888942,0.00014763308,0.00001341289],"category_scores_gemma":[0.00081489317,0.0002633301,0.00019689531,0.00043445273,0.000092324255,0.000079337464,0.00029371897,0.00032013454,6.74126e-7],"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.0000076307615,0.00039026208,0.008946351,0.00025162654,0.000012187831,0.00000773325,0.00011463308,0.00003905822,0.00030101315,0.9845838,0.0027486677,0.0025970242],"study_design_scores_gemma":[0.0006021671,0.000060565748,0.0007875935,0.00004053115,0.000024232979,0.000012888977,0.000031160613,0.003931907,0.0014211113,0.9892208,0.0035368674,0.0003301636],"about_ca_topic_score_codex":0.00004997266,"about_ca_topic_score_gemma":0.000008522973,"teacher_disagreement_score":0.042656478,"about_ca_system_score_codex":0.00024767927,"about_ca_system_score_gemma":0.000059382925,"threshold_uncertainty_score":0.9999819},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005276254,0.00597317,0.069170296,0.00014784429,0.0019385541,0.003473762,0.005892691,0.0005582179,0.9123178],"genre_scores_gemma":[0.000077333505,0.0025505375,0.63938504,0.000051216535,0.00013945196,0.00012556129,0.000030941228,0.00031561425,0.3573243],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977027,0.00041648909,0.00059246767,0.00061844307,0.00023602897,0.00043387877],"domain_scores_gemma":[0.99827135,0.0004277058,0.00029347657,0.00079185236,0.00006889633,0.00014670569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010529725,0.0004889651,0.00087814825,0.0001662259,0.00005726106,0.00003908138,0.0002469252,0.0005143811,0.0007238624],"category_scores_gemma":[0.0014575261,0.00045615755,0.00006755221,0.00013030364,0.000491773,0.00005327685,0.00020977747,0.00045488542,4.672499e-7],"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.00015100805,0.00023409627,0.0010151153,0.004097186,0.00010123027,0.00008985857,0.0019333911,4.1496057e-7,0.0000016969607,0.4338357,0.5167011,0.041839223],"study_design_scores_gemma":[0.0007198939,0.0002784019,0.00008942591,0.0012959652,0.0001267485,0.00002973585,0.00032192052,0.00022788598,0.000007982194,0.40643814,0.58943725,0.0010266778],"about_ca_topic_score_codex":0.000665751,"about_ca_topic_score_gemma":0.011873183,"teacher_disagreement_score":0.57021475,"about_ca_system_score_codex":0.00007547127,"about_ca_system_score_gemma":0.00009152118,"threshold_uncertainty_score":0.999789},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25744343,0.000051020415,0.7313279,0.00070366525,0.0016572616,0.0007727726,0.000043789565,0.00018242856,0.007817753],"genre_scores_gemma":[0.98040795,0.000008757187,0.01827936,0.00016320542,0.00051175104,0.00007773328,0.000016935424,0.000042377345,0.0004919467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738735,0.00026552382,0.0007980117,0.00056263065,0.00032859654,0.00065791584],"domain_scores_gemma":[0.9977675,0.0009756714,0.00019127593,0.0006378238,0.0002608886,0.00016681047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001465293,0.00030716977,0.00045294594,0.00024235177,0.00015470848,0.00007112797,0.0004728461,0.00016271256,0.00029022602],"category_scores_gemma":[0.0025195596,0.00028571056,0.00013250831,0.0006581341,0.00034062503,0.000086701395,0.00011584022,0.0003149295,0.000013028751],"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.00025656633,0.00037704545,0.000043410375,0.000056427263,0.000036319863,0.000027623986,0.004303928,0.0014011058,0.0023739606,0.8891155,0.00059321936,0.10141487],"study_design_scores_gemma":[0.00013106168,0.00033790697,0.000029458066,0.00022507028,0.000043938282,0.000016426095,0.0036074882,0.4660279,0.0068178396,0.52148044,0.00060133485,0.0006811678],"about_ca_topic_score_codex":0.00070184615,"about_ca_topic_score_gemma":0.013480355,"teacher_disagreement_score":0.7229645,"about_ca_system_score_codex":0.00038675626,"about_ca_system_score_gemma":0.00010023301,"threshold_uncertainty_score":0.9999595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89193445,0.0018219234,0.09473749,0.0013767199,0.0002977525,0.006525542,0.00040007566,0.00019357065,0.0027124856],"genre_scores_gemma":[0.79602283,0.00021376234,0.20096873,0.0001498989,0.00017587717,0.002155627,0.00016915046,0.00007066119,0.00007344976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976111,0.00015068286,0.0008289472,0.0006689169,0.00036785798,0.00037251096],"domain_scores_gemma":[0.9946476,0.002013439,0.00077558646,0.0014432053,0.0010345948,0.00008557739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028043934,0.00041879946,0.00092483585,0.000047272424,0.00013631803,0.00008808127,0.0006191367,0.0003252614,0.000020000225],"category_scores_gemma":[0.0032858266,0.0002960002,0.00034983896,0.0001637535,0.00021928466,0.000036194288,0.00061674503,0.0003421188,6.005248e-8],"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.0071978373,0.006945969,0.0014624565,0.21459167,0.0033594246,0.000010600394,0.03931018,0.006895369,0.016312648,0.51997316,0.012357533,0.17158313],"study_design_scores_gemma":[0.00024154178,0.00006623337,0.000064638705,0.00025700123,0.00022582058,0.0000014179362,0.00015168494,0.00066854275,0.086490214,0.9110144,0.00049177324,0.00032676026],"about_ca_topic_score_codex":0.000027996448,"about_ca_topic_score_gemma":0.000058207243,"teacher_disagreement_score":0.3910412,"about_ca_system_score_codex":0.00003614095,"about_ca_system_score_gemma":0.00034643564,"threshold_uncertainty_score":0.9999492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005802514,0.000040942243,0.99320674,0.00045843676,0.000018944304,0.00024348094,0.000015933841,0.000040678016,0.0001723093],"genre_scores_gemma":[0.78655696,0.000018794912,0.21286021,0.00020046748,0.000055705666,0.000020395377,0.000049672133,0.000026451495,0.00021133508],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882805,0.000133035,0.00039555674,0.00031920872,0.00016804195,0.00015609479],"domain_scores_gemma":[0.9989339,0.00012148669,0.00028490805,0.00025956496,0.00022708488,0.00017301449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000408966,0.00015435943,0.00046681592,0.00012348201,0.00012252237,0.00006214481,0.00011807639,0.000067554436,0.000064182925],"category_scores_gemma":[0.0003149287,0.00008973282,0.00013757926,0.0009011069,0.000058861464,0.0002397862,0.000032224852,0.000043428718,1.0470597e-8],"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.0015209258,0.0012642557,0.6127262,0.008385792,0.011196784,0.00003827273,0.0411183,0.008613798,0.020733712,0.1658643,0.00464024,0.123897426],"study_design_scores_gemma":[0.0007947127,0.00014660547,0.00044664333,0.000043972876,0.002323974,0.0000013980208,0.0017061287,0.98976696,0.0021823875,0.0012983095,0.0010140862,0.00027482814],"about_ca_topic_score_codex":0.00001656728,"about_ca_topic_score_gemma":0.00007065314,"teacher_disagreement_score":0.98115313,"about_ca_system_score_codex":0.000012037627,"about_ca_system_score_gemma":0.000041089654,"threshold_uncertainty_score":0.36591983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8813205,0.00008896408,0.113660745,0.00011651477,0.00028485467,0.0014624387,0.00006066593,0.000053182615,0.0029521587],"genre_scores_gemma":[0.8200553,0.000007963848,0.17029148,0.00005957289,0.00024054042,0.00011439854,0.000023627908,0.000058528032,0.009148608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986779,0.00012845911,0.00037554136,0.0002946851,0.00021793648,0.0003054506],"domain_scores_gemma":[0.99865305,0.0003157459,0.00021673895,0.00059084164,0.00012463551,0.00009896799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085010007,0.00016761938,0.00038882246,0.00007008783,0.000035819776,0.000014660192,0.00019552239,0.00010134425,0.00006249811],"category_scores_gemma":[0.00040015543,0.0001410677,0.00015944507,0.00008827043,0.000030270936,0.00008796581,0.000053465003,0.000099141405,2.2170873e-7],"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.004019814,0.0029679812,0.009799415,0.0040174597,0.00046686982,0.00006610304,0.008038471,0.000055727167,0.18212862,0.68051744,0.009304497,0.0986176],"study_design_scores_gemma":[0.028519081,0.0074444124,0.004442827,0.0012823355,0.0006314243,0.00008137059,0.0038865518,0.20748045,0.63175154,0.07219938,0.039230835,0.003049808],"about_ca_topic_score_codex":0.000011840385,"about_ca_topic_score_gemma":0.000017443,"teacher_disagreement_score":0.60831803,"about_ca_system_score_codex":0.0000373193,"about_ca_system_score_gemma":0.00004113427,"threshold_uncertainty_score":0.5752574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6367866,0.18303476,0.088660106,0.014775264,0.0012606633,0.03165331,0.000493471,0.0005972946,0.042738564],"genre_scores_gemma":[0.6326328,0.12912557,0.15060776,0.069660634,0.0037790602,0.009579844,0.00017683223,0.0008136905,0.0036238288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947403,0.0015305926,0.0010814719,0.0010854092,0.0007009792,0.0008612691],"domain_scores_gemma":[0.9902464,0.0071594855,0.00047962798,0.001457758,0.0003297846,0.00032691497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002868458,0.00078798353,0.0028452203,0.0000847857,0.000090302856,0.000039879298,0.0007060875,0.000113182716,0.0000354364],"category_scores_gemma":[0.0039651217,0.00060515053,0.0015077236,0.0006347345,0.00008033565,0.00027379527,0.00019247642,0.0007398915,0.000013020591],"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.0004221348,0.0029735954,0.00021003051,0.06832994,0.000323671,0.000027847682,0.0006636026,0.00071616063,0.0053950064,0.7024918,0.026322681,0.19212352],"study_design_scores_gemma":[0.0017063114,0.0006920272,0.000016930248,0.022799818,0.0009211659,0.0000027834212,0.000033802407,0.54454625,0.00407803,0.4019905,0.021814432,0.0013979418],"about_ca_topic_score_codex":0.000016756387,"about_ca_topic_score_gemma":0.00001675557,"teacher_disagreement_score":0.5438301,"about_ca_system_score_codex":0.00015376501,"about_ca_system_score_gemma":0.00014963215,"threshold_uncertainty_score":0.99964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045231814,0.00030508853,0.985082,0.0040801005,0.00035326587,0.0024007196,0.00028875246,0.00020988593,0.006827895],"genre_scores_gemma":[0.1031787,0.00009134862,0.8931945,0.00054079003,0.00047831313,0.0012718586,0.0003648277,0.00018386499,0.00069578417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915332,0.002970043,0.0018104359,0.0018294435,0.0007588856,0.001097999],"domain_scores_gemma":[0.9938828,0.0018477269,0.0012037569,0.0025767542,0.00018607892,0.0003028861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.011004571,0.0010861252,0.0028653804,0.0012619973,0.00030866626,0.0004923893,0.0020739185,0.0008102808,0.00003769183],"category_scores_gemma":[0.00247931,0.0008316084,0.0027205062,0.0023876086,0.00007110099,0.000103205646,0.000931301,0.0015241266,2.6892312e-7],"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.0014687,0.0034322096,0.0063967034,0.033496518,0.047259066,0.0008363671,0.07974158,0.0064994334,0.003279634,0.4365778,0.06811116,0.31290084],"study_design_scores_gemma":[0.0010894117,0.000081316495,0.00010207459,0.0003123142,0.011072329,0.000011290547,0.007164007,0.7185512,0.0006644511,0.25697842,0.0022610624,0.0017120922],"about_ca_topic_score_codex":0.00012342661,"about_ca_topic_score_gemma":0.00029973176,"teacher_disagreement_score":0.7120518,"about_ca_system_score_codex":0.00024941933,"about_ca_system_score_gemma":0.00016684877,"threshold_uncertainty_score":0.9994135},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38068423,0.0022080974,0.58041155,0.0028302562,0.0012639709,0.007312131,0.0030973626,0.00039491945,0.021797514],"genre_scores_gemma":[0.08128491,0.0004977072,0.90980893,0.0019725915,0.00015141939,0.0038903442,0.00046769384,0.00027516816,0.0016512573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899304,0.0031701147,0.0023570561,0.0021052104,0.0007807725,0.0016564756],"domain_scores_gemma":[0.98063284,0.01565556,0.0010798862,0.0016063104,0.00061369146,0.00041168134],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.009262154,0.001375993,0.0019780593,0.0005975076,0.0005152631,0.00038249348,0.0010691307,0.0007953856,0.000058674683],"category_scores_gemma":[0.014382711,0.0015399383,0.0006616015,0.000509419,0.0005652896,0.00050630723,0.0011689034,0.0027862946,6.181277e-7],"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.00045643398,0.0008549274,0.00068927655,0.00595699,0.00019194414,0.00017477485,0.011233867,0.19450456,0.00006584406,0.74993753,0.0015321664,0.034401678],"study_design_scores_gemma":[0.0011122122,0.0011281656,0.00012906722,0.0030326422,0.00017565659,0.00005578675,0.0010360533,0.17910239,0.00019058165,0.8052804,0.0074261045,0.0013309674],"about_ca_topic_score_codex":0.0032610376,"about_ca_topic_score_gemma":0.003500011,"teacher_disagreement_score":0.32939738,"about_ca_system_score_codex":0.002442563,"about_ca_system_score_gemma":0.0020370216,"threshold_uncertainty_score":0.9998991},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84163433,0.00017967437,0.044483427,0.000042253403,0.0012541167,0.0007514944,0.00008951446,0.0004463347,0.11111887],"genre_scores_gemma":[0.95168436,0.00026057853,0.01180689,0.00007828568,0.00019446774,0.000002956152,0.000008318971,0.000090579495,0.035873547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753827,0.00032087028,0.00034405608,0.0011480583,0.000110161025,0.0005385801],"domain_scores_gemma":[0.99697214,0.00023559835,0.00039379727,0.0018680134,0.00022104502,0.00030942596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006640072,0.0005536159,0.00075152237,0.00026532455,0.00014260119,0.00005044576,0.001028308,0.00065286865,0.00015438825],"category_scores_gemma":[0.00019848625,0.0006098332,0.0005657447,0.0002565354,0.00016080153,0.00010967627,0.0014211668,0.0009468975,0.0000046801147],"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.00025950893,0.00045023076,0.0031740481,0.0012134868,0.0007836095,0.0016559236,0.0023109955,0.0033888181,0.00007982632,0.97529876,0.009257919,0.0021268427],"study_design_scores_gemma":[0.0032296805,0.00031256408,0.0012503037,0.0012504256,0.002321568,0.000042498526,0.0018337523,0.07888067,0.00086662226,0.87271434,0.032743495,0.00455409],"about_ca_topic_score_codex":0.00066626543,"about_ca_topic_score_gemma":0.00047686338,"teacher_disagreement_score":0.11005006,"about_ca_system_score_codex":0.00025983542,"about_ca_system_score_gemma":0.00016746043,"threshold_uncertainty_score":0.9996353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43855327,0.000023843637,0.55442977,0.000018517378,0.0001451679,0.00029524366,0.00030454708,0.000063266794,0.0061663454],"genre_scores_gemma":[0.9827428,0.00014200146,0.015716845,0.000003943226,0.00004509574,0.0000013436783,0.000037550446,0.000023030529,0.0012873838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988423,0.00021903233,0.00020553116,0.00045030768,0.00008153548,0.00020129865],"domain_scores_gemma":[0.9969366,0.00049150246,0.000892401,0.0012556353,0.00032013183,0.0001037039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061217224,0.0002409211,0.0004935587,0.00014061047,0.00020146824,0.00003102203,0.00048432793,0.0002862254,0.000022191498],"category_scores_gemma":[0.0010138549,0.00023063626,0.00019829295,0.00009924051,0.00019659514,0.00009518768,0.00039067306,0.00047075993,4.5261024e-7],"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.0003853923,0.00037453216,0.004654561,0.0008308282,0.0007266391,0.00018883396,0.0008221567,0.12884165,0.00003617031,0.8575327,0.0011277373,0.0044788118],"study_design_scores_gemma":[0.002564263,0.00016763112,0.0010870985,0.000970513,0.002076594,0.000008887191,0.0003605331,0.45301586,0.0014403223,0.5366557,0.0007214633,0.0009310997],"about_ca_topic_score_codex":0.00025387426,"about_ca_topic_score_gemma":0.00018815229,"teacher_disagreement_score":0.5441895,"about_ca_system_score_codex":0.00012494824,"about_ca_system_score_gemma":0.00016861768,"threshold_uncertainty_score":0.94050735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101633,0.00013342517,0.18649662,0.00012322751,0.00015264998,0.0005077104,0.0000018404406,0.000058702513,0.0023625165],"genre_scores_gemma":[0.85966,0.000052583047,0.13946433,0.00020870985,0.000083139304,0.00031909536,0.0000067996493,0.0000656503,0.00013967243],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856853,0.00021812864,0.00032657804,0.00037518927,0.00011763167,0.00039392067],"domain_scores_gemma":[0.999169,0.00025727978,0.00016767369,0.00023645787,0.00009732979,0.00007229386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008127125,0.00020399864,0.00034454346,0.00035076408,0.0000998843,0.000016577642,0.00016412858,0.0001013377,0.00001560106],"category_scores_gemma":[0.00016347891,0.00019396495,0.00007879634,0.00015740917,0.00020681335,0.000072575545,0.00007379492,0.00014068383,1.02369945e-7],"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.01126696,0.003131793,0.38625738,0.005989654,0.0034257276,0.0012162447,0.122117475,0.01633544,0.22636199,0.078217186,0.0066317255,0.13904841],"study_design_scores_gemma":[0.022861091,0.00787958,0.10471458,0.0012462223,0.0011657515,0.0002890976,0.015479064,0.5685511,0.023533741,0.044031292,0.20408805,0.0061604395],"about_ca_topic_score_codex":0.000017090912,"about_ca_topic_score_gemma":0.00057293574,"teacher_disagreement_score":0.55221564,"about_ca_system_score_codex":0.0002748248,"about_ca_system_score_gemma":0.000044980454,"threshold_uncertainty_score":0.79096615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96906835,0.00061425933,0.015456371,0.0005883607,0.0021547736,0.0011472973,0.00010228353,0.000407722,0.0104605695],"genre_scores_gemma":[0.8932093,0.000093309696,0.08765913,0.0008614027,0.001005998,0.00012861757,0.00014899409,0.0002177165,0.016675536],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99626285,0.00042051927,0.0009727139,0.00100631,0.0006030929,0.0007345436],"domain_scores_gemma":[0.99588364,0.00097107375,0.0006710643,0.001874144,0.00030484513,0.00029522285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002695333,0.0007010762,0.0010633909,0.00043672867,0.00019542291,0.000066267894,0.00068024435,0.00089822017,0.00016729833],"category_scores_gemma":[0.0013840243,0.0007020893,0.00063902827,0.0003091149,0.000065879925,0.000076417775,0.0005951447,0.0012250349,0.0000033776864],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027418067,0.0004976027,0.95235384,0.0034937214,0.0004743476,0.0002569057,0.0009486293,0.0010177577,0.00039011962,0.002277699,0.030526793,0.00748841],"study_design_scores_gemma":[0.015766168,0.0009980559,0.63997906,0.0127619775,0.0047731767,0.00008861547,0.0028962155,0.0842479,0.014916122,0.041209985,0.16382739,0.018535323],"about_ca_topic_score_codex":0.0015143037,"about_ca_topic_score_gemma":0.0006517952,"teacher_disagreement_score":0.31237477,"about_ca_system_score_codex":0.00043939383,"about_ca_system_score_gemma":0.00022959744,"threshold_uncertainty_score":0.999543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7707485,0.00024662778,0.19855572,0.00034586017,0.0037852623,0.0015655304,0.0001492465,0.00029091418,0.024312358],"genre_scores_gemma":[0.9829555,0.00017997318,0.005670199,0.000028317729,0.00021156843,0.000003059405,0.000014419185,0.000048607533,0.010888312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979818,0.00075464736,0.00031306277,0.0005119918,0.00016548974,0.00027302513],"domain_scores_gemma":[0.9968306,0.00041870397,0.0006120656,0.0015458779,0.00049326214,0.00009952705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708579,0.00029026053,0.00042030236,0.00009420813,0.00031271976,0.000039529663,0.0009883209,0.00030110995,0.000012367937],"category_scores_gemma":[0.00043310339,0.0002015945,0.0003752594,0.00041486914,0.00048306753,0.000057138368,0.0012931451,0.00069575565,3.8565094e-7],"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.00046936632,0.000732904,0.0020954802,0.00083325035,0.0011791646,0.00010098006,0.0037952159,0.007136532,0.00048033497,0.93911767,0.03334027,0.010718853],"study_design_scores_gemma":[0.0012173317,0.000121747755,0.0008335194,0.00034154337,0.00057477766,0.000012071958,0.0026852093,0.18018223,0.0011282988,0.803322,0.008818411,0.00076284294],"about_ca_topic_score_codex":0.0003927583,"about_ca_topic_score_gemma":0.00048532244,"teacher_disagreement_score":0.21220706,"about_ca_system_score_codex":0.00026652307,"about_ca_system_score_gemma":0.00018570352,"threshold_uncertainty_score":0.8220785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9610909,0.000054999582,0.027062086,0.000020958876,0.00017505864,0.00041909044,0.00012106254,0.00004122869,0.011014597],"genre_scores_gemma":[0.987665,0.00029628375,0.006297634,0.000012020803,0.0000460776,0.0000010855783,0.000022815313,0.00003202679,0.005627047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978443,0.0004668825,0.00060278067,0.000634677,0.00011848084,0.00033292588],"domain_scores_gemma":[0.9974545,0.00048438378,0.0007717285,0.0009665203,0.00023759589,0.0000852203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010141407,0.00036591192,0.0010469346,0.0006089249,0.000045324916,0.000008401919,0.0006382367,0.00039023208,0.000036158686],"category_scores_gemma":[0.00028832367,0.00040164992,0.0004303107,0.0005550446,0.00022531475,0.00006616553,0.0010023566,0.00048431216,1.0334399e-7],"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.0008706004,0.0027903407,0.15123364,0.007447395,0.0012536156,0.00067094667,0.0035489427,0.026379906,0.004742654,0.7942805,0.0033038969,0.0034775452],"study_design_scores_gemma":[0.010150904,0.00080411125,0.046751034,0.0037163314,0.0027516885,0.000006481447,0.004389586,0.48028323,0.023419948,0.42249402,0.0011514829,0.0040811663],"about_ca_topic_score_codex":0.0012655001,"about_ca_topic_score_gemma":0.0010231985,"teacher_disagreement_score":0.45390332,"about_ca_system_score_codex":0.00019957489,"about_ca_system_score_gemma":0.00015880304,"threshold_uncertainty_score":0.99984354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8917561,0.00018885583,0.083052695,0.0017000792,0.00041370717,0.0007651106,0.000004324564,0.000027000016,0.02209213],"genre_scores_gemma":[0.9013206,0.000042725835,0.09818487,0.00013115296,0.00022373602,0.000016151504,3.741884e-7,0.000011245287,0.000069165566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988564,0.0001613494,0.00047241882,0.000109895074,0.00025708604,0.00014279697],"domain_scores_gemma":[0.9979732,0.0011727195,0.00039465335,0.00022312392,0.00014298644,0.00009329002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053351857,0.00010047313,0.0002526244,0.00001910704,0.0001414923,0.000045678615,0.00012582484,0.000056317705,0.0000068005875],"category_scores_gemma":[0.0004973224,0.000058137466,0.00007468704,0.00004123042,0.00012988788,0.00004248545,0.00004438227,0.00020743019,4.9377913e-8],"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.00042158074,0.0001876936,0.00028636647,0.00016769243,0.000102209866,0.00000217502,0.0008946506,0.000011454194,0.0015631514,0.74660265,0.0028821751,0.24687822],"study_design_scores_gemma":[0.0010416177,0.00026081665,0.0004300305,0.000024494388,0.0000635256,0.000032201104,0.00046018115,0.0006509136,0.0023271588,0.95127505,0.043314386,0.00011962604],"about_ca_topic_score_codex":0.0000012196236,"about_ca_topic_score_gemma":0.000009258054,"teacher_disagreement_score":0.2467586,"about_ca_system_score_codex":0.00006673785,"about_ca_system_score_gemma":0.000031971893,"threshold_uncertainty_score":0.23707771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23243846,0.00007203529,0.62262875,0.000025552596,0.002206313,0.0014147811,0.00010737837,0.0007203222,0.1403864],"genre_scores_gemma":[0.98842543,0.00019860922,0.004751158,0.00004279822,0.00019392306,0.0000044151507,0.00004704802,0.00009366237,0.006242928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970557,0.0009009466,0.00042464188,0.001011677,0.00013373351,0.00047329743],"domain_scores_gemma":[0.9965543,0.0010321247,0.00054161414,0.0013984867,0.00024108519,0.00023237363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013770323,0.0005802957,0.0009774646,0.00034957222,0.00022357,0.00008405244,0.0008874274,0.0005922554,0.000046974357],"category_scores_gemma":[0.0002869194,0.00059570355,0.00049556274,0.00024634236,0.000090288944,0.0000832907,0.00089877524,0.0012844296,0.000004553253],"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.0003359276,0.00029066694,0.00035458876,0.0012677063,0.0005092021,0.00029748198,0.0007487665,0.0058249854,0.0000144303995,0.98874927,0.0014900138,0.00011693912],"study_design_scores_gemma":[0.0027608983,0.0001366363,0.000022344375,0.00081965356,0.0007475105,0.00001612838,0.0018624031,0.90469414,0.00005479747,0.08469609,0.0029232174,0.0012661808],"about_ca_topic_score_codex":0.00020756583,"about_ca_topic_score_gemma":0.00010294265,"teacher_disagreement_score":0.9040532,"about_ca_system_score_codex":0.0007312443,"about_ca_system_score_gemma":0.000111222624,"threshold_uncertainty_score":0.99964947},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7351308,0.00020077881,0.2605899,0.0001575846,0.001468084,0.00062270643,0.000041387346,0.00013610274,0.0016526841],"genre_scores_gemma":[0.2563081,0.0007858825,0.7298066,0.00041238268,0.0025574437,0.00018436908,0.00010979967,0.00022750013,0.009607935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997288,0.00029880437,0.0007420288,0.0008382141,0.00038011384,0.00045286998],"domain_scores_gemma":[0.99739975,0.00033902214,0.0004379089,0.001255918,0.0003741675,0.00019324763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014738983,0.00046798307,0.00088296365,0.00030208117,0.0001260969,0.000029343171,0.0003338682,0.00050963357,0.00006411848],"category_scores_gemma":[0.0010822712,0.00044329447,0.0004234048,0.00025667818,0.000044660595,0.000046973317,0.00074564223,0.0007050143,0.0000012797431],"study_design_candidate":"design_other","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.0005479989,0.0020075126,0.0545072,0.0053557823,0.0014092942,0.0002957395,0.0105038965,0.005729942,0.17885365,0.0060373475,0.02071022,0.7140414],"study_design_scores_gemma":[0.011215619,0.0054467013,0.16561215,0.022653671,0.0047169733,0.000902136,0.0056531313,0.23650305,0.31347728,0.048386812,0.16725628,0.018176205],"about_ca_topic_score_codex":0.00042167687,"about_ca_topic_score_gemma":0.000069074216,"teacher_disagreement_score":0.6958652,"about_ca_system_score_codex":0.00018921064,"about_ca_system_score_gemma":0.00009453605,"threshold_uncertainty_score":0.9998019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.694542,0.00031908412,0.2632244,0.0068522957,0.0023277905,0.0019164657,0.00019941088,0.00025056154,0.030367972],"genre_scores_gemma":[0.9929667,0.00006978094,0.00076727924,0.0008946372,0.00089545303,0.0000032100277,0.000005385731,0.000050185514,0.0043473607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973557,0.0006724785,0.0003301628,0.00090901565,0.00023763906,0.0004949912],"domain_scores_gemma":[0.99348134,0.0031621,0.0004063044,0.0026318482,0.00016978726,0.00014864521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208201,0.00045502692,0.00045605376,0.00007040158,0.00061371,0.00016690583,0.0031761536,0.00036694165,0.000054435237],"category_scores_gemma":[0.00048409562,0.00022038203,0.00040284987,0.000303564,0.00022645661,0.00007191854,0.003449406,0.0012012682,0.0000071142467],"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.000759844,0.0003497979,0.01998469,0.00019154644,0.0019123114,0.00049064186,0.013113804,0.023341939,0.00058864796,0.70520747,0.20053725,0.03352207],"study_design_scores_gemma":[0.0049658814,0.0003116691,0.019858249,0.0034501506,0.0029534942,0.000042385407,0.0122008175,0.13756765,0.0019422432,0.66687137,0.14486034,0.004975764],"about_ca_topic_score_codex":0.0007812509,"about_ca_topic_score_gemma":0.002608833,"teacher_disagreement_score":0.2984247,"about_ca_system_score_codex":0.00020321242,"about_ca_system_score_gemma":0.00017759667,"threshold_uncertainty_score":0.89869183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76165664,0.0001750494,0.22597927,0.00015595928,0.00059273385,0.00087907107,0.0002524677,0.00019674814,0.01011207],"genre_scores_gemma":[0.94448626,0.0005120019,0.008660102,0.000085251246,0.0002327805,0.0000066134694,0.000025197369,0.00006988591,0.04592189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983944,0.00023280378,0.00023443694,0.0007286585,0.000055285727,0.00035441286],"domain_scores_gemma":[0.9969716,0.001737193,0.0003105492,0.0006238863,0.00017285401,0.00018390978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091507094,0.00031139996,0.00049685675,0.00027645932,0.00019752255,0.0000472643,0.00037770512,0.00031304144,0.00005608686],"category_scores_gemma":[0.0009330139,0.0002849676,0.00022615051,0.0002465438,0.000115597715,0.00007784279,0.0008529362,0.00026355186,0.0000016664807],"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.000327638,0.00033761945,0.0037555525,0.002408934,0.000705267,0.00024623921,0.0007136318,0.00018076522,0.006320432,0.9655922,0.013432154,0.005979559],"study_design_scores_gemma":[0.004815153,0.00030367894,0.0006873565,0.0017175224,0.0016190411,0.00001763336,0.0004587845,0.22486441,0.0016450118,0.7406031,0.020508645,0.002759673],"about_ca_topic_score_codex":0.000026738737,"about_ca_topic_score_gemma":0.0000194867,"teacher_disagreement_score":0.22498912,"about_ca_system_score_codex":0.00012613095,"about_ca_system_score_gemma":0.00009010914,"threshold_uncertainty_score":0.99996024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30947617,0.00011361464,0.67588127,0.00005642507,0.0009026236,0.00059374346,0.00026029831,0.00030758174,0.012408273],"genre_scores_gemma":[0.96541744,0.00019357933,0.028429775,0.000058866906,0.00034978963,0.0000034086606,0.000026317904,0.00009617215,0.0054246346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713707,0.00047539928,0.0004028224,0.0012126518,0.00015769123,0.0006143728],"domain_scores_gemma":[0.9957228,0.0016524608,0.0005456809,0.0014462123,0.00029611506,0.0003367664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067279744,0.00061444344,0.0008808,0.00038625736,0.00020888506,0.0000501795,0.0009183646,0.000589142,0.000094613606],"category_scores_gemma":[0.00057179196,0.00058415195,0.00062050694,0.00026107192,0.00023331199,0.00014073988,0.0016854395,0.0008230555,0.000004350133],"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.0010070468,0.00074194523,0.0073698265,0.0010779129,0.0017658687,0.0008672242,0.0009911185,0.0050844853,0.0015669323,0.9705557,0.0049997303,0.0039721867],"study_design_scores_gemma":[0.006819178,0.00028533186,0.00060718367,0.0025249445,0.0019857595,0.000026494652,0.0035617119,0.14589302,0.0024319324,0.8189928,0.012429897,0.0044417735],"about_ca_topic_score_codex":0.0002113454,"about_ca_topic_score_gemma":0.00011353182,"teacher_disagreement_score":0.6559413,"about_ca_system_score_codex":0.0005785646,"about_ca_system_score_gemma":0.00014703913,"threshold_uncertainty_score":0.99966097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95711654,0.000004830644,0.004810481,0.0000660973,0.000055612603,0.00040812377,0.000044063592,0.00004837177,0.03744587],"genre_scores_gemma":[0.9828321,0.0000040472933,0.01348941,0.00027925865,0.000053142343,9.0483496e-7,0.0000018269736,0.000029199306,0.003310125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900776,0.00020620872,0.00013273871,0.00029592702,0.00014012991,0.0002172094],"domain_scores_gemma":[0.998517,0.00083640486,0.00015338464,0.000311049,0.0001259701,0.00005621616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957993,0.00017250788,0.00024275082,0.00014962982,0.0001362595,0.0000107085625,0.00017697523,0.00007259987,0.00021316],"category_scores_gemma":[0.00016148266,0.000116214986,0.00005689955,0.00026986614,0.0006307187,0.000052147072,0.00009522572,0.00013222956,0.0000012721595],"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.0025074922,0.00058743154,0.0039657773,0.00031518424,0.00085666764,0.00015841013,0.006766035,0.000040555955,0.009298044,0.96046793,0.010644451,0.004392021],"study_design_scores_gemma":[0.06590466,0.030594895,0.0072438475,0.009229915,0.0063908403,0.0011897207,0.050002076,0.07764475,0.23370413,0.3822082,0.121469826,0.014417144],"about_ca_topic_score_codex":0.00014143887,"about_ca_topic_score_gemma":0.00006649765,"teacher_disagreement_score":0.57825977,"about_ca_system_score_codex":0.00004075837,"about_ca_system_score_gemma":0.00008655043,"threshold_uncertainty_score":0.47391096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5959634,0.0071260775,0.36482823,0.0015548217,0.0003533209,0.0023352506,0.00010027234,0.0006592956,0.027079292],"genre_scores_gemma":[0.8040409,0.0005365017,0.19087107,0.0003669899,0.0009244941,0.0005990937,0.000026432348,0.00005649507,0.0025780003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918336,0.000048601658,0.0002041881,0.00018804701,0.000103255836,0.00027257644],"domain_scores_gemma":[0.99919355,0.00020466448,0.000075548574,0.00028656656,0.00006238183,0.00017726368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037781574,0.00013963378,0.0001889384,0.00006967461,0.00015720804,0.00001953283,0.00011156878,0.00009550413,0.000030275582],"category_scores_gemma":[0.0000715864,0.000115754294,0.00005877041,0.00020866162,0.00005085133,0.00010485485,0.0000621924,0.0001278262,0.0000029916225],"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.0000071961995,0.0003241017,0.0045149284,0.0001519543,0.00007619632,4.6346935e-7,0.0008623825,4.3459764e-7,0.0028398633,0.96342945,0.0021302234,0.02566282],"study_design_scores_gemma":[0.0017768429,0.00016937144,0.0034013009,0.00009037933,0.0005435663,0.00016407785,0.001312773,0.008692218,0.01934268,0.21314949,0.7496902,0.001667133],"about_ca_topic_score_codex":0.000004102562,"about_ca_topic_score_gemma":0.0000018598292,"teacher_disagreement_score":0.75027996,"about_ca_system_score_codex":0.000006115351,"about_ca_system_score_gemma":0.0000082007855,"threshold_uncertainty_score":0.4720323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007025442,0.000014100769,0.98005235,0.0019982378,0.00079486176,0.0002005389,0.00024363362,0.000058603193,0.009612243],"genre_scores_gemma":[0.8261276,0.00029206972,0.1700667,0.00019878263,0.00028978076,0.000029304187,0.0000062053164,0.000028194921,0.00296138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.00013721296,0.0005461602,0.0004060484,0.0003938568,0.00032723387],"domain_scores_gemma":[0.99817497,0.0009654203,0.00017218168,0.0002468795,0.00028738828,0.00015319153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896642,0.00025195937,0.00027245114,0.00013653,0.00010658234,0.0001225187,0.00030383968,0.000097103795,0.0004908919],"category_scores_gemma":[0.0009352561,0.00018740624,0.000062788815,0.00006444607,0.00019096749,0.00011395736,0.00010269883,0.00016090299,0.0000067456226],"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.00020472307,0.00006380432,0.00005023821,0.000014036827,0.000037202015,0.000036136316,0.0003013433,0.00001628951,0.0019419107,0.66972214,0.0004404352,0.32717177],"study_design_scores_gemma":[0.00018653307,0.00036478945,0.000102252,0.00025549156,0.000033243436,0.00004590145,0.0007936272,0.20070106,0.0033627034,0.7922979,0.0012733107,0.0005831714],"about_ca_topic_score_codex":0.000070300615,"about_ca_topic_score_gemma":0.0006758674,"teacher_disagreement_score":0.81910217,"about_ca_system_score_codex":0.000082258324,"about_ca_system_score_gemma":0.00004704132,"threshold_uncertainty_score":0.7642205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5644001,0.00036554513,0.43320918,0.00053775316,0.0004183269,0.00021953105,0.00023754477,0.000011880425,0.0006001731],"genre_scores_gemma":[0.638027,0.00003944606,0.3614358,0.00020162303,0.00011496165,0.0000010320091,0.0000043198247,0.000012326365,0.00016350903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984925,0.00017281757,0.00052624237,0.00013112443,0.0005165594,0.0001607992],"domain_scores_gemma":[0.9978099,0.0011776604,0.00037325555,0.00006997736,0.000402397,0.00016679824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069144246,0.0001541313,0.00037073952,0.00013510545,0.00006541178,0.00003563233,0.000107809865,0.000082933475,0.000041869236],"category_scores_gemma":[0.000230191,0.00011852021,0.0001064463,0.00013490987,0.00008399425,0.00007883243,0.000048276,0.00033464568,1.5780402e-7],"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.0010571507,0.00049849227,0.010876748,0.0003381289,0.00069055555,0.00026770006,0.0010673075,0.0018099754,0.00025802734,0.911483,0.02855194,0.043100975],"study_design_scores_gemma":[0.0032444438,0.0015094483,0.01639331,0.00021003204,0.0001954076,0.00050245004,0.00059628533,0.080687396,0.00002713064,0.89272237,0.0034360196,0.0004756929],"about_ca_topic_score_codex":0.000006963016,"about_ca_topic_score_gemma":0.0000080503805,"teacher_disagreement_score":0.07887742,"about_ca_system_score_codex":0.000029054096,"about_ca_system_score_gemma":0.00005737293,"threshold_uncertainty_score":0.4833114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49325088,0.0000120534405,0.504263,0.000021420947,0.00021277746,0.00081407354,0.000004736921,0.00011927153,0.0013018074],"genre_scores_gemma":[0.9195954,0.000011334134,0.06869385,0.000052108317,0.00010376297,0.000006428381,0.0000069079956,0.000045106066,0.011485054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879414,0.00006203208,0.00020489826,0.00047563275,0.000051995165,0.00041128532],"domain_scores_gemma":[0.99841505,0.00070163707,0.00016859484,0.00042278072,0.00016653896,0.00012537627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007446862,0.00020387232,0.00036394212,0.00010617254,0.00015306674,0.0000369558,0.00026581596,0.00013957192,0.00002324878],"category_scores_gemma":[0.00023353164,0.00021166632,0.00025626496,0.0002709353,0.000049870923,0.00017126881,0.00010458071,0.00016002067,0.0000011307684],"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.0065472266,0.0009402842,0.009544851,0.002555599,0.0009816285,0.000091057744,0.0020515248,0.002766944,0.048383035,0.8998408,0.0007578151,0.025539234],"study_design_scores_gemma":[0.028643673,0.0015765429,0.00007424294,0.00028147575,0.00081197463,0.000021722335,0.0022327774,0.7208014,0.008439403,0.06723763,0.16776606,0.002113056],"about_ca_topic_score_codex":0.000033390483,"about_ca_topic_score_gemma":0.000031475363,"teacher_disagreement_score":0.83260316,"about_ca_system_score_codex":0.000104425184,"about_ca_system_score_gemma":0.000047901805,"threshold_uncertainty_score":0.86315024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42321083,0.004456314,0.0046479073,0.0015182714,0.0080723995,0.0002806913,0.0020462472,0.0011488611,0.5546185],"genre_scores_gemma":[0.9391739,0.008036628,0.02054315,0.0036438298,0.007320089,0.007230956,0.0061602304,0.0058486615,0.0020425685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9564379,0.0024239474,0.009669442,0.008252498,0.010909803,0.012306396],"domain_scores_gemma":[0.9607447,0.00787473,0.01234763,0.012692499,0.0009692356,0.005371229],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.011947934,0.0052495566,0.0022380983,0.0029538234,0.007714397,0.009823594,0.011958601,0.011939638,0.69688046],"category_scores_gemma":[0.00849449,0.010244969,0.0089010205,0.004690216,0.007508198,0.0074988515,0.011693954,0.009449188,0.00509263],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00812528,0.0014945101,0.00002295736,0.007263132,0.007506366,0.006773542,0.006227505,0.0030603416,0.0067795566,0.6102888,0.33966252,0.0027955263],"study_design_scores_gemma":[0.010484194,0.005028694,0.0000889322,0.006304532,0.0077632163,0.008606194,0.005157973,0.16965827,0.76915044,0.000784101,0.009343827,0.0076296288],"about_ca_topic_score_codex":0.007309895,"about_ca_topic_score_gemma":0.010443786,"teacher_disagreement_score":0.7623709,"about_ca_system_score_codex":0.00016731478,"about_ca_system_score_gemma":0.00949461,"threshold_uncertainty_score":0.99985737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6522592,0.0029283185,0.050119143,0.016580168,0.0045525352,0.0029288898,0.00027804126,0.00042486042,0.26992884],"genre_scores_gemma":[0.9117634,0.0018524672,0.0801686,0.00029037334,0.00029428347,0.000101051584,0.000011220801,0.00006802256,0.005450538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987073,0.0001337435,0.0002735629,0.000389258,0.00022009893,0.00027604945],"domain_scores_gemma":[0.9980887,0.0008966869,0.00020295155,0.0005648584,0.00007923544,0.00016753128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006638851,0.00023299312,0.00034404203,0.00006897881,0.0006170894,0.0003441134,0.00020886176,0.000106226726,0.000020848733],"category_scores_gemma":[0.0006858279,0.00018230664,0.00007840803,0.000029922941,0.00024241561,0.00029724554,0.0001773287,0.00015837801,5.534473e-7],"study_design_candidate":"design_other","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.0015191176,0.0007854083,0.021700714,0.002829281,0.002168863,0.00034230217,0.061266307,0.000034197674,0.038491223,0.14573935,0.03564985,0.6894734],"study_design_scores_gemma":[0.06420694,0.0059077237,0.040225398,0.0049016294,0.0033931436,0.0006136808,0.03530113,0.46664718,0.028692422,0.21805254,0.12071692,0.011341296],"about_ca_topic_score_codex":0.000044795957,"about_ca_topic_score_gemma":0.00006531917,"teacher_disagreement_score":0.6781321,"about_ca_system_score_codex":0.00001679778,"about_ca_system_score_gemma":0.000018981822,"threshold_uncertainty_score":0.7434249},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20832624,0.000044708242,0.78200734,0.0012254458,0.00030249308,0.000617492,0.00018593109,0.000121434336,0.007168934],"genre_scores_gemma":[0.8422515,0.0000099332765,0.12608723,0.000054446613,0.00009242913,0.0000027632534,0.000007849661,0.000044862223,0.03144902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987062,0.000114993745,0.00019173035,0.0003607377,0.00024862267,0.0003776914],"domain_scores_gemma":[0.99782234,0.0009935816,0.00021721657,0.0005284189,0.0002707974,0.00016763067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006105715,0.00020197988,0.00045001152,0.00015178909,0.00018188264,0.000012052557,0.00041661525,0.0001575262,0.00026841188],"category_scores_gemma":[0.0003088827,0.00018151556,0.00027590588,0.0001424188,0.0001610318,0.00020911402,0.00018234657,0.00007757918,0.0000016114739],"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.0040618847,0.0016524191,0.0008127771,0.004205489,0.0017304803,0.00013296225,0.018443078,0.00020800118,0.05387224,0.37689966,0.24166282,0.2963182],"study_design_scores_gemma":[0.065922715,0.0051395907,0.0011844216,0.0077221757,0.0044906237,0.00018185913,0.054275807,0.045753334,0.032861087,0.5414839,0.23259082,0.008393702],"about_ca_topic_score_codex":0.000049176564,"about_ca_topic_score_gemma":0.00021823631,"teacher_disagreement_score":0.6559201,"about_ca_system_score_codex":0.00009908557,"about_ca_system_score_gemma":0.0000698479,"threshold_uncertainty_score":0.74019897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723479,0.0006231486,0.0014285924,0.00032846502,0.00041216597,0.0003274017,0.000002882288,0.0000730414,0.02445639],"genre_scores_gemma":[0.97126627,0.0006973785,0.00253236,0.0000022638133,0.0002835751,0.0000011827515,0.0000021260562,0.000027242513,0.025187617],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974911,0.0009376123,0.00015617679,0.0004061345,0.00056886027,0.00044007192],"domain_scores_gemma":[0.99699086,0.0012732696,0.00030541234,0.00067022955,0.00049173215,0.0002684963],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024770077,0.0001659218,0.00042541235,0.00013934866,0.0028659718,0.00022066916,0.00055909797,0.00020180266,0.000055883556],"category_scores_gemma":[0.0015532401,0.00017497588,0.00013686928,0.000118364565,0.00060474494,0.0002752523,0.00037405756,0.0009256344,0.0000010675561],"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.007580574,0.0014420475,0.7180449,0.00596019,0.0018843516,0.0029881932,0.03964677,0.00008236544,0.07745536,0.015326697,0.056119803,0.073468745],"study_design_scores_gemma":[0.02265085,0.004568583,0.06046075,0.0026034806,0.0004018153,0.00016461573,0.07666002,0.0067968955,0.0062481766,0.008719634,0.80832195,0.0024032304],"about_ca_topic_score_codex":0.0011582519,"about_ca_topic_score_gemma":0.0005238439,"teacher_disagreement_score":0.75220215,"about_ca_system_score_codex":0.00007392319,"about_ca_system_score_gemma":0.000093252755,"threshold_uncertainty_score":0.99843216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5497253,0.00017990374,0.26279867,0.008084028,0.0005754291,0.0026808584,0.0007869357,0.00024258983,0.17492633],"genre_scores_gemma":[0.43872458,0.006254922,0.43832487,0.000055138167,0.00031345204,0.000003834391,0.00003641057,0.00014229538,0.11614449],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950403,0.0015504087,0.0002716307,0.00078023487,0.0011365077,0.0012209178],"domain_scores_gemma":[0.9928557,0.0026003283,0.0005047634,0.0027719808,0.0007505782,0.0005166287],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.005535887,0.00034773914,0.00061835564,0.0004474599,0.00630513,0.00016898275,0.0038194715,0.00021500184,0.00008793771],"category_scores_gemma":[0.001983387,0.00035960446,0.00052011426,0.00055871316,0.0015858272,0.00087074813,0.003334161,0.001045649,0.000001065849],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013906456,0.00166948,0.030721113,0.0013319134,0.0026081267,0.0016303217,0.028134651,0.00014311548,0.01231047,0.34319797,0.21264558,0.35170078],"study_design_scores_gemma":[0.008488295,0.0014368712,0.018428719,0.0003754923,0.0003843884,0.000039835704,0.06894254,0.039016474,0.00093679206,0.048687626,0.8120781,0.0011848637],"about_ca_topic_score_codex":0.006305924,"about_ca_topic_score_gemma":0.018491331,"teacher_disagreement_score":0.5994325,"about_ca_system_score_codex":0.00042940624,"about_ca_system_score_gemma":0.00041746287,"threshold_uncertainty_score":0.9998856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021058682,0.000012057285,0.96023357,0.000010594961,0.0003012234,0.0016946846,0.00005252585,0.00035443617,0.016282212],"genre_scores_gemma":[0.74942815,0.000013949407,0.2475832,0.000063966814,0.0000638921,0.000019739347,0.00007513463,0.0000958861,0.002656072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973964,0.00045806007,0.0005248467,0.00078228605,0.0002109538,0.00062746],"domain_scores_gemma":[0.9979056,0.0003102507,0.00067367515,0.00047567423,0.0004244054,0.00021039785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012082912,0.00046839518,0.0005626838,0.00049802737,0.00031684,0.00006523891,0.0004597792,0.00023232133,0.000026237447],"category_scores_gemma":[0.00020201383,0.00045008626,0.00022998924,0.00079702656,0.00009529215,0.00065328414,0.00024176201,0.000299033,4.495908e-7],"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.013070257,0.013206102,0.017375784,0.01240579,0.0039891484,0.0018802031,0.109724805,0.0103819305,0.06375798,0.6485859,0.021314917,0.08430717],"study_design_scores_gemma":[0.0018608771,0.0003402773,0.000024081415,0.00030215792,0.0001360395,0.0000075321946,0.0015749936,0.9377387,0.0051294663,0.052023746,0.00025217765,0.00060993666],"about_ca_topic_score_codex":0.00041911236,"about_ca_topic_score_gemma":0.00013417834,"teacher_disagreement_score":0.9273568,"about_ca_system_score_codex":0.000394439,"about_ca_system_score_gemma":0.00016115479,"threshold_uncertainty_score":0.9997951},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9120819,0.00012324443,0.08060244,0.0004972205,0.00044173165,0.00060821325,0.000020000278,0.00017810613,0.00544714],"genre_scores_gemma":[0.9982118,0.0000048301604,0.0012374131,0.000030191935,0.00005980402,0.0000630356,6.52693e-7,0.000008691925,0.0003835878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985794,0.00013823296,0.0005732968,0.000103703496,0.0004439517,0.0001614533],"domain_scores_gemma":[0.9980295,0.00044810286,0.00052899384,0.00027577393,0.0006734677,0.000044219953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096885,0.00013299115,0.00021641042,0.000071751885,0.00015320045,0.00008676448,0.00017249369,0.00005980336,0.0000029032176],"category_scores_gemma":[0.000921154,0.000059305894,0.00004692444,0.00020377354,0.00009438553,0.0011382606,0.000033859687,0.00009798752,2.5141424e-7],"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.00160419,0.0004167679,0.08814048,0.023080774,0.00031234988,0.0000062349777,0.04163698,0.024520786,0.013378019,0.04378118,0.007028879,0.7560934],"study_design_scores_gemma":[0.012463875,0.0019319194,0.018460369,0.019081963,0.0006236504,0.0008569804,0.022094611,0.7448647,0.055244632,0.0058936467,0.11412304,0.0043606204],"about_ca_topic_score_codex":0.000082699225,"about_ca_topic_score_gemma":0.000014400468,"teacher_disagreement_score":0.75173277,"about_ca_system_score_codex":0.00006545118,"about_ca_system_score_gemma":0.000094735544,"threshold_uncertainty_score":0.2418424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22056387,0.000067361,0.7779586,0.00034729563,0.0000053952294,0.00019931955,0.000008281313,0.000009660319,0.00084025075],"genre_scores_gemma":[0.5963764,0.000036191115,0.40321687,0.000049742957,0.000107486114,0.000030346608,0.0000011882197,0.000015661966,0.00016612298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979981,0.00011084015,0.0010973931,0.00019963754,0.00039718932,0.00019679674],"domain_scores_gemma":[0.9970501,0.0007271678,0.001011624,0.00037094526,0.0006409563,0.00019919494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014815116,0.00017625712,0.00088174245,0.00028517397,0.00012037293,0.000040676663,0.00022742286,0.00008544732,0.000074960204],"category_scores_gemma":[0.00029561535,0.000113627706,0.0003358771,0.0007119855,0.0001918488,0.000105794934,0.00006491587,0.00017341618,3.8120544e-7],"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.00035875625,0.0042592925,0.0033529827,0.0012329927,0.0082511725,0.000023515737,0.0024646688,0.00007418988,0.065465,0.8574568,0.0005078298,0.056552786],"study_design_scores_gemma":[0.010422704,0.0035974584,0.0065051373,0.0020243593,0.045648653,0.0011682379,0.009196964,0.17875043,0.06701447,0.65736425,0.015507188,0.002800147],"about_ca_topic_score_codex":0.0000049337427,"about_ca_topic_score_gemma":0.0000138730575,"teacher_disagreement_score":0.37581253,"about_ca_system_score_codex":0.000018907702,"about_ca_system_score_gemma":0.00003543231,"threshold_uncertainty_score":0.46336034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03218746,0.00018605261,0.9490135,0.00011434881,0.00013290871,0.00036849928,0.0000029185774,0.00011620682,0.017878111],"genre_scores_gemma":[0.09915014,0.00004824207,0.89713764,0.00016072454,0.00014249462,0.0000047033936,0.0000016334483,0.000017757102,0.0033366864],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888664,0.000022610988,0.00031226577,0.00027512095,0.00019512897,0.000308203],"domain_scores_gemma":[0.9979734,0.0012544086,0.000119702425,0.0002858191,0.00025464376,0.000112043315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000537293,0.00018678595,0.0002832328,0.00010098718,0.0001447872,0.00016634108,0.00020588766,0.00010559662,0.00009150081],"category_scores_gemma":[0.0018326463,0.00015214222,0.00008787774,0.00025007155,0.000013779732,0.00040391067,0.00004547385,0.00008711959,1.1467286e-7],"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.00046583565,0.0002962857,0.0003334922,0.0019630909,0.000085001375,0.000016386703,0.0029597632,0.0002556653,0.030581726,0.33225563,0.11271441,0.5180727],"study_design_scores_gemma":[0.0014814768,0.00040015907,0.000044126067,0.0008800768,0.00013395943,0.00001824955,0.0033703963,0.015035908,0.015003503,0.95360094,0.009265904,0.00076531066],"about_ca_topic_score_codex":0.000044365064,"about_ca_topic_score_gemma":0.00013725329,"teacher_disagreement_score":0.6213453,"about_ca_system_score_codex":0.000046522404,"about_ca_system_score_gemma":0.00048087127,"threshold_uncertainty_score":0.62041795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6654028,0.0004043101,0.32195833,0.00032761146,0.0015179756,0.0010394878,0.000051853673,0.00031806435,0.008979564],"genre_scores_gemma":[0.96869826,0.0005733919,0.010324188,0.00044949024,0.0005939017,0.0000020052025,0.000012477849,0.00018914789,0.019157115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896808,0.0030909744,0.0013171567,0.0030134418,0.00047237173,0.002425243],"domain_scores_gemma":[0.98750234,0.0018770804,0.0012522956,0.0037133778,0.0018616706,0.0037932685],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0062698554,0.0015782994,0.0020433685,0.0007582457,0.0007309806,0.0003014141,0.0024442736,0.0010893045,0.000057776328],"category_scores_gemma":[0.0036168562,0.0018880712,0.0012016423,0.0033620638,0.0010028741,0.0018141044,0.001777197,0.0013822374,0.0000047349913],"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.003427802,0.0024614206,0.020457616,0.00067704316,0.0011037783,0.007086698,0.011246263,0.053964715,0.00038584927,0.8930461,0.0038315107,0.0023112432],"study_design_scores_gemma":[0.023712575,0.002823784,0.00025698508,0.00068252924,0.003204783,0.00020419128,0.060502484,0.6563063,0.0017747474,0.23334281,0.012677633,0.0045111724],"about_ca_topic_score_codex":0.0006397909,"about_ca_topic_score_gemma":0.0006862464,"teacher_disagreement_score":0.65970325,"about_ca_system_score_codex":0.0016076415,"about_ca_system_score_gemma":0.001139524,"threshold_uncertainty_score":0.9996965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42231804,0.000013187369,0.57309145,0.000031301748,0.00019557873,0.0005926869,0.0000028694362,0.000041163028,0.0037137347],"genre_scores_gemma":[0.9816867,0.000002981856,0.015022209,0.000027375587,0.000048056387,0.00006639253,0.000012260746,0.00003456151,0.0030994697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986227,0.00026706437,0.00036185913,0.0002705721,0.00018370572,0.00029411117],"domain_scores_gemma":[0.9976437,0.0014247497,0.00035077037,0.00030025517,0.00020996737,0.00007057019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021150701,0.00018825982,0.0003563934,0.00010476204,0.000088808316,0.000025598663,0.00017775623,0.00009182743,0.00010866003],"category_scores_gemma":[0.0012895362,0.00016451532,0.00012651747,0.00008129331,0.00006528571,0.000062671614,0.000053305637,0.00024013405,0.0000029371583],"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.0010214641,0.00039401586,0.0013359461,0.0015122611,0.00011363756,0.0000013253414,0.0054167463,0.003198275,0.033048052,0.898644,0.00016568655,0.055148628],"study_design_scores_gemma":[0.004071291,0.003243958,0.0010333643,0.0018330923,0.00024524317,0.0000125960405,0.0053345007,0.6888132,0.036833808,0.25703052,0.0004389365,0.001109458],"about_ca_topic_score_codex":0.0000024598837,"about_ca_topic_score_gemma":0.0000014544619,"teacher_disagreement_score":0.68561494,"about_ca_system_score_codex":0.00004373513,"about_ca_system_score_gemma":0.000055574765,"threshold_uncertainty_score":0.670874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23685478,0.00029960138,0.761949,0.000088422654,0.00010934964,0.00017016241,0.000068483496,0.0000035155133,0.0004567087],"genre_scores_gemma":[0.19565189,0.00019803639,0.8039775,0.000017724973,0.000041086747,8.5031854e-7,8.3542994e-7,0.000009060122,0.00010303736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985169,0.000282961,0.00065683783,0.00012295692,0.0002767252,0.0001435723],"domain_scores_gemma":[0.99724823,0.0017768259,0.00038273906,0.00015460468,0.00030684844,0.00013076725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023398697,0.00011591541,0.0005785099,0.00008010009,0.000038613845,0.000023282826,0.000085509986,0.00007540013,0.00001636717],"category_scores_gemma":[0.0013788436,0.00008546396,0.000068264606,0.00006367719,0.00016359378,0.00010971133,0.000061553874,0.00027527363,1.1205705e-8],"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.00058773975,0.00023086861,0.0019483849,0.0014630276,0.00016248671,0.00001825661,0.0025273452,0.00008871384,0.0007334325,0.93571484,0.00045252798,0.056072354],"study_design_scores_gemma":[0.0022321127,0.00049577834,0.00018004002,0.00011206997,0.00012070617,0.00008191034,0.0003419979,0.06153734,0.0001542026,0.93436444,0.00025778863,0.000121587225],"about_ca_topic_score_codex":0.000014112575,"about_ca_topic_score_gemma":0.0000082768365,"teacher_disagreement_score":0.061448626,"about_ca_system_score_codex":0.000027877017,"about_ca_system_score_gemma":0.00006624097,"threshold_uncertainty_score":0.3485119},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809148,0.00013344194,0.0068459464,0.00005122446,0.00017605418,0.00030201586,0.000014471451,0.00009769632,0.011464384],"genre_scores_gemma":[0.9830017,0.00004600343,0.0012572509,0.00009377463,0.00004901325,7.052989e-7,0.0000019741428,0.000028514207,0.015521083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.000101098405,0.00013372039,0.00043720368,0.00006309812,0.00028547656],"domain_scores_gemma":[0.9988572,0.00037543284,0.00009411637,0.0004477465,0.000080244085,0.00014524425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029352523,0.00020023745,0.00030073785,0.00011335147,0.00008200017,0.00003787153,0.00022536395,0.000114725764,0.00008661195],"category_scores_gemma":[0.00008286186,0.00019942014,0.0000866306,0.00022880944,0.000064526525,0.00018890115,0.00017598803,0.00017386778,0.0000042827487],"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.0005151102,0.0004617313,0.03394989,0.0007957049,0.00058865704,0.00049558573,0.0033357781,0.007847569,0.0054416005,0.93320113,0.00903395,0.0043332814],"study_design_scores_gemma":[0.01673206,0.0018177867,0.0076190354,0.00073302555,0.0018982351,0.00015029797,0.017982658,0.7215175,0.0027641584,0.20566449,0.01739225,0.0057284804],"about_ca_topic_score_codex":0.00005576543,"about_ca_topic_score_gemma":0.000096578944,"teacher_disagreement_score":0.7275367,"about_ca_system_score_codex":0.00005668297,"about_ca_system_score_gemma":0.000029058836,"threshold_uncertainty_score":0.81321174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004031862,0.0021018945,0.9919441,0.00082517194,0.0004324292,0.00027675243,0.00016116984,0.000008047869,0.00021859995],"genre_scores_gemma":[0.84902126,0.00059445604,0.14530908,0.0004203566,0.00030190934,0.00007749806,0.000006088246,0.000060521856,0.0042088474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998193,0.00024681844,0.0005960214,0.00011626726,0.00041189612,0.00043598982],"domain_scores_gemma":[0.9947492,0.0039805216,0.0007021895,0.00023216777,0.0002784595,0.000057453988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032415227,0.00013200668,0.00031949655,0.000054281198,0.000274646,0.00003589325,0.0005127799,0.000023071922,0.00007907812],"category_scores_gemma":[0.0012034498,0.00009512695,0.00014600187,0.00012532095,0.000057060657,0.000051006686,0.00007254455,0.0005655214,3.8350425e-8],"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.00027278886,0.00007001731,0.000010497839,0.00006460756,0.00018408839,0.0000149325915,0.00072055246,0.000056432058,0.00071180845,0.9562923,0.033540245,0.008061765],"study_design_scores_gemma":[0.0021929191,0.0027664457,0.000020556918,0.00006681716,0.00049783255,0.0004238536,0.0073163933,0.009254576,0.0012305325,0.7059464,0.26992014,0.00036352075],"about_ca_topic_score_codex":0.0000059772615,"about_ca_topic_score_gemma":0.00007094735,"teacher_disagreement_score":0.846635,"about_ca_system_score_codex":0.0003274288,"about_ca_system_score_gemma":0.00039542513,"threshold_uncertainty_score":0.38791645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006662536,0.0003407865,0.98557156,0.003539912,0.0014432907,0.0002927312,0.0002370216,0.00004404309,0.0018681326],"genre_scores_gemma":[0.0042391187,0.00013772452,0.9878033,0.0009849616,0.00048460506,0.000019667988,0.000011146354,0.000077663004,0.0062418184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99363375,0.002238241,0.0016221012,0.00056275696,0.0009697048,0.0009734456],"domain_scores_gemma":[0.9856582,0.0114504555,0.0007642623,0.0006939822,0.00081895886,0.0006141245],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048817685,0.000535173,0.0016123669,0.000043576256,0.00052007916,0.00014878817,0.0007917576,0.00047245427,0.000826855],"category_scores_gemma":[0.020605806,0.00037308084,0.00081456394,0.00043501923,0.0009809408,0.00017368436,0.00061330537,0.0015610452,0.000002696098],"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.0010120508,0.0006660595,0.0010890744,0.00089249545,0.0012545572,0.0006471642,0.0010434068,0.00046333167,0.0031286718,0.73914987,0.2464904,0.004162912],"study_design_scores_gemma":[0.0068165897,0.0017133805,0.0053711953,0.00058011094,0.0020320595,0.0014593388,0.0047629587,0.02218142,0.0043267454,0.82379013,0.12500033,0.0019657577],"about_ca_topic_score_codex":0.000047790767,"about_ca_topic_score_gemma":0.000024755955,"teacher_disagreement_score":0.12149008,"about_ca_system_score_codex":0.00026240796,"about_ca_system_score_gemma":0.0005588543,"threshold_uncertainty_score":0.9998721},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9348082,0.000011389957,0.014441012,0.026496192,0.00066732994,0.004198888,0.00011568828,0.00016198303,0.019099293],"genre_scores_gemma":[0.57214487,0.000009064669,0.3483993,0.0017919687,0.00016717674,0.0001770481,0.0000069981816,0.00012535824,0.07717824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825495,0.00012357767,0.00051522464,0.00029149593,0.0004274783,0.00038725743],"domain_scores_gemma":[0.9972991,0.0015121655,0.00018098381,0.0008115355,0.00009161751,0.00010462982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011545195,0.00025610023,0.00051456783,0.000018026483,0.00011688007,0.000024275689,0.00048195606,0.00021821317,0.0007359969],"category_scores_gemma":[0.0005835039,0.00015819177,0.0010955831,0.00011497923,0.00013267352,0.000013117984,0.00014478789,0.00024153898,0.000007380484],"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.00021499748,0.0011591354,0.00032455305,0.0047978275,0.00018965476,6.807478e-7,0.0026338017,0.000026979065,0.02184993,0.5501917,0.41794673,0.00066401507],"study_design_scores_gemma":[0.0073885703,0.001042122,0.0005051222,0.0020591884,0.0005876581,0.000025626252,0.0019869802,0.004063479,0.06499543,0.6667553,0.24916698,0.0014234905],"about_ca_topic_score_codex":0.000009454111,"about_ca_topic_score_gemma":5.2884536e-7,"teacher_disagreement_score":0.3626634,"about_ca_system_score_codex":0.000049591363,"about_ca_system_score_gemma":0.000018971636,"threshold_uncertainty_score":0.805865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39427343,0.00004063445,0.60463405,0.000086525324,0.00054378394,0.00015135542,0.00012382296,0.0000043747345,0.00014200299],"genre_scores_gemma":[0.8837333,0.000012267389,0.11595831,0.000089411034,0.00016541626,9.596638e-7,0.000013965015,0.000016303533,0.000010073632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998083,0.00023591824,0.00082757004,0.00009864919,0.00061257585,0.00014231111],"domain_scores_gemma":[0.99683243,0.0011676729,0.0012450893,0.00011430053,0.0005753969,0.000065121385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017773148,0.00013150154,0.00030839772,0.0001597668,0.00003481811,0.000051817402,0.00034461662,0.00004539261,0.000006753087],"category_scores_gemma":[0.00054713216,0.00009835112,0.00009042909,0.00014021918,0.000048134447,0.00014624117,0.00010184854,0.00023874224,3.3196315e-8],"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.00059191824,0.00023561687,0.018048322,0.00015022827,0.00039146666,0.000094302515,0.0017190388,0.7670748,0.0010504939,0.2025697,0.00040590597,0.007668185],"study_design_scores_gemma":[0.0009905769,0.00008491267,0.00082865625,0.00034053373,0.00006834938,0.0000474453,0.00031141925,0.7149246,0.00006647181,0.28222615,0.0000048449697,0.000106089006],"about_ca_topic_score_codex":0.000079712896,"about_ca_topic_score_gemma":0.000054336724,"teacher_disagreement_score":0.48945987,"about_ca_system_score_codex":0.00014849105,"about_ca_system_score_gemma":0.00021761263,"threshold_uncertainty_score":0.40106422},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031689033,0.00039515443,0.959915,0.0005898253,0.00010056542,0.0011213871,0.00011235587,0.000108298234,0.03448851],"genre_scores_gemma":[0.17630573,0.00041994452,0.8011094,0.00051971094,0.00033357975,0.000998544,0.00020942639,0.00009465191,0.020009037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.00011136827,0.0004856204,0.00043142075,0.0001407755,0.00012324679],"domain_scores_gemma":[0.99816066,0.0005525424,0.00029840117,0.00068060966,0.00020795506,0.00009983639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004220784,0.0002185047,0.0009803253,0.00018598848,0.000028361175,0.000027772423,0.00019535191,0.0002473079,0.0002086707],"category_scores_gemma":[0.00015775037,0.00017398519,0.0003144123,0.0004480787,0.000057514288,0.000012903847,0.00050384726,0.00027049266,3.3205257e-8],"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.00085083663,0.001200563,0.0015856964,0.011590477,0.05304586,0.000008921711,0.005127748,0.00031461255,0.030966992,0.7141894,0.022511806,0.15860707],"study_design_scores_gemma":[0.013313091,0.00024298741,0.0013404536,0.00029394357,0.083747424,0.000003389471,0.0015462141,0.35813996,0.008654799,0.3415321,0.1868401,0.0043454976],"about_ca_topic_score_codex":0.00013318208,"about_ca_topic_score_gemma":0.00009204617,"teacher_disagreement_score":0.3726573,"about_ca_system_score_codex":0.000016445165,"about_ca_system_score_gemma":0.000044502445,"threshold_uncertainty_score":0.709491},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13861468,0.000039211107,0.8290723,0.00024390484,0.00095097424,0.0017126093,0.00040802214,0.0003154847,0.02864283],"genre_scores_gemma":[0.8362808,0.00019091221,0.15911503,0.00026525636,0.00039470822,0.000010731605,0.000119503355,0.00013293704,0.0034900915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970452,0.00020912096,0.0005313194,0.0013749797,0.00018087617,0.0006584675],"domain_scores_gemma":[0.99518126,0.0019980357,0.0006296353,0.0013784606,0.00037925196,0.00043336692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009906921,0.000649259,0.0010743211,0.00046026794,0.00037402386,0.00011576952,0.001411138,0.0006025153,0.00007629711],"category_scores_gemma":[0.0021360365,0.00070552836,0.0010217654,0.00077620085,0.00012528822,0.00020313101,0.0020523816,0.00092969893,0.0000029573694],"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.0005049127,0.00032737924,0.0005784024,0.001235095,0.0011773815,0.00033483424,0.0013846975,0.0121414615,0.00037469226,0.94638306,0.033091303,0.0024667627],"study_design_scores_gemma":[0.004248243,0.00045267932,0.00007281634,0.0009553044,0.0026394348,0.000012709667,0.006612233,0.36599317,0.0022319024,0.592849,0.021299634,0.0026328457],"about_ca_topic_score_codex":0.00023905607,"about_ca_topic_score_gemma":0.00013295053,"teacher_disagreement_score":0.69766617,"about_ca_system_score_codex":0.0005533459,"about_ca_system_score_gemma":0.00040321233,"threshold_uncertainty_score":0.9995396},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01063521,0.000018436132,0.18470545,0.04822002,0.0002456848,0.0005877998,0.00004182091,0.00033069652,0.75521487],"genre_scores_gemma":[0.010843898,0.00007553319,0.02155639,0.00038208434,0.00044488165,5.477872e-7,0.000023851393,0.000019576773,0.9666532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844295,0.00028100403,0.00015181399,0.00050921366,0.00027005436,0.00034497865],"domain_scores_gemma":[0.9980057,0.00016925238,0.00014102392,0.0009880367,0.00043327728,0.0002627275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042141182,0.00020718157,0.00022455503,0.0007507214,0.0010512237,0.00008959179,0.00081510976,0.0001452247,0.000058173046],"category_scores_gemma":[0.00015609717,0.00019913098,0.00016536753,0.0020333158,0.00007317862,0.00091458467,0.00020752494,0.00027892154,0.0000025566555],"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.000052363725,0.0001277634,0.000010878847,0.0000064070628,0.000034394936,0.000006285269,0.00081322336,0.00090660126,0.00009431474,0.90596205,0.08948153,0.0025042049],"study_design_scores_gemma":[0.00040461612,0.00006781389,0.00006620186,0.000011621005,0.000117836535,0.000007134523,0.0035194338,0.0037267539,0.000027764667,0.0022455284,0.98957235,0.0002329505],"about_ca_topic_score_codex":0.00011989177,"about_ca_topic_score_gemma":0.00032527937,"teacher_disagreement_score":0.9037165,"about_ca_system_score_codex":0.0004785562,"about_ca_system_score_gemma":0.00012580764,"threshold_uncertainty_score":0.8120326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09858883,0.00032891327,0.89757025,0.00080344215,0.0002657459,0.0015253488,0.0003928893,0.00034481304,0.0001797571],"genre_scores_gemma":[0.9928441,0.0001394761,0.0055772946,0.00012870792,0.00019459797,0.00047576646,0.000038152823,0.000044627603,0.0005572588],"study_design_codex":"randomized_trial","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980691,0.00028823037,0.00049024285,0.00054949225,0.00029277286,0.00031015993],"domain_scores_gemma":[0.99885786,0.00025220428,0.00018172279,0.00027026876,0.00010656178,0.00033137097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034019572,0.0003494232,0.0005984936,0.00006898858,0.00034568083,0.0001644833,0.000094718205,0.00024391936,0.00002118103],"category_scores_gemma":[0.00004391128,0.0002651496,0.000098876604,0.00031187976,0.00005818995,0.00013273089,0.000002747908,0.0003675033,5.2225744e-7],"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.26032645,0.010589439,0.00094728655,0.051179275,0.011493603,0.0011855769,0.04378587,0.24018896,0.02812718,0.026139315,0.24711446,0.07892259],"study_design_scores_gemma":[0.19179222,0.016050713,0.00022875788,0.0023316843,0.0027830543,0.0016139208,0.010982598,0.7051391,0.0013281609,0.0008779297,0.06158891,0.005282986],"about_ca_topic_score_codex":0.000051809104,"about_ca_topic_score_gemma":0.000055901983,"teacher_disagreement_score":0.8942553,"about_ca_system_score_codex":0.000047340378,"about_ca_system_score_gemma":0.000047920334,"threshold_uncertainty_score":0.9999801},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88061506,0.000028828636,0.0068605463,0.00031457425,0.0002710331,0.00043546062,0.000007808004,0.00006316941,0.111403495],"genre_scores_gemma":[0.9158527,0.000015482587,0.058060337,0.00022456712,0.000013416308,0.000015673486,0.000007528617,0.000026738719,0.025783552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909204,0.00008155263,0.0002508117,0.0001987944,0.00014574517,0.00023105016],"domain_scores_gemma":[0.9992382,0.00028588125,0.00005854048,0.00032266727,0.000040599865,0.000054127584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004505596,0.00012854759,0.00025669497,0.00006971128,0.000012349701,0.000020999329,0.00012257686,0.00007673964,0.00025013444],"category_scores_gemma":[0.00015413303,0.0000991719,0.0000695507,0.00011087977,0.000023533265,0.000056194556,0.00006055171,0.00012382277,0.000001994902],"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.00008628551,0.00036027268,0.05019441,0.0003879651,0.000051733987,0.000030015875,0.001145843,0.0000022584154,0.0023963111,0.93264914,0.0022454031,0.010450386],"study_design_scores_gemma":[0.016555427,0.0009836784,0.016232422,0.0015186955,0.0002157984,0.000092137714,0.058446143,0.7162774,0.01722523,0.11814785,0.05007964,0.0042255423],"about_ca_topic_score_codex":0.0001792322,"about_ca_topic_score_gemma":0.003296308,"teacher_disagreement_score":0.8145013,"about_ca_system_score_codex":0.00021519852,"about_ca_system_score_gemma":0.000028357186,"threshold_uncertainty_score":0.40441126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40143946,0.00005377499,0.59167355,0.00002484672,0.0005949306,0.0004323308,0.00053703925,0.000075909484,0.005168143],"genre_scores_gemma":[0.9160347,0.00014759642,0.07817085,0.000023782499,0.00023436177,0.0000024682827,0.0001729667,0.000054689135,0.0051585953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773216,0.0004013389,0.00042079337,0.0008070623,0.00016381379,0.0004748103],"domain_scores_gemma":[0.9972952,0.0005941634,0.00050159876,0.001143546,0.00028272506,0.00018273739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008759022,0.00043702064,0.00094452477,0.00030407723,0.00013427516,0.00003223542,0.0006469238,0.00045474432,0.000099131124],"category_scores_gemma":[0.00038591123,0.00045160498,0.0006994571,0.0003387223,0.00016357102,0.000074540214,0.00083037827,0.0007151589,0.0000015759543],"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.00077958545,0.00071988744,0.0010397309,0.00089707295,0.0010124708,0.00020541783,0.0003582578,0.40829793,0.0003101927,0.58192754,0.0038809907,0.000570941],"study_design_scores_gemma":[0.006725163,0.00030267035,0.00011738343,0.00063174596,0.0012598113,0.000008915011,0.0007553172,0.90821135,0.0091234865,0.06777695,0.0034266287,0.0016605735],"about_ca_topic_score_codex":0.0001949325,"about_ca_topic_score_gemma":0.000008197263,"teacher_disagreement_score":0.5145952,"about_ca_system_score_codex":0.0003273553,"about_ca_system_score_gemma":0.00016253757,"threshold_uncertainty_score":0.9997936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004411869,0.00044767055,0.99262166,0.00065948407,0.000020515812,0.0005679601,0.0004887653,0.000071598646,0.0007104589],"genre_scores_gemma":[0.8661908,0.000019710116,0.13280417,0.000112819434,0.00026609527,0.0004592266,0.000069533744,0.00002820706,0.00004943073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990222,0.000031794145,0.00031125068,0.00028934667,0.00012499944,0.00022043986],"domain_scores_gemma":[0.99871385,0.00055441813,0.00015356237,0.00020979406,0.00020232168,0.00016603364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020795982,0.00018305203,0.00034740695,0.000045829354,0.00021234929,0.000025908092,0.00016840293,0.00006114761,0.000014527675],"category_scores_gemma":[0.0005407634,0.0001396505,0.00007922982,0.0003795133,0.0001253238,0.000043145505,0.00007800698,0.00012871852,2.1103172e-7],"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.00028679278,0.0006098194,0.000007699266,0.0015624163,0.00031492414,9.95368e-7,0.0035761795,0.0011659829,0.004901205,0.96386886,0.0009641787,0.02274094],"study_design_scores_gemma":[0.010369455,0.0014099616,0.000017851356,0.00054247223,0.00093615457,0.000054404114,0.010550278,0.33171612,0.07395666,0.5518378,0.016104067,0.0025048044],"about_ca_topic_score_codex":0.000009235761,"about_ca_topic_score_gemma":0.000001426015,"teacher_disagreement_score":0.8617789,"about_ca_system_score_codex":0.00001621101,"about_ca_system_score_gemma":0.00007314167,"threshold_uncertainty_score":0.56947815},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26577035,0.0075125312,0.53089595,0.000287337,0.0012801932,0.006312092,0.000238655,0.0003065364,0.18739636],"genre_scores_gemma":[0.29778114,0.0011489475,0.69998634,0.00003708206,0.00006608702,0.0006754585,0.00007417034,0.000043747594,0.00018699144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961254,0.00037689848,0.0013596662,0.0011016036,0.0005716004,0.00046482385],"domain_scores_gemma":[0.99541646,0.0016040104,0.00075889914,0.0018296853,0.00026714816,0.00012377948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031512592,0.00046413727,0.0013316903,0.00038598292,0.00006352651,0.000037217167,0.00069282565,0.0005210994,0.00008227994],"category_scores_gemma":[0.002736562,0.00046520378,0.00033139373,0.0011440543,0.000283681,0.00010664933,0.0012267663,0.0010749716,1.15842525e-7],"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.000508981,0.0048139915,0.008793141,0.041869216,0.00030164438,0.000028865032,0.0038499576,0.0058394903,0.001363978,0.6855268,0.0004893684,0.24661458],"study_design_scores_gemma":[0.0013465451,0.00007811316,0.00062178087,0.0009168052,0.0001739904,0.000004813192,0.0008634954,0.0026030338,0.0040643294,0.98390543,0.004246467,0.0011752206],"about_ca_topic_score_codex":0.00002645109,"about_ca_topic_score_gemma":0.00026793126,"teacher_disagreement_score":0.29837862,"about_ca_system_score_codex":0.0003880994,"about_ca_system_score_gemma":0.0003425195,"threshold_uncertainty_score":0.99977994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81706464,0.000091635,0.16965453,0.0034133648,0.000058627476,0.0031233262,0.000102455815,0.000043509845,0.006447914],"genre_scores_gemma":[0.9813209,0.000007457469,0.018167747,0.00016400285,0.00007427235,0.00021417752,0.000010247635,0.000013887324,0.000027315255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891543,0.00016690737,0.00047840332,0.00017060603,0.00014209613,0.00012653734],"domain_scores_gemma":[0.99762106,0.001421241,0.00028102336,0.0003759275,0.00025159604,0.00004913691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174596,0.000104275525,0.00035904872,0.000013878603,0.000049110557,0.000008401612,0.00022085718,0.00006620524,0.000004758016],"category_scores_gemma":[0.001082372,0.00006728283,0.00016236195,0.00009765831,0.0001192666,0.000014837518,0.000047603287,0.00007142251,3.4127467e-8],"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.0027329682,0.0002761036,0.00005293864,0.0026128425,0.00016268546,6.5714914e-8,0.006585322,0.0015199617,0.016995428,0.9617949,0.0013913377,0.0058754194],"study_design_scores_gemma":[0.0041844407,0.0005784693,0.00029788978,0.000096441145,0.00025840497,0.0000015119659,0.0021405017,0.11468774,0.048263274,0.8245676,0.0044503966,0.00047329927],"about_ca_topic_score_codex":0.00001134249,"about_ca_topic_score_gemma":0.0000060458024,"teacher_disagreement_score":0.16425626,"about_ca_system_score_codex":0.0000069609882,"about_ca_system_score_gemma":0.000042888827,"threshold_uncertainty_score":0.27437142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2620063,0.0019435708,0.4452764,0.11049995,0.0003744397,0.0053676167,0.00048195204,0.0006697439,0.17338002],"genre_scores_gemma":[0.17206004,0.00004470832,0.8043865,0.008731683,0.0009001187,0.0003046102,0.000026201871,0.00020705683,0.01333907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984136,0.00007702521,0.0003941825,0.0003969026,0.00016417683,0.0005541148],"domain_scores_gemma":[0.99744946,0.001205227,0.000087291286,0.00021360967,0.00011995695,0.000924437],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005741813,0.0002626261,0.00046393304,0.000076886055,0.00019262268,0.00011916819,0.0002048755,0.00013982838,0.001622725],"category_scores_gemma":[0.0054377727,0.00023924341,0.00009904511,0.00013482617,0.00008009418,0.00003540207,0.00005716833,0.0001650497,0.000013745179],"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.00011885741,0.00011597457,0.00011841381,0.014857389,0.00024205718,0.00020902426,0.0068827644,0.000007085709,0.0012276386,0.5524498,0.4079925,0.015778428],"study_design_scores_gemma":[0.001910519,0.0002944555,0.000011148279,0.0006576493,0.00023625427,0.0001125198,0.0010441367,0.015086243,0.0027388684,0.19870113,0.7777553,0.0014517695],"about_ca_topic_score_codex":0.000097642784,"about_ca_topic_score_gemma":0.00028756785,"teacher_disagreement_score":0.36976278,"about_ca_system_score_codex":0.00006122889,"about_ca_system_score_gemma":0.0001983221,"threshold_uncertainty_score":0.99928993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06755871,0.0063118595,0.6993566,0.018644808,0.0009876263,0.0015751398,0.000020442207,0.0003909306,0.20515384],"genre_scores_gemma":[0.5677461,0.003650001,0.2237265,0.0038041235,0.0015549693,0.000779497,0.000010148464,0.00035874112,0.1983699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977909,0.00046973955,0.00055949594,0.00031033432,0.0004094643,0.00046011287],"domain_scores_gemma":[0.9923767,0.0062379953,0.00011831801,0.0009544997,0.00017262626,0.00013986927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027873993,0.00025079382,0.00036066317,0.000025617437,0.00044881765,0.00018583567,0.00044665937,0.00011286856,0.00065131945],"category_scores_gemma":[0.003748281,0.00012435828,0.00019401097,0.00024539584,0.00041689278,0.000046994417,0.00035967055,0.000366286,0.000009260079],"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.000023654276,0.000077685334,0.0000080800355,0.0001414442,0.00007468612,0.000018305205,0.0017752149,5.591297e-7,0.00023721727,0.935657,0.008147554,0.053838573],"study_design_scores_gemma":[0.0001030663,0.000046459118,0.0000064473393,0.00011476205,0.00009155123,0.00014286728,0.0034493045,0.0044205002,0.00909274,0.94716597,0.03511093,0.00025540008],"about_ca_topic_score_codex":0.0000047367516,"about_ca_topic_score_gemma":0.000041310606,"teacher_disagreement_score":0.5001874,"about_ca_system_score_codex":0.000035806184,"about_ca_system_score_gemma":0.000051164418,"threshold_uncertainty_score":0.71314913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11647578,0.00025755248,0.8816039,0.00028691074,0.00016754467,0.00086291716,0.000020605356,0.00003181027,0.00029299688],"genre_scores_gemma":[0.6618552,0.000038816896,0.33762282,0.000018748604,0.0001973749,0.00012328208,0.00007481911,0.00003034625,0.000038559418],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978188,0.00029844383,0.00089142314,0.00059216766,0.0001245478,0.00027457098],"domain_scores_gemma":[0.994936,0.003382817,0.0008233231,0.0004368321,0.00034281536,0.00007820228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012673335,0.00032370136,0.001171661,0.00007225366,0.000039702318,0.000013712659,0.00015631993,0.0008428703,0.000050309507],"category_scores_gemma":[0.0030504563,0.00024692825,0.0001895054,0.000067487716,0.00037999533,0.000010203775,0.00020412629,0.000411265,7.110113e-8],"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.0068848184,0.0044509815,0.00006828199,0.027166752,0.002745861,0.000014135157,0.0032394808,0.028800905,0.4720509,0.40819502,0.0013438642,0.045038972],"study_design_scores_gemma":[0.0059956787,0.0032394363,0.000037451762,0.010229186,0.0020580697,0.00035434752,0.0026176786,0.3169949,0.037914585,0.6157025,0.0019926848,0.002863423],"about_ca_topic_score_codex":0.0000045531347,"about_ca_topic_score_gemma":2.9793466e-7,"teacher_disagreement_score":0.54537946,"about_ca_system_score_codex":0.000039975166,"about_ca_system_score_gemma":0.000045633624,"threshold_uncertainty_score":0.9999983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562438,0.0049772575,0.41122964,0.008647841,0.0012635703,0.0036340742,0.00050741807,0.00019783223,0.007104353],"genre_scores_gemma":[0.81931704,0.000507756,0.17785919,0.00036308568,0.0007308274,0.000111015965,0.00001669823,0.00007411498,0.0010202582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000057421912,0.00027474447,0.00018022984,0.0001278744,0.00018505815],"domain_scores_gemma":[0.99825144,0.0013095847,0.0001333049,0.00014848467,0.00007050612,0.000086675995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035357467,0.00014389797,0.00035369795,0.000015491838,0.0001658057,0.000039200295,0.00014309405,0.00006845138,0.000004042636],"category_scores_gemma":[0.0005760823,0.00008363866,0.00014395497,0.00006615067,0.000102260456,0.000030250034,0.000058675498,0.0000933168,6.1906222e-9],"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.0021419215,0.000032135827,0.00031771758,0.0006928828,0.00040453294,0.0000050640224,0.0026810227,0.000024559762,0.0016245849,0.59621054,0.0051272754,0.39073774],"study_design_scores_gemma":[0.036685567,0.0013090953,0.0010127175,0.00012380793,0.0007720743,0.000048999005,0.0054291887,0.23022208,0.013276532,0.4952086,0.21464731,0.0012640326],"about_ca_topic_score_codex":0.000008647063,"about_ca_topic_score_gemma":0.000045711564,"teacher_disagreement_score":0.3894737,"about_ca_system_score_codex":0.000008931383,"about_ca_system_score_gemma":0.000015042596,"threshold_uncertainty_score":0.34106857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65546423,0.0005716071,0.3332343,0.0060567744,0.0011079484,0.00043634733,0.00006227015,0.000024009025,0.0030424793],"genre_scores_gemma":[0.9586877,0.000071795526,0.04025767,0.00070459174,0.00007974022,0.0000056325634,0.0000034387176,0.0000062450863,0.00018318085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885774,0.00009157296,0.00059132284,0.000055251156,0.0002745393,0.00012958515],"domain_scores_gemma":[0.9979542,0.0004953264,0.0005600002,0.00019688852,0.00072626414,0.000067333305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010771,0.000100695775,0.00022811725,0.000064642554,0.00013096817,0.000093380215,0.00014505009,0.00006311387,0.000021583635],"category_scores_gemma":[0.0032510583,0.00006328666,0.00012522744,0.000098868375,0.00004534407,0.0005539687,0.000079957106,0.0001772596,1.11091325e-7],"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.0004751728,0.00019515913,0.0021780585,0.0004980999,0.00041239438,0.0000062245545,0.003809121,0.00013087661,0.0046043447,0.6330291,0.02436369,0.33029774],"study_design_scores_gemma":[0.017733786,0.001476995,0.010480611,0.002137593,0.00086032925,0.001749573,0.012678971,0.022148855,0.08735434,0.67684156,0.16483098,0.0017063934],"about_ca_topic_score_codex":0.0000047366,"about_ca_topic_score_gemma":0.0000076789265,"teacher_disagreement_score":0.32859135,"about_ca_system_score_codex":0.00003213566,"about_ca_system_score_gemma":0.00020899042,"threshold_uncertainty_score":0.38920552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6227025,0.000056476507,0.37515777,0.000032502678,0.00013865366,0.00028091753,0.00009447704,0.00006179724,0.0014749207],"genre_scores_gemma":[0.94334763,0.000057785146,0.05613708,0.00001880127,0.000053194894,9.114573e-7,0.0000401093,0.000028732611,0.00031574917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859786,0.00017235632,0.00029113996,0.0006622438,0.00009276903,0.00018363378],"domain_scores_gemma":[0.99845594,0.00031764968,0.00041726322,0.0005443118,0.0001258905,0.00013892452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037538027,0.00025392103,0.0005137981,0.00012556864,0.00006650868,0.000028084743,0.00028645474,0.00026623995,0.000034309513],"category_scores_gemma":[0.00027754615,0.00028911815,0.00016823885,0.00019169874,0.00008356713,0.00002999568,0.0007729019,0.00036557118,4.526023e-7],"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.0014823257,0.0014825487,0.03094508,0.011270265,0.0020682046,0.00042933648,0.01787432,0.35642374,0.009747445,0.5528901,0.0024089292,0.012977699],"study_design_scores_gemma":[0.000722886,0.000053242016,0.0004906883,0.0003407823,0.0003708337,0.0000013220482,0.0008717941,0.8737581,0.00046343732,0.12231735,0.00016698695,0.0004425932],"about_ca_topic_score_codex":0.00017095976,"about_ca_topic_score_gemma":0.000014188629,"teacher_disagreement_score":0.51733434,"about_ca_system_score_codex":0.000091084476,"about_ca_system_score_gemma":0.000071937575,"threshold_uncertainty_score":0.9999561},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15874219,0.0010733731,0.7595284,0.0037457906,0.0035340616,0.006336485,0.00049656176,0.005328686,0.061214447],"genre_scores_gemma":[0.0033556588,0.00010917456,0.94157726,0.00034879512,0.0009699912,0.0008560903,0.00020129324,0.00018221351,0.052399505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873453,0.000046544654,0.00026962938,0.00028783272,0.00020047376,0.00046098986],"domain_scores_gemma":[0.9987732,0.00059252937,0.00009188801,0.00036163552,0.00009013262,0.00009061501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011053918,0.00017672864,0.00028230296,0.000094515315,0.00013624344,0.000061445004,0.00018226908,0.00011762499,0.000016388996],"category_scores_gemma":[0.00042607062,0.0001580848,0.00018271212,0.0002968893,0.00003465523,0.00005559562,0.00009158883,0.00011445699,0.000004551424],"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.000010499294,0.00010336111,0.0005290807,0.00035622425,0.00008286031,0.0000354338,0.0013172337,0.0000013612308,0.00046508317,0.015740309,0.088908516,0.89245003],"study_design_scores_gemma":[0.0013663715,0.00026128587,0.00014956259,0.0003078065,0.00012977893,0.000021363812,0.0012090451,0.027347855,0.0013292523,0.040188216,0.9269626,0.00072685536],"about_ca_topic_score_codex":0.00002352672,"about_ca_topic_score_gemma":0.000047458205,"teacher_disagreement_score":0.89172316,"about_ca_system_score_codex":0.00003296197,"about_ca_system_score_gemma":0.000028087255,"threshold_uncertainty_score":0.6446511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625721,0.0024939398,0.000034844827,0.014947691,0.00041640017,0.0011912346,0.00012276511,0.00009221494,0.018128822],"genre_scores_gemma":[0.9859414,0.00018179846,0.009960583,0.0007656931,0.00011617501,0.000012927852,0.0000011594501,0.000058773618,0.002961503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9948677,0.0011035947,0.00140911,0.0006356263,0.0015012043,0.0004827644],"domain_scores_gemma":[0.9962314,0.0007355843,0.0021571799,0.00056067435,0.000036222595,0.0002789566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021679918,0.00040968484,0.0009149522,0.0003437511,0.0003465356,0.000054261076,0.0033317476,0.0005182388,0.000013039443],"category_scores_gemma":[0.00051534944,0.00024551732,0.00035931793,0.0014296758,0.0020578355,0.00199519,0.0017284863,0.0008606473,7.897757e-8],"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.0008942742,0.0010254197,0.062537126,0.0043729343,0.0004829889,0.000005736726,0.006352838,0.00015236973,0.05412453,0.8381509,0.030868758,0.0010320737],"study_design_scores_gemma":[0.0012921044,0.00036389855,0.015952833,0.0019551937,0.00019489512,0.0000829707,0.0010919904,0.00041659473,0.78577346,0.1886771,0.0037595502,0.00043939185],"about_ca_topic_score_codex":0.000007406766,"about_ca_topic_score_gemma":2.8365466e-7,"teacher_disagreement_score":0.7316489,"about_ca_system_score_codex":0.000013800976,"about_ca_system_score_gemma":0.00047876517,"threshold_uncertainty_score":0.9999997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6568598,0.000056034816,0.3372641,0.00020628709,0.000035086323,0.0007472314,0.000060214843,0.00008111164,0.004690106],"genre_scores_gemma":[0.8712723,0.000037890095,0.12746094,0.000026102238,0.00008206367,0.0000026991781,0.00008563897,0.000048373484,0.0009839463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686915,0.0005385763,0.00027908158,0.00054394896,0.00088341604,0.000885804],"domain_scores_gemma":[0.9972492,0.0006745146,0.00019479019,0.00076969876,0.0003193698,0.0007924563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002022914,0.00025188204,0.00043141437,0.0003819352,0.0005510155,0.000026539374,0.00060468906,0.00012428658,0.000087772176],"category_scores_gemma":[0.00027223682,0.00025710056,0.000100993304,0.00065749226,0.0003207449,0.00048241884,0.00035462377,0.00048738022,0.0000032477894],"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.0035020441,0.0033507112,0.016275374,0.0010055215,0.0004018288,0.00016163535,0.049165808,0.00027595865,0.7855367,0.016086115,0.0118253585,0.112412944],"study_design_scores_gemma":[0.025233045,0.019300207,0.059061885,0.0046880157,0.0013312649,0.0005545273,0.21333711,0.31984758,0.09732865,0.044080794,0.20405978,0.011177155],"about_ca_topic_score_codex":0.0013058421,"about_ca_topic_score_gemma":0.00053239195,"teacher_disagreement_score":0.68820804,"about_ca_system_score_codex":0.00007999471,"about_ca_system_score_gemma":0.00010015691,"threshold_uncertainty_score":0.99998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014270185,0.00003845691,0.9441794,0.00028636632,0.0001358855,0.0018772689,0.03643312,0.00019788717,0.015424567],"genre_scores_gemma":[0.3588929,5.8009323e-7,0.5861325,0.0017789209,0.0003283284,0.00097219786,0.04986035,0.00013487534,0.0018993632],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.00006389606,0.000344935,0.00029956168,0.0002286558,0.00026837707],"domain_scores_gemma":[0.9964921,0.0019169406,0.00015779493,0.00026681754,0.0010712936,0.00009508424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018304269,0.00018320575,0.00029065914,0.0000634993,0.00010226866,0.00007404214,0.00020117204,0.00012702626,0.0069739306],"category_scores_gemma":[0.0023379063,0.00016935584,0.00015905358,0.00010237983,0.000008120125,0.00020463087,0.00010808626,0.00016166367,0.000017444303],"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.00016686012,0.00043446128,0.000027535092,0.005357407,0.0004405706,0.000017335618,0.0043294956,0.046385378,0.001101263,0.26185974,0.6088325,0.07104751],"study_design_scores_gemma":[0.00056407566,0.00008385069,0.000017495659,0.00064212177,0.000018565523,0.000011008701,0.0003333581,0.9559993,0.0002831377,0.038574923,0.0032096754,0.00026247156],"about_ca_topic_score_codex":0.0000013603188,"about_ca_topic_score_gemma":0.0000052851196,"teacher_disagreement_score":0.90961397,"about_ca_system_score_codex":0.000061866056,"about_ca_system_score_gemma":0.000092398346,"threshold_uncertainty_score":0.99393386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8824451,0.00012827323,0.035275333,0.0020997676,0.00003484402,0.0029105966,0.000038118043,0.000125639,0.07694236],"genre_scores_gemma":[0.9222932,0.00003658717,0.07659018,0.000008341886,0.000013548022,0.000013751033,0.0000113631,0.00001488232,0.0010181469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.998654,0.00022190428,0.00016589272,0.00023742372,0.00032104942,0.00039974245],"domain_scores_gemma":[0.9984916,0.00052753475,0.00012590525,0.0005921549,0.00022512063,0.00003771743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030259439,0.00011285107,0.00021723329,0.00030682224,0.0003093767,0.00001215258,0.0008833193,0.00019211377,0.0000118036005],"category_scores_gemma":[0.00020924475,0.00007114131,0.00006635858,0.00046006113,0.0005498041,0.000053715896,0.00013876437,0.00051821646,2.0272924e-7],"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.0026731796,0.0017463859,0.012345141,0.000621415,0.0004757213,0.00040912445,0.018179342,0.000005353383,0.0013492445,0.9005623,0.018586814,0.043046013],"study_design_scores_gemma":[0.012763943,0.0089191925,0.012138976,0.0005324273,0.00032859427,0.0003282878,0.70477897,0.0044934433,0.008081057,0.1592605,0.08680233,0.0015722709],"about_ca_topic_score_codex":0.0002635058,"about_ca_topic_score_gemma":0.0016271098,"teacher_disagreement_score":0.7413018,"about_ca_system_score_codex":0.000040925548,"about_ca_system_score_gemma":0.000075821925,"threshold_uncertainty_score":0.29010582},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41669852,0.000054237433,0.57657486,0.00037041563,0.00019106736,0.0009274676,0.00003645436,0.00006897896,0.0050779968],"genre_scores_gemma":[0.95834845,0.00023747903,0.040718105,0.00021626231,0.00006465877,0.0000038068824,0.0000066780985,0.00003742183,0.00036716342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955484,0.0027046902,0.0005576716,0.0007624533,0.00015940788,0.0002673291],"domain_scores_gemma":[0.9863502,0.011597858,0.0007707088,0.00093398435,0.00018429382,0.0001629532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055307345,0.00041147685,0.0015326104,0.00015726383,0.00013038493,0.00004239077,0.0005823879,0.000309208,0.000046950256],"category_scores_gemma":[0.005128669,0.00031130467,0.0007049588,0.00025696997,0.00034593433,0.000044139844,0.0012881714,0.0008533501,3.3628072e-7],"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.005610119,0.000099053555,0.00012233907,0.0008012904,0.00058030273,0.000037386908,0.00073202554,0.004105107,0.000111722395,0.98740596,0.00018425558,0.00021042892],"study_design_scores_gemma":[0.016906029,0.00007325908,0.00004252106,0.00050183,0.0012172638,0.000004778516,0.00043963594,0.12059848,0.0010815423,0.85854816,0.00009140076,0.00049511937],"about_ca_topic_score_codex":0.00021556595,"about_ca_topic_score_gemma":0.000034824654,"teacher_disagreement_score":0.54164994,"about_ca_system_score_codex":0.00008784023,"about_ca_system_score_gemma":0.000105315776,"threshold_uncertainty_score":0.9999339},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61391884,0.00003385552,0.3818664,0.000027683674,0.0000600299,0.00016219166,0.000027894659,0.000036067766,0.0038670325],"genre_scores_gemma":[0.58969563,0.000008171865,0.4084606,0.0000073511064,0.00003280908,1.7555855e-7,0.000005250059,0.000019280867,0.0017707447],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99850863,0.00010512044,0.00030116862,0.0003185726,0.00039044523,0.00037607],"domain_scores_gemma":[0.9983693,0.00040186322,0.00036880554,0.000439684,0.0002721027,0.00014825056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015757543,0.00021830095,0.0006825914,0.0002880416,0.00014370341,0.0000104083965,0.00034016772,0.00014198406,0.00024838027],"category_scores_gemma":[0.00013698015,0.00021934694,0.00025813072,0.00025406684,0.00041806334,0.00013470562,0.00021019552,0.00019807604,7.8552205e-7],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02619653,0.0048481193,0.11611606,0.0051692687,0.00883165,0.0030911488,0.4594728,0.0024013475,0.062425222,0.08523907,0.0040038694,0.22220491],"study_design_scores_gemma":[0.037028864,0.0011487922,0.015015656,0.0015171976,0.0019109925,0.0002452845,0.7207028,0.01306737,0.18968517,0.008850376,0.0073875645,0.003439921],"about_ca_topic_score_codex":0.00084890495,"about_ca_topic_score_gemma":0.00020767142,"teacher_disagreement_score":0.26123002,"about_ca_system_score_codex":0.00006554799,"about_ca_system_score_gemma":0.000047733985,"threshold_uncertainty_score":0.8944709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13865322,0.0039222147,0.85682285,0.00016173128,0.00031147475,0.00007654077,0.0000043681466,0.0000048764264,0.000042741456],"genre_scores_gemma":[0.86666703,0.0008015991,0.13196619,0.00034589422,0.00012629526,0.00000449264,0.0000033061256,0.000020145635,0.000065027016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984051,0.0006334152,0.00047657636,0.00014719348,0.00016799461,0.00016974512],"domain_scores_gemma":[0.998631,0.0008432939,0.0001515812,0.000103192695,0.00011820012,0.00015273629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841582,0.00012526146,0.0003310634,0.000052974923,0.00005829264,0.000041024123,0.00004328575,0.00007065365,0.00004287466],"category_scores_gemma":[0.00075124454,0.000100380035,0.00003428426,0.000074321826,0.000028894785,0.00007158715,0.00007335008,0.00017780873,1.22512e-8],"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.00030022662,0.00012329777,0.000009970628,0.000036402063,0.00002753769,0.00020450079,0.00062196417,0.00007515041,0.0054819365,0.98284805,0.00027896278,0.009992013],"study_design_scores_gemma":[0.0018297251,0.0005539532,0.00002276326,0.00017375247,0.0000797547,0.00053790415,0.0024182722,0.12223392,0.01740939,0.85377353,0.0006788162,0.0002882349],"about_ca_topic_score_codex":0.000001483577,"about_ca_topic_score_gemma":0.0000030783317,"teacher_disagreement_score":0.7280138,"about_ca_system_score_codex":0.000033891407,"about_ca_system_score_gemma":0.000025332105,"threshold_uncertainty_score":0.4093379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55959827,0.000019340616,0.43591014,0.00042561386,0.000036819652,0.00032304449,0.000006067793,0.000035673165,0.0036450147],"genre_scores_gemma":[0.98048514,0.00005407871,0.018793136,0.00044032378,0.00002968546,8.25676e-7,8.469638e-7,0.00001448847,0.00018146647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788415,0.0012343252,0.0002832138,0.00033001063,0.00008922343,0.00017909815],"domain_scores_gemma":[0.992034,0.007161796,0.0002493011,0.0003343488,0.000091420814,0.00012912713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028434368,0.0001702157,0.00062614994,0.000058988193,0.00010476627,0.000016687522,0.00024078287,0.00007809008,0.00004874917],"category_scores_gemma":[0.0036054128,0.00012225914,0.00026411377,0.0002906992,0.00020343171,0.000060193128,0.0001847487,0.00020826377,3.4476253e-7],"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.004431673,0.000054747892,0.00026395908,0.00014211258,0.00016042196,0.000016056005,0.00077781716,0.0011199946,0.0003853016,0.9922813,0.00014439813,0.00022218913],"study_design_scores_gemma":[0.06562882,0.00037108766,0.00017235489,0.00026810952,0.0012702455,0.000011445909,0.002304333,0.37984297,0.008758474,0.54006356,0.0005196746,0.0007889038],"about_ca_topic_score_codex":0.000056129305,"about_ca_topic_score_gemma":0.000012177768,"teacher_disagreement_score":0.45221776,"about_ca_system_score_codex":0.000025975347,"about_ca_system_score_gemma":0.000027673872,"threshold_uncertainty_score":0.4985583},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6296305,0.00018257016,0.16888975,0.00011355635,0.007974998,0.009944358,0.01720947,0.002136538,0.16391824],"genre_scores_gemma":[0.7779008,0.000008888587,0.21873778,0.00026098292,0.0000917729,0.00050241686,0.000110037596,0.0002770723,0.002110242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488735,0.0007854124,0.001194985,0.0011422597,0.00074324466,0.001246727],"domain_scores_gemma":[0.9949757,0.0021565307,0.00043306753,0.0012663193,0.00046914993,0.0006992463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038869597,0.00073692127,0.0010696144,0.00027774053,0.0005164787,0.000081828584,0.0007706808,0.0006336965,0.0001741602],"category_scores_gemma":[0.0035665007,0.0007096742,0.00044683975,0.00034657939,0.000095600255,0.00034629207,0.0003014331,0.0007872228,0.0000066019174],"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.0005047198,0.00050023437,0.000007805283,0.0008934864,0.00014915474,0.00007886486,0.000009176822,0.000010573121,0.015486426,0.9667476,0.00007038119,0.015541572],"study_design_scores_gemma":[0.010592714,0.0027531893,0.00009531134,0.0011182094,0.0014234973,0.00020809232,0.0007149424,0.4454926,0.06042016,0.41435683,0.057809405,0.0050150743],"about_ca_topic_score_codex":0.00012542855,"about_ca_topic_score_gemma":0.00012686595,"teacher_disagreement_score":0.5523908,"about_ca_system_score_codex":0.0005643929,"about_ca_system_score_gemma":0.00007164256,"threshold_uncertainty_score":0.99953544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40532053,0.0002547718,0.58876336,0.0012182555,0.0006458299,0.00035483227,0.00015217629,0.00004938589,0.0032408603],"genre_scores_gemma":[0.5665647,0.000048606504,0.43009147,0.00024284856,0.00025173943,0.0000010952039,0.000041530515,0.00005823604,0.0026997812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756974,0.00039574286,0.0005954406,0.00042950502,0.0007321724,0.00027740595],"domain_scores_gemma":[0.9958359,0.00081778807,0.001010493,0.0003771072,0.0016444554,0.0003142443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006185744,0.0004017652,0.0007897117,0.0018353605,0.00034786784,0.00025603818,0.0003305273,0.0003369823,0.000039696606],"category_scores_gemma":[0.00032211732,0.00039812824,0.00039194568,0.00094533706,0.00018927513,0.00019715009,0.00021075238,0.0012678656,6.806058e-8],"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.0010691361,0.0012162771,0.0034385535,0.0008338786,0.0020769255,0.0015705622,0.0013521914,0.9765366,0.00038002254,0.0048822975,0.0018160846,0.0048275273],"study_design_scores_gemma":[0.013949736,0.004976028,0.01881393,0.0043421527,0.0050010933,0.0014344086,0.008712833,0.85392517,0.00045118708,0.0072571677,0.077297315,0.0038389992],"about_ca_topic_score_codex":0.00008572763,"about_ca_topic_score_gemma":0.00016383162,"teacher_disagreement_score":0.16124415,"about_ca_system_score_codex":0.0005318048,"about_ca_system_score_gemma":0.0014181866,"threshold_uncertainty_score":0.99984705},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006972359,0.00016985532,0.00402616,0.00005222183,0.00058985094,0.0005638733,0.00031959167,0.000316824,0.9938919],"genre_scores_gemma":[0.00030096245,0.00007586395,0.0027937996,0.00024870638,0.00039775117,0.0000011746793,0.000032080574,0.00013971378,0.99600995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980383,0.00009837248,0.000320837,0.00075489416,0.00041910165,0.00036851052],"domain_scores_gemma":[0.9978109,0.00030725021,0.000355254,0.00094460126,0.00020665515,0.0003753395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024217037,0.00060479617,0.0008277446,0.00015854964,0.00019494006,0.000067157,0.0006855093,0.0005752438,0.000017082426],"category_scores_gemma":[0.00010164833,0.00069227675,0.0005782407,0.000011504383,0.00023846104,0.000070004,0.0006165428,0.0007980427,0.0000024234737],"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.00011552836,0.000011327169,2.5344247e-7,0.00025074632,0.00020204637,0.00078799855,0.000050455594,9.810728e-8,0.000031228952,0.81102437,0.18647727,0.0010486941],"study_design_scores_gemma":[0.00063927914,0.000091107984,3.4674684e-7,0.00025313537,0.0004920908,0.000019765614,0.00004027699,0.00004819924,0.00013678921,0.00067999656,0.99690425,0.0006947738],"about_ca_topic_score_codex":0.0000449685,"about_ca_topic_score_gemma":0.0000047924186,"teacher_disagreement_score":0.81042695,"about_ca_system_score_codex":0.00025418997,"about_ca_system_score_gemma":0.00016526795,"threshold_uncertainty_score":0.99955285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030322889,0.000018013867,0.928059,0.02545285,0.00012928972,0.00065218523,0.0000037967434,0.00007621808,0.015285782],"genre_scores_gemma":[0.6943255,0.000019297991,0.2618222,0.03369497,0.00058543327,0.00022507612,0.000008852144,0.000065071195,0.009253586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.00008807716,0.0001795817,0.0001438481,0.00012528911,0.000119371856],"domain_scores_gemma":[0.9970488,0.002600532,0.000057370275,0.00020197523,0.000043913136,0.00004741203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043438896,0.000096440795,0.0001333053,0.000019202795,0.000056615627,0.00002500253,0.00011062577,0.00005087421,0.00015294405],"category_scores_gemma":[0.0015254199,0.000054625445,0.00011154715,0.0000721397,0.000008857502,0.000028684417,0.000022411225,0.00008256263,7.744475e-7],"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.00013083177,0.000051404884,0.000023735862,0.00019730316,0.00004680353,0.0000010208391,0.0038038162,0.000013359464,0.0011170864,0.90482676,0.078064,0.011723871],"study_design_scores_gemma":[0.0020071536,0.0025321573,0.000007293872,0.00016538786,0.00020089728,0.000001468791,0.006209697,0.3565921,0.123153046,0.46216848,0.046204142,0.00075818435],"about_ca_topic_score_codex":0.0000072588105,"about_ca_topic_score_gemma":0.000026639073,"teacher_disagreement_score":0.6662368,"about_ca_system_score_codex":0.000007756408,"about_ca_system_score_gemma":0.000010293038,"threshold_uncertainty_score":0.22275609},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16079697,0.000025733969,0.8358678,0.0006043269,0.00037110175,0.0014026858,0.00009124129,0.000056672034,0.0007834338],"genre_scores_gemma":[0.9407398,0.000049813272,0.055851568,0.0000626118,0.00011838366,0.00003318843,0.00017997132,0.00003247744,0.002932149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846,0.00031887056,0.0003308401,0.00053992664,0.000117153344,0.00023318676],"domain_scores_gemma":[0.9974283,0.00055066607,0.00047104966,0.0008792188,0.0005852267,0.00008555305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608014,0.000233383,0.0003631469,0.00020714162,0.00018667991,0.0000401697,0.00040900364,0.00024381005,0.000018203365],"category_scores_gemma":[0.00091809337,0.00022515576,0.00031210287,0.00042691454,0.00004736681,0.000096250784,0.000383468,0.00022554155,2.096696e-7],"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.00049727166,0.0009085539,0.00030867688,0.0027173096,0.0008098103,0.0000115022385,0.0063962894,0.08174095,0.0032744117,0.88545215,0.00711638,0.010766694],"study_design_scores_gemma":[0.0010909031,0.00012635306,0.00033963597,0.00042297915,0.0007211672,0.0000014654179,0.0027218794,0.9561446,0.0025895953,0.03430506,0.0009846294,0.000551766],"about_ca_topic_score_codex":0.00011213117,"about_ca_topic_score_gemma":0.00027170734,"teacher_disagreement_score":0.8744036,"about_ca_system_score_codex":0.00028558614,"about_ca_system_score_gemma":0.00017540061,"threshold_uncertainty_score":0.91815853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17309427,0.00017018887,0.80171746,0.0028448375,0.00006235476,0.0002551996,0.000008458361,0.00011932738,0.02172793],"genre_scores_gemma":[0.8321084,0.000055866,0.16284917,0.000020006786,0.000008572026,0.000020727886,0.000005416317,0.000025511008,0.0049063363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960954,0.0027426365,0.00041294226,0.0002780713,0.00026025865,0.00021067793],"domain_scores_gemma":[0.99647945,0.0013192118,0.00030696837,0.0007211426,0.0010837875,0.000089411296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042203227,0.0001508589,0.00025523183,0.00009994284,0.00011746558,0.00004508745,0.0003377216,0.000079383,0.000032953652],"category_scores_gemma":[0.00251386,0.00010701896,0.00010778163,0.00019748369,0.00018172218,0.000121955694,0.00015812994,0.00007773316,6.221497e-7],"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.000033631753,0.0006743382,0.0014340519,0.00052869524,0.00008664041,0.0000021708734,0.009084313,0.000004012746,0.20826168,0.55300236,0.00089102704,0.2259971],"study_design_scores_gemma":[0.0014525016,0.0000014733607,0.00036472795,0.0034054765,0.00006342494,0.000015117056,0.0003263737,0.020085381,0.93891627,0.032820642,0.0020911868,0.00045741833],"about_ca_topic_score_codex":0.00006870349,"about_ca_topic_score_gemma":0.0001440528,"teacher_disagreement_score":0.7306546,"about_ca_system_score_codex":0.000044851964,"about_ca_system_score_gemma":0.00006384911,"threshold_uncertainty_score":0.43641064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01775042,0.00006503166,0.97771984,0.00045626954,0.00017645318,0.00064829324,0.00036680227,0.000050084283,0.0027668248],"genre_scores_gemma":[0.80075866,0.0000099957515,0.1893555,0.00013990363,0.00010030314,0.000843607,0.000101621416,0.00006293265,0.008627458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990731,0.00010682344,0.00026206323,0.00017461197,0.00019941572,0.00018400053],"domain_scores_gemma":[0.99843335,0.00094149617,0.00013581493,0.00032894243,0.00009802787,0.00006235657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003413244,0.000111067886,0.00022959226,0.00007837163,0.00023361419,0.0000099574945,0.00019956534,0.000035301502,0.00033873654],"category_scores_gemma":[0.0011214602,0.00010318351,0.00009702499,0.00022700676,0.000041524385,0.000026988497,0.00017353379,0.00011124495,7.247869e-8],"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.000091591166,0.000956261,0.001120284,0.00040697993,0.00012046819,0.0000034800976,0.0056811566,0.0018133171,0.006046687,0.9587997,0.015698422,0.009261622],"study_design_scores_gemma":[0.009815037,0.002545629,0.0015284972,0.0005653901,0.0013211118,0.000058955273,0.016665518,0.19807465,0.0026567022,0.5410325,0.2224823,0.003253704],"about_ca_topic_score_codex":0.000035178316,"about_ca_topic_score_gemma":0.00007594022,"teacher_disagreement_score":0.78836435,"about_ca_system_score_codex":0.000033838798,"about_ca_system_score_gemma":0.0000685671,"threshold_uncertainty_score":0.42077017},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92898023,0.000062179664,0.000046821337,0.00014547123,0.00007106476,0.00024693983,0.000008284637,0.000028320863,0.07041066],"genre_scores_gemma":[0.94657564,0.0032148662,0.045559246,0.000057927165,0.0001247781,0.00003723737,0.0000032468217,0.000032256932,0.004394818],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846643,0.00023622233,0.00031296784,0.00037718285,0.00016773857,0.00043944773],"domain_scores_gemma":[0.9983278,0.0009519589,0.00005598151,0.00043450147,0.000064809974,0.00016497252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021068123,0.00012777622,0.00027450974,0.00015707393,0.00017503308,0.00002658665,0.0002086885,0.0001308461,0.00002362907],"category_scores_gemma":[0.0012461467,0.00012519919,0.00005482583,0.0000943104,0.0002902517,0.00009904239,0.0002170173,0.0004938404,2.0808372e-7],"study_design_candidate":"design_other","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.00032491432,0.00072612194,0.3365358,0.00038707553,0.00010258309,0.00071147934,0.002968473,0.00004309379,0.0014031391,0.019748393,0.00080714235,0.6362418],"study_design_scores_gemma":[0.018135313,0.0026343449,0.11830691,0.0009933013,0.00007731914,0.003779805,0.013843527,0.17471433,0.011983194,0.11277822,0.5363458,0.0064079794],"about_ca_topic_score_codex":0.00006660936,"about_ca_topic_score_gemma":0.00046327498,"teacher_disagreement_score":0.6298338,"about_ca_system_score_codex":0.00013587378,"about_ca_system_score_gemma":0.00014971993,"threshold_uncertainty_score":0.51054746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93451905,0.00013217053,0.017290685,0.0008016559,0.00039714182,0.005732947,0.000504924,0.0002527416,0.040368665],"genre_scores_gemma":[0.8315213,0.00022898307,0.16403778,0.00012071157,0.00034475603,0.0012050378,0.00016319953,0.00022532458,0.002152947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945145,0.0009184752,0.00092341175,0.0016154328,0.00067084335,0.001357304],"domain_scores_gemma":[0.9954133,0.00060385844,0.00032138368,0.0023218382,0.00049197813,0.00084765896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004534508,0.00064713054,0.0010478381,0.0007532311,0.00024077496,0.00015108548,0.0010572374,0.00071135745,0.000037421276],"category_scores_gemma":[0.00021110082,0.00062222703,0.00016935688,0.000252905,0.00024698276,0.000251828,0.0013682336,0.0020557356,9.86215e-7],"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.0039268564,0.0023077799,0.0015308692,0.0010165314,0.00096549845,0.00012705312,0.00718539,0.34880474,0.0017184451,0.053599518,0.0008354174,0.5779819],"study_design_scores_gemma":[0.0025198238,0.0008930065,0.00122075,0.00075507624,0.0001248987,0.000053759366,0.002109176,0.94988894,0.00073781377,0.03043154,0.008601934,0.0026632997],"about_ca_topic_score_codex":0.00088723516,"about_ca_topic_score_gemma":0.004160083,"teacher_disagreement_score":0.6010842,"about_ca_system_score_codex":0.0013765541,"about_ca_system_score_gemma":0.0007573129,"threshold_uncertainty_score":0.9996229},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284221,0.0032239682,0.05957021,0.0052040317,0.0035819479,0.037131194,0.006048688,0.001202207,0.2556157],"genre_scores_gemma":[0.16313261,0.011322285,0.8040101,0.00034432302,0.002654535,0.00392981,0.00064981566,0.00066214433,0.013294366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965597,0.0007124965,0.0005721062,0.0009458629,0.0003638992,0.00084593706],"domain_scores_gemma":[0.9942394,0.0032538169,0.000297474,0.0016106345,0.00036664525,0.00023201329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041099656,0.00043761462,0.00076696114,0.00043435532,0.00026960415,0.00014348698,0.0010102672,0.0005296708,0.000050136427],"category_scores_gemma":[0.00078169676,0.00031598416,0.00024703497,0.00018650462,0.00032139925,0.00010498898,0.0005478392,0.0015685252,2.9627208e-7],"study_design_candidate":"design_other","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.0012450678,0.00043188632,0.00014288643,0.00028708315,0.0005594541,0.000026654825,0.0015162565,0.0022189033,0.000083000625,0.0029206534,0.0010727174,0.98949546],"study_design_scores_gemma":[0.0054765665,0.0022425405,0.00058348296,0.000857029,0.00034149154,0.00003324572,0.019886468,0.82177454,0.0011145193,0.004969318,0.14097737,0.0017433955],"about_ca_topic_score_codex":0.0002890986,"about_ca_topic_score_gemma":0.0019321607,"teacher_disagreement_score":0.987752,"about_ca_system_score_codex":0.0011178582,"about_ca_system_score_gemma":0.00055752066,"threshold_uncertainty_score":0.99992925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031719955,0.00032086705,0.9909928,0.00042226238,0.00041768025,0.000117917625,0.0008330229,0.00006774297,0.0036556972],"genre_scores_gemma":[0.006372477,0.00006950983,0.98869675,0.00030322812,0.00022818925,0.000013229438,0.000191101,0.000034123426,0.0040913904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.00017838454,0.00033326296,0.00031006665,0.00036318754,0.00021812897],"domain_scores_gemma":[0.99707186,0.0019120162,0.00011765914,0.00027269445,0.00048707463,0.0001387007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036799657,0.00017059628,0.0002658995,0.00008397135,0.00019740763,0.00007791586,0.000114501505,0.0000721022,0.00010981667],"category_scores_gemma":[0.00223945,0.00017690063,0.000050157614,0.00022768232,0.00009784832,0.000053464253,0.00016735026,0.00015583298,4.627485e-7],"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.000014215009,0.00012308982,0.0004201629,0.00016097381,0.00011512799,0.00012295095,0.00033016136,0.00017688164,0.000035828274,0.86106235,0.09360463,0.043833632],"study_design_scores_gemma":[0.0012862254,0.00008763529,0.002701249,0.00004416983,0.00009496419,0.00019694964,0.00048543894,0.14427343,0.00014396061,0.8362285,0.014016788,0.00044069474],"about_ca_topic_score_codex":0.000026284868,"about_ca_topic_score_gemma":0.000074976,"teacher_disagreement_score":0.14409655,"about_ca_system_score_codex":0.00007428508,"about_ca_system_score_gemma":0.00012845999,"threshold_uncertainty_score":0.7213798},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40717396,0.057056237,0.36581787,0.062693775,0.00067993347,0.0011052156,0.00021832541,0.00070734293,0.104547344],"genre_scores_gemma":[0.3125419,0.01568646,0.56259614,0.00038169656,0.00016339985,0.000058309575,0.000051395426,0.0001085259,0.10841215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9873764,0.009608505,0.00082700484,0.0007550163,0.0004901317,0.00094293134],"domain_scores_gemma":[0.988856,0.0045080236,0.0005127265,0.0017652754,0.0039026067,0.00045532966],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010172019,0.00057173026,0.0006900852,0.00019926114,0.0007460214,0.00046903343,0.0010275352,0.0004416015,0.00015935437],"category_scores_gemma":[0.009293388,0.0006023413,0.0004059248,0.00056549953,0.00059965946,0.00039729621,0.00030474135,0.00058902625,0.0000026080559],"study_design_candidate":"design_other","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.00003317436,0.001266214,0.001795311,0.00047868415,0.00013327051,0.000041967807,0.03030295,0.00001563522,0.0040058,0.0983115,0.008778538,0.85483694],"study_design_scores_gemma":[0.004807865,0.00002220323,0.016816176,0.018085403,0.0008591404,0.00039852824,0.0075657326,0.14814349,0.2972108,0.10022947,0.401827,0.0040341592],"about_ca_topic_score_codex":0.0037054582,"about_ca_topic_score_gemma":0.0065179267,"teacher_disagreement_score":0.8508028,"about_ca_system_score_codex":0.00028867935,"about_ca_system_score_gemma":0.0002859077,"threshold_uncertainty_score":0.9996428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7708494,0.0007699482,0.22218281,0.00047090778,0.00014305724,0.00029018315,8.5052017e-7,0.000022285496,0.00527056],"genre_scores_gemma":[0.9757521,0.000061909435,0.02351196,0.00006177263,0.000048907892,0.000007707538,1.6938998e-7,0.0000117203435,0.0005437258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983885,0.00022686292,0.00049481046,0.00016702696,0.0002997547,0.00042303454],"domain_scores_gemma":[0.99873734,0.00030061553,0.00030818136,0.00030549782,0.0002829404,0.000065414104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032467204,0.00014569795,0.0003737951,0.00012304478,0.00006280801,0.000026486357,0.00024976968,0.00007390162,0.000015635882],"category_scores_gemma":[0.0005846081,0.00010118176,0.00017017046,0.0002728729,0.000058923633,0.00010539812,0.000049376824,0.00067196134,2.4833515e-8],"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.001050125,0.0007017169,0.009585611,0.0005672293,0.00071575894,0.00003106542,0.0005997574,0.000103104896,0.0027252892,0.9610787,0.0009402236,0.021901391],"study_design_scores_gemma":[0.0015284428,0.00072940806,0.0007145847,0.00020520885,0.00015879923,0.00013889742,0.00017135257,0.000045458266,0.0039591216,0.9881853,0.003988395,0.00017506442],"about_ca_topic_score_codex":0.000008856513,"about_ca_topic_score_gemma":0.0002221295,"teacher_disagreement_score":0.20490272,"about_ca_system_score_codex":0.00046577037,"about_ca_system_score_gemma":0.0007812294,"threshold_uncertainty_score":0.41260722},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012201536,0.000107767,0.009265081,0.000013095073,0.00041290518,0.00058811426,0.00034020643,0.00027412665,0.9888767],"genre_scores_gemma":[0.000072915245,0.000107811116,0.017087592,0.000070733266,0.00044763472,0.0000013200862,0.00003110338,0.00013694105,0.9820439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802154,0.000104879284,0.00031550837,0.0007175924,0.0004133556,0.0004271003],"domain_scores_gemma":[0.9975292,0.00027663485,0.00037094476,0.0012039797,0.00033792836,0.00028130473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003821809,0.00059232785,0.0007592828,0.00022899134,0.00019917583,0.000050260933,0.00076877215,0.0007153859,0.000031948774],"category_scores_gemma":[0.000040701252,0.00066338794,0.0004659263,0.000008292097,0.00032342062,0.000104579594,0.0007101608,0.00055743294,0.0000015561546],"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.00008115757,0.000008998942,7.2497286e-8,0.00016755775,0.0001735374,0.00019698037,0.00009359564,8.690837e-8,0.00001327367,0.7417417,0.25500458,0.0025184269],"study_design_scores_gemma":[0.0006247405,0.00007450466,1.3683253e-7,0.00031645581,0.00048298956,0.00002642621,0.000061343606,0.00038633792,0.00018033046,0.0023090134,0.9947583,0.0007793888],"about_ca_topic_score_codex":0.000046646506,"about_ca_topic_score_gemma":0.000005335163,"teacher_disagreement_score":0.7397538,"about_ca_system_score_codex":0.00026162743,"about_ca_system_score_gemma":0.00012607,"threshold_uncertainty_score":0.99958175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94754034,0.00044306027,0.016021214,0.00075682276,0.000074934884,0.0016227376,0.000067247194,0.000086152424,0.03338746],"genre_scores_gemma":[0.9358038,0.00012256099,0.06300714,0.000056919747,0.00021887822,0.000093593975,0.000018752226,0.000036330926,0.00064204185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983911,0.00015106476,0.0006171061,0.0002924814,0.00031577182,0.00023248093],"domain_scores_gemma":[0.99803025,0.00077404245,0.00018922637,0.00067873666,0.0002763414,0.000051403546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045723123,0.00019919673,0.00054405176,0.000054974316,0.000061471845,0.000025530468,0.00023921079,0.000083983075,0.00010737271],"category_scores_gemma":[0.00021598468,0.0001158706,0.00014355448,0.00027727862,0.00022892863,0.0000657632,0.0000709356,0.0001555597,5.3559756e-7],"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.0063688066,0.0009336898,0.00009336657,0.004986472,0.0008577966,0.000006700009,0.0058899843,0.0010784596,0.15217224,0.7516724,0.011610464,0.06432965],"study_design_scores_gemma":[0.0012542082,0.00033662884,0.00006494745,0.00030707335,0.00025827048,0.000005483915,0.00028019445,0.013103253,0.64758575,0.3277331,0.00863813,0.00043295368],"about_ca_topic_score_codex":0.000021125954,"about_ca_topic_score_gemma":0.000032350512,"teacher_disagreement_score":0.4954135,"about_ca_system_score_codex":0.000013305274,"about_ca_system_score_gemma":0.000085187196,"threshold_uncertainty_score":0.47250658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068904325,0.0009540119,0.91066337,0.0006541316,0.008387088,0.0027225758,0.000382244,0.0002545248,0.0070777144],"genre_scores_gemma":[0.83891124,0.00035148987,0.13156582,0.0021431178,0.01282677,0.0024331976,0.0013262999,0.0004898992,0.009952186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984319,0.000095436626,0.00037930888,0.00041645957,0.00032983575,0.0003470101],"domain_scores_gemma":[0.9973104,0.0008809083,0.00032343084,0.0010049812,0.00039308815,0.00008721276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000861663,0.00034076642,0.00045704434,0.0000195529,0.0002564104,0.00022457914,0.0003992606,0.0002766615,0.00002494965],"category_scores_gemma":[0.00023551143,0.00025025933,0.0005533801,0.00010003742,0.00009879091,0.000091284506,0.00051715266,0.0006705341,2.4512659e-7],"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.0005432907,0.0007301952,0.00013163578,0.008463958,0.0029188856,0.000020860902,0.008171291,0.0010766396,0.004008547,0.59314877,0.050793923,0.329992],"study_design_scores_gemma":[0.00395372,0.0007154553,0.00022987026,0.0021430072,0.005008916,0.000038959042,0.008297799,0.061365277,0.048431627,0.6577796,0.20821272,0.0038230554],"about_ca_topic_score_codex":0.00001575282,"about_ca_topic_score_gemma":0.000017006096,"teacher_disagreement_score":0.77909756,"about_ca_system_score_codex":0.00006218646,"about_ca_system_score_gemma":0.00029408198,"threshold_uncertainty_score":0.999995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08838481,0.00016020615,0.9100862,0.000011541244,0.00027652763,0.00015709747,0.00071314396,0.000028248407,0.00018220201],"genre_scores_gemma":[0.32781774,0.000007431314,0.67199343,0.000028241047,0.00008033214,0.000001691277,0.000021450443,0.00002688562,0.000022791768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982586,0.00027388087,0.0005143116,0.0002540713,0.00033852528,0.0003606421],"domain_scores_gemma":[0.99730664,0.001977079,0.00030356177,0.00020158004,0.000115572875,0.000095581294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015597125,0.00017265524,0.00045425756,0.000114297094,0.0005427164,0.000041951345,0.00014212122,0.000036905698,0.00004486451],"category_scores_gemma":[0.0007278127,0.00017869251,0.00007242003,0.00019853725,0.000058049594,0.000023578303,0.00042497352,0.00023043774,7.916793e-9],"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.00027186386,0.0006977967,0.002920815,0.0013285076,0.0006168757,0.00013838746,0.01268338,0.043698665,0.0012629594,0.76682264,0.0016101233,0.167948],"study_design_scores_gemma":[0.0012371485,0.00009006959,0.000014015431,0.000031469594,0.00010439489,0.000022195552,0.0024557495,0.98303354,0.00016671396,0.011978071,0.0006569383,0.00020968549],"about_ca_topic_score_codex":0.00016460988,"about_ca_topic_score_gemma":0.0000065634767,"teacher_disagreement_score":0.93933487,"about_ca_system_score_codex":0.000062222076,"about_ca_system_score_gemma":0.0000551093,"threshold_uncertainty_score":0.7286869},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97408,0.000035420675,0.00004051667,0.00047781016,0.00042850393,0.00037347883,0.0000062094987,0.000030555624,0.024527455],"genre_scores_gemma":[0.9875794,0.000004034628,0.008823629,0.00010417998,0.00004127196,0.000022552262,9.036395e-7,0.00001707436,0.0034069757],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974387,0.00054138066,0.00042955484,0.00051597616,0.00054613996,0.00052824075],"domain_scores_gemma":[0.9949585,0.0034860875,0.00034274225,0.00062024547,0.00039003792,0.00020234265],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027492656,0.00020533979,0.00035832086,0.00007969393,0.000374471,0.000042011277,0.0007453551,0.0001022454,0.00011624483],"category_scores_gemma":[0.005079501,0.00013566205,0.00010223524,0.0008844438,0.0052469457,0.00019291173,0.00039992935,0.00024232977,0.0000051338975],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006148784,0.00019795848,0.10722087,0.00006309692,0.00006143571,0.00012853305,0.0012769188,0.0000143915395,0.7383255,0.15186605,0.00042130915,0.00036250422],"study_design_scores_gemma":[0.00077181123,0.0007371323,0.026726771,0.00018124338,0.000053656426,0.0018394657,0.0051324978,0.0016252773,0.62230265,0.33955327,0.0004773378,0.00059887645],"about_ca_topic_score_codex":0.00011940185,"about_ca_topic_score_gemma":0.000012348112,"teacher_disagreement_score":0.18768723,"about_ca_system_score_codex":0.00008231913,"about_ca_system_score_gemma":0.00035060002,"threshold_uncertainty_score":0.9974602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11920796,0.00034667525,0.8762535,0.00017402263,0.00092726503,0.00024034108,0.0026473207,0.0000246305,0.00017828545],"genre_scores_gemma":[0.27464297,0.000020743459,0.7240911,0.00008592851,0.000488412,0.000006512056,0.00008163332,0.00004402419,0.00053863204],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790704,0.0002559815,0.00080883503,0.00022170799,0.0004330983,0.00037331146],"domain_scores_gemma":[0.9953518,0.0016224857,0.0006707659,0.00026675404,0.0017712152,0.00031699095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012729358,0.00022182787,0.0005070158,0.000068980014,0.00021447215,0.000088021676,0.00018068631,0.00010193616,0.000020717425],"category_scores_gemma":[0.0042427685,0.00020241002,0.00014730284,0.00022255426,0.000063045714,0.0001479844,0.0000398047,0.0002840309,6.2491644e-8],"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.0023741426,0.0028742827,0.023935435,0.0029922163,0.0011860824,0.005024555,0.003055219,0.0024305203,0.056203775,0.17140685,0.33895928,0.38955766],"study_design_scores_gemma":[0.029907059,0.013860978,0.016501598,0.0072027165,0.004276851,0.0149749,0.010131819,0.27291018,0.047780424,0.5329232,0.043698832,0.0058314106],"about_ca_topic_score_codex":0.00000776063,"about_ca_topic_score_gemma":0.000025824014,"teacher_disagreement_score":0.38372624,"about_ca_system_score_codex":0.0001626435,"about_ca_system_score_gemma":0.00027205312,"threshold_uncertainty_score":0.8254041},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76791203,0.00013747957,0.22638991,0.000043795404,0.0008095737,0.0010835527,0.00007524223,0.000076926706,0.003471494],"genre_scores_gemma":[0.98895484,0.0001132521,0.0046833134,0.0000146052935,0.00015717991,0.0000068894215,0.0000137368825,0.000047438698,0.0060087196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850994,0.0001457672,0.0003476654,0.0006174191,0.000088401495,0.00029079764],"domain_scores_gemma":[0.99744445,0.00017476699,0.00072019827,0.0011940744,0.0003622529,0.00010424018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007822529,0.00033530817,0.0006645974,0.00023441648,0.00022769734,0.00006398101,0.0006596129,0.0004556629,0.000017463572],"category_scores_gemma":[0.0003367909,0.00033792076,0.0005677343,0.00007694196,0.00023152801,0.00016140903,0.00040767432,0.00028711717,1.7628165e-7],"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.008087925,0.0036648365,0.008943779,0.027502624,0.0054714116,0.00030661825,0.008370084,0.015578445,0.11238033,0.7817779,0.015852239,0.012063767],"study_design_scores_gemma":[0.0062004793,0.00096381776,0.0006518277,0.0032280893,0.0033673265,0.000014467584,0.0013731724,0.112233765,0.04177352,0.8178753,0.008640327,0.0036778988],"about_ca_topic_score_codex":0.00016887329,"about_ca_topic_score_gemma":0.00013055616,"teacher_disagreement_score":0.2217066,"about_ca_system_score_codex":0.00011680538,"about_ca_system_score_gemma":0.00017729882,"threshold_uncertainty_score":0.99990726},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09429985,0.000118864504,0.22852372,0.00090001343,0.00036249688,0.00022131133,0.000003891837,0.0002819803,0.67528784],"genre_scores_gemma":[0.030979794,0.0000540838,0.9228393,0.00067898,0.000105122104,0.000025248657,0.0000022006407,0.000028937373,0.045286354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992138,0.000104185376,0.0001755892,0.00019652164,0.00013774948,0.00017211208],"domain_scores_gemma":[0.99915355,0.00039836622,0.00003334021,0.0002871047,0.000057634366,0.00006997299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033534007,0.00010785437,0.00021051051,0.000024816061,0.000048986873,0.000029707517,0.000074075644,0.000057870304,0.00041114137],"category_scores_gemma":[0.00054572924,0.000085253756,0.00010850261,0.00007552432,0.000010772476,0.00002538626,0.000060021724,0.00009801289,8.4514903e-7],"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.00013901874,0.00051931106,0.00013989465,0.00022315615,0.00014778352,0.00045439784,0.0010431686,0.0003009656,0.01580869,0.9179479,0.038762163,0.02451355],"study_design_scores_gemma":[0.019370614,0.0007369196,0.0002615512,0.00088831416,0.00033605326,0.00032378355,0.010491088,0.041691598,0.3641708,0.15391213,0.4038713,0.0039458517],"about_ca_topic_score_codex":0.000003908679,"about_ca_topic_score_gemma":0.000011063004,"teacher_disagreement_score":0.76403576,"about_ca_system_score_codex":0.000020796555,"about_ca_system_score_gemma":0.000028875786,"threshold_uncertainty_score":0.45017096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9574653,0.00021069283,0.0076209027,0.0016868068,0.00017852715,0.00020808254,0.000013692252,0.000050815615,0.032565206],"genre_scores_gemma":[0.9950996,0.000116662355,0.00029896037,0.00022840811,0.000053798496,0.000019674933,0.0000017883484,0.000022420621,0.0041587097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977325,0.0013764831,0.00023356963,0.00025257745,0.00021092645,0.0001939393],"domain_scores_gemma":[0.9928843,0.0062885378,0.00018025118,0.0004404575,0.00015432846,0.000052153362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020221607,0.0001741058,0.0002998108,0.00003460348,0.00016861974,0.00004612802,0.00031596964,0.00008299633,0.00016350695],"category_scores_gemma":[0.0047758967,0.00009722161,0.0000834925,0.00011919341,0.00026492562,0.00003113018,0.00015669389,0.00053715083,8.369356e-7],"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.00005867048,0.000026598667,0.0016557388,0.000084524545,0.000063407184,0.000008183723,0.0034778055,0.0000054532634,0.0009866132,0.9852289,0.0004054202,0.007998696],"study_design_scores_gemma":[0.0018845786,0.0012668383,0.006460828,0.003116296,0.0005088099,0.00003645274,0.047032636,0.004169766,0.06220546,0.8616377,0.010250692,0.0014299242],"about_ca_topic_score_codex":0.000015346388,"about_ca_topic_score_gemma":0.0000106265825,"teacher_disagreement_score":0.12359117,"about_ca_system_score_codex":0.00001311834,"about_ca_system_score_gemma":0.00006512149,"threshold_uncertainty_score":0.5717539},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021154879,0.00033394882,0.024692627,0.00007872939,0.0029470853,0.0011150688,0.000093207935,0.00021411631,0.97031367],"genre_scores_gemma":[0.08793191,0.00014037597,0.012758903,0.00041131364,0.0010117278,0.00011178801,0.00009494747,0.00038421922,0.8971548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997163,0.00011727816,0.0009262277,0.00084641867,0.0005215329,0.00042555452],"domain_scores_gemma":[0.9974474,0.0005514403,0.0005264999,0.0010293961,0.00021973427,0.000225567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007773995,0.00077954493,0.0011550905,0.00025108657,0.000077572666,0.00004502295,0.0004534021,0.00037677487,0.000036715035],"category_scores_gemma":[0.00011641186,0.00079277786,0.0004129136,0.00010300195,0.000102535414,0.00026673003,0.00026498118,0.0010015849,0.000008441511],"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.00020801499,0.00016944234,0.0000086911205,0.00023845833,0.00014275842,0.0001232173,0.0021122335,0.000020038002,0.00002863291,0.6666579,0.25693256,0.07335802],"study_design_scores_gemma":[0.0005470457,0.00023431922,0.0000030341976,0.0010891088,0.00006626747,0.000009459644,0.0000385399,0.0013005055,0.00021439315,0.940375,0.055109885,0.0010124897],"about_ca_topic_score_codex":0.00010871989,"about_ca_topic_score_gemma":0.00008116955,"teacher_disagreement_score":0.27371702,"about_ca_system_score_codex":0.00016909404,"about_ca_system_score_gemma":0.0002475589,"threshold_uncertainty_score":0.9994523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818391,0.0002918291,0.014564609,0.00007892854,0.00031606917,0.0004412226,0.00010032531,0.00006652398,0.0023013726],"genre_scores_gemma":[0.99419,0.0011772872,0.0033514053,0.000029300942,0.000038848397,0.0000016310084,0.0000053351005,0.000025817471,0.0011803813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983243,0.00026778333,0.00033087944,0.0007334104,0.00009569607,0.00024795104],"domain_scores_gemma":[0.99854213,0.00023868114,0.00033238862,0.00061729713,0.00010996872,0.00015955431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039362966,0.0002983269,0.00065032206,0.00017047305,0.000038701142,0.0000127380645,0.0004956842,0.00027725525,0.00003599182],"category_scores_gemma":[0.0003530554,0.00033582927,0.0001672771,0.0003386744,0.00014219107,0.00007497787,0.0010986114,0.00048798035,3.5730156e-7],"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.0015280882,0.0009553481,0.393746,0.012390266,0.0011220957,0.0036193707,0.017241916,0.025298588,0.0034049528,0.5301012,0.007430031,0.0031621906],"study_design_scores_gemma":[0.006400266,0.00066859944,0.026514579,0.0037696357,0.0014511367,0.000021366992,0.0073037334,0.66781443,0.0040948275,0.27452186,0.0030712725,0.004368326],"about_ca_topic_score_codex":0.00078556675,"about_ca_topic_score_gemma":0.00058934634,"teacher_disagreement_score":0.64251584,"about_ca_system_score_codex":0.00008723257,"about_ca_system_score_gemma":0.000091660804,"threshold_uncertainty_score":0.9999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34801438,0.00003248684,0.65034443,0.00018799148,0.000082177445,0.00072438223,0.000015881596,0.000030263825,0.0005679788],"genre_scores_gemma":[0.97674686,0.000103799655,0.01759123,0.00012866952,0.000030615236,0.0000051015404,0.0000059229405,0.000020428499,0.005367358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992095,0.00003652379,0.00012847643,0.0003700896,0.000048388873,0.00020702771],"domain_scores_gemma":[0.99805295,0.0013318051,0.00008329271,0.0003425254,0.00008896546,0.0001004312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033850785,0.00013050436,0.00019552319,0.00007026055,0.00019547227,0.000017651677,0.00018081063,0.000085284024,0.0000040259492],"category_scores_gemma":[0.0001368705,0.00010840973,0.00016980055,0.00014978205,0.00004897208,0.00017861844,0.00009802416,0.0000845048,8.2824776e-8],"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.00027259893,0.000038110124,0.00034007127,0.00007978951,0.00006864245,0.0000015524446,0.00066612824,0.028549414,0.00015136621,0.96649563,0.0027514284,0.0005852732],"study_design_scores_gemma":[0.00087731535,0.000058218957,0.000013002477,0.000011729128,0.000094071846,0.0000011294724,0.00026654673,0.63659227,0.00004314255,0.36168882,0.0002607134,0.00009300219],"about_ca_topic_score_codex":0.00004497884,"about_ca_topic_score_gemma":0.00006045745,"teacher_disagreement_score":0.6327532,"about_ca_system_score_codex":0.000030492442,"about_ca_system_score_gemma":0.000035577854,"threshold_uncertainty_score":0.44208205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94167787,0.0005377775,0.055168707,0.00003906738,0.00020911038,0.0004045521,0.00002430503,0.000037091828,0.0019015265],"genre_scores_gemma":[0.9918517,0.00093473546,0.005408688,0.000026947955,0.000048321486,0.0000023616303,0.000013188762,0.0000263598,0.0016877338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984533,0.00030392714,0.00031062105,0.0005958411,0.000086092965,0.0002501986],"domain_scores_gemma":[0.99770856,0.00063035137,0.00042894113,0.0009402578,0.00018706491,0.000104812134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007402311,0.00027618674,0.0006941025,0.000089950634,0.00011883131,0.000048862756,0.00038190625,0.00019700745,0.000040047584],"category_scores_gemma":[0.00030728584,0.00022570594,0.00031123316,0.00019478775,0.00027398413,0.00005402487,0.0008818494,0.0004116004,3.3533258e-8],"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.0007807088,0.00047955188,0.037858564,0.0038117943,0.001186215,0.0002862908,0.0057971748,0.0064945524,0.00073305116,0.9415472,0.0003487746,0.00067613134],"study_design_scores_gemma":[0.015975287,0.00023554168,0.01049767,0.0034172577,0.0049032653,0.000064723965,0.018814033,0.3550027,0.0033067,0.5826491,0.001659709,0.00347397],"about_ca_topic_score_codex":0.00013629318,"about_ca_topic_score_gemma":0.0001572703,"teacher_disagreement_score":0.35889804,"about_ca_system_score_codex":0.00006536802,"about_ca_system_score_gemma":0.00007675649,"threshold_uncertainty_score":0.9204021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.290444,0.000073492505,0.69640374,0.00043604136,0.00032845512,0.0003236568,0.000016258786,0.00019689112,0.011777439],"genre_scores_gemma":[0.7563753,0.000016881493,0.23882352,0.00017170068,0.0003004655,0.000046956797,0.000079201316,0.00008131822,0.004104616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982213,0.0002367318,0.00035316564,0.0004383026,0.00037197114,0.00037856973],"domain_scores_gemma":[0.998738,0.00026313626,0.00016493138,0.000496063,0.00018833799,0.00014953592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028812213,0.00027041484,0.00041838994,0.0000735707,0.00015020704,0.0001253656,0.0001766569,0.0001175367,0.00016537395],"category_scores_gemma":[0.0001972244,0.00021826594,0.0001290617,0.00022437067,0.000059351078,0.000104349514,0.00013814027,0.000224236,8.0116496e-7],"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.0013365756,0.0057725487,0.008387441,0.00671808,0.002205901,0.0027397051,0.030458676,0.00045460637,0.06501525,0.44367564,0.06340132,0.36983424],"study_design_scores_gemma":[0.030954406,0.002341999,0.008162388,0.0030796684,0.0027169269,0.0015630766,0.008176517,0.309735,0.19566776,0.33139497,0.097054884,0.009152408],"about_ca_topic_score_codex":0.000013409652,"about_ca_topic_score_gemma":0.000050154245,"teacher_disagreement_score":0.46593136,"about_ca_system_score_codex":0.000059598,"about_ca_system_score_gemma":0.000085906766,"threshold_uncertainty_score":0.89006263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82544476,0.00001267255,0.1719676,0.000020988655,0.00017913814,0.0006996495,0.0000054858724,0.000028956249,0.001640756],"genre_scores_gemma":[0.95088404,0.0000107811675,0.048502687,0.00003263258,0.000027640455,0.000004411778,0.0000026624261,0.000021189098,0.00051394827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988174,0.00025470956,0.00031621318,0.00030374716,0.00006164036,0.0002462846],"domain_scores_gemma":[0.99710655,0.0021082603,0.00029718442,0.00036747693,0.00007882938,0.000041712337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021977993,0.0001542257,0.0004988329,0.00007683768,0.00007531959,0.000017284274,0.00024951456,0.000075241536,0.000058900787],"category_scores_gemma":[0.0005080756,0.00012223319,0.0003200708,0.0003032871,0.00009421998,0.00012887879,0.00007574142,0.00015086132,5.593303e-7],"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.008038568,0.00009512571,0.042182226,0.0005013746,0.0001687002,0.00001474772,0.0016767496,0.006776066,0.002171002,0.9380497,0.000059135466,0.0002666027],"study_design_scores_gemma":[0.06331388,0.000037177964,0.00008109314,0.00026166553,0.0002607406,0.0000096372005,0.00087917695,0.58361256,0.0012927281,0.34975052,0.000081939485,0.00041888322],"about_ca_topic_score_codex":0.00008263908,"about_ca_topic_score_gemma":0.000049935283,"teacher_disagreement_score":0.5882992,"about_ca_system_score_codex":0.00004327737,"about_ca_system_score_gemma":0.000034484892,"threshold_uncertainty_score":0.4984525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13136588,0.003637556,0.8617617,0.00030217928,0.0004645357,0.00033313435,0.0000037617885,0.000020686559,0.0021105665],"genre_scores_gemma":[0.4560613,0.0007330182,0.54205495,0.00004171367,0.0000493307,0.000014281579,1.544317e-7,0.000029356568,0.0010158704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921763,0.0046880622,0.0009931063,0.0002463715,0.00043029903,0.0014658953],"domain_scores_gemma":[0.99433345,0.0038848782,0.00076473755,0.0005507807,0.00036229848,0.00010387024],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.029222919,0.00025363528,0.00088082737,0.0001602956,0.000142004,0.000019457995,0.00065912283,0.0001310786,0.000026321224],"category_scores_gemma":[0.0075876713,0.00016880472,0.00032080637,0.00043069938,0.00013031345,0.00007304712,0.00009442634,0.0013739903,8.008732e-8],"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.00019451641,0.00015709641,0.0037567767,0.00014153696,0.0006611799,0.000002073114,0.0031136298,0.0002670804,0.028954301,0.864734,0.00076385326,0.09725396],"study_design_scores_gemma":[0.0012028262,0.0015191284,0.00031220994,0.0001599012,0.00048703328,0.0003235562,0.05324317,0.0015215524,0.20956331,0.723986,0.0070117796,0.0006694903],"about_ca_topic_score_codex":0.000053810825,"about_ca_topic_score_gemma":0.0002696818,"teacher_disagreement_score":0.32469544,"about_ca_system_score_codex":0.00027031734,"about_ca_system_score_gemma":0.0009201773,"threshold_uncertainty_score":0.9996193},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5395544,0.007145955,0.44819668,0.00081986573,0.00031639874,0.0004747509,0.000033621047,0.00003163106,0.0034266803],"genre_scores_gemma":[0.03693027,0.0005039734,0.96100426,0.00019445228,0.00029223564,0.0000070027804,6.300287e-7,0.000063496125,0.0010036841],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863315,0.000054868036,0.00070408103,0.00015212792,0.00023538392,0.00022037083],"domain_scores_gemma":[0.99594665,0.002580473,0.0006210519,0.00016671319,0.0005602314,0.00012488342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014963254,0.00018966492,0.00055438816,0.00008979902,0.00011137577,0.00008904872,0.0001057534,0.00009921486,0.000021981667],"category_scores_gemma":[0.0037650238,0.00014722874,0.00011337189,0.00011460381,0.000063573934,0.00010959162,0.000062810126,0.00016505235,4.6018762e-8],"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.0006762802,0.005614341,0.015080983,0.1741654,0.007853891,0.00086993683,0.26407802,0.00023190696,0.07658966,0.16157584,0.07350683,0.21975692],"study_design_scores_gemma":[0.011415161,0.001243799,0.000086544474,0.011177346,0.0031464286,0.0069403015,0.05187615,0.024429165,0.10559126,0.63883233,0.14260273,0.002658822],"about_ca_topic_score_codex":0.0000011479614,"about_ca_topic_score_gemma":0.0000067353267,"teacher_disagreement_score":0.51280755,"about_ca_system_score_codex":0.000019035273,"about_ca_system_score_gemma":0.00012412632,"threshold_uncertainty_score":0.6003814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5767394,0.00063116866,0.27797407,0.002106534,0.0005382839,0.0008804211,0.00015015934,0.0007464653,0.14023355],"genre_scores_gemma":[0.82994926,0.00012532335,0.16370663,0.00075350446,0.0015313533,0.000011514296,0.0000047691037,0.00011672121,0.0038009454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987239,0.000046297377,0.0002131551,0.00046723176,0.0002127212,0.00033669116],"domain_scores_gemma":[0.9988748,0.00019372377,0.000088617686,0.00044875304,0.000060250295,0.00033386683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012718803,0.00030378104,0.0004044903,0.000028834334,0.00017541321,0.00010827455,0.00015820371,0.00009114418,0.00000532426],"category_scores_gemma":[0.000036812697,0.00028411215,0.00008528592,0.00018800609,0.000056610115,0.00016242372,0.00020504982,0.0001495496,9.2483464e-7],"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.000014745139,0.00017790135,0.000021629794,0.000036706053,0.000038114926,0.0000011569149,0.0010348955,0.00007278415,0.0008600159,0.8337486,0.010148882,0.15384457],"study_design_scores_gemma":[0.0034115834,0.0005631832,0.00061711227,0.00018803174,0.0003850642,0.000030563086,0.0006749656,0.038557526,0.004080394,0.30011103,0.6488265,0.0025540483],"about_ca_topic_score_codex":0.0003033736,"about_ca_topic_score_gemma":0.000033836524,"teacher_disagreement_score":0.6386776,"about_ca_system_score_codex":0.000032674405,"about_ca_system_score_gemma":0.000025201685,"threshold_uncertainty_score":0.9999611},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046729305,0.0003119204,0.008969592,0.000011258908,0.00028393458,0.00031089166,0.000549277,0.00009046293,0.9890054],"genre_scores_gemma":[0.0002497123,0.00024645572,0.00529884,0.00007200533,0.00013542642,3.0822295e-7,0.00005743039,0.000072375464,0.99386746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986537,0.00006158999,0.00021495987,0.00055187324,0.00024644984,0.00027140352],"domain_scores_gemma":[0.9984918,0.00024713718,0.00022407295,0.00064575026,0.00018150861,0.00020968552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014369737,0.0004394083,0.00063773105,0.00013531618,0.00015029739,0.000052023443,0.00026843554,0.0006382579,0.000012732073],"category_scores_gemma":[0.000037617134,0.00048413497,0.00023872027,0.0000072010203,0.00024307417,0.000065181426,0.0005330653,0.0006285139,7.6206284e-8],"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.00006902077,0.000005100672,3.885761e-7,0.00036717474,0.00019976136,0.0005683804,0.000037968162,4.546979e-7,0.000047155703,0.9671241,0.021680905,0.009899596],"study_design_scores_gemma":[0.00056640914,0.00005901619,0.0000011345765,0.00033813395,0.0003967019,0.00010068807,0.00010512319,0.00006378531,0.00066447246,0.00039516683,0.9967181,0.00059127633],"about_ca_topic_score_codex":0.000040266455,"about_ca_topic_score_gemma":0.000015785916,"teacher_disagreement_score":0.97503716,"about_ca_system_score_codex":0.00016480488,"about_ca_system_score_gemma":0.0001218568,"threshold_uncertainty_score":0.99976104},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6904527,0.00021232617,0.30616754,0.00008384595,0.00018133745,0.00028112528,0.0000037385062,0.00002706659,0.0025903352],"genre_scores_gemma":[0.40990797,0.000014372016,0.5899492,0.00004988705,0.000025866013,0.0000127750845,0.0000018796017,0.0000076283873,0.000030407971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641645,0.0020782345,0.0005790148,0.0005447149,0.000110622226,0.00027096728],"domain_scores_gemma":[0.990759,0.008412343,0.00024331338,0.00038063384,0.00014755163,0.00005716012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069242977,0.00017775722,0.00068077515,0.000050375424,0.00008328281,0.000007617621,0.00013018856,0.00019814982,0.00002936278],"category_scores_gemma":[0.003114121,0.00016872774,0.000074219046,0.0002618236,0.00028722876,0.000020634376,0.00023226577,0.00034698308,6.468413e-8],"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.00047232996,0.0009716029,0.07370481,0.0020195744,0.00020906026,0.000052654796,0.008979114,0.00029376236,0.0619274,0.6197797,0.00009081167,0.23149914],"study_design_scores_gemma":[0.0011166511,0.00008255991,0.02124287,0.0000803544,0.000058864483,0.000045091205,0.0014804249,0.0050179237,0.19464499,0.7756271,0.00022226595,0.00038094452],"about_ca_topic_score_codex":0.00002992414,"about_ca_topic_score_gemma":0.000037283167,"teacher_disagreement_score":0.28378168,"about_ca_system_score_codex":0.00003256844,"about_ca_system_score_gemma":0.00008062779,"threshold_uncertainty_score":0.68805176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12110881,0.00015957865,0.8778208,0.00008662858,0.000042706615,0.00014710863,0.00020723174,0.00002056233,0.0004066123],"genre_scores_gemma":[0.35531098,0.000031455915,0.6444793,0.000022012586,0.00002862473,0.0000020163743,0.00005108935,0.000009734806,0.00006482097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991606,0.00010457514,0.00024521005,0.00019392482,0.00014524428,0.00015043527],"domain_scores_gemma":[0.999162,0.00018557227,0.00013125093,0.000117026444,0.00034010698,0.00006402773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002744633,0.00010904131,0.00022778616,0.000017353548,0.00010794135,0.000051029998,0.000039661918,0.00003739078,0.000003285793],"category_scores_gemma":[0.00027066213,0.00008951011,0.000013127819,0.0001238152,0.00008815793,0.000021638964,0.000083104336,0.00006124151,7.718555e-9],"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.000038444767,0.00009847639,0.0039022283,0.0006532874,0.00007171096,0.000056856177,0.00043521405,0.00005379466,0.0016778915,0.9656775,0.00087758136,0.026456997],"study_design_scores_gemma":[0.0047767526,0.0010664508,0.008328007,0.001354409,0.00050258683,0.0004385855,0.0016886891,0.78369945,0.0063320915,0.18929239,0.001361707,0.0011588851],"about_ca_topic_score_codex":0.000012295599,"about_ca_topic_score_gemma":0.000050809438,"teacher_disagreement_score":0.78364563,"about_ca_system_score_codex":0.000013005405,"about_ca_system_score_gemma":0.00012809555,"threshold_uncertainty_score":0.36501163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6145937,0.0011176586,0.37961358,0.002180215,0.0009013997,0.00013141234,0.0003742562,0.000009467697,0.0010783168],"genre_scores_gemma":[0.5285927,0.0008521523,0.46984005,0.0002339892,0.00017452493,0.0000022990394,0.0000055003807,0.000009972088,0.0002888426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987878,0.0001915026,0.00049404433,0.00013819453,0.0002971184,0.00009131603],"domain_scores_gemma":[0.996572,0.0018297898,0.0002901306,0.00010128731,0.001107578,0.00009918806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013510655,0.00009562046,0.00024012645,0.000049303886,0.000031801967,0.00009322657,0.00011862391,0.0000398939,0.000113558875],"category_scores_gemma":[0.006430569,0.00007937257,0.00004616719,0.000035733872,0.000116889394,0.000079206475,0.00011056128,0.00014756649,3.0966266e-8],"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.00031264778,0.000380852,0.011913038,0.0003806911,0.00043464504,0.00071714714,0.0016048066,0.0000048997836,0.0020797653,0.7241177,0.006485472,0.25156832],"study_design_scores_gemma":[0.0010623062,0.00021717063,0.004399192,0.0004439043,0.00008324723,0.0012032792,0.000405479,0.001328963,0.0020149641,0.98222,0.006405151,0.00021637497],"about_ca_topic_score_codex":0.0000123138825,"about_ca_topic_score_gemma":0.000048487283,"teacher_disagreement_score":0.25810227,"about_ca_system_score_codex":0.000034160734,"about_ca_system_score_gemma":0.000093780945,"threshold_uncertainty_score":0.7698456},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002731721,0.00058277755,0.013024078,0.00038421515,0.00015979949,0.00097474793,0.000021859274,0.0002680775,0.98455715],"genre_scores_gemma":[0.00029618872,0.00034000567,0.08135318,0.0005375923,0.00068113056,0.00016892875,0.000005399264,0.00029992717,0.91631764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968928,0.00009263295,0.0008976059,0.00047830387,0.00078791927,0.00085071725],"domain_scores_gemma":[0.9940058,0.0033427374,0.00084720494,0.0012989815,0.00015043572,0.00035481443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018233758,0.0007192834,0.0011384992,0.000024373237,0.00048705313,0.000117043266,0.00066514686,0.00036168422,0.00017910759],"category_scores_gemma":[0.0002751144,0.0004536538,0.0013417135,0.000028443224,0.0017994718,0.00002942377,0.00036439404,0.0010046256,0.000016070931],"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.0000048717875,0.000026249218,4.685909e-7,0.00030353523,0.00034919792,0.000001735084,0.0012115316,3.085313e-8,0.000022767554,0.89889795,0.022065103,0.07711658],"study_design_scores_gemma":[0.00009896001,0.000056205994,1.3170673e-7,0.0001709336,0.00023436162,0.000016783519,0.000257081,0.000053711545,0.000018457311,0.5352864,0.46339133,0.00041562686],"about_ca_topic_score_codex":0.0000058065316,"about_ca_topic_score_gemma":0.000008033541,"teacher_disagreement_score":0.44132623,"about_ca_system_score_codex":0.00017109382,"about_ca_system_score_gemma":0.00009475513,"threshold_uncertainty_score":0.9997915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99089867,0.003193828,0.003870826,0.00029667816,0.00025819172,0.00047430015,0.000027812377,0.0000151441345,0.0009645372],"genre_scores_gemma":[0.98561376,0.0006199713,0.01358466,0.000003820527,0.00006267208,0.000005261543,0.0000032230253,0.000028896255,0.000077720724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996804,0.00046864402,0.0014990073,0.00033546664,0.00052416726,0.00036872906],"domain_scores_gemma":[0.9964113,0.0009710739,0.0013355,0.0005688548,0.000593223,0.000120011944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044243815,0.00027971034,0.0010086931,0.00035831536,0.000038647268,0.000025439726,0.00034354412,0.00030831672,0.000017814167],"category_scores_gemma":[0.0022486795,0.00021697616,0.00067946647,0.00030287352,0.00027571325,0.0000625739,0.00042203796,0.0018982325,1.0913267e-8],"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.00043168254,0.0009400268,0.019320583,0.009320536,0.0021731057,0.000016364162,0.0060565183,0.000105469175,0.005892529,0.9502441,0.00037282344,0.005126208],"study_design_scores_gemma":[0.00026475117,0.00040847567,0.00085683883,0.0005291754,0.00044420318,0.00005563621,0.00038345013,0.000078931414,0.0055479724,0.99121976,0.000052206142,0.00015857376],"about_ca_topic_score_codex":0.00009837412,"about_ca_topic_score_gemma":0.00017617889,"teacher_disagreement_score":0.04097563,"about_ca_system_score_codex":0.00022312987,"about_ca_system_score_gemma":0.0011920803,"threshold_uncertainty_score":0.8848031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073888175,0.00031390827,0.9212505,0.000024182124,0.0018083819,0.00079209305,0.0015319627,0.000056836503,0.00033393377],"genre_scores_gemma":[0.18715562,0.00007602036,0.8111091,0.00008942074,0.00043308112,0.0000710572,0.0003244493,0.00007868258,0.00066251337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810517,0.00017907287,0.0006077188,0.0005628801,0.00019895198,0.00034618677],"domain_scores_gemma":[0.99564624,0.003125973,0.00051536795,0.00030686267,0.00030488757,0.00010067588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018599204,0.0003232236,0.0006646684,0.0001031575,0.000879613,0.00024166048,0.00016086713,0.000119364115,0.000053070988],"category_scores_gemma":[0.0008191816,0.00035345522,0.000118582844,0.00009017407,0.000081782186,0.000026042464,0.0007165886,0.0005435314,2.3064416e-8],"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.0013631191,0.00058419065,0.0017133212,0.014416238,0.0027674143,0.00011790309,0.021204248,0.14427918,0.00406813,0.7659684,0.01188317,0.031634726],"study_design_scores_gemma":[0.0009844211,0.00007290056,0.000015263511,0.0002361408,0.00028414742,0.0000047635585,0.0008192359,0.942812,0.00004421963,0.053156935,0.0011584348,0.00041151058],"about_ca_topic_score_codex":0.000055597626,"about_ca_topic_score_gemma":0.00001880421,"teacher_disagreement_score":0.79853284,"about_ca_system_score_codex":0.00010928992,"about_ca_system_score_gemma":0.00019224412,"threshold_uncertainty_score":0.99989176},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024956032,0.0027136619,0.7373645,0.0005968006,0.00062495033,0.0007646666,0.000009878922,0.0005539979,0.25487596],"genre_scores_gemma":[0.010797904,0.001443165,0.31773475,0.0009849571,0.0070931544,0.00010846058,0.000019690253,0.0008149591,0.66100293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998594,0.000019447805,0.00039637487,0.00042788778,0.00021980493,0.00034252793],"domain_scores_gemma":[0.99897766,0.00048327853,0.000089721296,0.00030704183,0.00003711229,0.000105208426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039336647,0.0003268784,0.00046566248,0.00027268997,0.000028830567,0.000038082086,0.00017629324,0.00030754122,0.000010802537],"category_scores_gemma":[0.000080962636,0.00028379832,0.000100259334,0.0000626362,0.000020651461,0.000048811624,0.00018184465,0.00051181426,3.436806e-7],"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.000017114728,0.000012778914,0.000023344206,0.00016743739,0.000046161927,0.000051856798,0.00004881632,0.000033425804,0.00008190269,0.87923527,0.0014027536,0.11887916],"study_design_scores_gemma":[0.000788347,0.00016383102,0.00015773783,0.0013790296,0.000047627596,0.00004819903,4.908761e-7,0.04464421,0.00015605858,0.058416385,0.8931131,0.0010850282],"about_ca_topic_score_codex":0.0000024360472,"about_ca_topic_score_gemma":0.0000025315312,"teacher_disagreement_score":0.8917103,"about_ca_system_score_codex":0.00011153511,"about_ca_system_score_gemma":0.000018082947,"threshold_uncertainty_score":0.99996144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950513,0.00004107539,0.019902987,0.00015763652,0.0001610461,0.00038183905,0.000006401204,0.000008298817,0.028827727],"genre_scores_gemma":[0.94141304,0.000012167022,0.058368765,0.00011951461,0.00003955119,0.000006740823,1.5430545e-7,0.0000124569015,0.000027592112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980879,0.00029379744,0.00077919255,0.0001462047,0.000496196,0.00019674031],"domain_scores_gemma":[0.9951238,0.0032678377,0.00076892617,0.00048107674,0.00026284799,0.00009552495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073106415,0.00014840197,0.00046979982,0.00013929368,0.000067367364,0.000013819736,0.00028124783,0.000048807302,0.000120121425],"category_scores_gemma":[0.005519801,0.00008583424,0.000253926,0.00039829113,0.00013537523,0.0000319205,0.00003062712,0.0004004145,1.2348357e-7],"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.00046144,0.00083009724,0.0005263409,0.00027714283,0.00014841877,0.00000557494,0.00034679633,0.00020685272,0.0013654024,0.9829672,0.0067311134,0.006133647],"study_design_scores_gemma":[0.0006719281,0.00026699263,0.00019519172,0.00003621119,0.00007618643,0.0000314774,0.00019164369,0.00002868314,0.047892094,0.9468125,0.0036622898,0.00013479279],"about_ca_topic_score_codex":0.0000022090253,"about_ca_topic_score_gemma":0.0000020802443,"teacher_disagreement_score":0.046526693,"about_ca_system_score_codex":0.000108093634,"about_ca_system_score_gemma":0.0001189602,"threshold_uncertainty_score":0.6608116},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003700945,0.00024963415,0.059319366,0.00005285619,0.0007371949,0.000273618,0.000008887105,0.00017996265,0.9391748],"genre_scores_gemma":[0.000015718588,0.00018417201,0.100857526,0.00034032325,0.0015363765,0.0000074610034,0.000013706425,0.00013158996,0.8969131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986748,0.00002950714,0.0003933142,0.00038810156,0.00023627587,0.00027796158],"domain_scores_gemma":[0.9983076,0.00041035583,0.00020912779,0.0008031916,0.00013802659,0.00013168818],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006410751,0.0003980584,0.00055561913,0.000087016946,0.00005882392,0.000034861114,0.00026008734,0.00063985534,0.010851389],"category_scores_gemma":[0.000098223514,0.0003224187,0.00030233577,0.00001420735,0.000101441416,0.000024904519,0.00018002665,0.00036835662,0.0000054375487],"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.0000143329535,0.000005569851,2.9092655e-7,0.000047979836,0.00007094407,0.000014170757,0.000025829795,7.3661255e-8,6.2903297e-7,0.5602023,0.428858,0.010759869],"study_design_scores_gemma":[0.000121604025,0.00006844499,7.996225e-8,0.00013433628,0.00009271252,0.0000121635585,0.000006657014,0.00032894744,0.0000071708705,0.19185203,0.80700517,0.00037065896],"about_ca_topic_score_codex":0.000002643867,"about_ca_topic_score_gemma":0.00005016629,"teacher_disagreement_score":0.37814718,"about_ca_system_score_codex":0.00005155067,"about_ca_system_score_gemma":0.00003190826,"threshold_uncertainty_score":0.9999228},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32601842,0.00022244817,0.57037497,0.00009415329,0.0003246194,0.0010043413,0.000057635552,0.000106454965,0.10179698],"genre_scores_gemma":[0.7243056,0.000018226501,0.27548218,0.000048945403,0.000033102486,0.00007430355,0.000007146152,0.000009705985,0.00002076508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853146,0.00013646494,0.0005079725,0.0003389611,0.00024591558,0.00023925064],"domain_scores_gemma":[0.99770796,0.0015239548,0.00023575824,0.00039273102,0.000077975055,0.00006159942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017259627,0.00015103209,0.00038573044,0.00005871375,0.000038702434,0.00000493991,0.00021064932,0.00006867528,0.00008804864],"category_scores_gemma":[0.001576439,0.00013782836,0.000068775145,0.00022831565,0.00033298385,0.00008636814,0.00007004705,0.00015058657,2.1415539e-7],"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.000058145943,0.0001254053,0.004360998,0.00041904356,0.0000067791716,1.6345547e-7,0.00016376916,0.00017126564,0.0011349015,0.98005205,0.00006329592,0.013444208],"study_design_scores_gemma":[0.0004928252,0.00004338935,0.0004147935,0.00002406283,0.000010617335,9.1582604e-7,0.00011779419,0.0006296686,0.0070411484,0.9806913,0.010366729,0.00016673433],"about_ca_topic_score_codex":0.000017265666,"about_ca_topic_score_gemma":0.00009261103,"teacher_disagreement_score":0.3982872,"about_ca_system_score_codex":0.00007398584,"about_ca_system_score_gemma":0.000029655701,"threshold_uncertainty_score":0.5620478},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23224962,0.0022311616,0.106522486,0.014657269,0.005695887,0.00090414594,0.000057508594,0.00059442606,0.63708746],"genre_scores_gemma":[0.8103585,0.00011791245,0.11418267,0.00370969,0.0048759524,0.000077720426,0.000013427449,0.00009202606,0.066572055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887514,0.00018406144,0.0002178291,0.00014218682,0.00019973831,0.00038104315],"domain_scores_gemma":[0.9979837,0.0011460073,0.00007081342,0.0006276256,0.000033995504,0.00013788849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823658,0.00015844405,0.00021008552,0.000020512041,0.00010852055,0.000029373776,0.0002700585,0.00009245462,0.00071477174],"category_scores_gemma":[0.00015972396,0.0000880975,0.0001247181,0.000082104634,0.000042042884,0.00016870987,0.00013701095,0.00015757301,0.00000605651],"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.000024872568,0.00029461592,0.0073784087,0.000041093375,0.00015035523,0.0000025530567,0.005101617,5.0038244e-7,0.0053191585,0.5847628,0.38976115,0.0071628504],"study_design_scores_gemma":[0.00060150423,0.000037107697,0.0016621869,0.000036533762,0.00011960388,0.000011747099,0.0014536023,0.00026806002,0.006116245,0.019900054,0.9693252,0.0004681746],"about_ca_topic_score_codex":0.000105803374,"about_ca_topic_score_gemma":0.000052542862,"teacher_disagreement_score":0.57956403,"about_ca_system_score_codex":0.00002575062,"about_ca_system_score_gemma":0.000010973889,"threshold_uncertainty_score":0.7826249},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2333602,0.012477538,0.17193669,0.004347406,0.011445041,0.013695198,0.0003071256,0.0011508863,0.5512799],"genre_scores_gemma":[0.027682105,0.003435267,0.2141838,0.0015940076,0.0014902486,0.00023680537,0.00064597954,0.00028763604,0.7504442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844015,0.00009820401,0.00043621316,0.000398007,0.00027752208,0.00034990063],"domain_scores_gemma":[0.99694544,0.0018230958,0.00026452015,0.0005442956,0.00031958788,0.00010307515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010998341,0.0004002313,0.0005524946,0.00009051628,0.00026816028,0.00009111748,0.00027890134,0.00046492295,0.000045200322],"category_scores_gemma":[0.0014227364,0.00025995995,0.00018957825,0.00013489767,0.000043726548,0.000040028513,0.000030422603,0.00034501698,1.2407801e-7],"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.0009010485,0.00031222263,0.000095650736,0.0025252225,0.00061973464,0.00001056473,0.0029415863,0.0000031756426,0.000535782,0.41002056,0.19892228,0.38311216],"study_design_scores_gemma":[0.008641313,0.0035492554,0.006230009,0.002139457,0.0073083676,0.000098827266,0.028351327,0.038430016,0.0108356355,0.25018632,0.6369168,0.007312671],"about_ca_topic_score_codex":0.00002964957,"about_ca_topic_score_gemma":0.0015010716,"teacher_disagreement_score":0.4379945,"about_ca_system_score_codex":0.000045327353,"about_ca_system_score_gemma":0.00011053828,"threshold_uncertainty_score":0.9999853},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029129325,0.00052405836,0.04017673,0.000056666868,0.00034118167,0.0003169441,0.00006293233,0.000251403,0.9582409],"genre_scores_gemma":[0.0001176946,0.00061321096,0.12491682,0.00008941789,0.00033949333,0.000035041492,0.000003404962,0.0003657681,0.8735191],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901927,0.000055408167,0.00019595181,0.00033361613,0.00015791328,0.00023783273],"domain_scores_gemma":[0.9992046,0.00012548674,0.000085826025,0.00043605847,0.000012459007,0.00013559451],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013133352,0.00029624958,0.0004522019,0.00016177667,0.00004620821,0.000029708259,0.0001144016,0.0003964212,0.0018835077],"category_scores_gemma":[0.000021585663,0.00024057348,0.00011266434,0.00007505503,0.00008449067,0.000020441463,0.00005145946,0.00024071711,0.0000012081407],"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.0000032487162,0.00003949071,0.0000030218878,0.00011390912,0.00009492039,0.000016015952,0.00008677407,4.8457497e-7,0.0000034340824,0.0006979931,0.9134213,0.08551945],"study_design_scores_gemma":[0.00030673709,0.000030467532,0.0000019241825,0.00012070928,0.000092252594,0.00001810664,0.0001599234,0.0013104291,0.00001750489,0.00024799886,0.9973746,0.0003193327],"about_ca_topic_score_codex":0.000617906,"about_ca_topic_score_gemma":0.0009686605,"teacher_disagreement_score":0.085200116,"about_ca_system_score_codex":0.000022187109,"about_ca_system_score_gemma":0.000031290117,"threshold_uncertainty_score":0.9990289},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.464769e-7,0.00018697347,0.23949262,0.00006747853,0.0004685339,0.0002047987,0.000003908473,0.00014653809,0.7594284],"genre_scores_gemma":[0.000056851895,0.00017131263,0.07885818,0.0004916498,0.0009804361,0.000008535399,0.000014792372,0.00013810022,0.9192801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998679,0.000040976174,0.00040811184,0.00036942126,0.00023492266,0.00026760806],"domain_scores_gemma":[0.99809265,0.00065912365,0.00022258921,0.0008011406,0.000088088986,0.00013643174],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007726021,0.0004037559,0.0006490824,0.000085176034,0.00005084253,0.00003239797,0.00025009038,0.00062620564,0.0021164413],"category_scores_gemma":[0.000115494855,0.00032826845,0.0003330733,0.00001120377,0.000054197753,0.000013191469,0.00014548612,0.000453573,0.0000024351466],"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.000009026817,0.0000031354994,3.5820878e-7,0.00006528873,0.000052342868,0.000008418033,0.000007848732,6.213097e-7,5.0909074e-7,0.7683391,0.19258599,0.038927354],"study_design_scores_gemma":[0.00014060308,0.0000457796,1.0208041e-7,0.00013025143,0.00009492318,0.000010610452,0.000002258511,0.0008954973,0.0000035003827,0.1237547,0.874531,0.00039079273],"about_ca_topic_score_codex":0.0000032429348,"about_ca_topic_score_gemma":0.00003687846,"teacher_disagreement_score":0.68194497,"about_ca_system_score_codex":0.000043452827,"about_ca_system_score_gemma":0.000022272496,"threshold_uncertainty_score":0.9999169},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93151176,0.00029933781,0.064018026,0.000050230417,0.00017004379,0.0004560537,0.000009083119,0.00001567784,0.0034697934],"genre_scores_gemma":[0.7003861,0.000028509296,0.29940853,0.000018346069,0.0001174975,0.0000030581891,1.3387685e-7,0.000015596386,0.000022236238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781257,0.00006512965,0.0011338504,0.00023031567,0.00046459064,0.00029353416],"domain_scores_gemma":[0.99695927,0.0011395514,0.0009469415,0.00030636333,0.00044306336,0.00020480389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096956,0.0002104738,0.0007314171,0.00012355608,0.00006741998,0.000014070667,0.00019416073,0.00016435354,0.000008465266],"category_scores_gemma":[0.00057080766,0.00016732643,0.00018168362,0.00018199597,0.00021310995,0.00007603334,0.00009973631,0.0004536721,1.5825087e-8],"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.021110306,0.005701291,0.026938336,0.0063695344,0.0024050346,0.0003402429,0.029702606,0.0033843126,0.042051643,0.30041784,0.0020113417,0.5595675],"study_design_scores_gemma":[0.016607942,0.0044410634,0.02210148,0.0013653494,0.0015802567,0.0005025302,0.01632733,0.06790333,0.10217031,0.7610521,0.0031487027,0.002799612],"about_ca_topic_score_codex":0.000017435312,"about_ca_topic_score_gemma":0.00004185286,"teacher_disagreement_score":0.5567679,"about_ca_system_score_codex":0.00014447274,"about_ca_system_score_gemma":0.000094881645,"threshold_uncertainty_score":0.6823374},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015596024,0.0006501503,0.004268885,0.00022382283,0.0005551931,0.0004279592,0.000034011435,0.00028125345,0.99354315],"genre_scores_gemma":[0.00002744405,0.001898417,0.092778176,0.0002893839,0.00061610143,0.000016066371,0.000021588816,0.00017651143,0.9041763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807465,0.000036205052,0.00053666736,0.0005825728,0.0004112044,0.00035871455],"domain_scores_gemma":[0.99790144,0.0003651263,0.00026235825,0.0011399632,0.0001408057,0.00019032351],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005012343,0.00052920467,0.0007878237,0.00021196244,0.00011122802,0.000023610188,0.00031825496,0.0006248679,0.0022513252],"category_scores_gemma":[0.0001836663,0.00045460626,0.0004500475,0.000027619271,0.00011323018,0.000039547747,0.00017232343,0.0005149368,0.0000057805505],"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.000010240563,0.000017823446,3.6904981e-7,0.00010551446,0.00008255707,0.000077051474,0.000110149354,4.9516103e-8,0.00001672429,0.5525594,0.43426737,0.012752765],"study_design_scores_gemma":[0.00023880145,0.000057090067,2.6268674e-7,0.00016764113,0.00007891704,0.00010445985,0.000016717337,0.00003608199,0.00013731257,0.03739006,0.96119004,0.000582591],"about_ca_topic_score_codex":0.000011071916,"about_ca_topic_score_gemma":0.00003403544,"teacher_disagreement_score":0.5269227,"about_ca_system_score_codex":0.00010487386,"about_ca_system_score_gemma":0.00012066784,"threshold_uncertainty_score":0.99979055},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020227576,0.000060862687,0.03337209,0.00002252003,0.00064245303,0.00023696158,0.0000063465186,0.00020222279,0.9654545],"genre_scores_gemma":[0.0000026451473,0.00002169419,0.11356433,0.000070300295,0.00020880341,0.000007693134,0.000007262931,0.00028303583,0.8858342],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995519,0.000033791188,0.00008630333,0.00014173608,0.00010286919,0.00008338066],"domain_scores_gemma":[0.9995014,0.000073745876,0.00008421455,0.0003062228,0.0000112655725,0.000023146084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012647717,0.00010586912,0.00017789553,0.00007693325,0.000005016482,0.000008113964,0.00006816441,0.0001561395,0.002532594],"category_scores_gemma":[0.000069082096,0.00008135588,0.000054473454,0.0000363745,0.000007256459,0.000006517251,0.000021795542,0.0000595192,0.000007191798],"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":[6.6740324e-7,0.0000074945006,0.0000033109197,0.000102932485,0.000014883667,7.0217834e-7,0.00001930778,4.5470547e-9,0.0000060305933,0.14114462,0.8559156,0.0027844573],"study_design_scores_gemma":[0.000119311015,0.000009112588,1.6624212e-7,0.000049054932,0.000018085802,7.3302874e-7,0.00003787301,0.000009329365,0.000032894768,0.0015616756,0.9980536,0.00010815237],"about_ca_topic_score_codex":0.00003950962,"about_ca_topic_score_gemma":0.000060380076,"teacher_disagreement_score":0.14213802,"about_ca_system_score_codex":0.000011861052,"about_ca_system_score_gemma":0.000014541829,"threshold_uncertainty_score":0.99837923},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051710464,0.000057278354,0.0011625176,0.000040373958,0.0004380931,0.0003321509,0.0014358163,0.00021642011,0.99626565],"genre_scores_gemma":[0.00014652598,0.00008367497,0.0022076683,0.000049564504,0.00032011798,7.789272e-7,0.000028036075,0.0000898843,0.99707377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825656,0.000082895924,0.00032579998,0.0006321908,0.00034294932,0.00035962864],"domain_scores_gemma":[0.9978593,0.00042229236,0.00039611242,0.0009290303,0.00015407465,0.00023918494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003413892,0.0004777725,0.0005803091,0.00017302073,0.00016617795,0.0000335808,0.00051730376,0.0005001817,0.000007747811],"category_scores_gemma":[0.00007149607,0.00045155475,0.0003911903,0.000004662367,0.00024266016,0.000061331666,0.0005084247,0.0004022999,0.0000016131994],"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.00024267884,0.000009033306,1.6840838e-7,0.00009390557,0.00014551001,0.0002856961,0.000037664053,1.3485594e-8,0.00006868609,0.8604284,0.13426358,0.004424656],"study_design_scores_gemma":[0.0013601688,0.000067679175,4.3308287e-7,0.00038386884,0.00022094524,0.000020658215,0.000026817488,0.0000043879663,0.0002772119,0.00018453787,0.9969117,0.0005415677],"about_ca_topic_score_codex":0.000020821144,"about_ca_topic_score_gemma":0.00000318069,"teacher_disagreement_score":0.8626481,"about_ca_system_score_codex":0.00033553288,"about_ca_system_score_gemma":0.00010334389,"threshold_uncertainty_score":0.99979365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01739248,0.00010028935,0.9649489,0.000652248,0.0012303824,0.00005984708,0.000117286276,0.000006088737,0.015492499],"genre_scores_gemma":[0.5180045,0.000009862613,0.47999558,0.00021784165,0.00054285745,7.474037e-7,0.0000027034544,0.000033901182,0.001192012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989417,0.00013282594,0.0004458112,0.00007257801,0.00014802569,0.0002590581],"domain_scores_gemma":[0.998002,0.00054527045,0.00029232286,0.00017103586,0.00030969156,0.0006796981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010623654,0.000109751396,0.00027259855,0.00021210866,0.000121061494,0.000049049966,0.00022651524,0.000058202215,0.00012430204],"category_scores_gemma":[0.0015697207,0.00009441447,0.00007585777,0.00007976983,0.00008143459,0.000059171165,0.000023662325,0.00026301434,4.212721e-7],"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.000019094798,0.000025892572,0.0010955762,0.00012171996,0.000090034926,0.00049418764,0.0028409236,0.000017494849,0.00008945606,0.515375,0.386624,0.09320658],"study_design_scores_gemma":[0.0011385336,0.00075178023,0.0009163706,0.00033292046,0.00021379848,0.0010947316,0.0018060302,0.0022692527,0.00020004949,0.7795659,0.21122363,0.0004870216],"about_ca_topic_score_codex":0.00011892536,"about_ca_topic_score_gemma":0.0105718635,"teacher_disagreement_score":0.500612,"about_ca_system_score_codex":0.000105184925,"about_ca_system_score_gemma":0.00045905312,"threshold_uncertainty_score":0.5899348},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007079711,0.0000718618,0.104807734,0.00006445672,0.00022254592,0.0003862279,0.000011117007,0.00017146203,0.8942575],"genre_scores_gemma":[0.00005354435,0.00001772957,0.08631735,0.00022666517,0.00028113756,0.000013321057,0.00000692801,0.000076517914,0.9130068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987493,0.00010494336,0.000365272,0.00037620802,0.00022161071,0.00018266143],"domain_scores_gemma":[0.9975559,0.0011225074,0.00017792101,0.00093847414,0.00010978606,0.00009538171],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021914255,0.00032191182,0.0005437887,0.000053746666,0.000041441792,0.000018764555,0.00021958395,0.0004150924,0.0022046496],"category_scores_gemma":[0.0005337154,0.00023833488,0.00029639242,0.000007264069,0.000100101315,0.000012451742,0.00012373393,0.0003208587,0.0000032862429],"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.000011010063,0.000007947684,4.1190694e-7,0.00023126257,0.000043782413,0.0000023249186,0.000034535035,2.4504693e-8,0.0000027388012,0.9462135,0.02252986,0.03092263],"study_design_scores_gemma":[0.00005971425,0.000021159278,7.325395e-8,0.000047952108,0.000045024175,0.0000027524027,0.0000021439705,0.000005289072,0.000018190261,0.58024925,0.41937873,0.00016970691],"about_ca_topic_score_codex":0.0000012444093,"about_ca_topic_score_gemma":0.000020227802,"teacher_disagreement_score":0.3968489,"about_ca_system_score_codex":0.000054005,"about_ca_system_score_gemma":0.000040847848,"threshold_uncertainty_score":0.9987075},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.8038834e-7,0.000092314935,0.2836898,0.000114126895,0.00040089575,0.00016873755,0.0000782683,0.00012829735,0.7153272],"genre_scores_gemma":[0.0000014324943,0.000030753945,0.40880325,0.0002014704,0.00038078023,0.0000011143093,0.00007016093,0.00008215945,0.5904289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984555,0.000028104092,0.0003813508,0.0005941634,0.00031453132,0.00022635497],"domain_scores_gemma":[0.9967455,0.0003253649,0.00022482705,0.0024753693,0.00010499747,0.00012394371],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010554481,0.00035563202,0.0005082895,0.000089081674,0.00007853019,0.000059639267,0.00081068825,0.0004292651,0.006240324],"category_scores_gemma":[0.00027454045,0.0002905673,0.00011780893,0.000011199371,0.000064523425,0.000068089255,0.00079667644,0.0002568698,0.000007113664],"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.000003794818,0.0000059128,9.566185e-9,0.00008880331,0.00005995696,0.000015109462,0.00003541492,1.5591359e-9,0.00005820668,0.7792234,0.20415072,0.016358687],"study_design_scores_gemma":[0.000069172595,0.00002124691,3.9369494e-9,0.00013436092,0.00008823158,0.0000113381175,0.000010525701,0.00014081791,0.0001202755,0.519342,0.4798387,0.00022331114],"about_ca_topic_score_codex":0.0000046366317,"about_ca_topic_score_gemma":0.000041761345,"teacher_disagreement_score":0.275688,"about_ca_system_score_codex":0.000037175967,"about_ca_system_score_gemma":0.00007103211,"threshold_uncertainty_score":0.99995464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84364784,0.00039627714,0.15480697,0.000034645072,0.00017892165,0.00046191362,0.000091251524,0.000035089404,0.00034708143],"genre_scores_gemma":[0.9065285,0.000041404594,0.09295009,0.000013202861,0.0003023868,0.000020120453,0.000033767556,0.000012516357,0.000098016055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.00009433865,0.00027505305,0.00018542608,0.00009735418,0.00013652086],"domain_scores_gemma":[0.9991954,0.00043370703,0.00012994706,0.000114190676,0.00007315487,0.00005357744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373603,0.00011984744,0.00029872925,0.0000291833,0.00015925456,0.00004878535,0.000032817097,0.00007285553,0.0000043056216],"category_scores_gemma":[0.00009637428,0.00009212812,0.00005319771,0.000049181686,0.00006179454,0.00009201526,0.000014129545,0.000051198145,1.3064632e-9],"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.0023528375,0.00043590713,0.01215855,0.0029289667,0.0004479321,0.0000062999466,0.0060411426,0.00008378988,0.04818457,0.7165799,0.002144831,0.20863526],"study_design_scores_gemma":[0.05678205,0.001091572,0.008739139,0.00015072737,0.0009950771,0.00010302214,0.00298171,0.06967363,0.021616612,0.8236488,0.012919472,0.0012981861],"about_ca_topic_score_codex":0.00007903765,"about_ca_topic_score_gemma":0.000049570703,"teacher_disagreement_score":0.20733707,"about_ca_system_score_codex":0.000008485075,"about_ca_system_score_gemma":0.000012843928,"threshold_uncertainty_score":0.37568757},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035387506,0.002299887,0.050598346,0.00007466044,0.010501492,0.0025930535,0.0002665853,0.0007980392,0.92932916],"genre_scores_gemma":[0.00027590676,0.0030934666,0.36574864,0.0002794259,0.0047602714,0.0002169067,0.000040379033,0.0009672564,0.62461776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98653483,0.0013326256,0.0023421939,0.0031012455,0.0034908347,0.003198273],"domain_scores_gemma":[0.97680706,0.0144552905,0.0030874652,0.003441603,0.00070094643,0.001507614],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.010994991,0.0021460725,0.0032656926,0.0020342686,0.00064898183,0.0004349543,0.0050182356,0.0019266811,0.00024906432],"category_scores_gemma":[0.07172124,0.0019217053,0.0011503812,0.0032376577,0.0026698187,0.0006871381,0.0016371978,0.001988352,0.00002581518],"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.000011157311,0.000854705,0.000106298525,0.0012257966,0.00040038236,0.00013977138,0.01436035,0.000025957965,0.0041119815,0.03765426,0.91780066,0.023308689],"study_design_scores_gemma":[0.0017219869,0.0004199922,0.0000606854,0.000889693,0.00043662763,0.00004768046,0.0027833607,0.00013930819,0.0035314073,0.010614384,0.97900003,0.00035484097],"about_ca_topic_score_codex":0.0011939065,"about_ca_topic_score_gemma":0.0004888713,"teacher_disagreement_score":0.3151503,"about_ca_system_score_codex":0.00069157156,"about_ca_system_score_gemma":0.0029243762,"threshold_uncertainty_score":0.999369},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88808286,0.000056962617,0.06072756,0.00007499521,0.0001521913,0.00032300956,0.000005868097,0.000012679453,0.050563857],"genre_scores_gemma":[0.38602155,0.00006550946,0.6130268,0.000010606437,0.00015449416,0.0000057555862,8.424311e-7,0.00004257296,0.0006718739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967298,0.00028992773,0.0011220499,0.000118374264,0.0013774491,0.00036238896],"domain_scores_gemma":[0.9954357,0.0021371539,0.00070527755,0.00042659152,0.0011428677,0.00015237628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010982561,0.00015196337,0.0005198104,0.00059423596,0.00011609117,0.000038660517,0.00047165432,0.0001338245,0.000108927714],"category_scores_gemma":[0.003663382,0.00011208974,0.00020342301,0.00034250514,0.00013837402,0.00017028795,0.000115103976,0.00071076275,0.0000012776426],"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.0007715009,0.0049032588,0.0005340668,0.005326183,0.00048057488,0.00009545594,0.043145984,0.000047257126,0.03636036,0.8841098,0.0037734373,0.020452142],"study_design_scores_gemma":[0.0026787154,0.0039933748,0.00036546835,0.0027218142,0.00017752538,0.0003830372,0.0224252,0.009705086,0.11588265,0.83941406,0.0016636365,0.0005894366],"about_ca_topic_score_codex":0.00000946942,"about_ca_topic_score_gemma":0.0000070764245,"teacher_disagreement_score":0.5522992,"about_ca_system_score_codex":0.00010820547,"about_ca_system_score_gemma":0.00015388147,"threshold_uncertainty_score":0.4570887},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001464394,0.00037773745,0.04920813,0.000026990561,0.00036954696,0.00061460584,0.0005760119,0.00020878494,0.9484717],"genre_scores_gemma":[0.00016638292,0.00022801683,0.016483448,0.000060434777,0.0002336333,0.0000016708809,0.000060137943,0.00013263697,0.98263365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781907,0.0001264019,0.00037789834,0.0007679089,0.00046742504,0.00044127548],"domain_scores_gemma":[0.9974655,0.000380077,0.0004057084,0.0010787584,0.0003908968,0.00027908612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043973187,0.0006448973,0.0011183036,0.00022845088,0.00034287488,0.000061034014,0.00055423897,0.0007117283,0.000013522663],"category_scores_gemma":[0.0000737937,0.00073309866,0.00070878817,0.0000126921195,0.00018050065,0.00011241299,0.00097566197,0.00075474643,3.447298e-7],"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.0001697841,0.000017837086,6.6087516e-8,0.00032474854,0.00029539925,0.00058439997,0.00016251823,0.000006755329,0.000089534784,0.9238759,0.07367666,0.0007963415],"study_design_scores_gemma":[0.0025916458,0.00005184044,7.932513e-8,0.0005773203,0.00077808,0.00006131554,0.00011981188,0.0007450188,0.0006337938,0.0008328822,0.99269193,0.00091627444],"about_ca_topic_score_codex":0.000107483465,"about_ca_topic_score_gemma":0.000008508072,"teacher_disagreement_score":0.9230431,"about_ca_system_score_codex":0.00027232795,"about_ca_system_score_gemma":0.00020746494,"threshold_uncertainty_score":0.999512},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004953,0.00028632677,0.0070502693,0.0016485499,0.0011883135,0.0008371863,0.000059267397,0.0006441136,0.9882364],"genre_scores_gemma":[0.0000136986755,0.00017380624,0.097038515,0.00043089717,0.0061755152,0.00008403154,0.0000132021305,0.0006946641,0.89537567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807,0.00018430188,0.00035768482,0.0006690457,0.0003115176,0.00040747528],"domain_scores_gemma":[0.99846035,0.00009441296,0.00014462981,0.0010636355,0.000028323577,0.00020863349],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048284626,0.00045800296,0.0006664049,0.0003972475,0.000038560942,0.000039602808,0.00027419708,0.00045823256,0.011995373],"category_scores_gemma":[0.0001855605,0.0003932371,0.00019477139,0.00023334169,0.000029019911,0.000022919066,0.00008527195,0.00028257954,0.000011064018],"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.000021414678,0.000042641514,0.00000164098,0.0001477428,0.00007583656,0.000008686495,0.00011493447,0.0000018937527,0.000051818985,0.0015633825,0.97170705,0.026262935],"study_design_scores_gemma":[0.000194746,0.000049152393,5.153663e-7,0.00011621531,0.00006166344,0.0000121321755,0.000069506656,0.000067765264,0.00010655968,0.00016632587,0.99870104,0.000454409],"about_ca_topic_score_codex":0.00034749034,"about_ca_topic_score_gemma":0.001079842,"teacher_disagreement_score":0.09286077,"about_ca_system_score_codex":0.00006847328,"about_ca_system_score_gemma":0.00003502607,"threshold_uncertainty_score":0.99985194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94619995,0.0004091214,0.017141204,0.00077122805,0.00048036576,0.0017922345,0.000060704515,0.000087299835,0.033057895],"genre_scores_gemma":[0.9315128,0.00032659087,0.06747652,0.00028814838,0.00003467424,0.00022595539,0.0000026612722,0.000025847105,0.00010681637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786896,0.0002717281,0.00058032456,0.0005389711,0.00031789628,0.00042213444],"domain_scores_gemma":[0.99697804,0.0016115556,0.00034929338,0.00090069853,0.00009270381,0.0000676853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027046124,0.00028910677,0.0005071291,0.000068223395,0.00012180187,0.000027661403,0.00041213032,0.0000780251,0.00003447224],"category_scores_gemma":[0.0009099328,0.00019501003,0.00009372427,0.0004744772,0.0006545888,0.000108085085,0.00008194121,0.00035077758,7.8070144e-7],"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.00029183525,0.00034337566,0.00016457487,0.00022745162,0.000020935156,0.000002483402,0.0007557783,0.0011137574,0.00149864,0.9896309,0.000032824264,0.0059174527],"study_design_scores_gemma":[0.00074739056,0.00017532929,0.00006697999,0.000077873425,0.000010238723,6.2747614e-7,0.0004119482,0.00007909351,0.07037141,0.9246878,0.0031532857,0.00021804497],"about_ca_topic_score_codex":0.000064662534,"about_ca_topic_score_gemma":0.00036303521,"teacher_disagreement_score":0.06887277,"about_ca_system_score_codex":0.00028372812,"about_ca_system_score_gemma":0.00009675329,"threshold_uncertainty_score":0.7952278},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006901936,0.00017704853,0.07820724,0.00007294031,0.00043053812,0.0006547816,0.00020650258,0.00037179183,0.9198723],"genre_scores_gemma":[0.000014941455,0.00013758168,0.13389091,0.00012890903,0.00024039994,0.0000015096585,0.00002212931,0.00013162999,0.86543196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780965,0.0002565756,0.00039321554,0.0008164374,0.0003467632,0.00037735872],"domain_scores_gemma":[0.9969899,0.0009623611,0.0004611779,0.0009977603,0.00020905591,0.00037976223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005656717,0.0006575008,0.0011285446,0.00018730437,0.0002375803,0.000051872827,0.0007839833,0.00067523605,0.000013884515],"category_scores_gemma":[0.00024449802,0.0007358807,0.0006902441,0.000014309708,0.00021946439,0.00005932357,0.0007626666,0.00085186964,0.0000011714571],"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.00014018304,0.000009634901,1.3915577e-7,0.00044300786,0.0002984326,0.0003960603,0.00007948444,3.127156e-7,0.000072058414,0.9010124,0.09514352,0.0024047678],"study_design_scores_gemma":[0.0008695214,0.00006991093,2.3805485e-7,0.00024805736,0.0006656496,0.000018706323,0.000040638595,0.00031048406,0.00058717106,0.0005720251,0.9958821,0.0007354749],"about_ca_topic_score_codex":0.00003915569,"about_ca_topic_score_gemma":0.0000033879658,"teacher_disagreement_score":0.9007386,"about_ca_system_score_codex":0.00020275424,"about_ca_system_score_gemma":0.000114799004,"threshold_uncertainty_score":0.9995092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76123434,0.000114360024,0.03507553,0.0002568474,0.0004909418,0.0015825784,0.00003082368,0.00011088233,0.20110369],"genre_scores_gemma":[0.6736264,0.000018352615,0.32614547,0.0000399726,0.000037808444,0.00008773972,0.0000029786904,0.000015268564,0.000025975785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.00008571124,0.000549954,0.00037145542,0.00024484552,0.0002330528],"domain_scores_gemma":[0.99795884,0.0011461214,0.00018651124,0.0006095198,0.00004058475,0.00005840467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018771936,0.00018004415,0.000385211,0.000062078456,0.000041034284,0.000008341548,0.00022874484,0.00012978217,0.000056709134],"category_scores_gemma":[0.00040188018,0.00015412689,0.000079586775,0.00019231506,0.00016153311,0.00008798922,0.00003449464,0.0004212235,2.8105615e-7],"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.00021113825,0.0003851684,0.0006667024,0.00045492197,0.000007209695,0.000001071781,0.00093427097,0.000090240734,0.015196835,0.8544188,0.000017792421,0.12761584],"study_design_scores_gemma":[0.0007590715,0.000060432772,0.0002203078,0.000040777464,0.000012236329,0.0000016755652,0.000088435874,0.0004040164,0.01575281,0.97037953,0.012061109,0.00021960071],"about_ca_topic_score_codex":0.000010539495,"about_ca_topic_score_gemma":0.00046111783,"teacher_disagreement_score":0.29106995,"about_ca_system_score_codex":0.000030656272,"about_ca_system_score_gemma":0.000036126665,"threshold_uncertainty_score":0.62851125},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003114448,0.000085035936,0.018659763,0.000044715234,0.00031064032,0.0004574653,0.000022433915,0.00018663087,0.9802022],"genre_scores_gemma":[0.000014706893,0.000019022258,0.11002485,0.00015647912,0.00044017984,0.000011613578,0.0000064015603,0.00007273583,0.88925403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987649,0.00007547056,0.00035190934,0.00039518462,0.00022283777,0.00018970329],"domain_scores_gemma":[0.99792963,0.0006979796,0.00016715286,0.0009410035,0.00017218737,0.000092060385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018171493,0.00031735247,0.0004653061,0.000054899225,0.0000479763,0.000020192068,0.00022835986,0.00042415602,0.01132111],"category_scores_gemma":[0.00045360785,0.00023407508,0.00026895356,0.0000092184555,0.00018770139,0.000023527278,0.00015318122,0.00026037,0.000007341195],"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.000016078859,0.000012989615,3.0672615e-7,0.00015615091,0.000054589385,0.0000035995138,0.00010466002,2.6558844e-9,0.0000031096115,0.9268944,0.06499419,0.0077599143],"study_design_scores_gemma":[0.000055444674,0.000034024764,6.1518385e-8,0.000053133823,0.000047226204,0.000003390816,0.0000067980363,0.0000020790994,0.000040039857,0.6117862,0.3877988,0.00017283038],"about_ca_topic_score_codex":0.0000010149503,"about_ca_topic_score_gemma":0.000027534566,"teacher_disagreement_score":0.32280457,"about_ca_system_score_codex":0.00006413301,"about_ca_system_score_gemma":0.00005857902,"threshold_uncertainty_score":0.98958266},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011199052,0.0015418273,0.00047404514,0.00004668001,0.00044448258,0.00030229666,0.00014100934,0.0001170362,0.9968206],"genre_scores_gemma":[0.000010097599,0.0011361494,0.004962797,0.00007959904,0.0006511756,6.07924e-7,0.000038226175,0.000072565,0.9930488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998696,0.00008853179,0.00019004369,0.0005404002,0.00022893959,0.00025608484],"domain_scores_gemma":[0.9985241,0.0002384423,0.00019472906,0.0006740209,0.00015740594,0.000211302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019744248,0.00041492374,0.00060186174,0.00011582614,0.00015448775,0.00004902392,0.00027006533,0.00058049423,0.000007514209],"category_scores_gemma":[0.000021470767,0.00046431783,0.00025198446,0.0000096294425,0.00015740383,0.000042773812,0.0005361789,0.00059458084,9.9823026e-8],"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.000052194435,0.0000064033643,0.0000011647007,0.0002443538,0.00015552393,0.0006332749,0.000054442262,1.7078278e-8,0.000008374111,0.8609128,0.12968367,0.008247794],"study_design_scores_gemma":[0.00038838075,0.000020492298,0.000002022009,0.000339639,0.00032521965,0.00002610587,0.00011535578,0.0000028532304,0.00005745678,0.00006938956,0.9981919,0.00046120305],"about_ca_topic_score_codex":0.000011846946,"about_ca_topic_score_gemma":0.0000025162205,"teacher_disagreement_score":0.8685082,"about_ca_system_score_codex":0.00010299972,"about_ca_system_score_gemma":0.000081341655,"threshold_uncertainty_score":0.99978083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92678934,0.00016698946,0.07176508,0.000022955817,0.00019361207,0.00042476645,0.000041362317,0.000045502282,0.00055040815],"genre_scores_gemma":[0.99265015,0.0007991097,0.004665111,0.000015561187,0.000019405432,0.000003019793,0.000084101,0.00003169168,0.0017318672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986732,0.00036067213,0.0002729637,0.00046150154,0.00008106758,0.0001505815],"domain_scores_gemma":[0.998965,0.00010611765,0.00029738416,0.0004580864,0.00012379792,0.000049589704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044463886,0.00020182945,0.00037570766,0.00031929353,0.000075907235,0.000014883561,0.0002090385,0.00018523214,0.000034699144],"category_scores_gemma":[0.00018703907,0.0002208569,0.00007570462,0.00036271158,0.000071792136,0.000082258426,0.0007385901,0.0002739552,3.2862285e-8],"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.00016775596,0.00031716126,0.025038384,0.0014132288,0.00014826664,0.00010429358,0.0012751197,0.22577909,0.0006130669,0.7440832,0.00014471,0.00091572345],"study_design_scores_gemma":[0.0011144765,0.00010402545,0.000866376,0.00034012407,0.00027413882,0.000003825066,0.0014966365,0.919979,0.0006291477,0.07445908,0.000108883665,0.00062430237],"about_ca_topic_score_codex":0.00043169974,"about_ca_topic_score_gemma":0.0005031276,"teacher_disagreement_score":0.69419986,"about_ca_system_score_codex":0.0002679364,"about_ca_system_score_gemma":0.00008852089,"threshold_uncertainty_score":0.9006283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809595,0.00086323125,0.008104292,0.000070002534,0.00041199522,0.00043739384,0.00005133121,0.00006713603,0.009035172],"genre_scores_gemma":[0.99218583,0.000009136878,0.0004963068,0.000032328615,0.00004804677,0.0001215014,0.0000029964751,0.000021662463,0.0070821615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979261,0.0010776836,0.00033600652,0.00022450373,0.00024824546,0.00018743676],"domain_scores_gemma":[0.99870545,0.0007351747,0.00018553803,0.0002551323,0.000032355507,0.00008633212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002829839,0.00012817392,0.00037061263,0.000053747375,0.00016842324,0.000015020576,0.00015580138,0.00005889218,0.00006369867],"category_scores_gemma":[0.00031607618,0.00009954902,0.00008254512,0.000102999475,0.000103437735,0.000032751115,0.00020904388,0.00021535932,1.0090311e-7],"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.0002198101,0.000115516756,0.00060182094,0.00040092133,0.000043734974,0.000015884436,0.0005493624,0.00004839964,0.0008869161,0.9962752,0.00021740003,0.0006250519],"study_design_scores_gemma":[0.0077761034,0.003101539,0.0018007192,0.0013489574,0.00075434224,0.001273144,0.06345372,0.03624531,0.0010335359,0.66506135,0.21506752,0.0030837553],"about_ca_topic_score_codex":0.000027151074,"about_ca_topic_score_gemma":0.0000031311788,"teacher_disagreement_score":0.33121383,"about_ca_system_score_codex":0.00005103835,"about_ca_system_score_gemma":0.0000191102,"threshold_uncertainty_score":0.40594912},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1318761,0.0012898822,0.8082653,0.004388848,0.004729345,0.000831571,0.0051123207,0.00004619565,0.043460403],"genre_scores_gemma":[0.83773494,0.000045369692,0.1596888,0.0004930524,0.00014166554,0.000008339198,0.0000028854984,0.000033191714,0.0018517801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988094,0.00023722893,0.00036131914,0.000114035705,0.00022164515,0.0002563779],"domain_scores_gemma":[0.99824667,0.0006342985,0.00024375993,0.00016773638,0.00016674912,0.00054080243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008178339,0.00012363418,0.00024485766,0.00032095466,0.00040697865,0.00004930501,0.00016324467,0.000036100195,0.00017341453],"category_scores_gemma":[0.0012685414,0.00012399454,0.000044734505,0.00016822226,0.00007045418,0.00003919096,0.000024529205,0.0004781524,4.3537064e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012722329,0.00010099785,0.0025250728,0.00017829376,0.00023597867,0.002542891,0.009972395,0.0007212454,0.0001518558,0.7280429,0.17582606,0.0795751],"study_design_scores_gemma":[0.0042557227,0.00597934,0.0037405642,0.00043761116,0.00065000926,0.0033880635,0.020212874,0.016319137,0.00013681769,0.31644338,0.6264491,0.0019873786],"about_ca_topic_score_codex":0.0016123385,"about_ca_topic_score_gemma":0.031044085,"teacher_disagreement_score":0.7058588,"about_ca_system_score_codex":0.00027515081,"about_ca_system_score_gemma":0.0007549694,"threshold_uncertainty_score":0.9866368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3960813,0.00014549297,0.5997492,0.000023647635,0.00070216233,0.00018080416,0.00004567785,0.00011303133,0.002958696],"genre_scores_gemma":[0.9616458,0.00072843017,0.03091589,0.000055165416,0.000107655884,0.0000014410633,0.00013630948,0.000046860372,0.0063624727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983288,0.00024399118,0.0002360936,0.0008201464,0.00009176453,0.00027918257],"domain_scores_gemma":[0.9981327,0.0004226559,0.0002771116,0.0007996385,0.00022459516,0.0001433203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032081787,0.00029926913,0.00041194825,0.00010321791,0.00012944371,0.00006816399,0.00047265273,0.00036739523,0.00014934163],"category_scores_gemma":[0.00046669092,0.00036072911,0.00025244715,0.00028929848,0.0000613247,0.00010472377,0.0009864287,0.00044239173,4.843537e-7],"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.00043505544,0.002218007,0.0320445,0.006084873,0.002348622,0.0019111783,0.0068723136,0.18875968,0.006444655,0.6683632,0.074746996,0.009770904],"study_design_scores_gemma":[0.0044831466,0.00025197212,0.0005932958,0.0030144667,0.0032592304,0.000034618268,0.0100564,0.6598953,0.009844886,0.27041543,0.03061147,0.0075398185],"about_ca_topic_score_codex":0.000082168335,"about_ca_topic_score_gemma":0.000048467016,"teacher_disagreement_score":0.5688333,"about_ca_system_score_codex":0.00016525833,"about_ca_system_score_gemma":0.00011087193,"threshold_uncertainty_score":0.9998845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012816653,0.000110908644,0.98542714,0.00042713512,0.000111655165,0.000174919,0.00008538027,0.000009306002,0.0008368965],"genre_scores_gemma":[0.7104423,0.000013084693,0.28936064,0.000050435778,0.00002968077,0.0000065173786,0.000015113368,0.0000063657867,0.000075833574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899286,0.00029519066,0.00026357023,0.000103608836,0.00024569768,0.00009909504],"domain_scores_gemma":[0.99352753,0.006043304,0.00022498249,0.00009078028,0.00009034431,0.000023034634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016079311,0.000070744645,0.00012856965,0.000020065667,0.00073950883,0.00005395682,0.00008979248,0.000013265499,0.0000047060257],"category_scores_gemma":[0.0006093823,0.000045642344,0.000016177875,0.00007497144,0.00015735728,0.00001414109,0.0002052876,0.00013323312,7.542995e-9],"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.00002344294,0.000012883847,0.00015166862,0.000034865156,0.000021668086,3.980164e-7,0.001466333,0.0024541696,0.00000290571,0.9808109,0.0002754936,0.01474527],"study_design_scores_gemma":[0.00042759095,0.000024556895,0.00050057523,0.000006192296,0.000017534696,0.0000075546263,0.00065000734,0.65235084,0.0000014061887,0.34565774,0.00031092792,0.000045090957],"about_ca_topic_score_codex":0.00001286123,"about_ca_topic_score_gemma":0.0000056241797,"teacher_disagreement_score":0.6976257,"about_ca_system_score_codex":0.000013797923,"about_ca_system_score_gemma":0.000045726716,"threshold_uncertainty_score":0.5687779},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93713003,0.00668133,0.0033628226,0.0006884296,0.0023318164,0.0062791794,0.0018607368,0.00030078166,0.041364886],"genre_scores_gemma":[0.9674015,0.0015770067,0.019615054,0.000020707143,0.00044180168,0.0012937894,0.00012563204,0.00015152007,0.009372979],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943078,0.0017015741,0.0007759696,0.00080660795,0.0016411969,0.0007668302],"domain_scores_gemma":[0.9919607,0.004817755,0.00037562998,0.0013377036,0.0012629633,0.00024523548],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051244977,0.00037766722,0.00084824406,0.0005175466,0.00027518443,0.00009408721,0.0012302821,0.00031203032,0.0013605283],"category_scores_gemma":[0.012353658,0.00035731963,0.00026568037,0.00064274354,0.0003766943,0.000055312976,0.0032974062,0.0018168738,6.7933877e-7],"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.0043248436,0.00522166,0.03437684,0.38502842,0.0016022957,0.0014445947,0.022523295,0.00022067917,0.009141118,0.010393538,0.44528762,0.08043509],"study_design_scores_gemma":[0.012387225,0.011479875,0.007776214,0.03261505,0.0016440052,0.00022804773,0.054018416,0.029974718,0.1401832,0.14847371,0.5478377,0.013381888],"about_ca_topic_score_codex":0.00020581186,"about_ca_topic_score_gemma":0.00008201833,"teacher_disagreement_score":0.35241336,"about_ca_system_score_codex":0.00025131626,"about_ca_system_score_gemma":0.0020041019,"threshold_uncertainty_score":0.9998879},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17583591,0.000004510586,0.8216999,0.0001771996,0.000068046524,0.0005680649,0.00003909786,0.00019650272,0.0014107475],"genre_scores_gemma":[0.19779347,7.385713e-7,0.7999894,0.00017616648,0.00024190535,0.00016720316,0.0005911562,0.00010309913,0.0009368528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981782,0.00036971265,0.00036001194,0.0004163523,0.0003548387,0.00032089482],"domain_scores_gemma":[0.99893373,0.00026412142,0.00024134234,0.00029734065,0.00011353866,0.00014990594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013874363,0.00020245291,0.00029887533,0.00012730893,0.00045820232,0.000047500547,0.00022648826,0.000059250375,0.000027924061],"category_scores_gemma":[0.00016133109,0.00020313798,0.00006439689,0.00037949136,0.00002839466,0.000093206385,0.00018297776,0.00043705414,4.5721015e-7],"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.0004951227,0.0005517138,0.0038221877,0.00033159787,0.00014345808,0.00006453208,0.0037978773,0.6943122,0.0023379743,0.013462021,0.00021153752,0.28046978],"study_design_scores_gemma":[0.00037816333,0.00030636127,0.000008171752,0.00001541596,0.000038496033,0.00007539728,0.0006562588,0.99614424,0.00003728996,0.0011980846,0.00089084986,0.00025129726],"about_ca_topic_score_codex":0.000031150106,"about_ca_topic_score_gemma":0.000102897226,"teacher_disagreement_score":0.30183202,"about_ca_system_score_codex":0.00027024146,"about_ca_system_score_gemma":0.00007157282,"threshold_uncertainty_score":0.82837266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8702217,0.000012326373,0.055776887,0.0005845061,0.00008916651,0.00017511378,0.0000040009045,0.0000742989,0.073062025],"genre_scores_gemma":[0.69304717,0.00003470847,0.29909497,0.000069930626,0.000037697817,0.000011939049,0.0000010910011,0.000008510695,0.0076939957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993052,0.00004214661,0.00016986964,0.00020477753,0.00010466413,0.00017336635],"domain_scores_gemma":[0.99903834,0.00025505607,0.00008553436,0.00048091894,0.00004261315,0.00009752223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005978832,0.00011273925,0.00024660525,0.000018742268,0.00020937606,0.00006243035,0.00021476865,0.000115937895,0.0001670496],"category_scores_gemma":[0.00074143865,0.0000799014,0.00005956163,0.000011571163,0.00013133096,0.000098525416,0.00007774921,0.00010672882,1.1869266e-7],"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.00015627517,0.00033112778,0.035286207,0.0001813326,0.00010039451,0.00014452718,0.0008559411,0.0000018384869,0.004437128,0.9311278,0.0022363202,0.025141103],"study_design_scores_gemma":[0.016416496,0.0019093244,0.49340636,0.00035335484,0.00078408245,0.00020546318,0.0015894908,0.02577302,0.016494853,0.34451556,0.094504334,0.0040476713],"about_ca_topic_score_codex":0.000027599111,"about_ca_topic_score_gemma":0.00007883645,"teacher_disagreement_score":0.5866122,"about_ca_system_score_codex":0.000008015399,"about_ca_system_score_gemma":0.00001944873,"threshold_uncertainty_score":0.32582846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30840173,0.00028738857,0.68193746,0.00004429433,0.00022190614,0.0055635944,0.0008752234,0.00015997318,0.002508439],"genre_scores_gemma":[0.78302205,0.0005208888,0.18306026,0.000059637372,0.00018468019,0.00012249986,0.00014490435,0.00023339107,0.03265167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946912,0.0004115585,0.0010411764,0.0024631317,0.00018478326,0.0012081456],"domain_scores_gemma":[0.99400806,0.0010690769,0.0010686793,0.0024322872,0.00083590293,0.0005860037],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010496788,0.0012833078,0.0018799857,0.00061637507,0.0002309692,0.0000821084,0.0016444753,0.001388104,0.00007645785],"category_scores_gemma":[0.00035580405,0.0013927415,0.00075308006,0.00077349256,0.00058756385,0.00014304105,0.0011623605,0.0012175872,0.000003931686],"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.026585672,0.06319137,0.040184822,0.03754689,0.015392401,0.0039206557,0.031968933,0.06030045,0.10054364,0.5713485,0.013124024,0.035892624],"study_design_scores_gemma":[0.023649955,0.001734367,0.0015078748,0.0031184554,0.005033786,0.000063064545,0.005466026,0.9181604,0.011952566,0.010513949,0.01050358,0.0082959905],"about_ca_topic_score_codex":0.00032023733,"about_ca_topic_score_gemma":0.00044026814,"teacher_disagreement_score":0.8578599,"about_ca_system_score_codex":0.00063337316,"about_ca_system_score_gemma":0.00031719924,"threshold_uncertainty_score":0.9999919},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008581211,0.00040020715,0.97044486,0.0065801567,0.001184421,0.0012329208,0.00003317915,0.00015265834,0.011390372],"genre_scores_gemma":[0.17610785,0.000020569594,0.82139194,0.0008391333,0.00035043512,0.00006592497,0.000007696332,0.000064993656,0.0011514667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99217916,0.0015746517,0.0014944245,0.001313584,0.0017766787,0.0016615283],"domain_scores_gemma":[0.9899818,0.004715771,0.0005807463,0.0027808493,0.0011693517,0.000771503],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011623103,0.0008253232,0.0013947149,0.00045672056,0.0012012214,0.002203296,0.0029527328,0.00034064555,0.001808235],"category_scores_gemma":[0.0016068256,0.00053575216,0.00091142004,0.0048285685,0.007347688,0.0006494123,0.0017677441,0.00095702405,0.000034799632],"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.000005974194,0.000355285,0.00002713361,0.00029432712,0.0004894004,0.000016236914,0.005829983,0.00017933184,0.00065350335,0.96852005,0.00044085312,0.023187913],"study_design_scores_gemma":[0.00015989036,0.000085674765,0.00003810712,0.00012579423,0.0010032776,0.000051969462,0.00026142845,0.5778471,0.00067213346,0.4190885,0.00024108017,0.00042501447],"about_ca_topic_score_codex":0.0001184746,"about_ca_topic_score_gemma":0.00001201825,"teacher_disagreement_score":0.5776678,"about_ca_system_score_codex":0.00018393462,"about_ca_system_score_gemma":0.00018058067,"threshold_uncertainty_score":0.9997094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7935836,0.0006216343,0.20033497,0.0006239997,0.0036587382,0.00030521318,0.0000049817563,0.00003500673,0.0008318796],"genre_scores_gemma":[0.970805,0.00012051749,0.028285397,0.00019762502,0.0004467502,0.0000088854595,4.5247242e-7,0.0000195624,0.00011581144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825037,0.00016915178,0.0007534115,0.0001492394,0.0003680489,0.0003097886],"domain_scores_gemma":[0.9979959,0.0008941185,0.00057643617,0.00032316524,0.0001488931,0.000061461295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017247887,0.00017185704,0.0004005376,0.00011009167,0.00012776119,0.000035107303,0.0005092167,0.00010280948,0.000007313946],"category_scores_gemma":[0.0019522337,0.00010941065,0.0002488863,0.00068019505,0.00011102866,0.00013217132,0.00017267693,0.0006638725,1.8124733e-7],"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.00014349705,0.000106660205,0.006268869,0.00005770728,0.00007915268,0.00014561618,0.001896871,0.96130925,0.00015732163,0.022347583,0.0011096376,0.006377822],"study_design_scores_gemma":[0.0016361082,0.00014686887,0.004718423,0.0009167159,0.00010193795,0.00009590839,0.0007528751,0.9569347,0.00017239926,0.029463291,0.0046677045,0.00039309467],"about_ca_topic_score_codex":0.000021449106,"about_ca_topic_score_gemma":0.00014870976,"teacher_disagreement_score":0.17722142,"about_ca_system_score_codex":0.0000886645,"about_ca_system_score_gemma":0.00008875768,"threshold_uncertainty_score":0.44616368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023351396,0.00007675301,0.97070587,0.0012427216,0.00027487366,0.00035348308,0.00019612326,0.0001243065,0.0036744531],"genre_scores_gemma":[0.59137356,0.00005320012,0.4043243,0.00063534285,0.0003703006,0.00011656406,0.00005774606,0.000092970695,0.0029760248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966317,0.00034153787,0.0010982659,0.0004674538,0.00094868167,0.00051238446],"domain_scores_gemma":[0.9809453,0.01765825,0.00021187417,0.00046635512,0.0002874434,0.00043080957],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002515764,0.000390785,0.0008996181,0.0010489435,0.00031076462,0.00034235415,0.00028706802,0.00017610386,0.0011195727],"category_scores_gemma":[0.005645737,0.00027114217,0.0010119176,0.0011845536,0.00013032496,0.0001210889,0.00004483308,0.0007227421,0.00001806528],"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.00008323355,0.00047735532,0.000010626856,0.00025996583,0.0017017178,0.000088958484,0.00034009948,0.0008650259,0.0001437138,0.9883988,0.0040060366,0.0036244835],"study_design_scores_gemma":[0.00035076236,0.00042516575,0.000013912612,0.00037118956,0.0022514795,0.00002851554,0.00009227165,0.20661458,0.00010445788,0.7869302,0.002487432,0.000329999],"about_ca_topic_score_codex":0.0000014053697,"about_ca_topic_score_gemma":0.000010062383,"teacher_disagreement_score":0.56802213,"about_ca_system_score_codex":0.00012073183,"about_ca_system_score_gemma":0.00012405156,"threshold_uncertainty_score":0.9999741},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97301793,0.0007503959,0.016454438,0.00062146044,0.00022999127,0.0042257416,0.00060816604,0.00003892785,0.0040529724],"genre_scores_gemma":[0.9960061,0.00019771492,0.0016065128,0.000012577448,0.000050957537,0.0006431759,0.000016389651,0.00005766999,0.001408917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936753,0.0033671532,0.0004978468,0.00052254327,0.0014880315,0.0004491616],"domain_scores_gemma":[0.9784847,0.019283267,0.0003357072,0.001395528,0.0003767567,0.00012404766],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012589585,0.0002965587,0.00073971343,0.00031702346,0.00018988564,0.0000253996,0.0008067882,0.00020384176,0.00021333474],"category_scores_gemma":[0.015272744,0.0001965248,0.000255987,0.00028341633,0.0003635267,0.000025110181,0.0024348015,0.0017740877,1.0166194e-7],"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.00939716,0.0022300773,0.0011382573,0.15411922,0.0018404215,0.00013546004,0.030756555,0.038453627,0.011325808,0.64951605,0.030211585,0.070875764],"study_design_scores_gemma":[0.0016469148,0.0041219825,0.0001258103,0.0045805145,0.00021171158,0.0000075525336,0.0031801744,0.9348811,0.008454469,0.041775413,0.00022768193,0.0007866788],"about_ca_topic_score_codex":0.00009813002,"about_ca_topic_score_gemma":0.0000149320485,"teacher_disagreement_score":0.89642745,"about_ca_system_score_codex":0.000121616446,"about_ca_system_score_gemma":0.00030927671,"threshold_uncertainty_score":0.993022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046096204,0.01096465,0.9859899,0.00023782245,0.00004123707,0.0013023384,0.0009787256,0.000015365082,0.0004238662],"genre_scores_gemma":[0.0027005193,0.008534704,0.98719525,0.00034554506,0.000026389727,0.000800652,0.00025117816,0.00002168136,0.00012409453],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989483,0.00020430172,0.00041807926,0.00019058793,0.00013275293,0.00010597511],"domain_scores_gemma":[0.99844384,0.0007618798,0.0003486289,0.00013405162,0.0002676736,0.00004394827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073187,0.00009672215,0.0003112917,0.000036464713,0.00013158306,0.0000053731565,0.00008679821,0.000019540154,0.0000130016815],"category_scores_gemma":[0.00048668738,0.000091111906,0.000043298172,0.00012663714,0.00001795608,0.00003293246,0.00006901958,0.00006543669,2.087942e-8],"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.000008212058,0.000042514497,9.680136e-7,0.006571867,0.0000122814,7.4523065e-8,0.00015796817,0.0000017910646,0.00030358965,0.47192693,0.004666389,0.5163074],"study_design_scores_gemma":[0.00071643357,0.0005160388,0.000020792138,0.0006436736,0.00035689643,0.000016040034,0.0006185737,0.19341195,0.00077786914,0.36415026,0.43833855,0.000432951],"about_ca_topic_score_codex":0.0000034905343,"about_ca_topic_score_gemma":4.7567156e-7,"teacher_disagreement_score":0.51587445,"about_ca_system_score_codex":0.000020272757,"about_ca_system_score_gemma":0.000023603281,"threshold_uncertainty_score":0.37154356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60331583,0.000010566096,0.39303616,0.00053993304,0.00009210822,0.00040680612,0.00002458563,0.00005968034,0.0025143137],"genre_scores_gemma":[0.7637469,0.000012176125,0.2353121,0.000018221403,0.000034199395,0.000039258957,0.000087370245,0.000023425338,0.0007263177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987448,0.00014595175,0.00051845354,0.00013019718,0.00036506588,0.00009551728],"domain_scores_gemma":[0.99367166,0.00553509,0.00033905738,0.00020782175,0.00021851694,0.000027861708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012416176,0.00010210135,0.0002509639,0.00017899017,0.00013965774,0.0000122222555,0.00011439035,0.00004259373,0.000029307796],"category_scores_gemma":[0.0018479241,0.00007929066,0.000092816976,0.0004328594,0.00011235337,0.00005675681,0.000027328244,0.00011576747,8.110923e-7],"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.00001662611,0.00009517561,0.00007003276,0.00030871507,0.000075668766,0.000001153631,0.0038892168,0.023256462,0.00013472523,0.9706757,0.0007049203,0.000771598],"study_design_scores_gemma":[0.00034562277,0.00006771036,0.0003012416,0.00009701731,0.000052081345,0.000004332703,0.0015386671,0.15580621,0.0002647476,0.841273,0.00016976803,0.00007959862],"about_ca_topic_score_codex":0.000005569395,"about_ca_topic_score_gemma":0.0000015531309,"teacher_disagreement_score":0.16043109,"about_ca_system_score_codex":0.0000117552145,"about_ca_system_score_gemma":0.00003864224,"threshold_uncertainty_score":0.3233379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6032885,0.0008539682,0.034164306,0.0034011789,0.00041477385,0.0024676418,0.0002974692,0.0016340587,0.35347816],"genre_scores_gemma":[0.7429857,0.000047104433,0.25055054,0.0008795009,0.00014455989,0.0006332974,0.000019591562,0.00014990165,0.004589748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970633,0.00069062435,0.0005938109,0.00051275996,0.000584109,0.0005554154],"domain_scores_gemma":[0.99632514,0.0023793597,0.0002946043,0.00064624654,0.000054725693,0.0002999232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014293011,0.0003467044,0.0009177762,0.0001474644,0.00038697128,0.00005213808,0.0003353166,0.000044600685,0.00036127164],"category_scores_gemma":[0.0014145939,0.00030438986,0.00019709788,0.00046840555,0.00039029896,0.00006305023,0.00047899093,0.00042185327,8.742381e-7],"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.0011897985,0.0023331998,0.0011742678,0.00085538946,0.0006791615,0.00037445594,0.008498592,0.00003569276,0.002148369,0.8447522,0.04459286,0.09336603],"study_design_scores_gemma":[0.008872521,0.0016514781,0.001753502,0.00020591446,0.0007421329,0.0003792397,0.014943911,0.08191565,0.00047403565,0.82616854,0.059915382,0.0029776874],"about_ca_topic_score_codex":0.00008596388,"about_ca_topic_score_gemma":0.000019693396,"teacher_disagreement_score":0.3488884,"about_ca_system_score_codex":0.000106468535,"about_ca_system_score_gemma":0.000045565976,"threshold_uncertainty_score":0.9999408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91372365,0.000047974663,0.0451994,0.0002789635,0.0007228832,0.00063711085,0.00012451083,0.00022111506,0.039044403],"genre_scores_gemma":[0.9574172,0.000010176673,0.040584292,0.0007775464,0.000027760578,0.00013605547,0.00007293202,0.000012182368,0.00096185034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987838,0.00006108678,0.0003221807,0.00008197385,0.0005136355,0.00023732294],"domain_scores_gemma":[0.9992505,0.00011608196,0.00024176609,0.00022102923,0.00009403089,0.00007663554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007902493,0.0001259733,0.0001617655,0.0002929941,0.00033789745,0.000039284976,0.00022587705,0.0000348638,0.00074927195],"category_scores_gemma":[0.000112634545,0.00010303348,0.00005804167,0.0004613507,0.000039059003,0.00066630344,0.00018818563,0.00021153063,0.0000023094449],"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.001881142,0.0010085246,0.07115401,0.0022822316,0.00086733804,0.00009010727,0.0392433,0.0018308228,0.00039993116,0.44181573,0.11227435,0.32715252],"study_design_scores_gemma":[0.0034373759,0.001120864,0.00479872,0.000051576026,0.000111853056,0.00031995255,0.027561199,0.0082241045,0.0018138777,0.0022007707,0.9492303,0.0011293738],"about_ca_topic_score_codex":0.00003866643,"about_ca_topic_score_gemma":0.000008938744,"teacher_disagreement_score":0.83695596,"about_ca_system_score_codex":0.00009630002,"about_ca_system_score_gemma":0.00006730028,"threshold_uncertainty_score":0.82040024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92009187,0.006072665,0.0075076087,0.00034085338,0.0007504878,0.0028115087,0.0014164832,0.00010174896,0.060906768],"genre_scores_gemma":[0.9665758,0.0025450597,0.023793489,0.000007499653,0.00021640702,0.0003463411,0.00006329559,0.00008220789,0.0063698925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99186736,0.0026571185,0.000975199,0.00068977295,0.0030824882,0.0007280784],"domain_scores_gemma":[0.99115694,0.0052475,0.0005776603,0.0016623292,0.0011567284,0.00019882643],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.014435621,0.00031007582,0.001117279,0.0021406931,0.00016614326,0.000029969839,0.0014439261,0.00036440114,0.0014188278],"category_scores_gemma":[0.00997472,0.0002832308,0.00055037095,0.0020177402,0.0004384443,0.000040756633,0.0048711835,0.0021323625,1.4499479e-7],"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.0022261215,0.008973642,0.07011729,0.2675555,0.0028178974,0.0005009034,0.017080167,0.00082221505,0.0075139417,0.31541878,0.0792225,0.22775103],"study_design_scores_gemma":[0.011024164,0.0167927,0.049509484,0.030706944,0.0014701614,0.00007968217,0.08232271,0.0205396,0.099731445,0.5874709,0.09130583,0.0090464],"about_ca_topic_score_codex":0.0006611626,"about_ca_topic_score_gemma":0.000057538808,"teacher_disagreement_score":0.27205208,"about_ca_system_score_codex":0.00028832254,"about_ca_system_score_gemma":0.00069238985,"threshold_uncertainty_score":0.999962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7613516,0.0008145335,0.2244874,0.0012895921,0.0019070907,0.0011619579,0.00004880948,0.0001314044,0.008807616],"genre_scores_gemma":[0.9933808,0.00031769602,0.0041914782,0.00089674396,0.00015634221,0.0002255298,0.00000854159,0.00003065302,0.00079222675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973155,0.0005407405,0.0005925463,0.0005471386,0.000585898,0.00041812094],"domain_scores_gemma":[0.9973355,0.0016290052,0.00022604586,0.00052905054,0.00013101012,0.00014941796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018299178,0.00028958154,0.00055020454,0.0002828176,0.00028261726,0.00011044622,0.00033441823,0.00012948357,0.00050663954],"category_scores_gemma":[0.00052357273,0.00026966844,0.00012648992,0.00053240446,0.000046821893,0.00009614044,0.0001308544,0.00062154717,0.0000010467237],"study_design_candidate":"design_other","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.002461727,0.00041843092,0.0010610296,0.000058120444,0.000084382016,0.00009614775,0.0013249177,0.0037643334,0.0013166463,0.09044625,0.020618606,0.8783494],"study_design_scores_gemma":[0.033578873,0.015715959,0.0031047722,0.0012201669,0.00043807825,0.0001385354,0.012999068,0.57392037,0.0012094723,0.24645077,0.107239135,0.003984807],"about_ca_topic_score_codex":0.0000721058,"about_ca_topic_score_gemma":0.00037611337,"teacher_disagreement_score":0.8743646,"about_ca_system_score_codex":0.00006738002,"about_ca_system_score_gemma":0.00009265519,"threshold_uncertainty_score":0.99997556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529708,0.00007439407,0.04457264,0.00006534199,0.00020784819,0.00051418203,0.0000055577316,0.00010546612,0.0014837933],"genre_scores_gemma":[0.6712821,0.00001672868,0.3285578,0.000028880611,0.000034446814,0.00003129987,0.0000021741296,0.000011328996,0.000035249213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997363,0.0010806253,0.00062293507,0.00047943406,0.0001093458,0.00034467442],"domain_scores_gemma":[0.9885122,0.010812735,0.0002265353,0.00031503584,0.000072780764,0.000060697046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008375228,0.00019177455,0.00063080393,0.00012288829,0.00008514053,0.000009419257,0.00020168598,0.00017576772,0.0000103513585],"category_scores_gemma":[0.005456189,0.00017476288,0.000047131336,0.00053985923,0.000353891,0.000017817783,0.00025084562,0.00022910346,1.8739448e-7],"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.0030699996,0.001154991,0.31088808,0.025747828,0.00026660043,0.000058634716,0.021255657,0.00068784243,0.038752623,0.0848841,0.0021003392,0.5111333],"study_design_scores_gemma":[0.0047129933,0.00061888044,0.0909713,0.0005150374,0.00023588154,0.00006706241,0.0026239587,0.03787156,0.07151008,0.7878476,0.0012262769,0.0017993697],"about_ca_topic_score_codex":0.000019733909,"about_ca_topic_score_gemma":0.000043773103,"teacher_disagreement_score":0.7029635,"about_ca_system_score_codex":0.000021139744,"about_ca_system_score_gemma":0.00009735503,"threshold_uncertainty_score":0.71266234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23810323,0.00015941822,0.7530215,0.0029371786,0.00029978785,0.00083711377,0.00006271922,0.00021283708,0.004366236],"genre_scores_gemma":[0.090479344,0.00002327936,0.8745928,0.00009874135,0.000025995827,0.00015020884,0.000030919717,0.000082654726,0.03451608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9938084,0.004184399,0.00053681846,0.00065184355,0.00030965358,0.0005088831],"domain_scores_gemma":[0.9887325,0.0065132086,0.00049143523,0.001614729,0.0023560314,0.00029207574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013824698,0.00035489356,0.0005234477,0.00014950601,0.00039676364,0.00017097632,0.00061578886,0.00017744198,0.000040957613],"category_scores_gemma":[0.0061062267,0.0003063829,0.00021884503,0.0002990924,0.00026822896,0.00013615478,0.00025345501,0.00048742467,6.060938e-7],"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.00038530832,0.0042829355,0.0019931684,0.0005573369,0.00049580424,0.000024226676,0.028525362,0.000040963358,0.15073991,0.45772803,0.0042897845,0.3509372],"study_design_scores_gemma":[0.0092088785,0.000018882707,0.0011118696,0.001463143,0.00037677865,0.00015734795,0.0013390068,0.38513646,0.4629251,0.009560402,0.12631391,0.0023882021],"about_ca_topic_score_codex":0.00038900433,"about_ca_topic_score_gemma":0.007311555,"teacher_disagreement_score":0.44816762,"about_ca_system_score_codex":0.000051775736,"about_ca_system_score_gemma":0.00018916548,"threshold_uncertainty_score":0.99993885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01005859,0.000011301614,0.9876017,0.00009137802,0.00068466004,0.0003985586,0.00010780364,0.00012709627,0.00091888657],"genre_scores_gemma":[0.53173614,0.00007599041,0.46550736,0.00027782403,0.000054115997,0.00043523926,0.000051552768,0.000026672185,0.0018351049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.00021401195,0.00044694546,0.000089307905,0.00014066056,0.00012987082],"domain_scores_gemma":[0.9975563,0.001901834,0.00021026867,0.000141079,0.0001452631,0.00004522205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002743013,0.000106187814,0.00018385964,0.00026809803,0.00018713783,0.000024559906,0.00006394744,0.00008072669,0.000088435474],"category_scores_gemma":[0.00025307998,0.00009643077,0.00010474682,0.00023087168,0.00007490612,0.0004601623,0.0000019381814,0.00007786708,0.0000014273686],"study_design_candidate":"design_other","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.00038302765,0.000056806824,0.000002765134,0.0007093475,0.00017358774,1.1731999e-7,0.003984858,0.009963075,0.001737633,0.14364317,0.0016591274,0.8376865],"study_design_scores_gemma":[0.0018993366,0.00043080345,0.000042974083,0.00015193522,0.0003546235,0.000012014734,0.004347557,0.37730172,0.20418242,0.40321505,0.007577432,0.00048412252],"about_ca_topic_score_codex":0.0000031302686,"about_ca_topic_score_gemma":9.212471e-7,"teacher_disagreement_score":0.83720237,"about_ca_system_score_codex":0.0000197435,"about_ca_system_score_gemma":0.00003011452,"threshold_uncertainty_score":0.39323324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9721496,0.000031559997,0.0083555365,0.0033339951,0.00012411749,0.0018275857,0.0010051873,0.00018579962,0.012986596],"genre_scores_gemma":[0.81286633,0.000026880363,0.186032,0.00028798124,0.00010997549,0.00034442864,0.00012717517,0.000034123812,0.00017109538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981587,0.00022208043,0.00062244444,0.00039839325,0.00025577555,0.00034261972],"domain_scores_gemma":[0.99338263,0.004962526,0.00034021967,0.0009403168,0.00030413232,0.000070149086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052122935,0.00019289702,0.0005189844,0.00004172648,0.00019222325,0.000024380546,0.00041813994,0.00009564249,0.000009672846],"category_scores_gemma":[0.002200792,0.00013378928,0.00021632362,0.00030200134,0.00045673986,0.00003828312,0.00018023506,0.00014221149,9.0150826e-7],"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.004919457,0.0003001635,0.00002859309,0.0004664142,0.00025502496,5.578423e-7,0.009788224,0.0000601463,0.011873981,0.9395395,0.026797164,0.0059708115],"study_design_scores_gemma":[0.0006610289,0.00010979901,0.000840422,0.000021809785,0.000032997043,8.8169465e-8,0.00091979443,0.0012544636,0.031402066,0.9617743,0.0028323445,0.00015088619],"about_ca_topic_score_codex":0.00009771353,"about_ca_topic_score_gemma":0.00018245261,"teacher_disagreement_score":0.17767645,"about_ca_system_score_codex":0.000016309054,"about_ca_system_score_gemma":0.000056386492,"threshold_uncertainty_score":0.5455768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756758,0.000030141708,0.0071858414,0.00054923765,0.00046971004,0.0010000262,0.000012815066,0.000117223055,0.014959156],"genre_scores_gemma":[0.53236693,0.000028053268,0.46405253,0.00036768548,0.0011171467,0.0001526017,0.000009960018,0.00013655415,0.0017685548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982413,0.00009516561,0.00073905865,0.00023682298,0.00036008735,0.00032758308],"domain_scores_gemma":[0.9974581,0.0012800783,0.00048874906,0.0004067029,0.00023706528,0.00012932734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062836525,0.00018524034,0.0005240572,0.00019104606,0.00015342752,0.000036183297,0.00025966924,0.000128879,0.00001578318],"category_scores_gemma":[0.00096048246,0.00014878965,0.00036850673,0.0003458064,0.00006902388,0.00006463553,0.000059779293,0.00028014186,7.923098e-7],"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.0038488146,0.0012485058,0.00029877623,0.0038166319,0.0007917167,0.000045163706,0.0063101673,0.00063439255,0.10558086,0.6991328,0.07981884,0.0984733],"study_design_scores_gemma":[0.0011679047,0.00030811733,0.00008552101,0.00014315468,0.00009349241,0.000011993159,0.00021060824,0.0010785997,0.010866327,0.97021806,0.0155739905,0.00024221069],"about_ca_topic_score_codex":4.1096436e-7,"about_ca_topic_score_gemma":0.0000012228093,"teacher_disagreement_score":0.45686668,"about_ca_system_score_codex":0.00012719944,"about_ca_system_score_gemma":0.000083417486,"threshold_uncertainty_score":0.6067466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96976733,0.00012712897,0.024663266,0.00051092694,0.00029438292,0.00024086519,0.000022030257,0.000021306654,0.004352764],"genre_scores_gemma":[0.9620337,0.00007619392,0.03769116,0.00001484744,0.000092920374,0.0000023900527,4.0647342e-7,0.000013614785,0.00007478625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966653,0.0007249866,0.0013885433,0.00017579479,0.00075836346,0.00028702707],"domain_scores_gemma":[0.9937607,0.004080443,0.00088514463,0.00044187705,0.00066399685,0.00016783278],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01163081,0.0001589677,0.0008403575,0.00037276503,0.000034631776,0.0000084987405,0.0004884759,0.000142131,0.00020572466],"category_scores_gemma":[0.020607384,0.00010876134,0.0005036447,0.0011108064,0.0010658238,0.000078472534,0.00019382451,0.00033562764,1.3966607e-7],"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.00049092347,0.0006548792,0.0060931914,0.0015902553,0.00013427988,0.000014773563,0.0004041357,0.000028813953,0.0024836154,0.97615147,0.0009084763,0.011045195],"study_design_scores_gemma":[0.00054826227,0.00072644005,0.0026515755,0.00021119852,0.00012530969,0.00002217585,0.00021432342,0.0009398303,0.011977919,0.9823891,0.00006259995,0.00013126608],"about_ca_topic_score_codex":0.0000034675932,"about_ca_topic_score_gemma":0.0000012738096,"teacher_disagreement_score":0.013027894,"about_ca_system_score_codex":0.00006256053,"about_ca_system_score_gemma":0.00011505934,"threshold_uncertainty_score":0.98764247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68009347,0.00012175519,0.30974883,0.0010045323,0.00046618978,0.00043986386,0.000021336064,0.00030582678,0.0077982047],"genre_scores_gemma":[0.65848076,0.00015001273,0.33499032,0.00009018546,0.00037435725,0.000023109176,0.000009500286,0.00008438013,0.005797331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982193,0.00018283128,0.0007162558,0.00014756992,0.00042057442,0.00031343306],"domain_scores_gemma":[0.99806356,0.0010655214,0.00029294583,0.00028156856,0.00013531966,0.00016108001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001679763,0.00016986154,0.00043870579,0.0002037636,0.00010742378,0.00004507333,0.00021475901,0.0001171685,0.00018246264],"category_scores_gemma":[0.0020429012,0.00012784073,0.00019322273,0.00029316207,0.0000632789,0.0001037044,0.00006606037,0.00029735363,0.000006490579],"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.00020958348,0.0019981912,0.0008133459,0.0017834652,0.0007004255,0.0005555315,0.009713629,0.00011976923,0.14883572,0.7108532,0.05419715,0.07022],"study_design_scores_gemma":[0.0049244086,0.00055848784,0.0010745837,0.0012248055,0.00038729713,0.0013206507,0.002740566,0.054250263,0.047329172,0.88078946,0.0044458625,0.000954425],"about_ca_topic_score_codex":0.0000013511742,"about_ca_topic_score_gemma":0.0000067722076,"teacher_disagreement_score":0.16993628,"about_ca_system_score_codex":0.00002737364,"about_ca_system_score_gemma":0.00004081055,"threshold_uncertainty_score":0.5213193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96361935,0.00008979677,0.027996674,0.0002139262,0.00046284948,0.00047029607,0.00015691739,0.00026313224,0.006727084],"genre_scores_gemma":[0.9907915,0.0005437354,0.0017103252,0.000012682164,0.000027327118,0.0000011559508,0.000031026266,0.000045168752,0.0068370947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.00023264054,0.00027468742,0.00056901225,0.00009305753,0.00025292378],"domain_scores_gemma":[0.9979997,0.0007398642,0.00040068282,0.00064623804,0.00009308652,0.00012039566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057777116,0.0002762966,0.0004929006,0.0003058093,0.000104280356,0.000026987147,0.00027507034,0.00036138296,0.000057471676],"category_scores_gemma":[0.00048985286,0.0002871421,0.00019836184,0.00031075167,0.00009865838,0.00006921247,0.00055111625,0.00046987206,0.0000016766786],"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.000051381736,0.000119494856,0.0067347386,0.00043560832,0.00027849083,0.0001343852,0.0010245924,0.0011109476,0.000026699403,0.98833895,0.0017252702,0.000019455349],"study_design_scores_gemma":[0.0016407474,0.00018268097,0.0026612717,0.0011026604,0.00090536824,0.0000044542317,0.0013869321,0.08945462,0.00053751585,0.89996827,0.0012369989,0.0009185031],"about_ca_topic_score_codex":0.00004174642,"about_ca_topic_score_gemma":0.00005544013,"teacher_disagreement_score":0.08837069,"about_ca_system_score_codex":0.000078958175,"about_ca_system_score_gemma":0.00007588129,"threshold_uncertainty_score":0.9999581},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44304496,0.000010676116,0.55569583,0.000107033586,0.00027905902,0.00049848156,0.00005787042,0.0001755912,0.00013051946],"genre_scores_gemma":[0.9677489,0.00005628498,0.027816385,0.000081449994,0.00012819761,0.0000065616323,0.00007539907,0.00010050807,0.0039863153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790883,0.00035151662,0.00026818702,0.00094975403,0.00012442078,0.00039731475],"domain_scores_gemma":[0.996299,0.002280684,0.0003453371,0.00073199667,0.00019136614,0.00015156515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012889308,0.00039774997,0.00047617996,0.00018893417,0.0004462775,0.00007581233,0.00046585672,0.00039951707,0.0000032140647],"category_scores_gemma":[0.00062676024,0.00035351142,0.00022961188,0.00016789393,0.00011648114,0.00011129652,0.0008205648,0.00092436554,3.374629e-7],"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.00015240064,0.00010421039,0.00052978506,0.0002690599,0.00014720183,0.000051876617,0.0005396619,0.7768313,0.000023069459,0.21955732,0.000052412295,0.0017416474],"study_design_scores_gemma":[0.00073165813,0.000085605054,0.00006367324,0.00019109459,0.00015093682,0.0000018815435,0.00068667176,0.88756,0.000021093234,0.11013201,0.000023184099,0.00035218548],"about_ca_topic_score_codex":0.0003466667,"about_ca_topic_score_gemma":0.0006708549,"teacher_disagreement_score":0.5278794,"about_ca_system_score_codex":0.00021779625,"about_ca_system_score_gemma":0.00008738176,"threshold_uncertainty_score":0.9998917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18743926,0.000028632572,0.80537486,0.00016630016,0.0017904458,0.0013422313,0.0001828972,0.00046360088,0.003211769],"genre_scores_gemma":[0.86624265,0.00023783324,0.042495962,0.000121491765,0.00070012663,0.000035991317,0.00025224264,0.00022317517,0.08969052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978193,0.00018053253,0.0003520982,0.0010156565,0.00012504982,0.0005073359],"domain_scores_gemma":[0.9973233,0.00066117675,0.00043202576,0.0011314275,0.0002729486,0.00017911967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094137975,0.00044815853,0.00061576493,0.0003276158,0.00020309664,0.00009219258,0.0006366136,0.0005311275,0.000030420348],"category_scores_gemma":[0.0005294956,0.0005001088,0.0005817158,0.0003297685,0.00010938721,0.000108506516,0.0006590302,0.0004712154,0.0000025246486],"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.00031319307,0.00033621106,0.00029500606,0.0017165681,0.00035281043,0.0001455699,0.0006292674,0.0045098737,0.00020871368,0.97424346,0.01628059,0.00096871494],"study_design_scores_gemma":[0.0020592092,0.00019843623,0.00007216287,0.00040366364,0.00069479167,0.000002561868,0.00073851144,0.42261004,0.0003386684,0.55024534,0.021377668,0.0012589749],"about_ca_topic_score_codex":0.00005714032,"about_ca_topic_score_gemma":0.00011980984,"teacher_disagreement_score":0.7628789,"about_ca_system_score_codex":0.00034013105,"about_ca_system_score_gemma":0.00015651877,"threshold_uncertainty_score":0.9997451},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029566504,0.0000659227,0.96856993,0.00036188067,0.00013020592,0.00033929633,0.000050721308,0.00016885564,0.00074666453],"genre_scores_gemma":[0.68174016,0.00009549873,0.3177487,0.00003675097,0.00003347886,0.000031238123,0.00019541579,0.000020127005,0.0000986459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984732,0.00040816574,0.0004901694,0.00021566273,0.0002195079,0.00019327743],"domain_scores_gemma":[0.9944075,0.0044548423,0.00012210275,0.0007257227,0.00022601128,0.00006382875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092273,0.00012569367,0.0001857481,0.0003077846,0.00032789473,0.00007908135,0.00026871866,0.00008096379,0.000009131283],"category_scores_gemma":[0.0011162817,0.00014139336,0.000027253363,0.0006663176,0.000099957535,0.00011427788,0.0003017874,0.00021867438,0.0000014521412],"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.000061130566,0.0002070298,0.00312502,0.00021183075,0.000041716754,0.000003887164,0.0048053456,0.35175493,0.00019311163,0.36941308,0.0012214528,0.26896146],"study_design_scores_gemma":[0.00051326485,0.000026240046,0.0030681924,0.00003404612,0.000014596549,0.00000142136,0.00030257457,0.86649114,0.000009762157,0.12860952,0.00080244435,0.00012677902],"about_ca_topic_score_codex":0.00005186124,"about_ca_topic_score_gemma":0.00013378474,"teacher_disagreement_score":0.65217364,"about_ca_system_score_codex":0.00006993871,"about_ca_system_score_gemma":0.000038841026,"threshold_uncertainty_score":0.5765854},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000158266,0.0006091525,0.06784296,0.00016693564,0.0004170092,0.00046498154,0.000029524967,0.00029138714,0.93017644],"genre_scores_gemma":[0.0000012463078,0.00039629106,0.44124633,0.00029944465,0.00030532494,0.000014020902,0.000011655685,0.00013190664,0.55759376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977249,0.00020150926,0.00068868935,0.00063081854,0.00035110078,0.00040299929],"domain_scores_gemma":[0.9970351,0.0012533292,0.00025666817,0.0011548434,0.000088595865,0.00021144903],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002032873,0.000653764,0.001041915,0.00023971366,0.00008106734,0.0000447843,0.00039616032,0.00080882246,0.014499354],"category_scores_gemma":[0.00020581136,0.0005486215,0.0005764055,0.000031309013,0.000095499774,0.00003969987,0.00014707384,0.0006421057,0.0000066978873],"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.000016605909,0.000011875515,9.138674e-8,0.00008950993,0.000098128665,0.000025338748,0.00005486562,5.3731256e-8,0.000018455214,0.6495512,0.03979078,0.3103431],"study_design_scores_gemma":[0.00014853835,0.00003312256,7.1326426e-8,0.00009995453,0.00010679321,0.000020639754,0.000008643538,0.000050534174,0.000092951275,0.3739025,0.62510663,0.00042964835],"about_ca_topic_score_codex":0.00001072774,"about_ca_topic_score_gemma":0.000027140157,"teacher_disagreement_score":0.5853158,"about_ca_system_score_codex":0.00009233906,"about_ca_system_score_gemma":0.00007895553,"threshold_uncertainty_score":0.99969655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48872352,0.0002723526,0.49967003,0.0002808704,0.000662321,0.00026488872,0.00021688231,0.00042956276,0.00947958],"genre_scores_gemma":[0.5681039,0.00013048183,0.42659378,0.00015460655,0.0003025193,0.0000051568745,0.000015030718,0.00004827817,0.004646263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925125,0.000060851435,0.00017931822,0.00016544858,0.00012071804,0.00022240674],"domain_scores_gemma":[0.99893844,0.00074096734,0.00006262311,0.00013927654,0.00005002715,0.00006864397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053038093,0.00009996446,0.00017556871,0.00005361586,0.00012450687,0.000044196648,0.00006606701,0.000035164463,0.000005631371],"category_scores_gemma":[0.0003626135,0.000091144735,0.000023400284,0.00013214846,0.000027527589,0.000013532226,0.00011820956,0.000089872054,5.828407e-7],"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.000009366021,0.000028632963,0.0013149241,0.00040652676,0.00006128458,0.00014849415,0.0029660633,0.00007153496,0.0002618714,0.50400066,0.08058606,0.41014457],"study_design_scores_gemma":[0.0012357419,0.0001967196,0.004149934,0.00027858536,0.000120560435,0.000043233333,0.0027361095,0.807461,0.0001657042,0.11516392,0.06754787,0.0009006123],"about_ca_topic_score_codex":0.00003855088,"about_ca_topic_score_gemma":0.0000317013,"teacher_disagreement_score":0.8073895,"about_ca_system_score_codex":0.000010474646,"about_ca_system_score_gemma":0.000012918487,"threshold_uncertainty_score":0.37167743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5080699,0.000018116298,0.48598036,0.00053555134,0.00015683986,0.0011660993,0.00025358936,0.00018207832,0.0036375052],"genre_scores_gemma":[0.7331097,0.00012847995,0.18472852,0.00056473655,0.0008973192,0.000031641895,0.00008048998,0.00017524857,0.08028387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980822,0.00014089208,0.00024066553,0.0010953448,0.00009789,0.00034298684],"domain_scores_gemma":[0.9974073,0.00050261186,0.00017832826,0.0012052908,0.000115989256,0.0005904331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003290971,0.000387071,0.00059698144,0.00026958558,0.00013333706,0.00010899666,0.00054993836,0.00028506166,0.00005932632],"category_scores_gemma":[0.00012984927,0.0003992864,0.00013385538,0.00048338866,0.00007843603,0.000065247885,0.0009454297,0.00034923005,0.000016543689],"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.0026477613,0.0012747907,0.024002522,0.0024812345,0.0046671997,0.00077217974,0.030855337,0.05581181,0.0063340417,0.5129372,0.3353709,0.02284505],"study_design_scores_gemma":[0.0060881907,0.00096423033,0.0072054067,0.0024684782,0.002872857,0.00001656226,0.007982267,0.010789029,0.0032312253,0.69946027,0.25188723,0.0070342603],"about_ca_topic_score_codex":0.0031095638,"about_ca_topic_score_gemma":0.0048848917,"teacher_disagreement_score":0.30125186,"about_ca_system_score_codex":0.00019242831,"about_ca_system_score_gemma":0.00017139052,"threshold_uncertainty_score":0.9998459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36218077,0.0000053361423,0.636339,0.000057480138,0.000046676614,0.0010091177,0.00015715155,0.000094924406,0.00010951873],"genre_scores_gemma":[0.96646494,0.0000108234235,0.03212739,0.000013473329,0.00002311152,0.000028785682,0.000014136895,0.000044521847,0.0012728162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848336,0.00009838348,0.0002693781,0.0007151744,0.00011067203,0.00032304274],"domain_scores_gemma":[0.9968593,0.0007728814,0.0003231482,0.0014134193,0.00044220983,0.00018905244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065546914,0.00026360407,0.00046776017,0.000116844574,0.000063814594,0.000020028487,0.00058613793,0.0001482619,0.0000026381674],"category_scores_gemma":[0.00045438262,0.0002688822,0.00013549485,0.00036690867,0.000073581265,0.00009178652,0.0007446133,0.00022507367,4.0131175e-7],"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.0007159815,0.00021255955,0.0008864396,0.0011713478,0.0001927529,0.000008483336,0.0014715729,0.7544561,0.0003156095,0.2393463,0.00028244726,0.0009403926],"study_design_scores_gemma":[0.00043548908,0.00009746656,0.00005828851,0.00011474065,0.000122063204,1.4754167e-7,0.00014982195,0.6062374,0.00035329576,0.39221215,0.0000143275865,0.00020479278],"about_ca_topic_score_codex":0.00028700678,"about_ca_topic_score_gemma":0.000981332,"teacher_disagreement_score":0.60428417,"about_ca_system_score_codex":0.00012670242,"about_ca_system_score_gemma":0.0001772203,"threshold_uncertainty_score":0.99997634},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023412358,0.9765531,0.000063031155,0.007935451,0.0018787825,0.009614059,0.000040502357,0.0001828724,0.003729868],"genre_scores_gemma":[1.08254916e-7,0.94171077,0.0030981055,0.00047548086,0.0012119856,0.0026345795,0.000061867795,0.00021563974,0.050591435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933401,0.0030856822,0.0015613305,0.0012618339,0.00027019106,0.00048088757],"domain_scores_gemma":[0.99543095,0.0018094634,0.0007436148,0.0017547021,0.00010292695,0.00015836876],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0070286533,0.0009265275,0.0031481723,0.00016500725,0.00014225539,0.00014634314,0.0007231162,0.00026737072,0.001162408],"category_scores_gemma":[0.0023142828,0.0005388937,0.0013235084,0.00056449574,0.000065352295,0.00003762095,0.00021696073,0.00080322096,0.0012848988],"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.000005593734,0.0000186102,5.624629e-9,0.09037754,0.00019231922,0.000002264122,0.00004697769,2.4563974e-7,0.0000015252422,0.00010232873,0.43687823,0.47237435],"study_design_scores_gemma":[0.00005746605,0.00007621432,2.951507e-8,0.13544273,0.0037107274,0.00006965974,0.0000038719013,0.000004226953,0.0000023625068,0.00018508396,0.86,0.0004476102],"about_ca_topic_score_codex":0.000010527556,"about_ca_topic_score_gemma":0.0000010722712,"teacher_disagreement_score":0.47192675,"about_ca_system_score_codex":0.00024595181,"about_ca_system_score_gemma":0.00009528442,"threshold_uncertainty_score":0.9997507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400787,0.000104685685,0.5560437,0.00007808286,0.0005050593,0.0010056323,0.00044362684,0.00020667427,0.0015338358],"genre_scores_gemma":[0.92270684,0.00009661272,0.06543747,0.000050090446,0.00020851726,0.000033112257,0.00021343405,0.000106962405,0.011146988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968596,0.000183651,0.00056993525,0.0016457626,0.00018368171,0.0005573549],"domain_scores_gemma":[0.9968681,0.0006677261,0.00032523932,0.0016015654,0.0002599886,0.0002774355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007953798,0.00070321496,0.0012739204,0.0008202295,0.00016741297,0.00013966332,0.00080118683,0.0006789796,0.000051408348],"category_scores_gemma":[0.00021101726,0.0007626242,0.0015336871,0.0008676448,0.000099562574,0.00010368939,0.0011518091,0.00076904724,0.0000021566577],"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.00069387344,0.00053979596,0.007342256,0.002996738,0.015450088,0.00081199966,0.0026937628,0.8634971,0.0000790432,0.0974861,0.005548716,0.0028605228],"study_design_scores_gemma":[0.00049200386,0.000051823008,0.0005245979,0.00024758876,0.007939114,0.0000011668365,0.00037328654,0.92642355,0.000026602947,0.06305175,0.00014658073,0.00072191615],"about_ca_topic_score_codex":0.0008116916,"about_ca_topic_score_gemma":0.0013007385,"teacher_disagreement_score":0.49060625,"about_ca_system_score_codex":0.0005325497,"about_ca_system_score_gemma":0.0001995128,"threshold_uncertainty_score":0.99948245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644621,0.00611214,0.0030628815,0.012755106,0.00024213544,0.0015688675,0.00005378824,0.00032492523,0.011418084],"genre_scores_gemma":[0.9452684,0.00019228716,0.05396592,0.000037629416,0.000023198632,0.00017470053,0.000019598396,0.000024147253,0.0002941185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774724,0.00073377904,0.0005859635,0.00033537467,0.00025794457,0.00033967485],"domain_scores_gemma":[0.99490494,0.0023171185,0.00009470143,0.002521861,0.00011737677,0.000043997723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025332384,0.0001687335,0.0003348325,0.0001545499,0.00009187704,0.000023815532,0.00075949304,0.000109757115,0.00006257518],"category_scores_gemma":[0.0009282469,0.0001584482,0.00013926368,0.00047485996,0.00022479649,0.000075538424,0.00033493806,0.00073987636,9.680899e-7],"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.0000427421,0.0008201593,0.0001207638,0.0002164639,0.00005078552,4.612153e-7,0.00032323133,0.00005940714,0.00075311074,0.97371846,0.00034006327,0.023554347],"study_design_scores_gemma":[0.00045473184,0.00039334924,0.0007240244,0.00048754565,0.000063297804,0.0000055696296,0.00006472722,0.0076313703,0.002613193,0.9733767,0.01388629,0.0002992042],"about_ca_topic_score_codex":0.00012289696,"about_ca_topic_score_gemma":0.0017379872,"teacher_disagreement_score":0.050903037,"about_ca_system_score_codex":0.0005173085,"about_ca_system_score_gemma":0.0003502705,"threshold_uncertainty_score":0.646133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631555,0.0027964879,0.015958438,0.0124826925,0.0008795359,0.00074972736,0.000017589085,0.000120197896,0.0038398486],"genre_scores_gemma":[0.9893486,0.00017665191,0.008104906,0.00018500748,0.0004070913,0.00001427189,0.0000014592546,0.000039569342,0.00172246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971026,0.0006149269,0.0007920034,0.0003065297,0.0005640459,0.0006198944],"domain_scores_gemma":[0.99773955,0.0011872168,0.000246834,0.00047565214,0.00020268903,0.00014803554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069722636,0.00025075983,0.00060666044,0.00014490697,0.00008037236,0.00007576593,0.00032150015,0.00013599076,0.00007975305],"category_scores_gemma":[0.0017876596,0.00017572081,0.0005177556,0.00023019676,0.0000881,0.00010475361,0.00004006507,0.001046129,2.0983902e-7],"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.0030096385,0.00083648885,0.000072401934,0.00088524295,0.0009835091,0.00017007794,0.0027383862,0.000117247706,0.019841326,0.88316184,0.012788414,0.07539542],"study_design_scores_gemma":[0.00443423,0.0026635544,0.00012911092,0.00055811787,0.0004779929,0.00042174663,0.00021669491,0.00097443874,0.024500946,0.88137925,0.08365875,0.00058515905],"about_ca_topic_score_codex":0.000015268555,"about_ca_topic_score_gemma":0.00033118878,"teacher_disagreement_score":0.07481026,"about_ca_system_score_codex":0.00078703515,"about_ca_system_score_gemma":0.0007895932,"threshold_uncertainty_score":0.71656865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4611863,0.000039456565,0.53696173,0.0007056551,0.0006287851,0.00015099479,0.000023309796,0.00003755811,0.00026622653],"genre_scores_gemma":[0.941597,0.000007918645,0.057267983,0.00011306409,0.00026239597,0.0000013191025,0.0000015047231,0.000024244395,0.0007246043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808645,0.0004485813,0.0005867402,0.00012228884,0.00055992213,0.00019604225],"domain_scores_gemma":[0.994156,0.0044592503,0.0008748882,0.00014103734,0.00029218406,0.000076615484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938622,0.00013357839,0.00040001734,0.0001033516,0.000107234126,0.00009424909,0.00015321428,0.00004968281,0.000035267465],"category_scores_gemma":[0.0038439748,0.00008806406,0.00017887975,0.00046533512,0.000049253016,0.00015105952,0.000044579476,0.00033527237,8.276581e-7],"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.00053204305,0.0010000766,0.015024657,0.0015885666,0.005381219,0.0003715295,0.014977134,0.12362099,0.07063765,0.039941844,0.117917515,0.60900676],"study_design_scores_gemma":[0.00028970555,0.00020779151,0.0024956416,0.00020969598,0.0003169327,0.000013308722,0.00021419702,0.97930884,0.0009572898,0.014672479,0.0011489912,0.00016511073],"about_ca_topic_score_codex":0.00002248359,"about_ca_topic_score_gemma":0.0000064184123,"teacher_disagreement_score":0.85568786,"about_ca_system_score_codex":0.00079405715,"about_ca_system_score_gemma":0.00010086597,"threshold_uncertainty_score":0.46018746},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016972618,0.0014832513,0.0008849209,0.0020843232,0.001089109,0.0015915176,0.00017736587,0.000529098,0.9919907],"genre_scores_gemma":[0.0012184193,0.0010747534,0.047341958,0.000273434,0.00044516963,0.000099793295,0.000023875546,0.00069473765,0.94882786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496853,0.00008556333,0.0017102103,0.0011664652,0.0012215609,0.00084768265],"domain_scores_gemma":[0.99500686,0.0019080316,0.0006748907,0.001994819,0.00014747304,0.00026792067],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0016754518,0.0014473024,0.0019068967,0.001005579,0.00011075228,0.00017322335,0.000808321,0.0010431248,0.00014963883],"category_scores_gemma":[0.00054657756,0.0012618823,0.0007555269,0.0001783861,0.000250101,0.00007641263,0.0004235507,0.0019365045,0.00003712554],"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.000026400927,0.00019041933,9.603028e-7,0.0040990366,0.00028242634,0.0006051862,0.0014028178,0.000034324425,0.000006257909,0.9563749,0.033253018,0.0037242605],"study_design_scores_gemma":[0.00049739855,0.00013834002,1.9147525e-7,0.0049632774,0.0003136447,0.00008451564,0.00021412835,0.0059900833,0.000021334316,0.8970908,0.08952718,0.001159104],"about_ca_topic_score_codex":0.00001225296,"about_ca_topic_score_gemma":0.00019500984,"teacher_disagreement_score":0.059284095,"about_ca_system_score_codex":0.00061799,"about_ca_system_score_gemma":0.00014201952,"threshold_uncertainty_score":0.9998277},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31379122,0.00040707138,0.6831603,0.0003665574,0.0018559169,0.00022030689,0.0000069371345,0.000025856823,0.00016582379],"genre_scores_gemma":[0.33825022,0.0000018273093,0.66132426,0.000019399693,0.00013309864,0.0000028115003,0.0000023321406,0.000015556307,0.0002504483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812496,0.0002761639,0.0009299335,0.0001939296,0.00029540286,0.00017960962],"domain_scores_gemma":[0.9957134,0.0024344504,0.0007518581,0.0002093586,0.0008199792,0.00007092984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009111468,0.00011520277,0.0003372323,0.00046652288,0.00019677017,0.00017883384,0.00019024244,0.00006170827,0.0000036866527],"category_scores_gemma":[0.0022775428,0.00009581456,0.00030285274,0.0006276414,0.000099397854,0.00017522315,0.000032832082,0.00017219648,4.1240924e-8],"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.0001268851,0.00047983325,0.00048456082,0.0040497733,0.00036477516,0.000012251382,0.0111853825,0.007236593,0.14939176,0.13441336,0.020481044,0.6717738],"study_design_scores_gemma":[0.00046908643,0.000101568796,0.000059205147,0.0006895965,0.0001547668,0.000030281966,0.0004897773,0.9633389,0.01073386,0.010376512,0.013433763,0.00012265587],"about_ca_topic_score_codex":0.0000064086635,"about_ca_topic_score_gemma":0.0000063453012,"teacher_disagreement_score":0.9561023,"about_ca_system_score_codex":0.00008693711,"about_ca_system_score_gemma":0.00020676623,"threshold_uncertainty_score":0.39072046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7481944,0.003678088,0.15313637,0.0022276004,0.059073653,0.0010779648,0.000047446127,0.00029203,0.032272443],"genre_scores_gemma":[0.9349344,0.00013785997,0.048441984,0.00007714884,0.00840354,0.000023551363,0.0000027089004,0.00013190963,0.007846919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983348,0.0002511603,0.00064810144,0.00016292254,0.00032596465,0.00027701753],"domain_scores_gemma":[0.9976702,0.0014524431,0.0002449576,0.00022742976,0.00027700662,0.00012800228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030227678,0.00022208085,0.00055575045,0.00018023039,0.00008660098,0.0003023259,0.00031958564,0.00012177914,0.00007332799],"category_scores_gemma":[0.0012158221,0.00016673788,0.0005366705,0.00019412697,0.00009180019,0.0006685192,0.000040997722,0.00035023215,1.5335326e-7],"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.000955882,0.000089296744,0.0000072372045,0.0002011484,0.0002567773,0.00012418607,0.0006194591,0.0000011520397,0.003008403,0.9893874,0.0031786875,0.002170393],"study_design_scores_gemma":[0.0009014556,0.0007589829,0.000007512028,0.00016894873,0.0001754169,0.00023308881,0.000623299,0.00002318557,0.011553974,0.92378783,0.061580006,0.00018629496],"about_ca_topic_score_codex":0.0000010415873,"about_ca_topic_score_gemma":0.0000024476483,"teacher_disagreement_score":0.18673997,"about_ca_system_score_codex":0.00008805387,"about_ca_system_score_gemma":0.00017344709,"threshold_uncertainty_score":0.67993736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9145839,0.00022023212,0.07278749,0.007904499,0.0005113399,0.00038003948,0.000056569996,0.00014553212,0.003410353],"genre_scores_gemma":[0.9687338,0.000071699484,0.02107838,0.00017674528,0.00034807122,0.00029323544,0.0000492804,0.000042417265,0.009206363],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981857,0.00027592407,0.0002357706,0.00035460046,0.000551058,0.0003969649],"domain_scores_gemma":[0.9990827,0.0003656173,0.0000058164783,0.0002938845,0.00012336618,0.00012863579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748415,0.00012286306,0.0001335474,0.00027607943,0.0005733195,0.00024780055,0.00021432394,0.000062862215,0.00029991372],"category_scores_gemma":[0.00025471151,0.000105173334,0.0000913845,0.0006463968,0.00010249616,0.00031471666,0.00005067692,0.0005311432,0.000006812933],"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.000019361029,0.00014353349,0.0001726476,0.00020814325,0.00018553667,0.00008802031,0.0032538453,0.0022313967,0.736622,0.022257157,0.22653395,0.008284448],"study_design_scores_gemma":[0.0017674443,0.0010303843,0.00041699648,0.0013787972,0.0003255776,0.00009204366,0.013044027,0.1930349,0.10615416,0.0010298858,0.6789113,0.0028144736],"about_ca_topic_score_codex":0.0002928344,"about_ca_topic_score_gemma":0.00020541807,"teacher_disagreement_score":0.6304678,"about_ca_system_score_codex":0.00009935661,"about_ca_system_score_gemma":0.000112135254,"threshold_uncertainty_score":0.44095677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3425715,0.00022772978,0.6497273,0.00041950823,0.0002122785,0.00034837585,0.0006726777,0.00010277492,0.005717894],"genre_scores_gemma":[0.5052271,0.000006116673,0.49403605,0.00003303222,0.0000503983,0.000021691927,0.000103285936,0.00002550979,0.0004967992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981989,0.00008216739,0.00082755537,0.000245233,0.0005023801,0.0001437663],"domain_scores_gemma":[0.9955632,0.0032989301,0.00022748427,0.00040481554,0.000423082,0.000082478466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583593,0.00017558837,0.00060398725,0.000733947,0.000049416332,0.000054478416,0.00025186516,0.00007248392,0.00016739426],"category_scores_gemma":[0.0007324368,0.00016333465,0.0003385922,0.0013360963,0.00006461131,0.00010053262,0.00009242457,0.00009530959,0.0000026615312],"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.00002909951,0.00078682014,0.0004930455,0.0018013397,0.006289883,0.000010916957,0.014286203,0.14661586,0.0009065968,0.811999,0.008560341,0.008220858],"study_design_scores_gemma":[0.00024161366,0.00008292525,0.0010123731,0.00041809474,0.0025330845,0.0000030764281,0.0008980127,0.65172946,0.00029516546,0.34005743,0.0024136351,0.0003151254],"about_ca_topic_score_codex":0.00009345923,"about_ca_topic_score_gemma":0.000120859695,"teacher_disagreement_score":0.5051136,"about_ca_system_score_codex":0.000060451148,"about_ca_system_score_gemma":0.00011913803,"threshold_uncertainty_score":0.6660594},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004793204,0.022942735,0.0029860316,0.00019276385,0.0009464741,0.00047067163,0.00023500947,0.00013726395,0.9672958],"genre_scores_gemma":[0.02848727,0.00436354,0.022037445,0.00021657885,0.0018573031,0.00015609864,0.00013007931,0.0002601071,0.9424916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832433,0.000041692932,0.0005537512,0.00048393235,0.00035832377,0.00023794215],"domain_scores_gemma":[0.9979074,0.0011155928,0.00032475212,0.0005122241,0.000066376735,0.00007366151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001813942,0.0004001351,0.00043593644,0.00004126327,0.00009741276,0.000052312484,0.00028713932,0.0003700633,0.000099322344],"category_scores_gemma":[0.0003717491,0.00028780452,0.00013641738,0.000040897132,0.00026331423,0.00012806627,0.0002661288,0.0009694304,5.2732383e-7],"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.000033771492,0.000012928253,0.0000072617972,0.0013145695,0.00004738336,0.00004932947,0.00040468315,0.0000070066058,0.00019133293,0.9960889,0.00010066004,0.0017421556],"study_design_scores_gemma":[0.00018167136,0.000012205288,0.0000017390629,0.00055302854,0.000092017915,0.000109123226,0.00016689928,0.0014347023,0.00069365103,0.84167856,0.15473202,0.0003444038],"about_ca_topic_score_codex":0.0000017030147,"about_ca_topic_score_gemma":0.000011929266,"teacher_disagreement_score":0.15463136,"about_ca_system_score_codex":0.000101665144,"about_ca_system_score_gemma":0.000095244046,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010443445,0.0008132611,0.987784,0.00020416953,0.0008051383,0.00024719693,0.00002914466,0.000060644496,0.009951982],"genre_scores_gemma":[0.025151966,0.000027351216,0.97167945,0.0002280301,0.00048360266,0.000009245616,0.000008066894,0.000059425896,0.002352882],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736965,0.00007442287,0.0006361919,0.00089214643,0.0006088772,0.0004186945],"domain_scores_gemma":[0.99620813,0.0021636365,0.00029784153,0.0009966254,0.00019706995,0.00013672459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024255356,0.0004232462,0.0011063592,0.0032918814,0.00006423672,0.00009159521,0.0008486384,0.000270797,0.00003641276],"category_scores_gemma":[0.0006807223,0.00033616307,0.0004675714,0.0019045691,0.00043473387,0.000052095376,0.00057120796,0.00055853056,2.94596e-7],"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.0000141381115,0.00004671755,0.000010497994,0.00039230374,0.0007281227,0.000042860986,0.002651545,0.034830328,0.00022654954,0.40902206,0.000041911142,0.55199295],"study_design_scores_gemma":[0.00009853454,0.00009304645,0.0000065566787,0.00035247148,0.0007641613,0.000012637591,8.275475e-7,0.4714804,0.0002727714,0.52608067,0.00044784302,0.00039011164],"about_ca_topic_score_codex":0.000035270416,"about_ca_topic_score_gemma":0.00014362292,"teacher_disagreement_score":0.55160284,"about_ca_system_score_codex":0.00019048052,"about_ca_system_score_gemma":0.00030123338,"threshold_uncertainty_score":0.99990904},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6383933e-7,0.6631416,0.3316488,0.000013912489,0.0010446163,0.0010771152,0.0025381858,0.000053535096,0.00048198065],"genre_scores_gemma":[4.5398608e-7,0.6459813,0.35178968,0.000014642209,0.0002747405,0.00017464251,0.000746322,0.000112579866,0.0009056544],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938467,0.0008899839,0.0033474255,0.0008535527,0.00061432814,0.00044801025],"domain_scores_gemma":[0.99328786,0.0035421236,0.00193868,0.000599171,0.00042054476,0.00021163422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018190854,0.0009966507,0.0044716564,0.00044775326,0.00015606506,0.000085923246,0.00075640867,0.00029430853,0.00021573792],"category_scores_gemma":[0.0010606202,0.0007307596,0.001186545,0.0008136293,0.00032324428,0.000093972754,0.0012607377,0.00078246766,0.000026945474],"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.000005034955,0.000107145206,6.286256e-7,0.09799841,0.0003843146,0.00005597665,0.00023255659,0.0000076005485,9.188539e-8,0.050901767,0.13753925,0.71276724],"study_design_scores_gemma":[0.00011490755,0.00018195907,1.5334442e-7,0.0602179,0.0031104428,0.00013513975,0.00007524601,0.005317253,3.044061e-7,0.08951295,0.8406078,0.00072594936],"about_ca_topic_score_codex":0.000007300749,"about_ca_topic_score_gemma":0.000008302958,"teacher_disagreement_score":0.71204126,"about_ca_system_score_codex":0.00026581928,"about_ca_system_score_gemma":0.0003658591,"threshold_uncertainty_score":0.99951434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84513104,0.00009847027,0.018797295,0.0006337412,0.0017521301,0.0013082995,0.000008418228,0.00033346337,0.13193716],"genre_scores_gemma":[0.9595188,0.0000025350396,0.012660004,0.00026049092,0.00049931486,0.00007354582,0.0000047420817,0.00005416665,0.026926393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986242,0.0002123625,0.00030757367,0.0002841915,0.00025928157,0.00031237837],"domain_scores_gemma":[0.99870783,0.00035062333,0.00013999565,0.00065210706,0.00008172625,0.00006769544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008901129,0.00018749786,0.00024138225,0.000059490725,0.00010932497,0.00007267154,0.00025733485,0.00011272122,0.00013304288],"category_scores_gemma":[0.000011247535,0.00012780554,0.00015459492,0.00016674989,0.000026305275,0.00011198587,0.00002261025,0.0002425773,0.0000151804215],"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.00037228785,0.0007018706,0.0055139815,0.0009960589,0.00038753747,0.000032010743,0.027108006,0.000016853202,0.044130187,0.2869908,0.093964614,0.5397858],"study_design_scores_gemma":[0.0037899993,0.0034053004,0.0014993179,0.0002295001,0.00023088207,0.00023963275,0.01264667,0.0052189217,0.00103819,0.27076757,0.6992992,0.0016348212],"about_ca_topic_score_codex":0.000055085675,"about_ca_topic_score_gemma":0.00021015665,"teacher_disagreement_score":0.6053346,"about_ca_system_score_codex":0.00005017975,"about_ca_system_score_gemma":0.00003207811,"threshold_uncertainty_score":0.5211759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035412994,0.0013034852,0.9869872,0.00082486594,0.0022128944,0.0006324334,0.00046750833,0.00031019608,0.0037201324],"genre_scores_gemma":[0.1403813,0.00017497817,0.8542029,0.0006717634,0.0016158314,0.00006060937,0.00007724216,0.00013352955,0.0026817855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959629,0.00008452241,0.0007859504,0.0016639835,0.0006871457,0.0008154651],"domain_scores_gemma":[0.9957796,0.0024334234,0.00028217144,0.0010600238,0.00018673163,0.00025809903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013914065,0.000766414,0.0010153513,0.00048670865,0.00029579055,0.00038312902,0.0013692472,0.000674519,0.00010686564],"category_scores_gemma":[0.0007056758,0.00061347324,0.00034775393,0.0005114357,0.0006366126,0.00012045601,0.001081059,0.001342935,0.0000037522268],"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.00009020743,0.0002225071,0.00028713042,0.0006891574,0.00035278362,0.00046660219,0.00258296,0.004302081,0.0059486004,0.7209306,0.0006021145,0.26352525],"study_design_scores_gemma":[0.00033112176,0.00016985169,0.00008208776,0.0016558925,0.00012904622,0.000043808857,0.0000019759063,0.12276934,0.0011954231,0.86495936,0.007347332,0.0013147666],"about_ca_topic_score_codex":0.00014861092,"about_ca_topic_score_gemma":0.0006068702,"teacher_disagreement_score":0.2622105,"about_ca_system_score_codex":0.0004828133,"about_ca_system_score_gemma":0.00031917627,"threshold_uncertainty_score":0.99963164},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028864622,0.0003677847,0.3094424,0.00037614608,0.00059661083,0.0019985642,0.0062591806,0.00012425525,0.6808322],"genre_scores_gemma":[0.00001979597,0.00033647986,0.27210736,0.00009225651,0.00038702402,0.00016048203,0.0001925394,0.00015445452,0.7265496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975645,0.00008240381,0.0010326636,0.0006282117,0.00040568167,0.00028655946],"domain_scores_gemma":[0.993979,0.004726709,0.00041137246,0.000561618,0.00014627267,0.00017505354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027019714,0.00055171264,0.0012613361,0.00024308395,0.00012155883,0.00017919249,0.00016584918,0.0004179918,0.0004228347],"category_scores_gemma":[0.0012390747,0.00041374855,0.0003440125,0.00001935941,0.00008875949,0.000034035937,0.00013403526,0.00037628037,0.000001691788],"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.000063983505,0.000015765974,1.1934621e-7,0.0011974227,0.00030789565,0.000009050139,0.00010068996,3.771309e-7,0.000009059335,0.92243916,0.05321153,0.022644974],"study_design_scores_gemma":[0.00049337663,0.00018748874,9.454756e-8,0.000395122,0.000710327,0.000008363339,0.00005689864,0.0008443078,0.000045999062,0.7139091,0.28291366,0.0004352989],"about_ca_topic_score_codex":0.00000937261,"about_ca_topic_score_gemma":0.00012933598,"teacher_disagreement_score":0.22970212,"about_ca_system_score_codex":0.00011187994,"about_ca_system_score_gemma":0.00008133006,"threshold_uncertainty_score":0.99983144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8543346,0.00015379715,0.12623468,0.00016460978,0.0007597965,0.0009861826,0.00011089143,0.0005910711,0.016664363],"genre_scores_gemma":[0.99068785,0.00008639935,0.0017436552,0.00005858017,0.00009496533,0.000009834775,0.000056405373,0.00008392242,0.0071784058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979762,0.0002102343,0.00026858062,0.0010323724,0.00019813533,0.00031449212],"domain_scores_gemma":[0.9983655,0.00022420328,0.00024905152,0.0008341789,0.00016020633,0.00016686687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005086463,0.00046464693,0.00048614244,0.0002687624,0.00011367108,0.00008790053,0.0004960319,0.0004829682,0.000035288234],"category_scores_gemma":[0.00026127484,0.00046290125,0.00029234434,0.0003416962,0.00004280407,0.000075809534,0.00064847636,0.00090140407,0.0000052118994],"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.0011743187,0.0019060324,0.00027372208,0.011798482,0.0010652838,0.0017039198,0.006606867,0.02552348,0.00179383,0.88296807,0.053278,0.011907979],"study_design_scores_gemma":[0.0009568409,0.00016409578,0.000008386755,0.0021503891,0.0006810054,0.0000071830423,0.00088825624,0.42820078,0.0013635722,0.5638785,0.00068581244,0.0010151827],"about_ca_topic_score_codex":0.000033723758,"about_ca_topic_score_gemma":0.0000266697,"teacher_disagreement_score":0.4026773,"about_ca_system_score_codex":0.00028129155,"about_ca_system_score_gemma":0.00011590546,"threshold_uncertainty_score":0.99978226},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059084992,0.0065752864,0.17707722,0.00077210885,0.0014163682,0.0013172743,0.00017449007,0.00043051146,0.81217766],"genre_scores_gemma":[0.002315518,0.0020067561,0.31672516,0.0003602049,0.0014773977,0.00010319222,0.00006986934,0.0009779535,0.67596394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963569,0.000050549264,0.0012990028,0.00082591147,0.0008112844,0.0006563689],"domain_scores_gemma":[0.99445707,0.0033422525,0.00047848903,0.0013816067,0.00016681461,0.00017379392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015607595,0.0011100116,0.0016700791,0.00060291664,0.000083854204,0.00013250881,0.0006394835,0.0012871531,0.000538131],"category_scores_gemma":[0.0013776413,0.0009107396,0.0006949049,0.00014295126,0.00017827805,0.000048083682,0.0002933349,0.0018928857,0.000015740528],"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.000025211717,0.00011885567,0.000001728598,0.008837047,0.0003320612,0.00054202613,0.0028025552,0.0000333457,0.00011697799,0.9708372,0.0036217684,0.012731268],"study_design_scores_gemma":[0.00031278402,0.0000625317,1.2248942e-7,0.0036379322,0.00039363364,0.00014992118,0.000027522367,0.0054919715,0.0001241548,0.9288576,0.05997231,0.00096947385],"about_ca_topic_score_codex":0.000003645233,"about_ca_topic_score_gemma":0.0001995806,"teacher_disagreement_score":0.13964795,"about_ca_system_score_codex":0.00032126016,"about_ca_system_score_gemma":0.00015673865,"threshold_uncertainty_score":0.99933434},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030124416,0.00271752,0.714123,0.00030228938,0.00089157297,0.00087907386,0.000068371024,0.00023503053,0.28075305],"genre_scores_gemma":[0.021162316,0.0007719339,0.5142142,0.00033660693,0.0020707303,0.00019351444,0.00016609512,0.0012919131,0.4597927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973123,0.00003512099,0.0010416001,0.00059531414,0.00061002775,0.00040563024],"domain_scores_gemma":[0.99547225,0.0029684922,0.0003953158,0.00088757527,0.00017020694,0.00010616029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010567602,0.0008152401,0.0011801213,0.0004943648,0.000061002585,0.00011626995,0.00039131514,0.0009297219,0.00026381735],"category_scores_gemma":[0.0017813408,0.0006433151,0.00043582794,0.000109105866,0.00012164729,0.000048333288,0.0001449238,0.0015218671,0.000012132616],"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.000019542547,0.00007824228,1.4656219e-7,0.003505184,0.00016935721,0.00012632493,0.0032274686,0.00026621413,0.00018422976,0.9768627,0.0010985304,0.014462031],"study_design_scores_gemma":[0.00020881074,0.00005882715,3.7825213e-8,0.004166198,0.00035583737,0.00008984412,0.000033400294,0.017674116,0.0001180658,0.9718762,0.0047707083,0.0006479408],"about_ca_topic_score_codex":0.000003044883,"about_ca_topic_score_gemma":0.0002000255,"teacher_disagreement_score":0.1999088,"about_ca_system_score_codex":0.0002815564,"about_ca_system_score_gemma":0.00011651735,"threshold_uncertainty_score":0.99960184},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062252097,0.047267057,0.11551567,0.0030532985,0.0037313802,0.0072409245,0.0011607365,0.0014136984,0.81439203],"genre_scores_gemma":[0.033367276,0.009016395,0.31448725,0.000708226,0.0019222322,0.00035888507,0.000088844106,0.00164529,0.6384056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948233,0.00012012204,0.0017423329,0.0013135677,0.0009949484,0.0010057238],"domain_scores_gemma":[0.9938307,0.003236481,0.0007514963,0.001619123,0.0002390453,0.0003231809],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0022963688,0.001671074,0.002600608,0.00078519713,0.00024307634,0.00019724613,0.0007130723,0.0016093306,0.0002602324],"category_scores_gemma":[0.0014972556,0.0014004076,0.00066739536,0.00022563514,0.0003476933,0.000094257186,0.00067886675,0.002246594,0.000003916334],"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.0004131666,0.0007631438,0.00014756761,0.047629777,0.0027091803,0.0028182603,0.023345407,0.00022160019,0.00089899806,0.8446921,0.01295714,0.06340364],"study_design_scores_gemma":[0.0016567525,0.0003033341,0.0000044145577,0.008682078,0.001247099,0.0005087585,0.0001510207,0.061000347,0.0001568596,0.88175285,0.041698523,0.0028379883],"about_ca_topic_score_codex":0.00001202919,"about_ca_topic_score_gemma":0.00065102935,"teacher_disagreement_score":0.19897158,"about_ca_system_score_codex":0.00034664606,"about_ca_system_score_gemma":0.00018012697,"threshold_uncertainty_score":0.9996868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14529523,0.00052483357,0.84379107,0.001647847,0.005431058,0.0018450296,0.00051107776,0.00047474488,0.0004791033],"genre_scores_gemma":[0.99257934,0.000003328174,0.002729802,0.0011540339,0.001998032,0.0005748462,0.000037682577,0.00011131905,0.00081163074],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740595,0.00037475917,0.000660658,0.00059130264,0.00036988358,0.00059746136],"domain_scores_gemma":[0.9980591,0.0009449848,0.00013692027,0.0005732182,0.00006897459,0.00021679793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014166302,0.00038267623,0.00067609234,0.00018628831,0.00013141721,0.0004182115,0.0002980617,0.00017153322,0.0000048632346],"category_scores_gemma":[0.000038187616,0.0003302648,0.0002718873,0.000101534264,0.00005599143,0.0003479523,0.000011415041,0.00022786665,0.0000021876717],"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.000684573,0.00040624506,0.00011123058,0.0057533453,0.0019353655,0.0006770014,0.0067050294,0.011664252,0.47069353,0.09068038,0.40170848,0.008980549],"study_design_scores_gemma":[0.004510059,0.00063723844,0.0000034381305,0.0006722216,0.0004271535,0.00022327756,0.00096315285,0.9369696,0.0005705426,0.001831682,0.052095886,0.0010957434],"about_ca_topic_score_codex":0.0001734575,"about_ca_topic_score_gemma":0.000046885012,"teacher_disagreement_score":0.92530537,"about_ca_system_score_codex":0.00019715448,"about_ca_system_score_gemma":0.00005218967,"threshold_uncertainty_score":0.99991494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.806517,0.0011026958,0.116881974,0.0005032008,0.0044990117,0.0020179974,0.00089992234,0.0014106899,0.06616751],"genre_scores_gemma":[0.9443224,0.00037517803,0.007882547,0.00012592692,0.00045928374,0.000008677582,0.000039849183,0.00018934689,0.046596795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996205,0.0005353202,0.00052147906,0.0016952851,0.00025713025,0.0007858122],"domain_scores_gemma":[0.9951587,0.00066517305,0.00041628047,0.0030564573,0.0002797866,0.00042362936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013678013,0.000848973,0.0010559959,0.0005945908,0.00018611533,0.0001464291,0.0019396993,0.0008600638,0.00014471285],"category_scores_gemma":[0.0005628257,0.0009102446,0.00080739055,0.00063744327,0.0002448589,0.000098296405,0.005722274,0.0019779378,0.000007376316],"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.0013034637,0.0010928147,0.0027894813,0.011007668,0.0042447983,0.017234651,0.00551676,0.01926454,0.00089097465,0.6556161,0.27346298,0.0075757764],"study_design_scores_gemma":[0.002066999,0.00022213656,0.00010232171,0.0014193312,0.0016316425,0.000054382203,0.00094719714,0.41746753,0.00025431864,0.5611165,0.01221754,0.002500095],"about_ca_topic_score_codex":0.0006368742,"about_ca_topic_score_gemma":0.0006825457,"teacher_disagreement_score":0.398203,"about_ca_system_score_codex":0.0005099557,"about_ca_system_score_gemma":0.00025612937,"threshold_uncertainty_score":0.9993348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65152293,0.00006900047,0.34053415,0.00009032864,0.0014925586,0.0014203556,0.00017167414,0.00013328884,0.004565725],"genre_scores_gemma":[0.9253836,0.000021062002,0.05886686,0.00010648438,0.00050810707,0.000009403068,0.000023436285,0.00010549793,0.014975523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980761,0.000092808616,0.00034038213,0.0009821514,0.00009357067,0.0004150126],"domain_scores_gemma":[0.9981696,0.00041355644,0.00020362901,0.00079536566,0.0002008302,0.00021702336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008131445,0.00041358313,0.00056449935,0.00038135546,0.00016322467,0.00015651585,0.0004114904,0.0005030699,0.00004805887],"category_scores_gemma":[0.00025854007,0.0004711951,0.00050177186,0.00030837292,0.000057083842,0.0000822996,0.00084678596,0.00047653102,0.0000017992294],"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.0011985248,0.00053908926,0.000410827,0.005217687,0.0013131443,0.00048865384,0.0034863444,0.0476567,0.016277015,0.8863208,0.03414921,0.0029419828],"study_design_scores_gemma":[0.0016888925,0.0003654646,0.00010348518,0.0015234709,0.002343516,0.000017261034,0.0010636137,0.31293285,0.0022805217,0.6496999,0.025531221,0.002449738],"about_ca_topic_score_codex":0.0000926164,"about_ca_topic_score_gemma":0.000101875274,"teacher_disagreement_score":0.2816673,"about_ca_system_score_codex":0.0004807998,"about_ca_system_score_gemma":0.00028216772,"threshold_uncertainty_score":0.999774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026351234,0.00018928316,0.9673635,0.0003146726,0.00019667526,0.0014315023,0.0013705388,0.0001794776,0.0026031218],"genre_scores_gemma":[0.18258737,0.00003592285,0.8134992,0.0001822506,0.00013513055,0.00040938938,0.00007994927,0.000116786185,0.0029540106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984656,0.00014452316,0.0004990175,0.00034024194,0.00029872375,0.00025189828],"domain_scores_gemma":[0.9909784,0.00812065,0.0001686658,0.00043891813,0.00019125405,0.000102102764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014071655,0.00023801716,0.0004412274,0.00015339823,0.000090136986,0.000076543976,0.00012040166,0.00008867826,0.000043755466],"category_scores_gemma":[0.0026617122,0.00019546588,0.00013864986,0.00014991449,0.00017126735,0.00009867026,0.000036852358,0.000119466466,1.4982902e-7],"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.00010260493,0.00063581724,0.0000020649961,0.0067951656,0.00008050288,0.0000075773687,0.007820041,0.000038228794,0.0005574229,0.9765153,0.0032712393,0.004174046],"study_design_scores_gemma":[0.0004070062,0.00082899915,0.0000019938036,0.0013146196,0.000101355225,0.000012364655,0.0032540937,0.14389631,0.0017328488,0.84566045,0.0025317194,0.00025821195],"about_ca_topic_score_codex":0.000010856066,"about_ca_topic_score_gemma":0.00003768142,"teacher_disagreement_score":0.15623613,"about_ca_system_score_codex":0.00006299418,"about_ca_system_score_gemma":0.00010641576,"threshold_uncertainty_score":0.7970867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3932236,0.000109424494,0.5971832,0.000083861814,0.0011161644,0.001715057,0.00028847062,0.00016743602,0.006112722],"genre_scores_gemma":[0.97211635,0.00015922586,0.021644793,0.000026211188,0.000120682125,0.000015480924,0.000055522956,0.00006275049,0.0057989885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982895,0.00014480985,0.00037236852,0.00075370393,0.00014790428,0.00029169477],"domain_scores_gemma":[0.998038,0.00056343595,0.00031916247,0.000699525,0.00027265065,0.00010723693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010338692,0.00035371148,0.0006087162,0.00033528436,0.00009476068,0.000025209349,0.00044360248,0.00038988734,0.00001744289],"category_scores_gemma":[0.000106832325,0.00035282265,0.0005114368,0.00029220045,0.00015428208,0.0000478222,0.00044121788,0.00051351753,6.2552374e-7],"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.00075270433,0.00026902507,0.00015697368,0.004407453,0.000616232,0.000038027156,0.0004407377,0.1267145,0.000086371816,0.86236125,0.0012472793,0.002909471],"study_design_scores_gemma":[0.0015588228,0.00019349296,0.000029014263,0.00064298307,0.00035934232,0.0000022744441,0.000067828965,0.6601223,0.00031930907,0.33560014,0.00076361216,0.00034089995],"about_ca_topic_score_codex":0.000029509707,"about_ca_topic_score_gemma":0.000019918678,"teacher_disagreement_score":0.5788927,"about_ca_system_score_codex":0.00016615765,"about_ca_system_score_gemma":0.00019824781,"threshold_uncertainty_score":0.99989235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6488818,0.00012675048,0.34348267,0.00045395573,0.00014653229,0.0007878596,0.000031176052,0.000015479824,0.0060737752],"genre_scores_gemma":[0.8147395,0.000020352985,0.18491834,0.000067231405,0.000042492557,0.00003868915,0.0000016700014,0.000009794163,0.00016193138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980287,0.00013478886,0.0011171104,0.00022080202,0.00031428668,0.00018428928],"domain_scores_gemma":[0.9969161,0.0012442245,0.0006986739,0.00040913545,0.00065282045,0.000079048215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043579433,0.00016310513,0.00090151245,0.00047527917,0.000056682355,0.000017193117,0.00024616387,0.0001622374,0.000006956074],"category_scores_gemma":[0.000737176,0.00012707508,0.00074360956,0.0008435958,0.00008600851,0.000074155534,0.000049582864,0.00022201848,2.5182427e-9],"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.0028211412,0.00097655685,0.0011446907,0.0014439685,0.0035179274,0.000001505111,0.0019239937,0.012698393,0.0025586372,0.94786865,0.0016320697,0.023412487],"study_design_scores_gemma":[0.0010571782,0.00012757581,0.00034106144,0.000053347212,0.0024393434,0.0000010330195,0.00027311593,0.11859651,0.0014289602,0.8751582,0.0003735532,0.00015015095],"about_ca_topic_score_codex":0.0000052389983,"about_ca_topic_score_gemma":0.000038627943,"teacher_disagreement_score":0.16585772,"about_ca_system_score_codex":0.000116044284,"about_ca_system_score_gemma":0.0001233763,"threshold_uncertainty_score":0.5181972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002192133,0.00018514303,0.9899335,0.0033679258,0.000071436785,0.00025881128,0.000030090636,0.000007888048,0.003953077],"genre_scores_gemma":[0.2662398,0.00021946011,0.7261014,0.0009278154,0.0006236044,0.00019772469,0.000020983638,0.000021836975,0.005647368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889934,0.00011097159,0.00044654097,0.00015410423,0.00025311584,0.00013593424],"domain_scores_gemma":[0.99745977,0.0011697285,0.0004032181,0.00022608018,0.0006796857,0.00006152788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014689495,0.00011654704,0.00030028317,0.0002761316,0.00013634672,0.00008902407,0.0004085566,0.000048028145,0.00002446076],"category_scores_gemma":[0.0001444091,0.00006936375,0.00025665335,0.00047331888,0.000059652386,0.00006633305,0.00005215509,0.00014130487,1.7562904e-8],"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.00021163646,0.0002631432,0.0008759613,0.00003919374,0.0074625537,0.000002345863,0.00044530965,0.0007686546,0.0015137644,0.87370276,0.0014895515,0.1132251],"study_design_scores_gemma":[0.0058018696,0.00037774252,0.0035682265,0.00033209045,0.019979239,0.0002205326,0.005520601,0.14663877,0.011393582,0.4646343,0.34058693,0.00094611297],"about_ca_topic_score_codex":0.000023009597,"about_ca_topic_score_gemma":0.000061537125,"teacher_disagreement_score":0.40906847,"about_ca_system_score_codex":0.00005387342,"about_ca_system_score_gemma":0.00008091852,"threshold_uncertainty_score":0.28285715},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0869735,0.00030343997,0.8644547,0.040400743,0.0012140085,0.0013523808,0.004792163,0.00001446862,0.00049458566],"genre_scores_gemma":[0.81117827,0.00020871099,0.18597935,0.0010554297,0.0001311389,0.000016014623,0.000017242954,0.000028154325,0.0013856966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652916,0.00064563524,0.0010632509,0.00028965686,0.0011204749,0.00035183723],"domain_scores_gemma":[0.99333954,0.004303519,0.00091828156,0.0008169581,0.000525083,0.00009659786],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0066845384,0.00021932038,0.00064400234,0.00004492121,0.00082182453,0.0001087635,0.0013882974,0.00011037698,0.000019019699],"category_scores_gemma":[0.010767869,0.00007466937,0.00038848975,0.001694934,0.0015357088,0.00008993213,0.0011986116,0.0006688063,2.3628841e-8],"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.00045015456,0.00052934256,0.009833684,0.00065327296,0.00191791,0.000004262772,0.013350957,0.0036038666,0.002051741,0.730015,0.22092465,0.01666519],"study_design_scores_gemma":[0.0034930306,0.00083333085,0.11202972,0.0036626556,0.009891885,0.00001361637,0.056301504,0.47126353,0.0042131697,0.30900687,0.028174141,0.0011165567],"about_ca_topic_score_codex":0.000058987458,"about_ca_topic_score_gemma":0.00019384065,"teacher_disagreement_score":0.7242048,"about_ca_system_score_codex":0.00023805104,"about_ca_system_score_gemma":0.00028084373,"threshold_uncertainty_score":0.99756485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774198,0.0015539704,0.0072057154,0.0039049597,0.000018900893,0.00092358823,0.0000049902615,0.000020317153,0.008947761],"genre_scores_gemma":[0.96677214,0.00036670914,0.032578778,0.000036954756,0.0000026218245,0.0000620852,0.000001702186,0.0000046296623,0.00017438557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793667,0.0010644819,0.00055270316,0.00015141338,0.00010327945,0.00019147014],"domain_scores_gemma":[0.9956948,0.002661059,0.00027718866,0.0012299458,0.00012424687,0.000012727967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418091,0.000087764,0.00025802577,0.00004038538,0.00008901542,0.000009446725,0.0003800483,0.000033204775,0.000003342147],"category_scores_gemma":[0.0023780835,0.00006718267,0.000053356758,0.00026338553,0.0004321103,0.000046176534,0.00026255235,0.00028178,7.698296e-9],"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.00010627364,0.00014843831,0.0017242153,0.00015696847,0.000024716315,2.376952e-8,0.0019340607,0.00007314479,0.001407677,0.98453206,0.000024806164,0.009867615],"study_design_scores_gemma":[0.0011319616,0.00008862506,0.00048348831,0.00023788832,0.00003393172,4.358339e-7,0.0003489264,0.03484017,0.011063822,0.95146585,0.00021805684,0.00008682733],"about_ca_topic_score_codex":0.00013822057,"about_ca_topic_score_gemma":0.00046804355,"teacher_disagreement_score":0.034767024,"about_ca_system_score_codex":0.00015396989,"about_ca_system_score_gemma":0.00020178489,"threshold_uncertainty_score":0.28469598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102458805,0.00044675817,0.8269193,0.005165151,0.00018849284,0.0020843688,0.00003084002,0.00007353938,0.0626327],"genre_scores_gemma":[0.9644738,0.000016426487,0.03322249,0.00028617017,0.00004327931,0.00021259433,0.0000024080468,0.000019288005,0.0017235558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986483,0.0001983554,0.00045724405,0.00023188537,0.0002987303,0.00016547408],"domain_scores_gemma":[0.99774116,0.001028379,0.0002554686,0.0008031359,0.00013404818,0.00003779906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012724751,0.00015135121,0.00034851616,0.00007266281,0.00019953286,0.00003981442,0.00039232042,0.000072667346,0.0000064405135],"category_scores_gemma":[0.0009968368,0.00007983225,0.00010386677,0.00062872184,0.000096030875,0.000052305124,0.00028162598,0.00014995654,3.4165112e-7],"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.00006310858,0.00014331866,0.003239793,0.0003438781,0.0001324427,2.5865018e-7,0.0064141275,0.000029079749,0.005311552,0.8590489,0.03869029,0.086583264],"study_design_scores_gemma":[0.0027896245,0.00021114133,0.0069076233,0.0012649487,0.0011563159,0.000032402702,0.011656716,0.04052544,0.13290949,0.69377273,0.107825674,0.00094790384],"about_ca_topic_score_codex":0.000026180243,"about_ca_topic_score_gemma":0.00006604414,"teacher_disagreement_score":0.862015,"about_ca_system_score_codex":0.000033599674,"about_ca_system_score_gemma":0.000031712538,"threshold_uncertainty_score":0.32554647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87687004,0.00037850297,0.040424883,0.0004520248,0.0007347667,0.0010154733,0.000021857368,0.00003085301,0.080071606],"genre_scores_gemma":[0.850624,0.00003748828,0.14867279,0.000059393304,0.000068333415,0.000016075668,1.6128068e-7,0.00001264448,0.00050910783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783874,0.00020197048,0.0011315737,0.00022375696,0.0003719028,0.00023206473],"domain_scores_gemma":[0.99721783,0.0008060131,0.00084452564,0.000475211,0.00055046007,0.00010596295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038688367,0.00020058338,0.0007535023,0.00013765646,0.000051203253,0.000011513154,0.00037426729,0.00014237688,0.0000387706],"category_scores_gemma":[0.0007394925,0.000159899,0.0002943257,0.00031797518,0.00017676629,0.00006762506,0.0001236648,0.00039115743,6.1580664e-8],"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.005752804,0.0017566612,0.0050993897,0.0029167545,0.0010377216,0.000021323243,0.0038795942,0.0004765314,0.0148432,0.8785359,0.01604331,0.06963678],"study_design_scores_gemma":[0.004175541,0.0007898581,0.0023688015,0.0007294418,0.00059789134,0.000030073512,0.0039248136,0.0037503086,0.05345231,0.9192243,0.0102579575,0.00069867447],"about_ca_topic_score_codex":0.000013519635,"about_ca_topic_score_gemma":0.00002901666,"teacher_disagreement_score":0.10824791,"about_ca_system_score_codex":0.00015767985,"about_ca_system_score_gemma":0.00027238947,"threshold_uncertainty_score":0.6520492},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021090658,0.0003352939,0.9745665,0.00039277275,0.000048997284,0.0025107204,0.00063560763,0.000064751766,0.0003546516],"genre_scores_gemma":[0.892874,0.00031036796,0.09896307,0.000100000034,0.00017903291,0.005510992,0.00018962327,0.000030732546,0.0018421842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985939,0.000050589093,0.0005183058,0.00045006705,0.00013604987,0.00025106122],"domain_scores_gemma":[0.997121,0.0016502332,0.00018275961,0.00045149363,0.0004744505,0.0001200571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023590955,0.0002219052,0.0004054314,0.00017881407,0.00047853423,0.00006645243,0.00021127149,0.00010995564,0.000011588308],"category_scores_gemma":[0.0006074008,0.00020359352,0.00009081345,0.0004913608,0.00016918054,0.00006513482,0.00017499778,0.00011314415,2.0921641e-7],"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.00034046464,0.0015938916,0.0015600856,0.002898083,0.00034589064,1.7700039e-7,0.0006023888,0.00007677511,0.034837633,0.8262779,0.00051188853,0.13095483],"study_design_scores_gemma":[0.016785113,0.00080453436,0.0033418126,0.0017708316,0.0040907636,0.000009762352,0.0018752584,0.307462,0.046611592,0.29901078,0.31439897,0.0038385545],"about_ca_topic_score_codex":0.000020716294,"about_ca_topic_score_gemma":0.000097728705,"teacher_disagreement_score":0.8756035,"about_ca_system_score_codex":0.000019758087,"about_ca_system_score_gemma":0.00012003577,"threshold_uncertainty_score":0.83023024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31911504,0.0002862123,0.679555,0.00031847344,0.0000712408,0.00039895406,0.000017155591,0.000010783023,0.0002271519],"genre_scores_gemma":[0.79468393,0.00034437003,0.20481452,0.000043102253,0.0000054383895,0.00006235318,0.000009614773,0.000006455642,0.00003022875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827045,0.0008672585,0.0005129233,0.00014915405,0.00009850942,0.000101685655],"domain_scores_gemma":[0.9951333,0.004027007,0.00016432056,0.0005265424,0.0001314657,0.000017379401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013288957,0.000104237406,0.00021086271,0.00011585878,0.00021000329,0.000044753153,0.00024411226,0.000033950455,0.0000012192672],"category_scores_gemma":[0.0010353815,0.00007814069,0.000025650643,0.00042126075,0.0002088743,0.00011392366,0.0002633028,0.00017654969,1.0343584e-8],"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.000091433576,0.0001687189,0.016572963,0.00023178877,0.00004212073,4.1408543e-7,0.0067962026,0.5469259,0.0001130757,0.28502205,0.000056911762,0.14397843],"study_design_scores_gemma":[0.0010006933,0.000008457225,0.03836694,0.000067452835,0.000021092696,2.7050316e-7,0.0010314946,0.93155485,0.000025453586,0.027678074,0.00017168962,0.00007353967],"about_ca_topic_score_codex":0.00012317325,"about_ca_topic_score_gemma":0.00025843544,"teacher_disagreement_score":0.4755689,"about_ca_system_score_codex":0.00006182361,"about_ca_system_score_gemma":0.00003866622,"threshold_uncertainty_score":0.3186485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5690018,0.00025897927,0.33966845,0.00007718429,0.00019545466,0.0005895416,0.00001326382,0.00010869612,0.090086654],"genre_scores_gemma":[0.6264986,0.0000103970015,0.36986816,0.000075244876,0.000046166577,0.000020035763,0.0000013587293,0.000025312269,0.0034547586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976731,0.0004068254,0.0007669406,0.00046255835,0.0002878475,0.00040270668],"domain_scores_gemma":[0.9978028,0.0007857414,0.0002090685,0.00088116614,0.0002262972,0.000094927906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002820753,0.00027528882,0.00068727625,0.00017391711,0.00010610227,0.000028834726,0.00027782863,0.00018713308,0.00006542522],"category_scores_gemma":[0.0010161191,0.00023739465,0.00025165122,0.00044097623,0.00010278297,0.00009467286,0.00025760077,0.00023726713,4.578989e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079055544,0.003506502,0.01437745,0.014990876,0.0015126364,0.000021503647,0.011692471,0.00033040752,0.5789277,0.31718007,0.0049888017,0.05168106],"study_design_scores_gemma":[0.0038775445,0.00029409226,0.0005488316,0.001112877,0.0009528597,0.000024575824,0.024493407,0.27396405,0.6760934,0.0131832305,0.0034594254,0.0019956878],"about_ca_topic_score_codex":0.00043435534,"about_ca_topic_score_gemma":0.00019263221,"teacher_disagreement_score":0.30399683,"about_ca_system_score_codex":0.00015481973,"about_ca_system_score_gemma":0.0001602803,"threshold_uncertainty_score":0.9680673},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5465923,0.0000752795,0.44862893,0.00017824571,0.000096158285,0.00096673606,0.0000075044486,0.00003204195,0.0034228237],"genre_scores_gemma":[0.27344292,0.0000025171034,0.72629905,0.00010848091,0.000018243709,0.00004142195,0.0000025362713,0.000008336377,0.000076453915],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973549,0.0014181026,0.000494611,0.00038064088,0.00011970313,0.0002320038],"domain_scores_gemma":[0.99583495,0.0033903667,0.00021717146,0.0004311801,0.000094516414,0.000031808708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005763199,0.00017603756,0.0005671485,0.00010085953,0.00011324709,0.000007888069,0.00021230889,0.00014818333,0.00000438208],"category_scores_gemma":[0.0007607896,0.00011345251,0.000055240365,0.000514443,0.00038575204,0.000015395117,0.00019844371,0.00030961426,1.5837301e-8],"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.0012502517,0.0015169231,0.03341079,0.0027021074,0.00027872087,0.000007300698,0.0042262645,0.00025350958,0.0049808426,0.3527389,0.00033228257,0.5983021],"study_design_scores_gemma":[0.011173756,0.0005458663,0.036882356,0.0005572405,0.00039369395,0.000033395987,0.0028042449,0.060176685,0.041118722,0.84488237,0.00067344,0.00075820176],"about_ca_topic_score_codex":0.000047007085,"about_ca_topic_score_gemma":0.00005616014,"teacher_disagreement_score":0.59754395,"about_ca_system_score_codex":0.00004813462,"about_ca_system_score_gemma":0.00010922178,"threshold_uncertainty_score":0.46264592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8657029,0.00047051118,0.080097795,0.001608763,0.00029858336,0.0010344872,0.0000071126983,0.00023410686,0.0505457],"genre_scores_gemma":[0.9941595,0.00003901538,0.0018747342,0.00021506975,0.000009206315,0.000067663415,0.000006586049,0.000011453437,0.003616781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856347,0.0005139036,0.00030037982,0.00032430273,0.00013368983,0.00016423427],"domain_scores_gemma":[0.99860305,0.00087917014,0.00007833975,0.00031603323,0.00006897963,0.00005440505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021326584,0.00016523138,0.00023149015,0.00005910309,0.00014747023,0.000027779623,0.00010702856,0.00038835726,0.000037115675],"category_scores_gemma":[0.001811285,0.00012313329,0.00007042047,0.00017124719,0.00006187107,0.00006833204,0.000046636054,0.00039657814,2.0876524e-7],"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.00060628296,0.00041897545,0.00011484139,0.0007257409,0.00008114268,0.000002901758,0.0029035092,0.00002043868,0.00045088495,0.95272446,0.00110946,0.040841345],"study_design_scores_gemma":[0.0006030848,0.000113696566,0.000021601858,0.00029084133,0.000069328664,0.0000034584682,0.00029948814,0.0022019446,0.002200624,0.99386895,0.00018385198,0.00014310479],"about_ca_topic_score_codex":0.0000023837474,"about_ca_topic_score_gemma":0.000002783525,"teacher_disagreement_score":0.12845655,"about_ca_system_score_codex":0.000028203023,"about_ca_system_score_gemma":0.000025354526,"threshold_uncertainty_score":0.50212294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26395497,0.0030271886,0.67551327,0.0022424718,0.0067854556,0.0062778867,0.0016177974,0.0003877293,0.040193215],"genre_scores_gemma":[0.10342019,0.005872973,0.51771027,0.00323502,0.004013534,0.0038698341,0.0007176676,0.0006311096,0.3605294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99124247,0.00092088344,0.0025917594,0.0026872575,0.0007805402,0.0017771062],"domain_scores_gemma":[0.9901523,0.0025461584,0.0014429291,0.0039779395,0.0012505003,0.00063016807],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0035127983,0.001878311,0.0029161863,0.00048894243,0.00064513163,0.00026298664,0.0020658162,0.0021223128,0.00020044879],"category_scores_gemma":[0.0017255323,0.0019478146,0.0021853964,0.00045619137,0.0002504656,0.00028517577,0.002360357,0.0018907886,0.000004102734],"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.005015659,0.0069990824,0.018436983,0.06441471,0.013534777,0.00027679114,0.029736765,0.05893032,0.016303914,0.44549775,0.26671556,0.07413771],"study_design_scores_gemma":[0.009178255,0.00059455156,0.00016636135,0.0051098517,0.005082877,0.000034088116,0.0015676288,0.5871015,0.018157491,0.1103623,0.2566495,0.005995603],"about_ca_topic_score_codex":0.00023418825,"about_ca_topic_score_gemma":0.0001349185,"teacher_disagreement_score":0.5281712,"about_ca_system_score_codex":0.0006066969,"about_ca_system_score_gemma":0.0011943114,"threshold_uncertainty_score":0.9993961},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9419946,0.00013977464,0.015441475,0.00023027435,0.007424239,0.0017854277,0.00054846884,0.00011751341,0.032318216],"genre_scores_gemma":[0.97896326,0.0006888851,0.006318997,0.0001778177,0.0010173534,0.00014821244,0.0004065386,0.0001222021,0.01215676],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99453664,0.0009823921,0.0021934244,0.0010663416,0.0005844887,0.00063674065],"domain_scores_gemma":[0.9940927,0.0011383631,0.0019789075,0.0016939136,0.0008831701,0.00021292614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023357908,0.0008474132,0.0020948222,0.00037303547,0.00020267302,0.00005226972,0.00078678847,0.0010721389,0.00038469167],"category_scores_gemma":[0.0017349984,0.000907645,0.00070553244,0.00046463302,0.000298014,0.00013075603,0.001458161,0.0010760822,0.0000042521324],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990719,0.0023901619,0.05078265,0.013925399,0.0022089793,0.00008038209,0.0070842863,0.000012012001,0.7764577,0.13566457,0.00038248443,0.010020639],"study_design_scores_gemma":[0.02356316,0.0019549034,0.02318983,0.045194663,0.00929956,0.000072790084,0.001915817,0.030107323,0.7280326,0.056094024,0.07022869,0.010346674],"about_ca_topic_score_codex":0.00004175773,"about_ca_topic_score_gemma":0.0000026498328,"teacher_disagreement_score":0.07957054,"about_ca_system_score_codex":0.00024893758,"about_ca_system_score_gemma":0.00081471546,"threshold_uncertainty_score":0.99933743},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6154035,0.0006064378,0.3760691,0.00089653506,0.0021636062,0.0012931263,0.0002376597,0.00015889909,0.0031711387],"genre_scores_gemma":[0.18615666,0.00028174286,0.810761,0.00047994516,0.0007264569,0.00037471158,0.00012694925,0.00005653605,0.0010360532],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766463,0.00027448667,0.0006380667,0.0008089171,0.00020251327,0.0004113956],"domain_scores_gemma":[0.99465793,0.003668916,0.0003690108,0.0008955582,0.0002378878,0.00017072017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082624896,0.0004671889,0.0008722749,0.00022722394,0.00017814808,0.00006969438,0.00030556592,0.0011267328,0.0000373362],"category_scores_gemma":[0.006056144,0.00043768616,0.000337634,0.00017405704,0.00020588633,0.00004730641,0.0007139121,0.0011402565,1.01690425e-7],"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.0007205073,0.0005190325,0.58002883,0.009285746,0.001714764,0.0000296294,0.0033035537,0.000024837973,0.00037062564,0.34578338,0.022872835,0.035346285],"study_design_scores_gemma":[0.0039052758,0.0003192896,0.011463159,0.0037874414,0.0020703017,0.000045225348,0.0055312454,0.006469142,0.004204758,0.89990693,0.059641417,0.0026557995],"about_ca_topic_score_codex":0.00006275855,"about_ca_topic_score_gemma":0.00005247242,"teacher_disagreement_score":0.56856567,"about_ca_system_score_codex":0.00013861121,"about_ca_system_score_gemma":0.00021546434,"threshold_uncertainty_score":0.9998075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66007715,0.00028241464,0.31990427,0.004741602,0.00034541416,0.0010062341,0.000036306632,0.00014115524,0.013465463],"genre_scores_gemma":[0.9428402,0.0000065990785,0.05184546,0.00063348864,0.00025267765,0.00005560617,0.0000037970212,0.000022880142,0.004339283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871397,0.0002932827,0.00029398175,0.00028976935,0.00018052656,0.00022845143],"domain_scores_gemma":[0.997783,0.0013333412,0.00007806354,0.0006339929,0.00010892834,0.0000626836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927469,0.00014551479,0.0002765703,0.00003565739,0.00017878896,0.000060462196,0.00027513228,0.000072442315,0.000057447523],"category_scores_gemma":[0.002954842,0.00007995629,0.00008407632,0.0002406967,0.000037976642,0.000036862708,0.00015832152,0.00022294589,8.8081384e-7],"study_design_candidate":"design_other","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.00045355328,0.00031775763,0.005726375,0.0010603126,0.0008035889,0.000012094837,0.017076066,0.0012518398,0.005646843,0.02771253,0.04972522,0.89021385],"study_design_scores_gemma":[0.004816152,0.00035183737,0.014690817,0.0064484696,0.0019588915,0.0000048142256,0.020077467,0.3364052,0.007469321,0.29451188,0.31012297,0.0031421862],"about_ca_topic_score_codex":0.0017032152,"about_ca_topic_score_gemma":0.00021992659,"teacher_disagreement_score":0.8870716,"about_ca_system_score_codex":0.00005758646,"about_ca_system_score_gemma":0.000060862614,"threshold_uncertainty_score":0.35374352},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005220595,0.0008209221,0.0010639909,0.0022070978,0.00062941085,0.0008254975,0.0012651347,0.0015153472,0.9916204],"genre_scores_gemma":[0.000452845,0.0008544434,0.0017591298,0.0003809467,0.0011735834,1.7584291e-7,0.0007195534,0.013827494,0.9808318],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974846,0.00045339033,0.00035474918,0.00066252326,0.0005984125,0.0004462909],"domain_scores_gemma":[0.9982346,0.00009519779,0.00019760276,0.001107033,0.00020360669,0.00016195902],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010738095,0.00040017522,0.00038256554,0.0003181086,0.0005910546,0.00065954874,0.001247792,0.00023028017,0.054131083],"category_scores_gemma":[0.0007656264,0.00029312057,0.00018893614,0.00034490117,0.00023957399,0.00004897224,0.00093692425,0.0007773174,0.0016520421],"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.000024733168,0.00010212633,2.42878e-8,0.00038879408,0.00015168206,0.000035792775,0.0005939524,6.006174e-7,0.00009291788,0.055566285,0.8852496,0.057793453],"study_design_scores_gemma":[0.00022734933,0.00019112988,6.707492e-7,0.000475579,0.00009139202,0.000048707534,0.00037425934,0.000043942768,0.00003209553,0.0017185573,0.9964824,0.00031392055],"about_ca_topic_score_codex":0.000021870743,"about_ca_topic_score_gemma":0.000007091217,"teacher_disagreement_score":0.11123276,"about_ca_system_score_codex":0.00009939483,"about_ca_system_score_gemma":0.0000041368244,"threshold_uncertainty_score":0.9999521},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011225307,0.0027168412,0.0052538863,0.00038130797,0.00124401,0.0012573279,0.0008381154,0.0014918288,0.9867044],"genre_scores_gemma":[0.0008261872,0.0012929301,0.0040885946,0.00013211607,0.0026696566,1.6836442e-7,0.002363307,0.021795614,0.96683145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99482495,0.0013617451,0.0007455387,0.0012864113,0.0008496051,0.00093176914],"domain_scores_gemma":[0.9966153,0.00010956609,0.00037393105,0.0015933379,0.0008077187,0.00050012977],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023893246,0.00068016996,0.0007246999,0.0007861172,0.0013373542,0.0021687644,0.0020735988,0.00056463794,0.3380342],"category_scores_gemma":[0.002672366,0.000684598,0.00043262244,0.0008889113,0.00031075388,0.00013148406,0.003187493,0.0013277489,0.08966158],"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.00005146876,0.00022109185,1.7007828e-7,0.001393106,0.00066737004,0.00012317458,0.0024139287,0.0000027171488,0.00058452727,0.01851676,0.92920727,0.04681841],"study_design_scores_gemma":[0.00056281185,0.0003512871,0.0000017604635,0.0006416978,0.00034001804,0.00010899727,0.00046249677,0.00031398516,0.00007570328,0.0010732735,0.99538165,0.00068634166],"about_ca_topic_score_codex":0.000022382232,"about_ca_topic_score_gemma":0.0000010459569,"teacher_disagreement_score":0.24837263,"about_ca_system_score_codex":0.00048469158,"about_ca_system_score_gemma":0.000016735614,"threshold_uncertainty_score":0.99996275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05385663,0.00051490014,0.1831869,0.04663081,0.00050536345,0.0034197704,0.004185964,0.0023649107,0.7053347],"genre_scores_gemma":[0.9631105,0.0004305023,0.027452115,0.000972724,0.00049525284,3.357252e-7,0.0045948247,0.0018578474,0.0010859104],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830693,0.0005257607,0.00034284938,0.00025869344,0.00030885957,0.0002568784],"domain_scores_gemma":[0.9972676,0.00007912595,0.00017602876,0.0007576749,0.0014509546,0.00026860525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008166363,0.00012911945,0.00021426953,0.00015730406,0.00087808206,0.00021937481,0.0011729775,0.00008080697,0.0063034445],"category_scores_gemma":[0.0048077726,0.00013556292,0.0000504632,0.00083024765,0.00014146528,0.00020077259,0.00081019435,0.00019249713,0.000073782205],"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.00008728884,0.00015025561,0.000004354838,0.0004885274,0.00008744006,0.000007672281,0.0032481242,0.00004566028,0.008022665,0.05535495,0.89663,0.0358731],"study_design_scores_gemma":[0.00060800224,0.000090104826,0.00014556803,0.000061931925,0.000035884765,0.000018930643,0.00030495954,0.00046438974,0.001347556,0.0017055651,0.9950288,0.0001883277],"about_ca_topic_score_codex":0.0003362588,"about_ca_topic_score_gemma":0.000050307677,"teacher_disagreement_score":0.90925384,"about_ca_system_score_codex":0.00007290497,"about_ca_system_score_gemma":0.000015028151,"threshold_uncertainty_score":0.99460495},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027741889,0.007529774,0.010319674,0.0028619068,0.0017298085,0.0050271596,0.013087016,0.0065147653,0.925188],"genre_scores_gemma":[0.16771805,0.025357,0.08027603,0.0032396757,0.0067189634,0.000009897093,0.040477,0.11950222,0.5567012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964498,0.0007970496,0.0006161066,0.0009801744,0.0005287977,0.00062803173],"domain_scores_gemma":[0.9982718,0.0001092104,0.000447412,0.00068865967,0.00018227324,0.00030060136],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057373184,0.00051484955,0.00071348797,0.0003581857,0.0005267215,0.00046508067,0.0013629883,0.0004376152,0.023783034],"category_scores_gemma":[0.00094156916,0.00053326535,0.00013149751,0.00070396106,0.00010774431,0.00012355918,0.0012645421,0.0008304182,0.00020656809],"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.0000548471,0.00012566357,0.0000024254075,0.00015953151,0.00012948077,0.000013327114,0.0010485798,0.0000036435626,0.07221706,0.00014546831,0.8951549,0.030945072],"study_design_scores_gemma":[0.0007009652,0.00007579597,0.000004393032,0.00032479456,0.00006380988,0.0000036927056,0.00033840985,0.00023762076,0.015061064,0.000085564614,0.9825281,0.0005757825],"about_ca_topic_score_codex":0.0013381832,"about_ca_topic_score_gemma":0.000009659691,"teacher_disagreement_score":0.36848685,"about_ca_system_score_codex":0.00027788949,"about_ca_system_score_gemma":0.000013814255,"threshold_uncertainty_score":0.9997119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3751589,0.00044629126,0.39395094,0.01918057,0.0005930601,0.0021157118,0.006303666,0.004717103,0.19753374],"genre_scores_gemma":[0.9893737,0.00017113973,0.004439611,0.0005171709,0.00032948708,2.0336091e-7,0.0022712008,0.0011833531,0.0017141376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968035,0.0013465128,0.00044897842,0.00047364403,0.00056462927,0.00036273253],"domain_scores_gemma":[0.9968417,0.0013335068,0.00021081898,0.0010807608,0.0004262141,0.0001069839],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.003920366,0.00017907815,0.00025296386,0.00016335599,0.002460303,0.000847356,0.0015575481,0.00007574277,0.0007215579],"category_scores_gemma":[0.008913138,0.00011941974,0.0001611588,0.001514997,0.00014752176,0.00011394595,0.0016590339,0.00043135465,0.00010572046],"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.00038173472,0.00010213571,0.000030457124,0.000029378525,0.0015100669,0.000022154567,0.03577526,0.0035217553,0.0059242398,0.007533136,0.815366,0.12980369],"study_design_scores_gemma":[0.00087642967,0.000055441604,0.000327607,0.00009913324,0.00059334823,0.0000048110683,0.0057913177,0.3058489,0.0006908699,0.005578232,0.67977405,0.000359826],"about_ca_topic_score_codex":0.00029170339,"about_ca_topic_score_gemma":0.000022320068,"teacher_disagreement_score":0.6142148,"about_ca_system_score_codex":0.00007723848,"about_ca_system_score_gemma":0.0000052494806,"threshold_uncertainty_score":0.9994352},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007661864,0.0014426174,0.221654,0.0009835685,0.0003342023,0.0006962959,0.00012157343,0.00033553428,0.76677036],"genre_scores_gemma":[0.013663435,0.00053801807,0.20451431,0.00020456308,0.0001673621,0.0000017976165,0.00031021488,0.0005618424,0.7800385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998526,0.00022316026,0.00020491549,0.00037699577,0.00035985143,0.000309127],"domain_scores_gemma":[0.9985994,0.00017398287,0.00030947884,0.00059970916,0.00009056072,0.00022683326],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001943435,0.0003091401,0.0004862575,0.0003963357,0.00023135041,0.000053377764,0.00064958486,0.000417722,0.002642001],"category_scores_gemma":[0.000043310818,0.00030760915,0.00012292061,0.00021550759,0.00016272382,0.00007989153,0.00018536141,0.0003113538,0.0000013874374],"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.00005591962,0.00023633424,0.0007696792,0.00016587102,0.0015309228,0.0003433318,0.013121045,0.000031747026,0.000039939998,0.09041549,0.8309883,0.062301405],"study_design_scores_gemma":[0.00084941625,0.00006232217,0.0019592054,0.0003708003,0.0010223647,0.0000064716232,0.0021533943,0.0024972085,0.00002788908,0.0077741155,0.9824012,0.0008756422],"about_ca_topic_score_codex":0.5145305,"about_ca_topic_score_gemma":0.41832677,"teacher_disagreement_score":0.15141286,"about_ca_system_score_codex":0.00011356347,"about_ca_system_score_gemma":0.00020582085,"threshold_uncertainty_score":0.9999376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15362163,0.00013285036,0.83528155,0.00024431787,0.0009768183,0.0013043532,0.0000981287,0.00012513106,0.0082152495],"genre_scores_gemma":[0.96568596,0.00021123514,0.026993304,0.00032310624,0.00017947824,0.0000063942257,0.00010072152,0.00004582711,0.006453973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728453,0.0003711207,0.0005949637,0.0010193747,0.00010160706,0.00062839116],"domain_scores_gemma":[0.996349,0.0017768671,0.0003878484,0.0007061762,0.00057492335,0.0002051965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009078584,0.0004925013,0.0007024212,0.00040914168,0.0005729793,0.00018983953,0.00051254313,0.00046996883,0.00008139706],"category_scores_gemma":[0.00047496057,0.0006119612,0.00046567302,0.000881914,0.00017230808,0.0003655455,0.0002430952,0.00037407232,0.0000016873182],"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.0009615206,0.00044957284,0.000469191,0.0015160644,0.00048516644,0.00004887537,0.00078428397,0.00661721,0.0028380258,0.9806545,0.000976607,0.0041990243],"study_design_scores_gemma":[0.0058380296,0.00040730604,0.0003401828,0.0009118167,0.002185869,0.0000047371814,0.0022219175,0.78514546,0.0026893492,0.19434454,0.0047546993,0.0011560888],"about_ca_topic_score_codex":0.000051894534,"about_ca_topic_score_gemma":0.00006333205,"teacher_disagreement_score":0.81206435,"about_ca_system_score_codex":0.00062985905,"about_ca_system_score_gemma":0.0002646654,"threshold_uncertainty_score":0.9996332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65904856,0.0017522661,0.0000019575236,0.000013706271,0.005799054,0.001092042,0.0007576664,0.0007821572,0.3307526],"genre_scores_gemma":[0.640244,0.0030235779,0.1311045,0.00040204352,0.0012554527,0.0011875335,0.0019306616,0.0023702898,0.21848191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99359727,0.00083520147,0.0018142629,0.0016784646,0.0010424088,0.0010324176],"domain_scores_gemma":[0.9946965,0.0020720675,0.0010734504,0.001230375,0.00049824594,0.0004293375],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0036373222,0.001267452,0.0017652264,0.0008372895,0.0009912703,0.00030090794,0.00091983285,0.00142359,0.00038678473],"category_scores_gemma":[0.004507524,0.0012237052,0.0011017908,0.0009008668,0.00006679314,0.00052148494,0.00022214961,0.0027519264,0.000030023508],"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.00080559874,0.00020664053,0.000011758456,0.0069348663,0.0012638876,0.00044004057,0.00011015514,0.000003162221,0.020702792,0.42468563,0.00022856655,0.5446069],"study_design_scores_gemma":[0.0050515453,0.0002664128,0.000010386284,0.007143945,0.003216526,0.00040721585,0.005507106,0.0003377928,0.1084732,0.6778417,0.18714885,0.0045952764],"about_ca_topic_score_codex":0.00013071297,"about_ca_topic_score_gemma":0.0007030171,"teacher_disagreement_score":0.54001164,"about_ca_system_score_codex":0.00058777427,"about_ca_system_score_gemma":0.00010135169,"threshold_uncertainty_score":0.99987274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9439996,0.0005477651,0.000004157249,0.000060593677,0.0020384223,0.0010693248,0.003981268,0.00024553516,0.048053358],"genre_scores_gemma":[0.9611807,0.00016792622,0.032290325,0.00046696232,0.00024654798,0.00015419607,0.0007208878,0.00041554953,0.004356942],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99157095,0.002503434,0.0023576093,0.0013581683,0.0014352602,0.00077457936],"domain_scores_gemma":[0.99067754,0.0036416284,0.0024420593,0.001835452,0.0010101774,0.00039312564],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032738945,0.0011448995,0.0021117292,0.0002039297,0.0009902919,0.00029529998,0.0014404943,0.0010657045,0.00014437454],"category_scores_gemma":[0.009736835,0.0009335222,0.0010980585,0.000478282,0.00013391775,0.0006675383,0.0003477607,0.0021996961,0.0000054625903],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011743032,0.00068800274,0.00032997658,0.005606458,0.0023999768,0.00014116851,0.0007228243,0.000009051846,0.58166236,0.1124049,0.00009711555,0.29476383],"study_design_scores_gemma":[0.008600526,0.0011475722,0.02547159,0.0104160085,0.005787076,0.00006385275,0.028475147,0.00057873153,0.4627033,0.1708981,0.274726,0.011132114],"about_ca_topic_score_codex":0.0030901344,"about_ca_topic_score_gemma":0.0059193755,"teacher_disagreement_score":0.28363174,"about_ca_system_score_codex":0.00041382512,"about_ca_system_score_gemma":0.00014448851,"threshold_uncertainty_score":0.9993115},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956476,0.000025219766,0.0027006615,0.00019052046,0.000244827,0.00059002754,0.00029208566,0.00004172286,0.00026732156],"genre_scores_gemma":[0.26698193,0.00014129501,0.14988492,0.000014395601,0.00006277966,0.00000359695,0.00033937817,0.00014253109,0.5824292],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989654,0.000092201,0.00019411539,0.00030916464,0.00021409849,0.00022505561],"domain_scores_gemma":[0.99871033,0.0002557095,0.00036424748,0.00040329664,0.000186059,0.000080324586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287656,0.00023564066,0.00056827255,0.00010053208,0.00021534,0.000010267448,0.00029114427,0.00029018646,0.000014665205],"category_scores_gemma":[0.00010652315,0.00021657757,0.00032356608,0.00018609808,0.00013792515,0.000054835677,0.000144021,0.00021797104,5.9021005e-8],"study_design_candidate":"qualitative","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.0023956718,0.0009809169,0.0037451254,0.030670034,0.0020574713,0.00075998314,0.8130454,0.0034902357,0.0041125524,0.104643926,0.010618641,0.02348005],"study_design_scores_gemma":[0.0026316443,0.00034562932,0.0009017847,0.0007010001,0.0015251164,0.00006570896,0.42062742,0.52920413,0.0014247863,0.04126259,0.000118797674,0.0011914085],"about_ca_topic_score_codex":0.016044097,"about_ca_topic_score_gemma":0.17744823,"teacher_disagreement_score":0.7286657,"about_ca_system_score_codex":0.00009952631,"about_ca_system_score_gemma":0.00007444664,"threshold_uncertainty_score":0.99050814},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032732359,0.014314331,0.07734052,0.0048250845,0.00036985107,0.0007681597,0.0004829862,0.00012736801,0.8984985],"genre_scores_gemma":[0.012236864,0.000799894,0.116658814,0.00056574994,0.0010322917,0.000069047375,0.000031780957,0.00051552255,0.86809003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99400985,0.0009992956,0.0014235529,0.00090202293,0.0020445304,0.00062077],"domain_scores_gemma":[0.9813372,0.015316862,0.0015832738,0.0009910458,0.0001513839,0.00062022725],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016849716,0.0009843548,0.0013787375,0.0013192965,0.00016841151,0.00021491485,0.0013241849,0.0003373202,0.010980754],"category_scores_gemma":[0.010040424,0.000957554,0.00066080503,0.0005770568,0.00035733177,0.0004925878,0.0008436155,0.0010076991,0.000025966698],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00015476675,0.00050498435,0.000961989,0.00082948327,0.00063855975,0.000017600249,0.009187457,0.00045266416,0.00049931504,0.34679374,0.634728,0.005231423],"study_design_scores_gemma":[0.0018160968,0.00025104158,0.00027706553,0.0014264075,0.00039325366,0.00005451047,0.00043454752,0.0069996747,0.000254336,0.01612475,0.97093993,0.0010283804],"about_ca_topic_score_codex":0.17857447,"about_ca_topic_score_gemma":0.9035193,"teacher_disagreement_score":0.7249448,"about_ca_system_score_codex":0.0052674175,"about_ca_system_score_gemma":0.08849356,"threshold_uncertainty_score":0.9992875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6715058,0.003900441,0.004252116,0.001486443,0.0017211926,0.0017379608,0.0023448998,0.0007170866,0.31233403],"genre_scores_gemma":[0.94828135,0.0005589643,0.03438448,0.00060188083,0.0021567345,0.00010908936,0.0002388666,0.00047137873,0.0131972805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99206984,0.0005936863,0.0024924346,0.0013999199,0.0012517853,0.002192361],"domain_scores_gemma":[0.9912864,0.002118744,0.0015648446,0.003463154,0.00056691613,0.0009999265],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015093882,0.0014619442,0.0022638955,0.000670147,0.00049713784,0.0015043381,0.0025254493,0.0011228365,0.00068518915],"category_scores_gemma":[0.0025037567,0.0013601064,0.0011214402,0.0012895603,0.003251499,0.0027809893,0.0023259516,0.00087285176,0.000015148765],"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.0013420113,0.0025392077,0.008134776,0.0027687112,0.001698783,0.00036076232,0.01203837,0.00001124537,0.0021121793,0.8923232,0.051350124,0.025320625],"study_design_scores_gemma":[0.004723102,0.0057749623,0.0019194905,0.0037954908,0.0014526402,0.00040838515,0.011714026,0.0056790602,0.044334203,0.12637281,0.7889228,0.0049030245],"about_ca_topic_score_codex":0.00027395814,"about_ca_topic_score_gemma":0.00006168618,"teacher_disagreement_score":0.7659504,"about_ca_system_score_codex":0.00011896066,"about_ca_system_score_gemma":0.0012405617,"threshold_uncertainty_score":0.999813},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001538561,0.00015076161,0.005231155,0.0028513204,0.0006287173,0.00090480637,0.0000062827953,0.00006912815,0.99014246],"genre_scores_gemma":[0.00002060053,0.000056309673,0.059135776,0.00058432977,0.0005858393,0.00007453597,0.0000033097647,0.0003481767,0.9391911],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986636,0.00010953461,0.00025484516,0.00040156563,0.00021848679,0.0003519796],"domain_scores_gemma":[0.99760187,0.0004917502,0.00022525595,0.0015291519,0.000018163952,0.00013378859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890135,0.00035184703,0.0005391726,0.00017076007,0.000047822236,0.00008437745,0.0006774157,0.0003004869,0.00086930435],"category_scores_gemma":[0.0009008647,0.00020343583,0.00014719537,0.000070701455,0.000037158356,0.000028899476,0.00027295997,0.00029526433,0.0000051393895],"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.000013212718,0.00001687565,0.000020914465,0.00011110212,0.00005053676,0.000008260589,0.00040775674,1.2679789e-7,0.000013200319,0.015020805,0.9671142,0.017222976],"study_design_scores_gemma":[0.000302492,0.0000227011,0.0000070271844,0.00046505625,0.000033017903,0.0000021369635,0.00006719535,0.000010065004,0.000027061536,0.0011035551,0.997657,0.00030268502],"about_ca_topic_score_codex":0.016772032,"about_ca_topic_score_gemma":0.09684356,"teacher_disagreement_score":0.08007153,"about_ca_system_score_codex":0.000051259573,"about_ca_system_score_gemma":0.00008970223,"threshold_uncertainty_score":0.98977536},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073641835,0.0003333032,0.018953176,0.00023561275,0.00095439184,0.00044572225,0.00046416215,0.000252111,0.97762513],"genre_scores_gemma":[0.011550023,0.00019417844,0.0022690038,0.00003623824,0.0008085347,0.0000017732795,0.000076388525,0.00018499792,0.98487884],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980312,0.00014373976,0.00035998822,0.00050134433,0.000616656,0.00034705907],"domain_scores_gemma":[0.9978009,0.0004371664,0.000573245,0.00075231347,0.00028280233,0.00015359053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020115644,0.00045688133,0.00066862046,0.00025894822,0.00034623305,0.00005721732,0.00069160643,0.0004588888,0.00043977296],"category_scores_gemma":[0.00019643852,0.0003240254,0.0003762552,0.00016015192,0.001063896,0.00019732794,0.00025442967,0.00028720088,0.00002521869],"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.00021415259,0.00019783426,0.0014429775,0.0004776972,0.0005412105,0.0004043467,0.00018443255,0.0000049079545,0.00008082629,0.05782752,0.9340658,0.004558253],"study_design_scores_gemma":[0.00091888645,0.00003949785,0.0005123898,0.0008964348,0.00016662164,0.00015334692,0.00011299735,0.0000109040275,0.00004229988,0.0023685466,0.9942856,0.00049252046],"about_ca_topic_score_codex":0.00039058845,"about_ca_topic_score_gemma":0.00017076329,"teacher_disagreement_score":0.060219713,"about_ca_system_score_codex":0.00015333912,"about_ca_system_score_gemma":0.00045488193,"threshold_uncertainty_score":0.9999212},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016653353,0.00007734,0.016822195,0.00024248539,0.00047761347,0.00071257516,0.00009155141,0.0001368947,0.979774],"genre_scores_gemma":[0.00064239505,0.00010375199,0.049987968,0.00008485966,0.000104415536,9.329809e-7,0.000043022228,0.00006734918,0.9489653],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834234,0.0000965345,0.00025281322,0.00045888318,0.0004536208,0.00039584018],"domain_scores_gemma":[0.99812317,0.00015375881,0.00049467606,0.0009364447,0.00009056378,0.00020138606],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006942035,0.00037294402,0.00069444627,0.00030119572,0.0001254916,0.000011312038,0.0006824415,0.00038975995,0.0031995305],"category_scores_gemma":[0.000014893152,0.00046308734,0.00046317247,0.00007472984,0.00021582347,0.00009702065,0.00070796907,0.00040094272,0.00004156134],"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.00023320549,0.0004714989,0.00028414198,0.00573266,0.0022574004,0.00041869545,0.014073868,0.000002318811,0.000054213717,0.32406357,0.59114814,0.061260287],"study_design_scores_gemma":[0.00084650144,0.000027385526,0.00013111894,0.0005964285,0.00056012283,0.000008150725,0.0028777372,0.000012863339,0.00003266824,0.021302605,0.9729395,0.0006649096],"about_ca_topic_score_codex":0.00003714518,"about_ca_topic_score_gemma":0.000022932103,"teacher_disagreement_score":0.38179135,"about_ca_system_score_codex":0.00025453942,"about_ca_system_score_gemma":0.00006213789,"threshold_uncertainty_score":0.9997821},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86848766,0.0037387116,0.0007895902,0.0047680205,0.0010704122,0.001074189,0.00012505808,0.0004097066,0.11953666],"genre_scores_gemma":[0.9681504,0.00004201783,0.021220857,0.0023620322,0.0005427977,0.00011564974,0.00002378375,0.00012668392,0.007415827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979534,0.00018387225,0.00030193414,0.00057617057,0.0003211404,0.0006634594],"domain_scores_gemma":[0.9982733,0.00021936827,0.00004722161,0.0007416748,0.000056103843,0.0006623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084496755,0.0003281183,0.00041583763,0.00022812602,0.00013619769,0.00023542797,0.0002982003,0.00019434036,0.0005244214],"category_scores_gemma":[0.00010944632,0.0002701911,0.000099758094,0.00036097274,0.00008934489,0.00032182364,0.000023631832,0.00047180173,0.000009269672],"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.00055262476,0.0009390851,0.019761309,0.004230337,0.00071442715,0.010107392,0.028980037,0.00005990417,0.007509001,0.77013177,0.08817994,0.06883419],"study_design_scores_gemma":[0.0031099934,0.0014642234,0.0028808792,0.0030166642,0.0002479193,0.0003133064,0.004783881,0.004732126,0.005629334,0.017952813,0.95306176,0.0028070898],"about_ca_topic_score_codex":0.06433997,"about_ca_topic_score_gemma":0.7454081,"teacher_disagreement_score":0.8648818,"about_ca_system_score_codex":0.00023575855,"about_ca_system_score_gemma":0.00032148353,"threshold_uncertainty_score":0.999975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86870426,0.10288451,0.0047150785,0.0039358097,0.00027721803,0.0016572236,0.00018856453,0.0001280897,0.017509248],"genre_scores_gemma":[0.9524393,0.024897086,0.0142400395,0.0012856674,0.00057735574,0.00011610453,0.000021081818,0.00014851103,0.0062748296],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975108,0.00059401855,0.00066282006,0.00034359,0.0005400833,0.00034866846],"domain_scores_gemma":[0.9968825,0.0009838317,0.0005810614,0.0012979801,0.00015988229,0.00009474811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088452024,0.0003657714,0.0007422338,0.00006174977,0.00017380645,0.000055553046,0.00072004565,0.00012597138,0.00048608464],"category_scores_gemma":[0.00057083496,0.00019313421,0.00032026804,0.00044876745,0.00037157378,0.000107639935,0.00011791984,0.0002560892,0.0000021186065],"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.0009391107,0.002036725,0.0185471,0.01660243,0.002384852,0.00009066582,0.2483213,0.00001973179,0.26969978,0.055750646,0.32360396,0.062003694],"study_design_scores_gemma":[0.0058554304,0.0021555824,0.012963957,0.034879547,0.00302778,0.0003540459,0.00537101,0.0012593706,0.0040252637,0.007268611,0.9200754,0.0027639717],"about_ca_topic_score_codex":0.0018167996,"about_ca_topic_score_gemma":0.0088650705,"teacher_disagreement_score":0.5964715,"about_ca_system_score_codex":0.000043062486,"about_ca_system_score_gemma":0.000072686606,"threshold_uncertainty_score":0.78757846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957808,0.00007459031,0.0012487855,0.00022157012,0.00034052963,0.00043586845,0.00007766688,0.00010642746,0.0017137214],"genre_scores_gemma":[0.98141325,0.000008701013,0.001504265,0.0006551363,0.000090613794,0.000007415945,0.000018216415,0.00006761977,0.01623481],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972075,0.0005596838,0.00031436133,0.00068381726,0.00065318536,0.0005814001],"domain_scores_gemma":[0.9984476,0.00022806718,0.00019089322,0.00058060297,0.00010408636,0.00044876133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001167428,0.00034094695,0.00043816998,0.00042375264,0.00073146546,0.0001045155,0.00068391475,0.00007664031,0.0000078344765],"category_scores_gemma":[0.00011097913,0.00038690396,0.00009778652,0.00047329848,0.000053900538,0.00044460583,0.0013710608,0.0006979643,2.8952337e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000594069,0.00052459654,0.97233933,0.0009122272,0.00037496144,0.0016959083,0.010912525,0.0001234945,0.0036416464,0.0031427725,0.00021841803,0.005520031],"study_design_scores_gemma":[0.015903488,0.0013443696,0.3846893,0.0011743042,0.0016427591,0.0022816656,0.24890885,0.00008734493,0.014398484,0.0019728865,0.31788903,0.009707497],"about_ca_topic_score_codex":0.0023164372,"about_ca_topic_score_gemma":0.17621782,"teacher_disagreement_score":0.58765006,"about_ca_system_score_codex":0.0009059763,"about_ca_system_score_gemma":0.0003589341,"threshold_uncertainty_score":0.99985826},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035895437,0.011197169,0.0015164647,0.0011926127,0.0018949648,0.0028183295,0.0006486252,0.0020073643,0.942829],"genre_scores_gemma":[0.0038803213,0.0068386844,0.01616547,0.0001760125,0.0011419848,0.00017940927,0.0006669367,0.0021279817,0.9688232],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99043053,0.001045597,0.0026863024,0.0025307434,0.0012135057,0.0020933172],"domain_scores_gemma":[0.98738647,0.00055847893,0.0057914755,0.005490435,0.0000775586,0.00069558795],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010158074,0.0017872952,0.0029480634,0.00084043393,0.0004336227,0.0008089409,0.0017549411,0.00080302666,0.0006650808],"category_scores_gemma":[0.00006801586,0.00173608,0.0007529186,0.00032540335,0.00082386326,0.0029768636,0.00028558436,0.0017799465,0.0000031902098],"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.00062894006,0.0004029363,0.0040530483,0.0020000783,0.0016377321,0.009694332,0.001557651,0.0000014868326,0.0007222363,0.0018610201,0.97616196,0.0012785762],"study_design_scores_gemma":[0.0024970435,0.0005866973,0.00030784452,0.0017323325,0.0004942898,0.002586727,0.00009991312,0.0000604483,0.005481064,0.017240126,0.9667353,0.0021782217],"about_ca_topic_score_codex":0.00012241848,"about_ca_topic_score_gemma":0.000087574015,"teacher_disagreement_score":0.032015115,"about_ca_system_score_codex":0.000098944656,"about_ca_system_score_gemma":0.0009226596,"threshold_uncertainty_score":0.9994872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96334046,0.00002644159,0.0005592954,0.0044794315,0.000075745316,0.0012391268,0.0020293833,0.00012626158,0.028123833],"genre_scores_gemma":[0.6231131,0.00015263245,0.004799527,0.0001582556,0.00009020874,0.0000016166747,0.000053452746,0.00012531203,0.3715059],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99351084,0.0025021867,0.00040374903,0.00077324844,0.001807793,0.0010022093],"domain_scores_gemma":[0.9891961,0.007876911,0.00041708135,0.0013261627,0.0006534038,0.00053032953],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0077753193,0.0004350325,0.0008590696,0.0015262086,0.0011810965,0.00004926134,0.001971403,0.00034260974,0.009203992],"category_scores_gemma":[0.002343583,0.00040043742,0.0005508921,0.0028454757,0.0011893292,0.00012263155,0.0011243193,0.000781357,0.00041514874],"study_design_candidate":"qualitative","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.075162254,0.0016361207,0.010495841,0.00080831547,0.0016330024,0.0043194047,0.15490344,0.000045780067,0.004453209,0.0036069877,0.7246724,0.018263256],"study_design_scores_gemma":[0.0046749953,0.00137942,0.0011690179,0.00045205373,0.00027500256,0.000022789312,0.9104137,0.0004534683,0.0002535466,0.0014978137,0.07861006,0.00079814426],"about_ca_topic_score_codex":0.0023771788,"about_ca_topic_score_gemma":0.0029768595,"teacher_disagreement_score":0.7555102,"about_ca_system_score_codex":0.0002054231,"about_ca_system_score_gemma":0.00043909685,"threshold_uncertainty_score":0.99984473},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008112963,0.0000219667,0.00011949631,0.00012590206,0.0008911324,0.00044557598,0.9970942,0.000118553624,0.0011020217],"genre_scores_gemma":[8.386899e-7,0.00007463923,0.000069209804,0.0004983797,0.0000020469643,0.0000069230177,0.99934626,9.75812e-9,0.0000017160369],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822265,0.00016469267,0.00054796116,0.00026083173,0.00047782608,0.0003260142],"domain_scores_gemma":[0.9981018,0.00013692291,0.0003824639,0.0008583492,0.00036923218,0.00015125283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006954287,0.00036252325,0.00047736673,0.00012716115,0.00025032868,0.00012591644,0.00064130814,0.0005104048,0.00037825142],"category_scores_gemma":[0.0011981372,0.00035720225,0.00026698492,0.00035818113,0.00012585332,0.00046453663,0.0005337809,0.00037688066,0.00021868128],"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.00004345091,0.000045166482,0.00006759876,0.0007835124,0.00005235906,0.000002237738,0.000035200526,5.6683615e-7,1.7705261e-8,0.0000040154823,0.99588555,0.0030802938],"study_design_scores_gemma":[0.00034971043,0.000023128288,0.0000013506307,0.000010677515,0.00012041364,0.0000025768607,0.00012744474,1.7135767e-7,0.0000033131867,0.000012740823,0.99903923,0.00030925556],"about_ca_topic_score_codex":0.0002280504,"about_ca_topic_score_gemma":0.000024167697,"teacher_disagreement_score":0.0031536368,"about_ca_system_score_codex":0.0003644689,"about_ca_system_score_gemma":0.0001969136,"threshold_uncertainty_score":0.999888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9158173,0.002276037,0.06797098,0.00055457075,0.0001876217,0.00073861994,0.0000106524585,0.00012703813,0.012317147],"genre_scores_gemma":[0.9279607,0.00039400056,0.0641125,0.00011424966,0.00016761018,0.000036947633,0.00001060077,0.00004370167,0.0071596853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983092,0.00031630008,0.00037022764,0.00048318255,0.00022566035,0.00029544826],"domain_scores_gemma":[0.99682534,0.0022709852,0.00015051985,0.00041267462,0.000082234175,0.00025827246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016933103,0.00028861928,0.0005464197,0.000049063405,0.00018301801,0.00009107793,0.000088067536,0.0001736417,0.00014788659],"category_scores_gemma":[0.0012995045,0.00021386653,0.00006217342,0.000057567897,0.00017746174,0.00029733565,0.0002660541,0.00013691706,1.187794e-7],"study_design_candidate":"design_other","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.0023864836,0.00139573,0.09630895,0.006945008,0.0004029428,0.00001710581,0.012481045,0.000004473583,0.016816473,0.17790785,0.057902876,0.62743104],"study_design_scores_gemma":[0.05976567,0.0051369206,0.08687139,0.0033555743,0.0022083293,0.0009607047,0.007203777,0.050354015,0.02105282,0.3764788,0.37750724,0.009104785],"about_ca_topic_score_codex":0.00041842612,"about_ca_topic_score_gemma":0.0017925157,"teacher_disagreement_score":0.61832625,"about_ca_system_score_codex":0.000053267377,"about_ca_system_score_gemma":0.0000089704845,"threshold_uncertainty_score":0.8721224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94493735,0.00005226952,0.0035704174,0.0011118922,0.00005311824,0.00009750562,7.7734296e-7,0.00000983412,0.05016686],"genre_scores_gemma":[0.9920429,0.0000134496195,0.007021864,0.0002543362,0.000030665775,0.000006994786,5.126142e-8,0.0000056091344,0.000624154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955714,0.00007672869,0.00010534243,0.000077916055,0.000071652896,0.00011119854],"domain_scores_gemma":[0.9991197,0.0006747519,0.000027086406,0.00014187963,0.000011654689,0.000024923156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461343,0.000055773384,0.00014581581,0.000011505863,0.000024937584,0.000008047854,0.000067420195,0.000010623774,0.00000507448],"category_scores_gemma":[0.00013210616,0.00002356701,0.000014797327,0.00003271193,0.000037913043,0.000023673012,0.000045884204,0.000036421246,2.4108035e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000028883867,0.000010416357,0.020325767,0.000028016431,0.000015700882,0.0000032080363,0.00017136597,4.747349e-7,0.00033497543,0.93070537,0.0012321343,0.04714366],"study_design_scores_gemma":[0.028963475,0.000065782086,0.057699803,0.0012017587,0.00013603829,0.000021461881,0.013603624,0.014881326,0.025646321,0.8258777,0.030070566,0.0018321095],"about_ca_topic_score_codex":0.5809804,"about_ca_topic_score_gemma":0.9814011,"teacher_disagreement_score":0.4004207,"about_ca_system_score_codex":0.00006097058,"about_ca_system_score_gemma":0.00006808148,"threshold_uncertainty_score":0.42180988},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04131491,0.000011425997,0.6316656,0.00083220104,0.0001310481,0.0005362596,0.0000011300125,0.00009293026,0.32541454],"genre_scores_gemma":[0.0335422,0.0000011438301,0.8852836,0.00038775746,0.00007968955,0.00016730043,5.558574e-7,0.000010443236,0.08052733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976194,0.000008987456,0.00006443081,0.00005378522,0.000029142493,0.00008169645],"domain_scores_gemma":[0.9995436,0.00026535228,0.000012635075,0.00010646595,0.000043857814,0.000028066643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014105659,0.00003307795,0.00005945714,0.000010731294,0.000017145678,0.000011233514,0.000039349834,0.000020215375,0.0002937254],"category_scores_gemma":[0.00021441512,0.000022847044,0.00003889932,0.000015785758,0.000005243295,0.00002677516,0.000010207254,0.000013725468,4.86778e-7],"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.0000012387036,0.000017246279,0.000034988683,0.00003279092,0.0000066792572,6.872801e-8,0.000057712914,3.054866e-8,0.0016133138,0.6052955,0.36209205,0.030848423],"study_design_scores_gemma":[0.00052932615,0.00007105755,0.000039618975,0.000008020812,0.000014089443,0.0000022954819,0.00036702742,0.0029996596,0.010436832,0.7162475,0.26910278,0.00018177679],"about_ca_topic_score_codex":0.0000102942795,"about_ca_topic_score_gemma":0.0000045098973,"teacher_disagreement_score":0.253618,"about_ca_system_score_codex":0.0000040044447,"about_ca_system_score_gemma":0.000003419759,"threshold_uncertainty_score":0.32160872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567487,0.000045153716,0.023573194,0.00062732375,0.0011359375,0.0017164428,0.0003006853,0.000043481938,0.015809033],"genre_scores_gemma":[0.9813353,0.00003318926,0.016543997,0.00076908636,0.000068658635,0.0000938664,0.00002329172,0.000035863308,0.0010967514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764884,0.0001282744,0.001196783,0.00015971992,0.00046329104,0.0004031046],"domain_scores_gemma":[0.99674785,0.001154513,0.00058507815,0.0011888794,0.0002657987,0.00005789762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038439,0.00030597093,0.0005641977,0.0001556935,0.00019825628,0.000035035217,0.0008444331,0.00018497623,0.000027407346],"category_scores_gemma":[0.0008979353,0.00016991321,0.0004823363,0.00039226055,0.0002274455,0.00016104404,0.0002818388,0.00037954788,6.027066e-7],"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.00066536956,0.00087440707,0.0020556669,0.0032385734,0.00058480713,0.0000015366644,0.015163761,0.00012771525,0.003794718,0.9242803,0.038562115,0.010651046],"study_design_scores_gemma":[0.016501533,0.0016666079,0.0046258657,0.006522329,0.0012554199,0.000065935375,0.024208156,0.09306962,0.5273746,0.25975546,0.06263626,0.0023182228],"about_ca_topic_score_codex":0.0000175953,"about_ca_topic_score_gemma":0.000019837673,"teacher_disagreement_score":0.66452485,"about_ca_system_score_codex":0.00007374463,"about_ca_system_score_gemma":0.00009652299,"threshold_uncertainty_score":0.692886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8170687,0.00026942036,0.17844225,0.0002641436,0.00017731189,0.00028832298,0.00012399825,0.000035726855,0.0033300985],"genre_scores_gemma":[0.9584883,0.000056559245,0.03549019,0.000005635724,0.00001496484,5.3298334e-7,0.000020761143,0.00001348774,0.0059095644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.000052803152,0.00015069281,0.00015435937,0.00011754089,0.00015434792],"domain_scores_gemma":[0.9989749,0.00065189524,0.000079077865,0.00017048676,0.000080354665,0.00004325245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044211157,0.000083071915,0.00023720835,0.00019303853,0.000050075116,0.0000053099607,0.00010330696,0.000065625834,0.000012806256],"category_scores_gemma":[0.000057286976,0.00009401181,0.00013482072,0.0002124188,0.0000686899,0.000118172116,0.00006191582,0.00007979092,1.5901881e-7],"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.00032137756,0.00032680875,0.004475229,0.002125318,0.00030061966,0.00005735092,0.009154823,0.00052081974,0.013891656,0.91266286,0.037896805,0.018266331],"study_design_scores_gemma":[0.012771229,0.002063379,0.022376373,0.0050533214,0.0020115192,0.000045209883,0.08908487,0.67288446,0.026749924,0.02617839,0.13832244,0.0024589042],"about_ca_topic_score_codex":0.00030367664,"about_ca_topic_score_gemma":0.00026451887,"teacher_disagreement_score":0.88648444,"about_ca_system_score_codex":0.00004828494,"about_ca_system_score_gemma":0.00006689094,"threshold_uncertainty_score":0.38336906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29099515,0.004678893,0.7015767,0.0003423086,0.0005672673,0.0015551044,0.00018972691,0.000024976225,0.00006985844],"genre_scores_gemma":[0.730065,0.014919047,0.2538189,0.000042514344,0.00028569103,0.00004999692,0.000011763001,0.000066506516,0.000740602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99076265,0.0025542206,0.0019298656,0.0012601422,0.0005479794,0.00294514],"domain_scores_gemma":[0.9894244,0.0060924715,0.0023532403,0.0008987209,0.0009455749,0.0002856061],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.020409048,0.0010187498,0.0022344268,0.00029913714,0.00065476086,0.00020714304,0.00033231126,0.0011440505,0.0000051777542],"category_scores_gemma":[0.0076141236,0.0009854721,0.0005229214,0.0002870179,0.00030893378,0.00023187992,0.0008713565,0.0071738246,1.4084962e-8],"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.002151846,0.0015297671,0.0031606455,0.007565222,0.00520687,0.000027221746,0.013127443,0.0001994249,0.013696894,0.8068468,0.000014203336,0.14647369],"study_design_scores_gemma":[0.0037254137,0.00074211083,0.0013086982,0.0036347252,0.0014255801,0.00046244127,0.007838261,0.089965835,0.0038580813,0.8857741,0.00007953362,0.001185225],"about_ca_topic_score_codex":0.00021473893,"about_ca_topic_score_gemma":0.0007429559,"teacher_disagreement_score":0.44775784,"about_ca_system_score_codex":0.0012608258,"about_ca_system_score_gemma":0.0051550483,"threshold_uncertainty_score":0.9992596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039698696,0.000059815073,0.98966086,0.0002530734,0.00044270742,0.00017339838,0.00021374504,0.00007640537,0.005150136],"genre_scores_gemma":[0.0737988,0.0000036147078,0.9232474,0.0005031614,0.000065046865,0.000012770984,0.00010835917,0.000016723327,0.0022441437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987978,0.00011661,0.00036320597,0.00023981342,0.00028560974,0.00019696931],"domain_scores_gemma":[0.9969938,0.0023719748,0.00009349535,0.00016536018,0.00029390657,0.000081482016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038333551,0.00015246557,0.00022085234,0.000113316666,0.00016596031,0.000029117546,0.00011123106,0.00006553032,0.000080143145],"category_scores_gemma":[0.0009827267,0.0001497847,0.000055234414,0.00018480673,0.00007933634,0.000031338575,0.00007958648,0.00013486519,0.000001171595],"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.000019560643,0.00009526287,0.00026792742,0.00007171742,0.00004500824,0.00001699981,0.00008093968,0.0028178636,0.000024005729,0.92280084,0.056149475,0.017610416],"study_design_scores_gemma":[0.0005967996,0.000018905912,0.0010057596,0.00006092272,0.000044739296,0.000006346944,0.000049153976,0.3089672,0.00006135294,0.6765816,0.012426332,0.00018086392],"about_ca_topic_score_codex":0.0000091830325,"about_ca_topic_score_gemma":0.000010319722,"teacher_disagreement_score":0.30614936,"about_ca_system_score_codex":0.00006462052,"about_ca_system_score_gemma":0.00015012719,"threshold_uncertainty_score":0.61080426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91792613,0.0010621984,0.07068714,0.0041131037,0.0005623191,0.0035386817,0.0014327128,0.00017675867,0.0005009358],"genre_scores_gemma":[0.92740554,0.00063642877,0.06686142,0.00006671627,0.00066005177,0.0000944139,0.0027331784,0.00026054037,0.0012817249],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99684644,0.0006237417,0.0003937268,0.0006902018,0.00079989654,0.0006460171],"domain_scores_gemma":[0.9945525,0.0033271068,0.00033145744,0.0008450495,0.0007078714,0.00023602828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017082212,0.0003780428,0.0007464152,0.00028509702,0.00073813926,0.00006235622,0.0010493813,0.00036863575,0.000060146067],"category_scores_gemma":[0.0011018398,0.00036799596,0.00055240677,0.00032014796,0.00019103911,0.00012329359,0.00023007524,0.00088931294,0.0000014158705],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016517645,0.0020870657,0.00072423165,0.028886776,0.004936741,0.00047295704,0.73278356,0.00033789597,0.026512763,0.023646627,0.04395455,0.11913922],"study_design_scores_gemma":[0.009602383,0.0015784687,0.0025744096,0.009000509,0.0019645498,0.000005719718,0.744789,0.03859022,0.014749291,0.014316505,0.15954712,0.0032818492],"about_ca_topic_score_codex":0.00006632606,"about_ca_topic_score_gemma":0.00012339542,"teacher_disagreement_score":0.11585737,"about_ca_system_score_codex":0.00032170603,"about_ca_system_score_gemma":0.00028676091,"threshold_uncertainty_score":0.9998772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3952163,0.0020484824,0.5750447,0.0005713791,0.0001746113,0.006731463,0.0002761793,0.00013450754,0.01980241],"genre_scores_gemma":[0.30314794,0.0023233744,0.6617468,0.00016986672,0.00016141686,0.005392667,0.0006826733,0.00034765163,0.026027592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99653065,0.00032387482,0.000904568,0.0010429554,0.00064916833,0.0005487612],"domain_scores_gemma":[0.99599993,0.0011973258,0.0009554149,0.00096310873,0.0004674004,0.00041680023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012592738,0.00072434766,0.0011735131,0.0005477238,0.00065874495,0.00013874842,0.00036849416,0.00031042215,0.00012701891],"category_scores_gemma":[0.0005308519,0.00071326765,0.00011322329,0.0009782894,0.00020005944,0.0001249389,0.000341172,0.0006506942,1.7463759e-7],"study_design_candidate":"qualitative","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.0013825692,0.0016771927,0.0014388595,0.030947898,0.0011411683,0.000019425795,0.3094756,0.0007584048,0.011920926,0.44341347,0.00033417475,0.19749032],"study_design_scores_gemma":[0.008215903,0.0035375345,0.0026279846,0.007783803,0.0059570153,0.00025014384,0.7040888,0.20733748,0.0146178845,0.009604421,0.027316002,0.0086630145],"about_ca_topic_score_codex":0.00015307659,"about_ca_topic_score_gemma":0.00029307336,"teacher_disagreement_score":0.43380907,"about_ca_system_score_codex":0.00009638516,"about_ca_system_score_gemma":0.0002643341,"threshold_uncertainty_score":0.99953187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90683335,0.0025893021,0.07851975,0.00177136,0.0020220585,0.0025953865,0.0009538986,0.00015221206,0.004562698],"genre_scores_gemma":[0.7752077,0.0028166692,0.06307361,0.000059310114,0.00057959673,0.000010027768,0.00002454529,0.00017576091,0.15805279],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950524,0.0008424334,0.0012645245,0.0009810963,0.0008713782,0.0009881753],"domain_scores_gemma":[0.99484175,0.0008386745,0.0021871682,0.0010306634,0.0006533224,0.00044840947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021837892,0.00067038025,0.00154594,0.00031505304,0.0006215519,0.00002750934,0.0011879851,0.0011520219,0.00018029258],"category_scores_gemma":[0.0003877105,0.00067114463,0.0011299117,0.00026451857,0.0006820596,0.0007774139,0.00058072165,0.00057177735,0.0000015141148],"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.01041203,0.00152393,0.012210493,0.007822873,0.004006932,0.00038454647,0.030392753,0.000093283445,0.7829366,0.011888827,0.1257308,0.012596994],"study_design_scores_gemma":[0.09745059,0.011325568,0.0055501433,0.033412203,0.01916216,0.001238073,0.075617306,0.055966306,0.31891558,0.014861199,0.35248658,0.014014299],"about_ca_topic_score_codex":0.00012087905,"about_ca_topic_score_gemma":0.000037943606,"teacher_disagreement_score":0.46402097,"about_ca_system_score_codex":0.00053357345,"about_ca_system_score_gemma":0.00049570267,"threshold_uncertainty_score":0.999574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047426615,0.0009149305,0.8852251,0.0012181505,0.0024421536,0.0015052594,0.00002212334,0.00014848582,0.10378115],"genre_scores_gemma":[0.0132750245,0.0003170937,0.8745187,0.0006836495,0.00043454266,0.00014295653,0.00000947271,0.000059529357,0.11055902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973018,0.000186546,0.0010326207,0.00066950615,0.0001979298,0.0006115513],"domain_scores_gemma":[0.9959306,0.0024847402,0.0002775955,0.00066782424,0.00052001484,0.0001191855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003296564,0.00038756194,0.000672755,0.00034007613,0.0004733027,0.00019629108,0.0002650735,0.00038555378,0.00007741066],"category_scores_gemma":[0.0033698645,0.00038180378,0.00045849508,0.0005401073,0.000049556533,0.00013190927,0.00017486776,0.0002909933,2.3599523e-7],"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.000396492,0.00032504302,0.00006226327,0.005494538,0.0005098773,0.0000024663095,0.000818825,0.00055388344,0.0152787315,0.7880861,0.02160493,0.16686684],"study_design_scores_gemma":[0.006362983,0.00088670466,0.0000355458,0.00610324,0.0021255836,0.000022915021,0.005542977,0.2958847,0.06308087,0.121174246,0.49654117,0.0022390657],"about_ca_topic_score_codex":0.000036857396,"about_ca_topic_score_gemma":0.00005493821,"teacher_disagreement_score":0.66691184,"about_ca_system_score_codex":0.00020622155,"about_ca_system_score_gemma":0.0002584072,"threshold_uncertainty_score":0.9998634},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011759162,0.00022261088,0.056815114,0.00013532436,0.00016409729,0.0010737572,0.000076396005,0.00058921333,0.9408059],"genre_scores_gemma":[0.000017655697,0.00006195861,0.45366323,0.0007565501,0.00040261983,0.00013699294,0.000005587934,0.00026374348,0.5446917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947372,0.00062285486,0.0014398247,0.0011287382,0.0009583211,0.0011130639],"domain_scores_gemma":[0.9921835,0.0042526587,0.0009355826,0.0018761997,0.00017377589,0.0005782755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023472414,0.0012319131,0.0028621384,0.00009538115,0.00026306877,0.00012808289,0.0009486352,0.0007564678,0.00067306124],"category_scores_gemma":[0.0004986025,0.0010588109,0.002575555,0.00012502172,0.0015917361,0.000046157642,0.0003582191,0.001608672,0.000014037155],"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.00004103448,0.00018681622,5.8116177e-7,0.0016419361,0.0013744519,0.0000428815,0.00520774,0.0000012243863,0.00006918629,0.18098842,0.49505284,0.31539288],"study_design_scores_gemma":[0.00033986225,0.00017829909,1.6197954e-7,0.000453435,0.0007022644,0.00004753976,0.000514445,0.00081529596,0.00008508938,0.39634317,0.5993449,0.0011755165],"about_ca_topic_score_codex":0.00002393616,"about_ca_topic_score_gemma":0.0000041685494,"teacher_disagreement_score":0.3968481,"about_ca_system_score_codex":0.0005227872,"about_ca_system_score_gemma":0.0005061521,"threshold_uncertainty_score":0.9991862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001271784,0.0000249984,0.8228217,0.00006473256,0.000058916445,0.00012500091,9.347251e-7,0.000071187664,0.17556074],"genre_scores_gemma":[0.22629893,0.0000033337897,0.7685828,0.00010057809,0.00010239049,0.000012796787,0.0000014564879,0.000018052026,0.0048796483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994364,0.00006398986,0.00010063232,0.000088179375,0.000114137685,0.00019670314],"domain_scores_gemma":[0.9994959,0.00013213822,0.00004596551,0.0001783896,0.000050132807,0.000097473865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385393,0.000090799294,0.00011733722,0.000033228378,0.000040192306,0.000010462233,0.000050235245,0.00004389976,0.00022875736],"category_scores_gemma":[0.00006868009,0.000059892252,0.000027778893,0.00008891842,0.000018965804,0.00013298717,0.000019748193,0.00005380293,1.9465817e-7],"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.00017863746,0.00046848436,0.0038705752,0.00008883839,0.00014958135,0.0000059872905,0.0036608095,0.0014505895,0.00012694442,0.9554961,0.015923211,0.018580267],"study_design_scores_gemma":[0.010036394,0.0027532072,0.0009413901,0.00056491455,0.0011728029,0.00039144358,0.027511999,0.8164188,0.02824532,0.028587595,0.07792499,0.0054511204],"about_ca_topic_score_codex":0.000008751431,"about_ca_topic_score_gemma":0.000012394757,"teacher_disagreement_score":0.9269085,"about_ca_system_score_codex":0.000021795133,"about_ca_system_score_gemma":0.00001170643,"threshold_uncertainty_score":0.25047326},"labels":[],"label_agreement":null}]}