{"meta":{"query_hash":"252b0e7a09be","filters":{"venue":"Combinatorics Probability Computing"},"cohort_total":106,"direct_labels_cover":0,"predictions_cover":106,"exported":106,"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/252b0e7a09be","api":"https://metacan.xera.ac/api/v1/cohort?venue=Combinatorics+Probability+Computing"},"results":[{"id":"W1521395182","doi":"10.1017/s0963548316000158","title":"Forward Clusters for Degenerate Random Environments","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":9,"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":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Degenerate energy levels; Combinatorics; Mathematics; Lattice (music); Percolation (cognitive psychology); Random graph; Component (thermodynamics); Connected component; Hexagonal lattice; Set (abstract data type); Statistical physics; Discrete mathematics; Physics; Computer science; Graph; Quantum mechanics","score_opus":0.04983120555318541,"score_gpt":0.29697628927078185,"score_spread":0.24714508371759644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521395182","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.046278294,0.00004014363,0.9514854,0.00030499927,0.0006687124,0.0009693986,0.000024770692,0.00010242931,0.00012586082],"genre_scores_gemma":[0.92129666,0.0000043092537,0.07828835,0.0000605439,0.0000773717,0.000059583428,0.0000031156058,0.000038381433,0.00017169396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981243,0.00007403456,0.00053967204,0.00048591715,0.00028301618,0.0004930585],"domain_scores_gemma":[0.9956552,0.0034619628,0.0002026496,0.00040604573,0.00011490465,0.00015924513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010564036,0.00023345281,0.00040287408,0.0000380798,0.00023872429,0.000035248602,0.00030123617,0.00011099123,0.000013040247],"category_scores_gemma":[0.004738842,0.0001670695,0.00013135478,0.00012671386,0.000072538176,0.000073802075,0.00020027667,0.00009374355,0.000014315536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012088151,0.00026508412,0.00011484327,0.00032737778,0.000044030607,0.0000015287644,0.00013287156,0.000029631225,0.00048866065,0.96706176,0.00038911912,0.031024188],"study_design_scores_gemma":[0.0033274759,0.00018000387,0.000014354148,0.00008271241,0.00004691949,0.0000032654168,0.000009721983,0.027769923,0.0018696679,0.9660185,0.00043052505,0.00024690753],"about_ca_topic_score_codex":9.18958e-7,"about_ca_topic_score_gemma":8.5111265e-7,"teacher_disagreement_score":0.87501836,"about_ca_system_score_codex":0.00023366565,"about_ca_system_score_gemma":0.000050546732,"threshold_uncertainty_score":0.6812897},"labels":[],"label_agreement":null},{"id":"W1573350772","doi":"10.1017/s0963548315000322","title":"Local Maxima of Quadratic Boolean Functions","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Trinity College","funders":"","keywords":"Maxima; Boolean function; Generalization; Quadratic equation; Maxima and minima; Function (biology); Quadratic function","score_opus":0.08224524302706783,"score_gpt":0.30350843026178137,"score_spread":0.22126318723471355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573350772","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.878552,0.00011812944,0.112694174,0.00006561361,0.0012132704,0.0003648731,0.0000045870693,0.00015355709,0.006833764],"genre_scores_gemma":[0.99257404,5.6028733e-7,0.007239554,0.000022419017,0.000044848555,0.0000034487055,0.0000033675196,0.000023425822,0.00008833858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815094,0.00021117549,0.0006207188,0.00031612784,0.00039974714,0.0003012606],"domain_scores_gemma":[0.99788606,0.0005461512,0.00025889184,0.00069306104,0.00044683315,0.00016902821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015754367,0.00019825538,0.00040184284,0.00008596407,0.0002269777,0.00002163952,0.0003544818,0.00012221627,0.0000126722325],"category_scores_gemma":[0.0014294309,0.00017715851,0.00013985799,0.00042112978,0.00029773504,0.00008275188,0.00038001724,0.00029221427,0.0000055289624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020813142,0.0003052081,0.0052083386,0.0002598916,0.00003594132,0.000002220258,0.0017030278,0.00025532037,0.000009772326,0.9881439,0.00078277016,0.0032727772],"study_design_scores_gemma":[0.0005604609,0.00016704218,0.0005717557,0.000042636068,0.000036962658,0.0000113989,0.00050984195,0.0058707944,0.00029440326,0.99142605,0.00032405433,0.00018460536],"about_ca_topic_score_codex":0.000014293149,"about_ca_topic_score_gemma":0.0000030349804,"teacher_disagreement_score":0.11402201,"about_ca_system_score_codex":0.0001718922,"about_ca_system_score_gemma":0.00011460065,"threshold_uncertainty_score":0.7224315},"labels":[],"label_agreement":null},{"id":"W1778871662","doi":"10.1017/s096354831400073x","title":"Orientability Thresholds for Random Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"","keywords":"Hypergraph; Combinatorics; Conjecture; Cardinality (data modeling); Vertex (graph theory); Mathematics; Graph; Orientation (vector space); Discrete mathematics; Computer science; Geometry","score_opus":0.12500517015308962,"score_gpt":0.34212752033350835,"score_spread":0.21712235018041873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778871662","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.9584471,0.00019032543,0.0328215,0.00012855843,0.0026370792,0.0015795477,0.000010951677,0.00037159692,0.0038133597],"genre_scores_gemma":[0.98072267,0.0000013565555,0.018922446,0.000063526444,0.0001531651,0.000039376333,0.0000071825975,0.0000407645,0.000049519942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735785,0.00027247934,0.0007217188,0.0006380203,0.00045532515,0.00055462134],"domain_scores_gemma":[0.99576735,0.0019818826,0.00024366201,0.00099137,0.0007363361,0.00027939407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044411086,0.0003193255,0.00059235597,0.00008829829,0.00055516063,0.00006539355,0.00057641574,0.00019660039,0.000006854295],"category_scores_gemma":[0.0051753563,0.00027436906,0.0003096901,0.0004622145,0.00026078412,0.00013352916,0.0004539455,0.00030584415,0.0000018530285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017032742,0.00033417658,0.03367982,0.00024974812,0.00004204909,0.0000010453823,0.001787951,0.000047535777,0.000009268899,0.961345,0.0010237277,0.0013093092],"study_design_scores_gemma":[0.0034269486,0.00018723334,0.00050092133,0.000023876159,0.00004752864,0.000009750128,0.00017693311,0.0023439256,0.00025926705,0.9912611,0.0014372077,0.00032528516],"about_ca_topic_score_codex":0.000008099519,"about_ca_topic_score_gemma":0.0000030608198,"teacher_disagreement_score":0.0331789,"about_ca_system_score_codex":0.00023980427,"about_ca_system_score_gemma":0.00012667799,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W1788889037","doi":"10.1017/s0963548316000201","title":"Median Eigenvalues of Bipartite Subcubic Graphs","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","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":"Simon Fraser University","funders":"","keywords":"Eigenvalues and eigenvectors; Bipartite graph; Interval (graph theory); Graph; Degree (music); Complete bipartite graph","score_opus":0.06222979210801924,"score_gpt":0.3082428999989921,"score_spread":0.2460131078909729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788889037","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.98964113,0.00006377934,0.007826421,0.00040170783,0.00024797124,0.00042365724,0.000007944019,0.00019104159,0.00119637],"genre_scores_gemma":[0.9955347,0.000007779518,0.0043346365,0.000012817257,0.000023197394,0.000015452923,0.0000014415239,0.000020448717,0.000049494247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831545,0.00019021485,0.00058099726,0.00034400367,0.00025583405,0.0003134898],"domain_scores_gemma":[0.99708587,0.0015208959,0.00028849556,0.0007379941,0.00025383508,0.00011288987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014492646,0.00017243174,0.00032437214,0.00010868358,0.00017471293,0.000013016096,0.00040481347,0.000092999784,0.000030086792],"category_scores_gemma":[0.0010409481,0.0001274543,0.00016063963,0.00060579274,0.00028210378,0.000086237305,0.00016317738,0.00011439893,0.000016909426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059094245,0.0002978316,0.018331798,0.00012947858,0.000021611932,4.3960162e-7,0.0003179581,0.0000012986616,0.0021886965,0.97505033,0.00011414531,0.0035404842],"study_design_scores_gemma":[0.00035469077,0.000057764715,0.0021895606,0.00009275559,0.000024285411,0.0000021750157,0.000027394031,0.00009177059,0.012523366,0.9843035,0.00017199847,0.00016076618],"about_ca_topic_score_codex":0.000004742156,"about_ca_topic_score_gemma":0.0000030304786,"teacher_disagreement_score":0.016142238,"about_ca_system_score_codex":0.000056755533,"about_ca_system_score_gemma":0.000047940848,"threshold_uncertainty_score":0.51974356},"labels":[],"label_agreement":null},{"id":"W1968569626","doi":"10.1017/s0963548302005321","title":"The Wiener Index of Random Trees","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":65,"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; Wiener index; Bivariate analysis; Limit (mathematics); Limit of a function; Probabilistic logic; Index (typography); Binary number; Random variable; Applied mathematics; Statistical physics; Statistics; Mathematical analysis; Combinatorics; Computer science; Physics","score_opus":0.051646312621922104,"score_gpt":0.2780597385568273,"score_spread":0.2264134259349052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968569626","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.9846083,0.00025957843,0.0076169325,0.00038989837,0.00021772491,0.00054974365,0.0000016842887,0.0001246005,0.006231516],"genre_scores_gemma":[0.99901414,0.0000091389,0.0007556573,0.000011875478,0.000023811546,0.000015431358,4.790236e-7,0.000012398376,0.00015709647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868804,0.0001924774,0.00046639808,0.00020984383,0.00021409192,0.0002291274],"domain_scores_gemma":[0.9964745,0.0024150666,0.00023461597,0.00064880535,0.00017693134,0.000050077953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013621786,0.00012530336,0.00023098792,0.000032497013,0.0004556183,0.000030759755,0.00041823488,0.000063242915,0.000015727655],"category_scores_gemma":[0.00096953317,0.000090180925,0.00012515332,0.00044232793,0.00023610891,0.000045714423,0.0001388923,0.00018909348,0.000006090098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008085162,0.0003073509,0.0038064662,0.000044422464,0.000018431498,1.8118408e-7,0.00045333736,0.000048618105,0.00004485809,0.99062073,0.00034049634,0.0043070395],"study_design_scores_gemma":[0.0006532516,0.000026305786,0.00085625105,0.000020089587,0.00001574932,0.0000018803782,0.000058008103,0.011198907,0.00041886177,0.9858222,0.00083055365,0.00009793676],"about_ca_topic_score_codex":0.0000033415201,"about_ca_topic_score_gemma":0.0000037446448,"teacher_disagreement_score":0.014405791,"about_ca_system_score_codex":0.000034624572,"about_ca_system_score_gemma":0.000010798842,"threshold_uncertainty_score":0.36774713},"labels":[],"label_agreement":null},{"id":"W1982329607","doi":"10.1017/s0963548313000631","title":"The Random Connection Model on the Torus","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"McGill University","funders":"","keywords":"Torus; Connection (principal bundle); Random graph; Mathematics; Combinatorics; Bounded function; Infinity; Graph; Discrete mathematics; Constant (computer programming); Computer science; Mathematical analysis; Geometry","score_opus":0.060110409667839086,"score_gpt":0.29574564686368426,"score_spread":0.23563523719584517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982329607","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.051856782,0.00002826968,0.94183826,0.0013525068,0.0007532785,0.00058511406,0.0000018464908,0.00015010523,0.0034338492],"genre_scores_gemma":[0.99630183,0.0000025660554,0.0033193433,0.00018214111,0.000078186844,0.000025422278,6.9834965e-7,0.000020507217,0.00006932637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983023,0.00023855388,0.00041101754,0.0003092819,0.00038538824,0.00035348342],"domain_scores_gemma":[0.98515284,0.01371585,0.00018147337,0.00061141653,0.00026447282,0.00007394299],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0030536023,0.00018407637,0.00024210257,0.000016371958,0.0010786502,0.00012417811,0.00044620907,0.00007857889,0.00000395052],"category_scores_gemma":[0.018066946,0.00010200888,0.00008803002,0.00021443512,0.000098695,0.000028776769,0.00016624975,0.00037117596,0.000013921432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035341298,0.00009328584,0.000006978281,0.00004866439,0.000011099716,1.6195298e-7,0.00014467334,0.0008856162,0.000006708421,0.9923516,0.00047983008,0.005936036],"study_design_scores_gemma":[0.00030478227,0.00007009269,0.000004745095,0.000019484994,0.00001108895,0.0000011914024,0.00002356351,0.46554804,0.000059850863,0.5337447,0.00014051954,0.00007191877],"about_ca_topic_score_codex":0.0000031718928,"about_ca_topic_score_gemma":0.0000030474396,"teacher_disagreement_score":0.944445,"about_ca_system_score_codex":0.00011692013,"about_ca_system_score_gemma":0.000048725396,"threshold_uncertainty_score":0.9902043},"labels":[],"label_agreement":null},{"id":"W1984081854","doi":"10.1017/s0963548311000101","title":"Lower Bounds for the Cop Number when the Robber is Fast","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","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 Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.04472043208422285,"score_gpt":0.24861083978108775,"score_spread":0.2038904076968649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984081854","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.07642003,0.00024091729,0.9057793,0.002736563,0.003763088,0.0012598219,0.00000377639,0.0004352944,0.009361191],"genre_scores_gemma":[0.9874383,0.0000035154346,0.011277309,0.0009646094,0.0000999141,0.000046046534,7.3891346e-7,0.000019072646,0.00015047776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978338,0.00022100878,0.00041568125,0.00062857196,0.0003376016,0.0005633251],"domain_scores_gemma":[0.99637353,0.0012713769,0.00019966986,0.0017080926,0.00035339087,0.00009395582],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026369863,0.00026502783,0.00023463438,0.000036821617,0.00133676,0.00035619768,0.0027521718,0.00009917802,0.000059477414],"category_scores_gemma":[0.00018960475,0.00016637365,0.00031294563,0.000682805,0.00031602205,0.000274916,0.0010136494,0.00037381976,0.000040292365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002000008,0.0002563542,0.005572054,0.000032862885,0.000054767774,0.0000011013647,0.00811838,0.000019431998,0.0000037003085,0.9668977,0.0030279236,0.015995707],"study_design_scores_gemma":[0.00036755027,0.00011548978,0.0025119393,0.0000220191,0.000027355432,0.000011258352,0.00008134911,0.022145802,0.00022734069,0.9583558,0.015868757,0.00026533465],"about_ca_topic_score_codex":0.000031967567,"about_ca_topic_score_gemma":0.0000040129185,"teacher_disagreement_score":0.9110183,"about_ca_system_score_codex":0.00007593037,"about_ca_system_score_gemma":0.00008776564,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W1988754041","doi":"10.1017/s0963548308009127","title":"On a Question of Bourgain about Geometric Incidences","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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 Calgary; University of British Columbia","funders":"","keywords":"Omega; Euclidean space; Euclidean geometry; Combinatorics; Line (geometry); Set (abstract data type); Space (punctuation); Mathematics; Computer science; Geometry; Physics","score_opus":0.027631551208523907,"score_gpt":0.2659481453081043,"score_spread":0.2383165940995804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988754041","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.5557876,0.00019080196,0.44255668,0.00010518063,0.00051838026,0.00017841897,5.767503e-7,0.00011333012,0.00054900016],"genre_scores_gemma":[0.97854626,0.000014905394,0.02125167,0.000080854385,0.000049845083,0.000005057726,0.000005059145,0.00000658545,0.00003978137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775136,0.00025456923,0.0005487086,0.0005093908,0.0006600485,0.00027591528],"domain_scores_gemma":[0.9976884,0.0008534128,0.00031407306,0.0005127049,0.000527621,0.00010376425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014690474,0.00017496357,0.00027284576,0.00046290056,0.00035362903,0.000050125138,0.000683126,0.00008480033,0.00000416387],"category_scores_gemma":[0.0012760342,0.00017854816,0.00010094963,0.0028239395,0.00009501703,0.00032719813,0.000294092,0.00021216705,0.000015511181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009321262,0.0006936077,0.009088297,0.00007594789,0.000015179633,0.000010271985,0.000573118,0.036977507,0.00011944149,0.928404,0.00025856151,0.023774793],"study_design_scores_gemma":[0.0006732534,0.0006194421,0.09538814,0.00010495151,0.000006612982,0.00005739024,0.000007984644,0.26199308,0.00517051,0.6353985,0.00019361392,0.00038649593],"about_ca_topic_score_codex":0.000027157606,"about_ca_topic_score_gemma":9.18577e-7,"teacher_disagreement_score":0.4227586,"about_ca_system_score_codex":0.00016900849,"about_ca_system_score_gemma":0.00022726518,"threshold_uncertainty_score":0.7280983},"labels":[],"label_agreement":null},{"id":"W1992296250","doi":"10.1017/s096354830300587x","title":"Rainbow Arithmetic Progressions and Anti-Ramsey Results","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":49,"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":"Univerzita Karlova v Praze","keywords":"Rainbow; Van der Waerden's theorem; Arithmetic progression; Mathematics; Monochromatic color; Arithmetic; Class (philosophy); Combinatorics; Term (time); Ramsey theory; Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.04527451832759227,"score_gpt":0.30251243573841324,"score_spread":0.25723791741082097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992296250","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.9909779,0.000306482,0.001267729,0.0001515338,0.0008461097,0.000695027,0.0000055035975,0.0002597384,0.0054899827],"genre_scores_gemma":[0.9752156,0.0000088300085,0.024588045,0.00004060349,0.000035863704,0.0000066802495,0.0000024119759,0.000029839648,0.0000720848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749374,0.00047005134,0.0006307141,0.00059810246,0.0003260075,0.0004813639],"domain_scores_gemma":[0.99721557,0.0014042151,0.00025735734,0.0007306257,0.00021187593,0.00018036753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025147183,0.00028173087,0.00042545897,0.00009665554,0.00083326927,0.000090321606,0.00027659943,0.00017846301,0.0000061800147],"category_scores_gemma":[0.005821587,0.00023742836,0.00010056229,0.0004614614,0.0003030193,0.000084171355,0.00033819315,0.0004569934,0.0000014967562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009886804,0.00023956216,0.010411616,0.0002040987,0.000026459436,0.000006785462,0.0013975336,0.00000939757,0.000019000276,0.98507756,0.00021664274,0.0023814782],"study_design_scores_gemma":[0.000980348,0.000072611474,0.0037488176,0.00009723973,0.000030264124,0.000039400442,0.00009961865,0.00057885255,0.00032181054,0.9929103,0.00082757283,0.00029316082],"about_ca_topic_score_codex":0.0000026316543,"about_ca_topic_score_gemma":6.508977e-7,"teacher_disagreement_score":0.023320317,"about_ca_system_score_codex":0.00007536739,"about_ca_system_score_gemma":0.0000623027,"threshold_uncertainty_score":0.96820474},"labels":[],"label_agreement":null},{"id":"W2004887104","doi":"10.1017/s0963548305006772","title":"Self-Avoiding Walks on Hyperbolic Graphs","year":2005,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"York University","funders":"","keywords":"Euclidean geometry; Hyperbolic geometry; Mathematics; Hyperbolic triangle; Reversing; Plane (geometry); Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.04799376499972036,"score_gpt":0.30512191605811484,"score_spread":0.2571281510583945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004887104","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.59263265,0.00019242777,0.39265913,0.00069342717,0.0011853956,0.0010881653,0.000009038527,0.0013640918,0.010175656],"genre_scores_gemma":[0.9235878,0.000005565616,0.07603537,0.00015720702,0.0001285844,0.000012758622,0.0000020029183,0.000043395066,0.000027340155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753684,0.00014332274,0.0006219443,0.0005898998,0.00050324365,0.00060475257],"domain_scores_gemma":[0.99613833,0.0026071551,0.00020180548,0.000579323,0.0002617113,0.0002116699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013050602,0.00032023116,0.00045407977,0.00010284058,0.00048311835,0.00008144565,0.0004349257,0.00015720278,0.000018877903],"category_scores_gemma":[0.0038415147,0.00030567477,0.00013090049,0.0005362014,0.000045133675,0.00008872905,0.00023361536,0.0006358647,0.00006741419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010485313,0.00067607587,0.00008975209,0.000317738,0.00002425501,0.0000034769691,0.000548389,0.00005150457,0.000022020515,0.9872484,0.00018862743,0.010819259],"study_design_scores_gemma":[0.00052195357,0.00019339834,0.000058064936,0.00008342091,0.00003718538,0.000011807621,0.00004330225,0.07796514,0.0004051994,0.9196683,0.00069320115,0.0003190349],"about_ca_topic_score_codex":0.0000022673428,"about_ca_topic_score_gemma":0.0000016036954,"teacher_disagreement_score":0.33095512,"about_ca_system_score_codex":0.000331257,"about_ca_system_score_gemma":0.00007915696,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W2010515315","doi":"10.1017/s0963548314000315","title":"Part Sizes of Smooth Supercritical Compositional Structures","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Topological and Geometric Data Analysis","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Poisson distribution; Mathematics; Supercritical fluid; Multiplicity (mathematics); Combinatorics; Genus; Graph; Statistical physics; Mathematical analysis; Statistics; Physics; Biology","score_opus":0.019875927365830923,"score_gpt":0.24662250376672315,"score_spread":0.22674657640089224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010515315","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.57910883,0.00012009952,0.4177354,0.0007510316,0.0004959971,0.00012664206,0.0000082553,0.00017125154,0.0014824929],"genre_scores_gemma":[0.9793596,0.000002457154,0.020404886,0.00013947063,0.000065892564,0.0000019251518,0.000015360127,0.0000047611093,0.0000056337212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997713,0.00028625145,0.0005524902,0.00057045015,0.00051372434,0.00036405431],"domain_scores_gemma":[0.99755555,0.0011434221,0.00007097955,0.00075272674,0.00032363136,0.000153659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472449,0.00018138633,0.0004281523,0.00014436204,0.00021182843,0.00009764147,0.001234884,0.00009844006,0.00003313683],"category_scores_gemma":[0.00096526113,0.00015429877,0.00014886096,0.0012490613,0.0002512302,0.00021446265,0.00083309045,0.00022902981,0.0000093909775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002476781,0.0002384441,0.010283844,0.000042556905,0.000016652148,0.0000012169215,0.000047190493,0.00018857725,0.00009727459,0.9790665,0.00013002861,0.009885233],"study_design_scores_gemma":[0.00034095743,0.00020243698,0.031192876,0.000016290265,0.00001700716,0.000006222343,0.000008613132,0.03053535,0.0015194482,0.9348861,0.0010434688,0.0002312518],"about_ca_topic_score_codex":0.000023733655,"about_ca_topic_score_gemma":0.0000011408753,"teacher_disagreement_score":0.40025076,"about_ca_system_score_codex":0.00005428924,"about_ca_system_score_gemma":0.000041677955,"threshold_uncertainty_score":0.62921214},"labels":[],"label_agreement":null},{"id":"W2018074536","doi":"10.1017/s0963548301004965","title":"The Chromatic Number of Graph Powers","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"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":"Simon Fraser University","keywords":"Mathematics; Graph; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.028188386149385156,"score_gpt":0.28389335437364815,"score_spread":0.255704968224263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018074536","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.6868468,0.00085563655,0.29645047,0.0011175472,0.0012742694,0.0009092809,0.0000011368544,0.0004526078,0.012092278],"genre_scores_gemma":[0.9890395,0.000022251248,0.010784032,0.000026070287,0.000014154188,0.000007484587,2.6940702e-7,0.000012758798,0.00009350313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973875,0.00037722127,0.0005437505,0.00047203564,0.0006426628,0.0005768278],"domain_scores_gemma":[0.9962804,0.0015064811,0.00024371319,0.0014853034,0.0003563167,0.00012778467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018614506,0.00018694779,0.00026555656,0.00007432451,0.0005842313,0.00012927376,0.002224397,0.00006593098,0.000013760008],"category_scores_gemma":[0.00076008943,0.00014625404,0.00015410599,0.0017070725,0.0004279413,0.0002878745,0.0008992896,0.00035683482,0.000051418316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024109847,0.00020390454,0.00867572,0.0000712141,0.000020943357,0.000003174162,0.00069757743,0.00016351313,0.000053453634,0.9758581,0.00016147485,0.014088535],"study_design_scores_gemma":[0.00029390116,0.000065070315,0.001509243,0.000030166248,0.000003012664,0.000016530184,0.000030752355,0.07472271,0.00040617833,0.92243236,0.00032338264,0.00016669078],"about_ca_topic_score_codex":0.0000049152727,"about_ca_topic_score_gemma":6.9542386e-7,"teacher_disagreement_score":0.30219272,"about_ca_system_score_codex":0.000116002375,"about_ca_system_score_gemma":0.00003428831,"threshold_uncertainty_score":0.59640664},"labels":[],"label_agreement":null},{"id":"W2020233469","doi":"10.1017/s0963548311000642","title":"Corrádi and Hajnal's Theorem for Sparse Random Graphs","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Independent set; Graph; Random graph; Binary logarithm; Discrete mathematics; Computer science","score_opus":0.049873761704026916,"score_gpt":0.296083561940946,"score_spread":0.24620980023691907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020233469","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.97184974,0.0006847343,0.022284327,0.000058339738,0.0017142566,0.0011610051,0.00000744174,0.00019865639,0.0020414826],"genre_scores_gemma":[0.9854974,0.000008998755,0.014186408,0.000070856484,0.00013710368,0.000021350279,0.0000036556198,0.000038008267,0.000036227368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805236,0.00022859349,0.0005093401,0.00036458598,0.00023222255,0.00061291456],"domain_scores_gemma":[0.9958955,0.0029404236,0.00022920639,0.0005357166,0.0001971575,0.00020199196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003239932,0.00028153835,0.0004966347,0.000085100786,0.0006881269,0.000057382644,0.0002870973,0.00015551153,0.000009263147],"category_scores_gemma":[0.0019304068,0.00023487925,0.00018859672,0.00024015653,0.00026411272,0.00015001128,0.00035512156,0.00026237257,0.0000010212237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096818,0.00019597053,0.017098222,0.00030664596,0.000044428747,3.5868948e-7,0.0026092713,0.000003309289,0.000016513959,0.97665423,0.00024810206,0.0027261018],"study_design_scores_gemma":[0.0018059292,0.000091963346,0.0015115724,0.000039600036,0.00007005379,0.000017037712,0.00012732655,0.0013537727,0.00021193351,0.99387336,0.00060843356,0.00028904752],"about_ca_topic_score_codex":0.0000027978592,"about_ca_topic_score_gemma":6.176536e-7,"teacher_disagreement_score":0.017219072,"about_ca_system_score_codex":0.000070711,"about_ca_system_score_gemma":0.000025061323,"threshold_uncertainty_score":0.95780975},"labels":[],"label_agreement":null},{"id":"W2022956475","doi":"10.1017/s0963548306007693","title":"Colouring Random 4-Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"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 graph; Mathematics; Random regular graph; Combinatorics; Discrete mathematics; Exponential random graph models; Chromatic scale; Graph; Line graph; Pathwidth","score_opus":0.021718065295472547,"score_gpt":0.26021704019595693,"score_spread":0.23849897490048438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022956475","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.98205733,0.00023203253,0.0075053563,0.00007137923,0.0010859208,0.0006157042,0.0000022618674,0.00044439075,0.007985617],"genre_scores_gemma":[0.9914402,0.000001836549,0.008230019,0.000030805935,0.00012511764,0.000008597023,0.000003967621,0.000039540184,0.000119940305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975779,0.00027692626,0.00068568095,0.00050805404,0.00041507243,0.0005363625],"domain_scores_gemma":[0.9975633,0.0011188696,0.00026349543,0.00073812524,0.00022536093,0.00009083549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017571091,0.0003034034,0.00049533916,0.00012498912,0.0008131075,0.00007769831,0.000489662,0.00017021991,0.000017337523],"category_scores_gemma":[0.0006004188,0.00027672367,0.00025978775,0.0005194794,0.00021385105,0.00009658196,0.00042536354,0.0003734802,0.0000033926672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002497463,0.00021464216,0.013357667,0.00018314533,0.00002648259,0.000007183711,0.00025081992,0.00014307396,0.000091036025,0.9846112,0.0004622557,0.00062748324],"study_design_scores_gemma":[0.0015281684,0.000044401964,0.0030307525,0.000046295056,0.000036649653,0.000013464254,0.000026445978,0.0015794013,0.0011279372,0.99183685,0.0004094252,0.0003201855],"about_ca_topic_score_codex":0.000026349653,"about_ca_topic_score_gemma":0.000004214104,"teacher_disagreement_score":0.0103269145,"about_ca_system_score_codex":0.00014184043,"about_ca_system_score_gemma":0.00003717134,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2023591833","doi":"10.1017/s0963548312000260","title":"Longest Path Distance in Random Circuits","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Algorithms and Data Compression","field":"Computer Science","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":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Path (computing); Electronic circuit; Computer science; Mathematics; Electrical engineering; Computer network; Engineering","score_opus":0.022531646828238227,"score_gpt":0.24885589015984275,"score_spread":0.22632424333160453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023591833","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.18957043,0.0015113034,0.8044892,0.00015414658,0.0019383723,0.000460521,0.000002710381,0.00028276176,0.0015905405],"genre_scores_gemma":[0.9885444,0.000013883515,0.011207061,0.000065339744,0.00012155343,0.000010984729,0.0000067784094,0.000013201554,0.00001678967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974043,0.0002607422,0.00052866014,0.0005961685,0.0004373943,0.0007727584],"domain_scores_gemma":[0.99794906,0.000421371,0.00018324694,0.0010875165,0.00012423868,0.00023455282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995773,0.00024603997,0.000362218,0.00009390985,0.00023354903,0.00015887806,0.0012379744,0.00010768151,0.00000477495],"category_scores_gemma":[0.00031814017,0.00023436693,0.00007902589,0.00083843846,0.000062824416,0.0010684285,0.0010551912,0.00039386612,0.00003387831],"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.000010647,0.0014595251,0.28570572,0.00017017822,0.000010515865,0.000019073137,0.002380974,0.0004222839,0.000061342274,0.61038077,0.00043642664,0.098942555],"study_design_scores_gemma":[0.0062021394,0.00019151613,0.31942952,0.00046779818,0.00001396612,0.000060619564,0.00007685283,0.42750892,0.00056214805,0.2319001,0.011912679,0.0016737531],"about_ca_topic_score_codex":0.00003346726,"about_ca_topic_score_gemma":0.0000022842376,"teacher_disagreement_score":0.798974,"about_ca_system_score_codex":0.00027245132,"about_ca_system_score_gemma":0.00009365328,"threshold_uncertainty_score":0.9557206},"labels":[],"label_agreement":null},{"id":"W2030362910","doi":"10.1017/s0963548309990216","title":"The <i>t</i>-Improper Chromatic Number of Random Graphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"McGill University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Random graph; Graph; Constant (computer programming); Discrete mathematics; Degree (music); Computer science; Physics","score_opus":0.023055607890313284,"score_gpt":0.29374503954948333,"score_spread":0.27068943165917003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030362910","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.9881447,0.00022589872,0.0015539594,0.00017745621,0.0007167091,0.00064689515,0.0000012777398,0.00014257591,0.008390548],"genre_scores_gemma":[0.9962257,0.00001003454,0.0035859512,0.00006264638,0.00003884615,0.0000038817448,7.8661446e-7,0.00001786885,0.00005424396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977491,0.00033043534,0.0007880466,0.00030700222,0.00042404563,0.0004013855],"domain_scores_gemma":[0.99650574,0.0018495888,0.00036812952,0.0009034031,0.00029342427,0.00007972932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023190824,0.00023846154,0.00045965656,0.00003726874,0.0007980138,0.000053440854,0.00065507204,0.00011347058,0.000011475632],"category_scores_gemma":[0.0015184142,0.00015042952,0.00024928313,0.0004674512,0.00029072154,0.000073575495,0.0002135107,0.00033208416,0.000002667752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037224087,0.0001864555,0.0030296163,0.00014489883,0.000029263605,0.0000011022206,0.0009413445,0.0000084529875,0.000073486146,0.9904514,0.00023439294,0.004862339],"study_design_scores_gemma":[0.0010099867,0.0000789395,0.002456296,0.000050800856,0.000037240105,0.000014478333,0.00004812031,0.0009214389,0.0005653103,0.99447495,0.00016092506,0.00018151729],"about_ca_topic_score_codex":0.0000036353433,"about_ca_topic_score_gemma":6.224062e-7,"teacher_disagreement_score":0.008336304,"about_ca_system_score_codex":0.00005899493,"about_ca_system_score_gemma":0.000043029624,"threshold_uncertainty_score":0.61377573},"labels":[],"label_agreement":null},{"id":"W2031110152","doi":"10.1017/s0963548399004162","title":"Zeros of Reliability Polynomials and <i>f</i>-vectors of Matroids","year":2000,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","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":"University of Waterloo","funders":"","keywords":"Matroid; Multigraph; Mathematics; Combinatorics; Interlacing; Order (exchange); Conjecture; Series (stratigraphy); Discrete mathematics; Function (biology); Hermite polynomials; Polynomial; Pure mathematics; Computer science","score_opus":0.029618361255642385,"score_gpt":0.29316199890300687,"score_spread":0.2635436376473645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031110152","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.99475497,0.00013332715,0.0023625575,0.000050492126,0.00036401406,0.0008598871,0.000010334557,0.0001552874,0.0013091578],"genre_scores_gemma":[0.9680338,0.000016207454,0.031793702,0.0000072829735,0.00003684088,0.0000075740877,0.0000015245296,0.000044934237,0.0000581473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667984,0.0002810832,0.0015738279,0.000533267,0.000510908,0.00042105472],"domain_scores_gemma":[0.9953527,0.002272685,0.0006893774,0.0011183227,0.00042193057,0.00014498756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019520333,0.00034337657,0.0010870994,0.00009004469,0.0001280311,0.000019106621,0.0004698285,0.00019449185,0.000047169495],"category_scores_gemma":[0.0027001929,0.00034183174,0.00018655659,0.0005785194,0.00043574683,0.0001570665,0.00029053443,0.0003135857,0.0000028216052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010667566,0.0018514054,0.016005214,0.0037906636,0.00006996446,0.0000018987931,0.0020244676,0.00022307552,0.0032428228,0.9652929,0.00010115067,0.0072898176],"study_design_scores_gemma":[0.00091864576,0.00025397012,0.0010249023,0.000178582,0.000055890963,0.0000071467966,0.00005590071,0.0008557397,0.018076664,0.9782277,0.000068554444,0.00027631654],"about_ca_topic_score_codex":0.000025279787,"about_ca_topic_score_gemma":5.3778604e-7,"teacher_disagreement_score":0.029431144,"about_ca_system_score_codex":0.00015695216,"about_ca_system_score_gemma":0.00009819981,"threshold_uncertainty_score":0.9999034},"labels":[],"label_agreement":null},{"id":"W2032160258","doi":"10.1017/s096354831200034x","title":"(<i>k</i>+1)-Cores Have <i>k</i>-Factors","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Conjecture; Mathematics; Combinatorics; Core (optical fiber); Discrete mathematics; Computer science; Telecommunications","score_opus":0.07341463199734996,"score_gpt":0.31347880665337574,"score_spread":0.24006417465602578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032160258","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.98408693,0.00031353434,0.0025628079,0.000038940678,0.0023568722,0.00043954645,0.0000040562095,0.0003906824,0.009806634],"genre_scores_gemma":[0.99473816,0.0000030591348,0.0047675944,0.00007502078,0.0002549279,0.000005226577,0.0000043523555,0.0000502886,0.00010134551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741477,0.0002817058,0.0005949259,0.0003954436,0.0004504376,0.00086270354],"domain_scores_gemma":[0.99692446,0.0014930515,0.0002629227,0.00085090735,0.00018246504,0.0002861948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017635144,0.00036520557,0.00046925552,0.000099855715,0.0007286094,0.00005422688,0.00052912266,0.00019535163,0.000043406133],"category_scores_gemma":[0.0016297124,0.00030417833,0.00023392844,0.00031968582,0.00020682458,0.0002496072,0.0006418033,0.00048498565,0.000007437027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056423514,0.00026003,0.2825788,0.00012489005,0.000028557604,6.8773556e-7,0.0029924691,0.000004245609,0.000024005723,0.71295667,0.00044723632,0.00057673943],"study_design_scores_gemma":[0.00032632996,0.00004459967,0.024368,0.000031205993,0.000038397666,0.000008824364,0.00022323556,0.0001964527,0.0014111033,0.9717069,0.0012626152,0.0003823175],"about_ca_topic_score_codex":0.000010352138,"about_ca_topic_score_gemma":0.0000012344098,"teacher_disagreement_score":0.25875023,"about_ca_system_score_codex":0.00017736247,"about_ca_system_score_gemma":0.00003164248,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W2038424818","doi":"10.1017/s0963548303005765","title":"Canonical Vertex Partitions","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":24,"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":"Arity; Countable set; Mathematics; Vertex (graph theory); Partition (number theory); Signature (topology); Binary number; Discrete mathematics; Finite set; Combinatorics; Graph; Arithmetic; Geometry; Mathematical analysis","score_opus":0.024399635549270653,"score_gpt":0.24892566394276597,"score_spread":0.2245260283934953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038424818","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.17931662,0.00022952155,0.80401886,0.00043596214,0.0015251706,0.00031501625,6.3379605e-7,0.0005784532,0.0135797765],"genre_scores_gemma":[0.9678646,0.0000028717168,0.031847708,0.00019618018,0.00001649452,0.000008273503,0.0000012412553,0.000008812219,0.00005386667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980252,0.00023696065,0.00036220692,0.0005954234,0.00027266063,0.00050754764],"domain_scores_gemma":[0.9983349,0.0003585834,0.00009984901,0.00085183064,0.00016632232,0.00018853614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880916,0.00018247381,0.00022951215,0.00005247443,0.00041518832,0.0001166655,0.0007416909,0.00008376783,0.000013584445],"category_scores_gemma":[0.00069558364,0.00018026489,0.00010055816,0.00078542816,0.00009028997,0.0003044379,0.0002918284,0.00030264514,0.00006290432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0941816e-7,0.00019370337,0.003101192,0.000013964788,0.0000051045595,0.0000064849273,0.00014263096,0.00045404217,0.000028971393,0.9934159,0.00012459588,0.0025129088],"study_design_scores_gemma":[0.00031665352,0.00007081941,0.001924307,0.000012121833,0.000003641524,0.000022480785,0.000009196969,0.010945466,0.000482451,0.98207045,0.0039067757,0.00023561025],"about_ca_topic_score_codex":0.0000040670307,"about_ca_topic_score_gemma":0.0000021400958,"teacher_disagreement_score":0.78854793,"about_ca_system_score_codex":0.0001889292,"about_ca_system_score_gemma":0.00020711687,"threshold_uncertainty_score":0.7350989},"labels":[],"label_agreement":null},{"id":"W2042502099","doi":"10.1017/s0963548308009097","title":"On the Maximum Degree of a Random Planar Graph","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"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":"Combinatorics; Mathematics; Planar graph; Random regular graph; Degree (music); Random graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; 1-planar graph; Outerplanar graph; Independent set; Chordal graph; Pathwidth; Line graph; Computer science; Physics","score_opus":0.07886002661000079,"score_gpt":0.270923936666516,"score_spread":0.19206391005651519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042502099","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.9865431,0.00008749656,0.004851475,0.00014265247,0.000564273,0.000605008,0.0000042911356,0.000109815664,0.0070918687],"genre_scores_gemma":[0.99776316,0.000006876902,0.0020571207,0.000085492626,0.000034996912,0.0000063705174,0.0000011406847,0.000022365408,0.000022504679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798876,0.00036101244,0.00056379795,0.00032094738,0.0004453437,0.00032016542],"domain_scores_gemma":[0.9943497,0.00420139,0.00030123763,0.0008880423,0.00019271376,0.00006687265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015943933,0.00023054259,0.00044009712,0.00008736229,0.0007307311,0.000012316249,0.0006148842,0.000114745075,0.000018893263],"category_scores_gemma":[0.0021662484,0.00014936994,0.00024259252,0.00044638602,0.0004207324,0.000036514997,0.00020095498,0.00040762933,0.0000022734584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007669261,0.00022476351,0.0032513652,0.00011772513,0.000048108268,0.000006051359,0.0017650184,0.00002873223,0.000016540615,0.9932721,0.00069096487,0.0005019391],"study_design_scores_gemma":[0.0010062448,0.00012402226,0.0018435965,0.00005529795,0.000020691077,0.000022958795,0.000058695663,0.0003711779,0.00049481017,0.99578995,0.00004851571,0.00016406806],"about_ca_topic_score_codex":0.000009501488,"about_ca_topic_score_gemma":0.0000012413486,"teacher_disagreement_score":0.011220012,"about_ca_system_score_codex":0.000054511296,"about_ca_system_score_gemma":0.000045910212,"threshold_uncertainty_score":0.609113},"labels":[],"label_agreement":null},{"id":"W2046240182","doi":"10.1017/s0963548314000169","title":"The First<i>k</i>-Regular Subgraph is Large","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.01952974264315668,"score_gpt":0.26406210588842854,"score_spread":0.24453236324527186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046240182","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.9681852,0.0005320336,0.01874886,0.001433661,0.0024636283,0.0007967008,0.000005144348,0.00047219553,0.0073626125],"genre_scores_gemma":[0.997595,0.000011927829,0.001693585,0.00040645406,0.00013922504,0.000009064489,0.0000013133591,0.000038905666,0.00010448263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997443,0.00029841936,0.00059239165,0.00050208677,0.00047395163,0.00069015275],"domain_scores_gemma":[0.9955146,0.0024385878,0.00026640997,0.0013906959,0.00027071065,0.00011905274],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003963622,0.00029849308,0.0003664803,0.00005520151,0.0026391058,0.00013682665,0.00093281694,0.00016257835,0.0000137045445],"category_scores_gemma":[0.0017336477,0.00020875754,0.00026336528,0.0004734307,0.00026209975,0.00007578986,0.0007289639,0.00044801476,0.000008139883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008195186,0.00011608601,0.010644002,0.00013279075,0.000035189056,6.231832e-7,0.0010209061,0.000004369986,0.0000020821317,0.9825617,0.0033389193,0.0021351422],"study_design_scores_gemma":[0.0004874914,0.000058889327,0.0019481583,0.000032830394,0.000025741483,0.000005092199,0.00003897196,0.0043254322,0.00020149545,0.93886656,0.053754583,0.0002547582],"about_ca_topic_score_codex":0.000004300218,"about_ca_topic_score_gemma":0.000008084166,"teacher_disagreement_score":0.050415665,"about_ca_system_score_codex":0.00008637063,"about_ca_system_score_gemma":0.000026264916,"threshold_uncertainty_score":0.9986593},"labels":[],"label_agreement":null},{"id":"W2057596055","doi":"10.1017/s0963548310000489","title":"The Evolution of the Cover Time","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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 British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Cover (algebra); Upper and lower bounds; Time complexity; Discrete mathematics; Order (exchange); Vertex cover; Random graph; Conjecture; Binary logarithm; Hypercube; Graph","score_opus":0.04537290750389973,"score_gpt":0.26179305032167577,"score_spread":0.21642014281777605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057596055","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.18576768,0.00020757462,0.79856604,0.00013766385,0.0013186862,0.00093067746,0.000008688481,0.00012810038,0.012934881],"genre_scores_gemma":[0.9946378,7.2889173e-7,0.005169606,0.000009544941,0.000018648685,0.0000045388074,1.85911e-7,0.00001207751,0.0001468654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871236,0.0001172855,0.0004204455,0.00019315751,0.0003096605,0.000247089],"domain_scores_gemma":[0.99726343,0.0015499643,0.0002601331,0.00055773417,0.00032431018,0.000044427175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010743808,0.00011953303,0.00018851034,0.000013048554,0.0003696639,0.00001685758,0.0005447792,0.000066618355,0.00001757952],"category_scores_gemma":[0.004775483,0.00006905534,0.00008950234,0.00034093147,0.00016250598,0.000032792304,0.00034685206,0.00020151887,0.00001630379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010135043,0.00013756676,0.00033616324,0.00009081223,0.000012563952,1.9329677e-7,0.00034684048,0.0000038778007,0.000027251714,0.99794155,0.00018164582,0.00091137993],"study_design_scores_gemma":[0.00015984145,0.00006309168,0.00088014005,0.00004217535,0.000026550959,0.000002871919,0.000044793953,0.025768658,0.00034002273,0.9725431,0.00004659182,0.00008211853],"about_ca_topic_score_codex":0.000015902395,"about_ca_topic_score_gemma":0.0000014167023,"teacher_disagreement_score":0.80887014,"about_ca_system_score_codex":0.00019269601,"about_ca_system_score_gemma":0.00012235262,"threshold_uncertainty_score":0.57170445},"labels":[],"label_agreement":null},{"id":"W2061450212","doi":"10.1017/s0963548312000272","title":"Connectivity for Bridge-Addable Monotone Graph Classes","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Monotone polygon; Mathematics; Vertex (graph theory); Graph; Monotonic function; Discrete mathematics; Geometry","score_opus":0.058127070442409265,"score_gpt":0.3213482555105076,"score_spread":0.26322118506809833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061450212","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.33122182,0.00035252285,0.66526973,0.00021380867,0.0009733081,0.00097616203,0.000003662314,0.00042759895,0.0005613614],"genre_scores_gemma":[0.9566357,0.0000056932613,0.043009464,0.00008001418,0.000115085386,0.00007804667,0.000004293427,0.000029345112,0.00004235572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964731,0.00037939302,0.00048506708,0.0008174462,0.0004943235,0.0013506811],"domain_scores_gemma":[0.99529,0.0021943056,0.00022188082,0.001348683,0.00056597777,0.0003791919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003909139,0.00031946023,0.0004521012,0.00020514736,0.00070707727,0.00019720875,0.0015218762,0.00013999057,0.0000032791534],"category_scores_gemma":[0.0015184912,0.0003322678,0.00022593715,0.0014575935,0.000207139,0.0012775116,0.0010808599,0.00043278848,0.000019965346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001822068,0.00064840866,0.044066105,0.00014520016,0.000026537613,9.497818e-7,0.00042464517,0.00029508225,0.00028461244,0.9446772,0.00020180519,0.009211255],"study_design_scores_gemma":[0.0007726334,0.00018560438,0.023891121,0.000024839193,0.00000829767,0.000013134455,0.000017274975,0.031028949,0.0040340843,0.9381378,0.0014502342,0.0004360288],"about_ca_topic_score_codex":0.00001737788,"about_ca_topic_score_gemma":0.000001997587,"teacher_disagreement_score":0.6254139,"about_ca_system_score_codex":0.00031037495,"about_ca_system_score_gemma":0.00013259621,"threshold_uncertainty_score":0.9999129},"labels":[],"label_agreement":null},{"id":"W2062486876","doi":"10.1017/s096354831400056x","title":"An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"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":"Combinatorics; Ramsey's theorem; Mathematics; Monochromatic color; Graph; Linearity; Integer (computer science); Discrete mathematics; Upper and lower bounds; Computer science; Physics","score_opus":0.024372395465655682,"score_gpt":0.296762292521978,"score_spread":0.2723898970563223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062486876","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.99481195,0.000012333961,0.0018667384,0.00004366006,0.0008974982,0.0006058029,0.0000092663895,0.000021593363,0.0017311386],"genre_scores_gemma":[0.9966392,3.9917614e-7,0.0032600139,0.000020511905,0.000044645745,0.0000025560978,3.4092074e-7,0.00001748254,0.000014874053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974286,0.00083417416,0.0007557051,0.0002709005,0.0005022931,0.00020832894],"domain_scores_gemma":[0.9952974,0.0017474385,0.0009348403,0.001379138,0.00059785286,0.000043356857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796476,0.00018152352,0.00046576295,0.000017548042,0.0002202598,0.000009895136,0.0011512068,0.00012296,0.000008657107],"category_scores_gemma":[0.0041421773,0.00010517426,0.00025276342,0.00040250242,0.00057116925,0.00005371336,0.0007446563,0.0003710541,1.01787506e-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.000013955551,0.0005061454,0.09961752,0.0005843995,0.00003789696,6.94603e-8,0.0034027973,0.00019960332,0.00019715338,0.89408255,0.000011349185,0.0013465809],"study_design_scores_gemma":[0.0003595606,0.000076262375,0.016674817,0.00012613366,0.000036484907,0.0000024807139,0.00006506275,0.0074145044,0.028766155,0.9463587,0.000014802301,0.000105036794],"about_ca_topic_score_codex":0.000038713813,"about_ca_topic_score_gemma":0.0000040562004,"teacher_disagreement_score":0.0829427,"about_ca_system_score_codex":0.00004836243,"about_ca_system_score_gemma":0.00006733276,"threshold_uncertainty_score":0.49588725},"labels":[],"label_agreement":null},{"id":"W2064212735","doi":"10.1017/s0963548307008796","title":"An Analysis of the Height of Tries with Random Weights on the Edges","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Algorithms and Data Compression","field":"Computer Science","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":"Trie; Combinatorics; Mathematics; Exponent; String (physics); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Alphabet; Function (biology); Discrete mathematics; Computer science; Data structure","score_opus":0.01640925999895056,"score_gpt":0.24312366649816672,"score_spread":0.22671440649921615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064212735","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.61674106,0.000060927294,0.38211432,0.00016020011,0.00029444718,0.00029668448,0.0000030910494,0.000041839146,0.00028742134],"genre_scores_gemma":[0.9947046,0.000001737737,0.0051979106,0.00004420395,0.000034984663,0.0000018535806,0.0000026463108,0.0000059489753,0.0000061022693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785,0.00031084262,0.00052341656,0.00042659466,0.00062560197,0.00026356065],"domain_scores_gemma":[0.99566925,0.0014208854,0.0004599088,0.0018206071,0.0005621612,0.00006719939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025266283,0.00017723718,0.00042303483,0.00014495477,0.00037662007,0.00006471984,0.0019086677,0.000062522005,0.0000027704477],"category_scores_gemma":[0.00026054904,0.00008437157,0.00017355931,0.0023606566,0.00026270025,0.00020294626,0.000495074,0.00022483336,4.2624595e-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.00013353265,0.0010694253,0.06471114,0.000066195586,0.00031193302,0.0000020574817,0.0026825538,0.0051967558,0.00013963738,0.9080911,0.00006905461,0.017526593],"study_design_scores_gemma":[0.0021568867,0.0008033949,0.2818738,0.00022819541,0.000341393,0.0000030400888,0.00027727836,0.51772994,0.05502639,0.14049919,0.00056784693,0.00049266225],"about_ca_topic_score_codex":0.000048429083,"about_ca_topic_score_gemma":0.000012499243,"teacher_disagreement_score":0.76759195,"about_ca_system_score_codex":0.000058173744,"about_ca_system_score_gemma":0.00008523397,"threshold_uncertainty_score":0.35468113},"labels":[],"label_agreement":null},{"id":"W2069653438","doi":"10.1017/s0963548309009833","title":"Decision Trees and Influences of Variables Over Product Probability Spaces","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"Bounded function; Conjecture; Mathematics; Monotonic function; Product (mathematics); Combinatorics; Domain (mathematical analysis); Function (biology); Constant (computer programming); Statement (logic); Random variable; Tree (set theory); Variable (mathematics); Discrete mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.02129531390923371,"score_gpt":0.2567866917483657,"score_spread":0.23549137783913202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069653438","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.9612717,0.00082156906,0.03527679,0.00051235955,0.00044736292,0.0006125926,0.000001417665,0.000209233,0.00084695814],"genre_scores_gemma":[0.8985009,0.00001997499,0.101369224,0.00006225898,0.00003484098,0.000002777325,9.2048276e-7,0.0000054168586,0.000003676143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971934,0.00019676742,0.0006960753,0.00095712236,0.0005222957,0.00043435162],"domain_scores_gemma":[0.9975862,0.0005560999,0.00033538032,0.0010656512,0.0003184978,0.0001381643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019678255,0.0002832714,0.0004975138,0.00011442375,0.00027060485,0.00025742987,0.0010234956,0.00010466401,0.0000024011294],"category_scores_gemma":[0.0009382912,0.0002333022,0.00008891332,0.0009817632,0.00021140734,0.0005885987,0.00059675926,0.00023950679,0.0000013361333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028393584,0.0010063769,0.13824141,0.00020486179,0.000022039423,0.00000479757,0.0014313196,0.001964607,0.00042820204,0.577573,0.00010861471,0.2789864],"study_design_scores_gemma":[0.00033138876,0.00026531733,0.25775152,0.00007217277,0.0000075196494,0.00000688595,0.000008529035,0.022782356,0.00035900573,0.7180564,0.00013610626,0.00022278924],"about_ca_topic_score_codex":0.000045932127,"about_ca_topic_score_gemma":0.0000048311435,"teacher_disagreement_score":0.2787636,"about_ca_system_score_codex":0.000088891466,"about_ca_system_score_gemma":0.00012597686,"threshold_uncertainty_score":0.95137876},"labels":[],"label_agreement":null},{"id":"W2071386577","doi":"10.1017/s0963548313000540","title":"Conflict-Free Colouring of Graphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Natural Sciences and Engineering Research Council of Canada; Freie Universität Berlin; Hungarian Scientific Research Fund; Deutsche Forschungsgemeinschaft","keywords":"Chromatic scale; Critical graph; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Graph; Probabilistic logic; Discrete mathematics; Line graph; Voltage graph; Statistics","score_opus":0.04105905275934962,"score_gpt":0.2772389971211725,"score_spread":0.23617994436182288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071386577","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.989962,0.00012304826,0.0011799135,0.000082995255,0.0006642141,0.000721945,0.0000028281338,0.00017924988,0.0070838397],"genre_scores_gemma":[0.9889431,0.0000037162952,0.010898281,0.00003505383,0.000030051713,0.000010983408,0.0000010575786,0.000026791582,0.00005094334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980205,0.00017804159,0.0007001856,0.00035480986,0.00035562823,0.0003907866],"domain_scores_gemma":[0.99675214,0.001167237,0.0003539726,0.0011612895,0.00045083807,0.00011449492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010083066,0.00022925845,0.00046996295,0.000113342416,0.00031154932,0.000037783328,0.00085032097,0.00014649997,0.00006178704],"category_scores_gemma":[0.0018607925,0.00020544013,0.00018475429,0.000420768,0.00026536486,0.000116426214,0.00091606716,0.00031755606,0.0000038956246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004909613,0.00016636042,0.015418585,0.0003619761,0.000039867784,8.49607e-7,0.0012310877,0.000013749268,0.00016747662,0.9808998,0.0006674598,0.0010278686],"study_design_scores_gemma":[0.00058054196,0.00008372244,0.007122727,0.00005833235,0.000021562257,0.000005455424,0.000089765104,0.0010133825,0.0016449232,0.9890675,0.00009986203,0.00021222747],"about_ca_topic_score_codex":0.00003657052,"about_ca_topic_score_gemma":0.0000011505854,"teacher_disagreement_score":0.009718367,"about_ca_system_score_codex":0.00006856329,"about_ca_system_score_gemma":0.00003478611,"threshold_uncertainty_score":0.8377605},"labels":[],"label_agreement":null},{"id":"W2071579776","doi":"10.1017/s0963548306007875","title":"Reconstructing Odd Necklaces","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"Trinity College","funders":"","keywords":"Computer science","score_opus":0.020988891127924663,"score_gpt":0.2596845590390479,"score_spread":0.23869566791112326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071579776","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.39773956,0.00011233086,0.59644395,0.00019259208,0.0014535681,0.00016757776,2.0683476e-7,0.0002989666,0.0035912725],"genre_scores_gemma":[0.87550855,0.0000015794711,0.124167606,0.00011300274,0.00014747791,0.0000014322334,0.0000032245337,0.000008007224,0.00004913644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782443,0.00010462367,0.0005723419,0.00060859736,0.0004079292,0.00048205047],"domain_scores_gemma":[0.99800545,0.0006970205,0.00022597471,0.0005310346,0.00037892215,0.00016161635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031164014,0.0001896526,0.00021213702,0.0001969289,0.0004738639,0.00021885763,0.0007461499,0.000092519374,0.0000054647658],"category_scores_gemma":[0.00050338206,0.00020582847,0.00009268991,0.0014020699,0.000058111287,0.00048737618,0.00047873362,0.00027241994,0.000024910973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048025145,0.00014564146,0.017193457,0.000047725116,0.000014019148,0.000009324609,0.0005800524,0.0025326489,0.00036983698,0.78810954,0.0001032704,0.19088967],"study_design_scores_gemma":[0.00061919127,0.00012715906,0.012173485,0.000041887397,0.000006880512,0.00009410696,0.000068399306,0.3205384,0.0071192025,0.6563015,0.0023913865,0.0005184309],"about_ca_topic_score_codex":0.000008771384,"about_ca_topic_score_gemma":0.0000027517162,"teacher_disagreement_score":0.47776896,"about_ca_system_score_codex":0.00019858885,"about_ca_system_score_gemma":0.00012659689,"threshold_uncertainty_score":0.8393442},"labels":[],"label_agreement":null},{"id":"W2072859770","doi":"10.1017/s096354831000026x","title":"Pegging Graphs Yields a Small Diameter","year":2010,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"Logarithm; Random graph; Graph; Mathematics; Combinatorics; Random regular graph; Midpoint; Indifference graph; Discrete mathematics; Pathwidth; Line graph; Geometry; Mathematical analysis","score_opus":0.05592154933511002,"score_gpt":0.29899361595737434,"score_spread":0.24307206662226433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072859770","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.45516017,0.000017940694,0.5412737,0.0001295985,0.0013495552,0.00035858699,0.000004096294,0.00028678495,0.0014195857],"genre_scores_gemma":[0.8597621,8.417996e-7,0.14001195,0.00007180223,0.00007116578,0.000013254199,0.0000021285205,0.000035125893,0.00003166614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997935,0.0000646761,0.00056497846,0.0005487801,0.00032394705,0.0005626278],"domain_scores_gemma":[0.99608773,0.0025006817,0.00019746847,0.0006608619,0.00033706962,0.00021619738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012123464,0.00027950804,0.00041261254,0.000086402426,0.00030149418,0.00010737577,0.00048624378,0.00020816318,0.00004438321],"category_scores_gemma":[0.007783515,0.00026464585,0.00013935375,0.00046200227,0.00010244798,0.0000647866,0.00034432334,0.00090108765,0.000016504011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006439626,0.0002699718,0.0009572587,0.00029745352,0.0000168147,0.000006508673,0.0003096987,0.0000029349235,0.00029771123,0.9896605,0.00007639819,0.0080983145],"study_design_scores_gemma":[0.00035616453,0.00009875739,0.00027629704,0.000049819904,0.00003558702,0.000019395777,0.000030196003,0.023929076,0.0004025099,0.97439754,0.00009768226,0.00030696558],"about_ca_topic_score_codex":0.000011587418,"about_ca_topic_score_gemma":0.000018982102,"teacher_disagreement_score":0.4046019,"about_ca_system_score_codex":0.000054511976,"about_ca_system_score_gemma":0.0000859251,"threshold_uncertainty_score":0.99998057},"labels":[],"label_agreement":null},{"id":"W2080099401","doi":"10.1017/s096354830500708x","title":"The Small Giant Component in Scale-Free Random Graphs","year":2005,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Giant component; Component (thermodynamics); Random graph; Upper and lower bounds; Mathematics; Combinatorics; Scale (ratio); Graph; Connected component; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.01325639483048388,"score_gpt":0.2363868157909862,"score_spread":0.2231304209605023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080099401","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.9635772,0.000378525,0.027900485,0.001260417,0.00024833926,0.0009121413,0.0000034064963,0.00022663754,0.0054928605],"genre_scores_gemma":[0.99503535,0.0000059203658,0.0046645193,0.00003352522,0.00015397824,0.00003380451,0.000010988275,0.000022945173,0.000038953243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974288,0.00034341335,0.0008064561,0.00051370804,0.000296405,0.00061122957],"domain_scores_gemma":[0.99753124,0.0007740843,0.00025300405,0.0011586663,0.00017057967,0.00011241121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020346588,0.00028678245,0.00045688386,0.000105085084,0.000534691,0.00016002184,0.0010902062,0.000055042805,0.000018788316],"category_scores_gemma":[0.00005742721,0.0002352968,0.0002835743,0.00079444377,0.00017251838,0.000079934056,0.00075437693,0.0005280255,0.000010161225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060589493,0.0011236541,0.2608071,0.000029833624,0.000095404546,0.0000016604803,0.00057232345,0.004285985,0.00010988851,0.5770012,0.0010081144,0.15490425],"study_design_scores_gemma":[0.0021400007,0.00003844285,0.02018547,0.00006137283,0.000030852774,0.0000010947687,0.00007805868,0.12359796,0.00046295486,0.8493441,0.003676758,0.00038295615],"about_ca_topic_score_codex":0.00025306994,"about_ca_topic_score_gemma":0.00020554216,"teacher_disagreement_score":0.27234286,"about_ca_system_score_codex":0.0002137067,"about_ca_system_score_gemma":0.00005779073,"threshold_uncertainty_score":0.9595125},"labels":[],"label_agreement":null},{"id":"W2083414707","doi":"10.1017/s0963548313000175","title":"The Entropy of Random-Free Graphons and Properties","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Conjecture; Random graph; Combinatorics; Mathematics; Entropy (arrow of time); Graph; Discrete mathematics; Physics; Thermodynamics","score_opus":0.041066510418671716,"score_gpt":0.2611840604611839,"score_spread":0.2201175500425122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083414707","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.99126965,0.0028894024,0.00085240864,0.00031175025,0.001960939,0.001872023,0.00001027127,0.00014436824,0.0006892077],"genre_scores_gemma":[0.99616706,0.00017334639,0.0034257402,0.000014036986,0.00007713174,0.00004391756,0.000002072626,0.000041008443,0.00005570636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969223,0.00056866807,0.0010113769,0.00058320386,0.00047706667,0.0004373423],"domain_scores_gemma":[0.9942911,0.0022846072,0.0007647667,0.0020109236,0.00054527906,0.00010327482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023253292,0.00043644075,0.0008333851,0.000088174085,0.000850288,0.00016126625,0.0013778321,0.00033543032,0.000004279861],"category_scores_gemma":[0.003979037,0.00027332167,0.00029877247,0.00018039101,0.0009539772,0.00004882607,0.00544829,0.0010193066,4.5270167e-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.00004789553,0.00011660958,0.002285562,0.0017663055,0.00015842349,6.228964e-7,0.0022860772,0.00003152807,0.00003548518,0.9912259,0.0004521981,0.001593382],"study_design_scores_gemma":[0.0009716253,0.00005230576,0.00064418436,0.00028745545,0.00009192908,0.0000049963933,0.00011314648,0.0027138938,0.00047290087,0.9942458,0.000106956526,0.0002947957],"about_ca_topic_score_codex":0.00004466515,"about_ca_topic_score_gemma":0.0000040326613,"teacher_disagreement_score":0.0048974105,"about_ca_system_score_codex":0.000081348284,"about_ca_system_score_gemma":0.00010512376,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W2092923474","doi":"10.1017/s0963548314000145","title":"Singularity Analysis Via the Iterated Kernel Method","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":49,"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":"Conjecture; Iterated function; Mathematics; Singularity; Random walk; Lattice (music); Diagonal; Kernel (algebra); Resummation; Path (computing); Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics; Physics","score_opus":0.039956531473799434,"score_gpt":0.33449784257212234,"score_spread":0.29454131109832293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092923474","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.15058528,0.000032662472,0.8454197,0.00027470896,0.00085315644,0.0006931351,0.000001823761,0.000499003,0.0016405338],"genre_scores_gemma":[0.8216344,6.064795e-7,0.17801222,0.00008518237,0.00012431061,0.000016266391,0.000006298803,0.000052028437,0.00006867093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522334,0.0013600972,0.0011488439,0.00080351526,0.00076758635,0.00069660146],"domain_scores_gemma":[0.9902218,0.006087811,0.0007116139,0.0020223719,0.00077137514,0.00018505147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006377353,0.00047958756,0.0010151404,0.00018786982,0.0007431628,0.00020042816,0.0011039134,0.0002310936,0.000020366118],"category_scores_gemma":[0.007158377,0.00037632888,0.00045816478,0.0029948172,0.00017458487,0.00016119579,0.0006706035,0.00076755375,0.000018565717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009769696,0.0005354757,0.0024209404,0.00021256991,0.0003407263,0.0000018187428,0.0010007943,0.001099364,0.000076605604,0.99064326,0.00006904635,0.0035896227],"study_design_scores_gemma":[0.0004327881,0.000060872288,0.00046681144,0.000025062376,0.00046553308,0.0000067781325,0.000030308425,0.2283617,0.0004306493,0.7691142,0.00027669754,0.0003286347],"about_ca_topic_score_codex":0.000026755117,"about_ca_topic_score_gemma":0.000008382139,"teacher_disagreement_score":0.6710491,"about_ca_system_score_codex":0.0003668534,"about_ca_system_score_gemma":0.000062486564,"threshold_uncertainty_score":0.99986887},"labels":[],"label_agreement":null},{"id":"W2094138124","doi":"10.1017/s0963548315000061","title":"On the Chromatic Thresholds of Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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 Victoria","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; European Commission; National Science Foundation","keywords":"Combinatorics; Chromatic scale; Mathematics; Infimum and supremum; Hypergraph; Dimension (graph theory); Bounded function; Upper and lower bounds; Bipartite graph; Discrete mathematics; Graph","score_opus":0.11248120240182265,"score_gpt":0.30672770137783945,"score_spread":0.1942464989760168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094138124","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.9861866,0.00008770342,0.000791927,0.00019051421,0.0007252663,0.00045476886,0.0000017204627,0.00010494044,0.011456539],"genre_scores_gemma":[0.998109,9.704617e-7,0.0017240056,0.00008039687,0.000034386325,0.0000052584137,6.9030574e-7,0.000021012933,0.000024271736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981697,0.00028947432,0.0005065775,0.00026559582,0.0004987328,0.00026989574],"domain_scores_gemma":[0.99618536,0.0022306824,0.00026842183,0.00093905546,0.0002803105,0.000096183874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247299,0.00019885223,0.00035183757,0.00006843982,0.000269914,0.000024434301,0.0006112594,0.00009913415,0.0000106667385],"category_scores_gemma":[0.0032799256,0.00012532977,0.00014970127,0.00045826336,0.00027163498,0.00004390886,0.000352524,0.00029755523,0.0000031274808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012596442,0.0001982592,0.0035459942,0.00012885162,0.000030107793,0.0000010392517,0.0016751772,0.000082015766,0.00001532238,0.99322706,0.000820228,0.00026331402],"study_design_scores_gemma":[0.0003588218,0.00016983456,0.00055385765,0.00007089737,0.000021223306,0.0000061622804,0.00015722794,0.0022345837,0.00048023358,0.99576366,0.000044346954,0.0001391437],"about_ca_topic_score_codex":0.000005047144,"about_ca_topic_score_gemma":7.403538e-7,"teacher_disagreement_score":0.011922387,"about_ca_system_score_codex":0.00008611435,"about_ca_system_score_gemma":0.000063157386,"threshold_uncertainty_score":0.51107997},"labels":[],"label_agreement":null},{"id":"W2095784445","doi":"10.1017/s096354830800967x","title":"The Ramsey Number for 3-Uniform Tight Hypergraph Cycles","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Hypergraph; Combinatorics; Mathematics; Ramsey's theorem; Lemma (botany); Monochromatic color; Integer (computer science); Discrete mathematics; Physics; Graph; Computer science","score_opus":0.03560432321952448,"score_gpt":0.31526380230338485,"score_spread":0.27965947908386035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095784445","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.9745559,0.0002066185,0.010657784,0.00092905655,0.001626099,0.0013235979,0.000006069541,0.00037725357,0.0103176255],"genre_scores_gemma":[0.98695844,0.00001200892,0.012565159,0.00014365336,0.00014877433,0.000012701011,0.0000034514792,0.000026022653,0.00012980023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798226,0.00013555061,0.0005824168,0.0004062664,0.00031795548,0.0005755763],"domain_scores_gemma":[0.9961788,0.0023251486,0.00024460742,0.0008326486,0.00030925873,0.000109545894],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019142028,0.00027716544,0.00034660555,0.000038152266,0.0018875937,0.0001329919,0.00070983,0.00015878573,0.0000063756092],"category_scores_gemma":[0.0013217763,0.00018830149,0.00028286767,0.00034151383,0.0001975668,0.0000927912,0.00019408508,0.0003312991,0.0000030550032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002753108,0.00013988171,0.0020784964,0.00006834811,0.000029244982,7.1782887e-7,0.00055709225,0.0000106694815,0.000013579534,0.9808204,0.001067784,0.015186233],"study_design_scores_gemma":[0.00053579407,0.00009562647,0.0025765086,0.000029357374,0.000030347546,0.000010656169,0.000063067644,0.001876562,0.00023044346,0.9898412,0.0044540893,0.0002563454],"about_ca_topic_score_codex":0.0000020187565,"about_ca_topic_score_gemma":0.0000018956783,"teacher_disagreement_score":0.014929888,"about_ca_system_score_codex":0.000108775836,"about_ca_system_score_gemma":0.000044014214,"threshold_uncertainty_score":0.9994118},"labels":[],"label_agreement":null},{"id":"W2098345409","doi":"10.1017/s0963548311000575","title":"On Even-Degree Subgraphs of Linear Hypergraphs","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"graph theory and CDMA systems","field":"Engineering","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":"Combinatorics; Hypergraph; Mathematics; Bounded function; Conjecture; Degree (music); Vertex (graph theory); Induced subgraph; Constant (computer programming); Discrete mathematics; Graph; Physics; Computer science","score_opus":0.026647026769529934,"score_gpt":0.2237650460045048,"score_spread":0.19711801923497488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098345409","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.9864493,0.0007490696,0.0020449527,0.000007405619,0.0021530932,0.0003142409,0.000004378768,0.00039380524,0.007883757],"genre_scores_gemma":[0.9994835,0.0000060833245,0.00036206527,0.000011071631,0.00007729496,0.000006912195,0.000004162739,0.00003810262,0.000010788485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983297,0.00014693945,0.0005168634,0.00021857837,0.0002822684,0.0005056569],"domain_scores_gemma":[0.9986929,0.0003575245,0.00009842207,0.00057886966,0.00010895177,0.0001633155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012297865,0.0002511197,0.00038155832,0.00016438428,0.00013059191,0.000011530572,0.00031691653,0.00014524724,0.000011029003],"category_scores_gemma":[0.00015336486,0.00025148518,0.0001944626,0.00072436227,0.00008847874,0.00012231024,0.00007000694,0.00032346795,0.000025249645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020845686,0.0005824763,0.07904784,0.00081683823,0.000099290526,0.0000013102318,0.0013970862,0.006845004,0.0013048337,0.90616053,0.00021915445,0.0035047769],"study_design_scores_gemma":[0.0019911348,0.0005357248,0.058448397,0.00052823394,0.000094552204,0.000030118548,0.00030365484,0.036675207,0.023874799,0.87440777,0.0015696873,0.0015407124],"about_ca_topic_score_codex":0.000006166509,"about_ca_topic_score_gemma":5.5864706e-7,"teacher_disagreement_score":0.031752773,"about_ca_system_score_codex":0.00007412304,"about_ca_system_score_gemma":0.000012680417,"threshold_uncertainty_score":0.99999374},"labels":[],"label_agreement":null},{"id":"W2100718844","doi":"10.1017/s0963548315000231","title":"Distinct Distances from Three Points","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Mathematical Approximation and Integration","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":"Israeli Centers for Research Excellence; Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Hungarian Scientific Research Fund","keywords":"Set (abstract data type); Point (geometry); Upper and lower bounds; Intersection (aeronautics)","score_opus":0.1409898485536636,"score_gpt":0.326499426148521,"score_spread":0.18550957759485742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100718844","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.6756349,0.000042141124,0.30937946,0.00041986787,0.0005317011,0.00043442223,0.000006924225,0.00031775745,0.013232825],"genre_scores_gemma":[0.9238534,2.3509044e-7,0.07591918,0.000037873167,0.00007569695,0.000011379887,0.000019121835,0.00002042013,0.00006270021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806404,0.00014282366,0.0006297763,0.00038411198,0.00051319326,0.00026607214],"domain_scores_gemma":[0.99769557,0.0009297172,0.00025336244,0.0005279177,0.0003911199,0.00020234553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097766,0.00021541864,0.0003638143,0.000036235564,0.00014006562,0.00011061893,0.00033739326,0.00009849271,0.00006428505],"category_scores_gemma":[0.0051627546,0.00017854125,0.000092883194,0.00029308873,0.00009667246,0.00022344114,0.00017799673,0.00024065764,0.00007512299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008628931,0.00035938452,0.0070381127,0.000097340264,0.000013243541,0.000001171668,0.00080284674,0.0000010783741,0.00000444723,0.9890151,0.00081256655,0.0018460803],"study_design_scores_gemma":[0.00048390398,0.000051835566,0.0011578797,0.00006989056,0.000016457201,0.000001160045,0.00011535779,0.038510118,0.00015594414,0.95886755,0.00036885295,0.00020106198],"about_ca_topic_score_codex":0.000023295033,"about_ca_topic_score_gemma":0.000040122854,"teacher_disagreement_score":0.24821849,"about_ca_system_score_codex":0.00026573296,"about_ca_system_score_gemma":0.00007428434,"threshold_uncertainty_score":0.7280701},"labels":[],"label_agreement":null},{"id":"W2109327442","doi":"10.1017/s0963548314000248","title":"On the Spread of Random Graphs","year":2014,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"Random graph; Combinatorics; Random regular graph; Mathematics; Bounded function; Discrete mathematics; Giant component; Lipschitz continuity; Graph; 1-planar graph; Chordal graph","score_opus":0.05686495012726308,"score_gpt":0.30701359161944425,"score_spread":0.2501486414921812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109327442","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.18197337,0.00010575854,0.81167156,0.00032376306,0.001758042,0.0015538355,0.00003241539,0.00016956613,0.0024116978],"genre_scores_gemma":[0.9899339,0.000004814413,0.009826281,0.00007303452,0.00005439914,0.000037088994,0.000007277526,0.00004641154,0.000016805943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674815,0.0003902436,0.0010545044,0.0006870626,0.00070422783,0.000415809],"domain_scores_gemma":[0.98214453,0.014844952,0.0008608437,0.0014434392,0.00059713144,0.00010908622],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030470525,0.0004522086,0.0010375462,0.00008473093,0.00021016959,0.00006660426,0.0010815978,0.00035232215,0.000023086206],"category_scores_gemma":[0.019759677,0.00032106895,0.00033076515,0.00028722396,0.00018906977,0.000014237794,0.001309266,0.0012456734,0.000007808444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048862294,0.0003574075,0.000023066059,0.0020724244,0.00006594154,0.0000012447865,0.00025773823,0.00037615743,0.0000038700186,0.994971,0.0005200465,0.0013022837],"study_design_scores_gemma":[0.000618107,0.00016367034,0.00001784493,0.00068054075,0.000098653356,0.000001767268,0.000016799608,0.081344254,0.00018213388,0.91658115,0.000016037175,0.00027905765],"about_ca_topic_score_codex":0.000012963041,"about_ca_topic_score_gemma":0.0000013215705,"teacher_disagreement_score":0.8079605,"about_ca_system_score_codex":0.00012292177,"about_ca_system_score_gemma":0.00016215077,"threshold_uncertainty_score":0.9999241},"labels":[],"label_agreement":null},{"id":"W2112317227","doi":"10.1017/s0963548312000107","title":"Non-Three-Colourable Common Graphs Exist","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"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":"Combinatorics; Mathematics; Conjecture; Discrete mathematics; Graph","score_opus":0.049415272058111956,"score_gpt":0.3042241545118432,"score_spread":0.25480888245373123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112317227","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.9760177,0.00025709663,0.0013825377,0.000060190447,0.002379173,0.00068175944,0.0000029773983,0.00031732305,0.01890123],"genre_scores_gemma":[0.99342436,0.0000028099855,0.0062479246,0.000078285244,0.000108499924,0.000012871238,0.0000042009124,0.00005056982,0.00007047091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973768,0.00018076252,0.0006813574,0.00041540686,0.00043568478,0.0009099808],"domain_scores_gemma":[0.9972179,0.0009751764,0.00030956493,0.0010244383,0.0001947954,0.00027811655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025438603,0.00036343202,0.0005691124,0.00011842241,0.0009725147,0.00006666311,0.00064714195,0.00022616303,0.000030547148],"category_scores_gemma":[0.0005512604,0.00032940172,0.00024132416,0.00060140586,0.00024191203,0.0002324693,0.00067810225,0.0005995775,0.00001452428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314292,0.00038999203,0.18429963,0.0002307496,0.00003575948,0.0000015854044,0.0011292673,0.0000096557005,0.000020730033,0.8120182,0.0005832817,0.001269813],"study_design_scores_gemma":[0.00048894755,0.00007284405,0.021167872,0.00005218774,0.0000433811,0.000017731207,0.000058229292,0.00074995897,0.00037697263,0.97620463,0.00038133372,0.00038591024],"about_ca_topic_score_codex":0.000029996825,"about_ca_topic_score_gemma":0.000007972046,"teacher_disagreement_score":0.16418642,"about_ca_system_score_codex":0.00020323157,"about_ca_system_score_gemma":0.0000367249,"threshold_uncertainty_score":0.9999158},"labels":[],"label_agreement":null},{"id":"W2112951078","doi":"10.1017/s0963548313000072","title":"Revolutionaries and Spies on Random Graphs","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Pursuit-evasion; Random graph; Combinatorics; Graph; Mathematics; Sigma; Computer science; Discrete mathematics; Physics; Mathematical optimization","score_opus":0.04521792821767961,"score_gpt":0.28755479641766407,"score_spread":0.24233686819998446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112951078","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.98894435,0.001290809,0.0015094867,0.00025287553,0.0027649803,0.001583979,0.000015736912,0.00039217647,0.0032455912],"genre_scores_gemma":[0.99067456,0.0000787435,0.008845733,0.00007363611,0.00013076334,0.00004133438,0.00001278296,0.00005357784,0.0000888602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681896,0.00042418778,0.00082355086,0.0009574112,0.00049830443,0.00047760937],"domain_scores_gemma":[0.99535215,0.0023312757,0.00053080625,0.001241689,0.00039316638,0.00015093658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016582077,0.0005927436,0.0009567231,0.00019902927,0.00083747145,0.00019512796,0.0006093335,0.000542094,0.000019907706],"category_scores_gemma":[0.0025755912,0.000511171,0.00028502694,0.00020709368,0.00058261683,0.000071174356,0.002755256,0.001412806,0.0000036870988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037383164,0.00015621865,0.0037874395,0.0014590464,0.00009807865,0.0000023678786,0.0014395392,0.000086933054,0.000001701722,0.9904891,0.0009713902,0.0014707935],"study_design_scores_gemma":[0.00083104416,0.00008297441,0.0031440745,0.00041500447,0.00007183462,0.000007642112,0.000054243894,0.0019878861,0.000029911205,0.9926482,0.00021250253,0.0005147143],"about_ca_topic_score_codex":0.000027745717,"about_ca_topic_score_gemma":0.0000015863702,"teacher_disagreement_score":0.007336246,"about_ca_system_score_codex":0.00018084106,"about_ca_system_score_gemma":0.00008477529,"threshold_uncertainty_score":0.999734},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"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":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","score_opus":0.022307528566733053,"score_gpt":0.2705696345529421,"score_spread":0.24826210598620904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119116325","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.9432079,0.000697325,0.052424576,0.0007159051,0.00022952497,0.0005339244,0.0000018013989,0.00034206416,0.0018469574],"genre_scores_gemma":[0.97405964,0.000026997333,0.02577903,0.00009528721,0.0000070477054,0.000003100573,6.843646e-7,0.000009068669,0.00001912587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.00020163953,0.00050659163,0.0006855439,0.00050272344,0.0005276997],"domain_scores_gemma":[0.99715924,0.0005250247,0.00021919397,0.0014740878,0.00041642805,0.00020601133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113987,0.00023159766,0.000408683,0.00026891695,0.00026190627,0.00009207043,0.0019082449,0.000104500534,0.0000013715397],"category_scores_gemma":[0.00068818807,0.00023727582,0.000112761845,0.0014646556,0.00032783797,0.00036608777,0.0010559144,0.0003660635,0.0000015501967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001162725,0.00020951785,0.009404681,0.000060401588,0.000011230828,0.00000511148,0.0005109728,0.00005738907,0.000876599,0.97785443,0.00004467958,0.010953367],"study_design_scores_gemma":[0.0007578725,0.0004109896,0.021559978,0.00003734579,0.000004575665,0.000017440187,0.000016502161,0.008213989,0.0025395427,0.9660839,0.00013166672,0.0002262344],"about_ca_topic_score_codex":0.000007560571,"about_ca_topic_score_gemma":6.3726105e-7,"teacher_disagreement_score":0.030851739,"about_ca_system_score_codex":0.000059226917,"about_ca_system_score_gemma":0.00006987763,"threshold_uncertainty_score":0.9675827},"labels":[],"label_agreement":null},{"id":"W2119305988","doi":"10.1017/s0963548301004758","title":"A Note on Vertex List Colouring","year":2001,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":115,"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; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.032389842811345056,"score_gpt":0.3031178416169424,"score_spread":0.27072799880559734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119305988","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.54870003,0.00008632569,0.43769267,0.0010115354,0.0012995681,0.00063115463,7.804934e-7,0.0008039616,0.009773996],"genre_scores_gemma":[0.9872321,0.000007316563,0.012326528,0.00020776443,0.00005293774,0.000011393021,0.0000012797044,0.000022796068,0.00013788928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996748,0.0003296956,0.00043611668,0.00094971847,0.00069754064,0.00083897886],"domain_scores_gemma":[0.9966853,0.0011082,0.00014721541,0.0014865714,0.0003128645,0.00025983588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017377634,0.0002813741,0.00032531752,0.00021436907,0.00060259097,0.00024657368,0.002000626,0.00011391274,0.00000882559],"category_scores_gemma":[0.0009702017,0.00029058446,0.00013510074,0.0017582808,0.00015425716,0.0003973533,0.001222087,0.00066598615,0.00009538655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028857803,0.00043976234,0.008465779,0.000044017754,0.00001061259,0.00006642018,0.00045341437,0.0016797036,0.00018617438,0.95689803,0.00009104685,0.031636152],"study_design_scores_gemma":[0.0006749953,0.00030749702,0.0033112816,0.00006761069,0.0000026863065,0.000033255637,0.000009905015,0.1506204,0.00085264764,0.8414813,0.0022770215,0.0003613796],"about_ca_topic_score_codex":0.0000126625955,"about_ca_topic_score_gemma":0.000003543398,"teacher_disagreement_score":0.43853208,"about_ca_system_score_codex":0.00048879226,"about_ca_system_score_gemma":0.000125036,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W2122000012","doi":"10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Université du Québec en Outaouais","funders":"","keywords":"Randomized algorithm; Node (physics); Undirected graph; Combinatorics; Graph; Algorithm; Computer science; Task (project management); Upper and lower bounds; Simple (philosophy); Mathematics; Discrete mathematics; Theoretical computer science","score_opus":0.040548659523731996,"score_gpt":0.30824757233417144,"score_spread":0.26769891281043945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122000012","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.18460412,0.00010628482,0.80885196,0.00070673414,0.0010817148,0.0026860798,0.0000032836076,0.00042729604,0.0015325104],"genre_scores_gemma":[0.9580962,0.0000019461618,0.041472856,0.0001219952,0.00008949088,0.00012793815,0.000005473414,0.000023592287,0.000060512284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627507,0.0008154317,0.0006629691,0.00086079014,0.0006200691,0.0007656626],"domain_scores_gemma":[0.9912729,0.0065023876,0.00027839013,0.0012772941,0.0005691567,0.00009987186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063492367,0.00031083994,0.00057351455,0.00016323102,0.0010159592,0.0003064905,0.0020307493,0.00010500931,0.0000010771662],"category_scores_gemma":[0.0016211538,0.00022696992,0.00039268137,0.0010629114,0.0004250215,0.00027324338,0.00066510035,0.0004735909,0.000007357844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005292399,0.0002563278,0.001380967,0.00004075202,0.000015546137,0.0000014793037,0.00012086565,0.000789302,0.000007374426,0.98559093,0.00008005038,0.011187187],"study_design_scores_gemma":[0.026627883,0.000109922614,0.0009335502,0.000019678504,0.000008130735,0.000002297054,0.000005231722,0.1638029,0.0003129804,0.8077597,0.00019516682,0.00022256718],"about_ca_topic_score_codex":0.000017312395,"about_ca_topic_score_gemma":0.0000021168248,"teacher_disagreement_score":0.7734921,"about_ca_system_score_codex":0.00018071457,"about_ca_system_score_gemma":0.00008572265,"threshold_uncertainty_score":0.9255565},"labels":[],"label_agreement":null},{"id":"W2123194426","doi":"10.1017/s0963548312000053","title":"Measurable Events Indexed by Trees","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Topology and Set Theory","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":"Combinatorics; Cardinality (data modeling); Mathematics; Homogeneous; Integer (computer science); Tree (set theory); Existential quantification; Discrete mathematics; Branching (polymer chemistry); Computer science","score_opus":0.05589671311276288,"score_gpt":0.31526776543446344,"score_spread":0.25937105232170055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123194426","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.95253736,0.0006622208,0.040272016,0.00012936858,0.0011332989,0.00043912127,0.00000402325,0.00033938227,0.004483188],"genre_scores_gemma":[0.994789,0.000003278595,0.004682911,0.000056025794,0.000073541516,0.000009393009,0.000006454734,0.000029786896,0.00034958805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979508,0.0003677832,0.00043945303,0.000303948,0.00027277172,0.00066528143],"domain_scores_gemma":[0.9979907,0.00097639515,0.00020628617,0.00051770994,0.0001285645,0.0001803309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021218162,0.00023292421,0.0003678743,0.000046070047,0.00035875966,0.000011908502,0.00033260032,0.00018752243,0.00003979717],"category_scores_gemma":[0.0016147465,0.00022647834,0.00009916982,0.0002757421,0.00011991609,0.00024354651,0.00021380441,0.00040407458,0.00003571716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002309692,0.0012456411,0.070888385,0.00012696054,0.000047455673,7.9823405e-7,0.0010781217,0.000020531663,0.00021300322,0.92051476,0.001612326,0.004228919],"study_design_scores_gemma":[0.00051411486,0.000041435425,0.0021236287,0.000025960513,0.000021788072,0.000008021873,0.00008062834,0.0002640623,0.0017277278,0.99398446,0.0009540101,0.00025418942],"about_ca_topic_score_codex":0.000004296679,"about_ca_topic_score_gemma":0.0000011892199,"teacher_disagreement_score":0.07346967,"about_ca_system_score_codex":0.00022062808,"about_ca_system_score_gemma":0.000033989305,"threshold_uncertainty_score":0.9235519},"labels":[],"label_agreement":null},{"id":"W2127274797","doi":"10.1017/s0963548306007760","title":"Rainbow Turán Problems","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"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":"Combinatorics; Bipartite graph; Rainbow; Mathematics; Graph; Complete bipartite graph; Discrete mathematics; Physics","score_opus":0.03322687722485506,"score_gpt":0.2691535873263459,"score_spread":0.23592671010149086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127274797","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.9718006,0.0002286392,0.0059921904,0.00014355629,0.0012152237,0.0007405848,0.0000031330594,0.0005612157,0.019314816],"genre_scores_gemma":[0.9898849,0.0000013417298,0.009523256,0.00004404484,0.00020431828,0.000009378255,0.0000054091793,0.00004041722,0.0002869151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976746,0.00020798921,0.00066091673,0.00052013225,0.00040079822,0.00053557305],"domain_scores_gemma":[0.99786735,0.000795099,0.00025757926,0.0007515493,0.00024176131,0.00008663705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014905289,0.00029575228,0.00040128487,0.00009211451,0.0006431299,0.0000784458,0.0004992655,0.00017326775,0.000024664792],"category_scores_gemma":[0.00060700753,0.00026166983,0.00018532437,0.00047395847,0.00018973669,0.000098789846,0.00045111033,0.0004077055,0.000006351567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004852942,0.0002565474,0.011614068,0.00026873607,0.00001602967,0.0000035388925,0.0004305629,0.00016972207,0.00005320627,0.9851656,0.0009932732,0.0010238419],"study_design_scores_gemma":[0.00049784646,0.000051199575,0.0034710693,0.00004837302,0.000020246562,0.000014208052,0.000020059753,0.0017244545,0.00031127204,0.9920498,0.0014762096,0.00031523907],"about_ca_topic_score_codex":0.000030396966,"about_ca_topic_score_gemma":0.000004744877,"teacher_disagreement_score":0.019027902,"about_ca_system_score_codex":0.0001667735,"about_ca_system_score_gemma":0.000043355405,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W2128660769","doi":"10.1017/s0963548308009140","title":"Graph Colouring with No Large Monochromatic Components","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bounded function; Degree (music); Discrete mathematics; Planar graph; Monochromatic color; Physics","score_opus":0.033064358270159085,"score_gpt":0.2590236197809189,"score_spread":0.22595926151075985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128660769","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.6476296,0.00008005257,0.34975007,0.00007748826,0.0003034172,0.00055729767,0.0000011699436,0.0004972126,0.001103683],"genre_scores_gemma":[0.9464346,0.0000070522924,0.0533467,0.000063300526,0.00003080398,0.000019929583,0.0000038161734,0.000029531364,0.0000642346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962265,0.0003832036,0.00052782096,0.0009443215,0.00088222674,0.0010359082],"domain_scores_gemma":[0.99683434,0.0005672509,0.00023723199,0.0014610449,0.0005988065,0.0003013116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013584695,0.00035282658,0.00047503307,0.00024191514,0.0011384264,0.00011368531,0.0019275636,0.00009871941,0.000006217297],"category_scores_gemma":[0.00029720974,0.00032610976,0.0001230812,0.0017567109,0.00029916887,0.0006249393,0.0013111713,0.00058902317,0.00009383551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000785582,0.002130959,0.17613636,0.00046601903,0.000118202275,0.00033232305,0.0026093093,0.0026932093,0.0007859118,0.8132501,0.00017818583,0.0012208407],"study_design_scores_gemma":[0.003471899,0.0008427723,0.0668993,0.00022995702,0.0000123953005,0.00033345382,0.00003866493,0.25587657,0.0013822948,0.66937286,0.00042164623,0.0011182161],"about_ca_topic_score_codex":0.00001227114,"about_ca_topic_score_gemma":0.000001690285,"teacher_disagreement_score":0.29880503,"about_ca_system_score_codex":0.00026950106,"about_ca_system_score_gemma":0.00015481762,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W2130524435","doi":"10.1017/s0963548306008133","title":"Searching for a Black Hole in Synchronous Tree Networks","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":52,"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é du Québec en Outaouais","funders":"","keywords":"Tree traversal; Node (physics); Tree (set theory); Black box; Black hole (networking); Computer science; Class (philosophy); TRACE (psycholinguistics); Mathematics; Algorithm; Combinatorics; Computer network; Physics; Artificial intelligence; Routing (electronic design automation)","score_opus":0.015018446847714398,"score_gpt":0.23856375514104539,"score_spread":0.223545308293331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130524435","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.20081154,0.00020056375,0.79429173,0.00029738704,0.0006114536,0.0016183679,5.245775e-7,0.00033351855,0.00183491],"genre_scores_gemma":[0.96882886,0.00000361936,0.030702343,0.000117510644,0.00017430117,0.000073020106,0.0000108726435,0.000028068049,0.00006139778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651015,0.00028225817,0.00074640167,0.0010432078,0.00039972656,0.0010182712],"domain_scores_gemma":[0.9975967,0.0007725446,0.00023026824,0.0011283004,0.00015483366,0.0001173454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002557869,0.00031353039,0.000404971,0.00020828379,0.0002835533,0.00032774077,0.0015036006,0.00011361234,0.0000016762804],"category_scores_gemma":[0.00011887002,0.00034961084,0.00016130909,0.0012943194,0.00010148686,0.00029907806,0.0010871495,0.0003951386,0.000009270102],"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.000006465321,0.00031726412,0.0035310213,0.00012758297,0.000008118789,0.000011955793,0.00012339566,0.63381463,0.000007149757,0.325654,0.00042048466,0.03597794],"study_design_scores_gemma":[0.00091995293,0.00012206627,0.0053658006,0.00006743651,0.000005507524,0.0000010336383,0.0000087145845,0.832991,0.000037073507,0.15956916,0.0006144464,0.00029783163],"about_ca_topic_score_codex":0.00017617128,"about_ca_topic_score_gemma":0.000083127416,"teacher_disagreement_score":0.76801735,"about_ca_system_score_codex":0.00092064217,"about_ca_system_score_gemma":0.00012978795,"threshold_uncertainty_score":0.9998956},"labels":[],"label_agreement":null},{"id":"W2139245322","doi":"10.1017/s0963548314000807","title":"Lazy Cops and Robbers on Hypercubes","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Artificial Intelligence in Games","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Hypercube; Computer science; Function (biology); Argument (complex analysis); Asymptotically optimal algorithm; Mathematics; Discrete mathematics; Parallel computing; Algorithm; Biology","score_opus":0.07483190199436138,"score_gpt":0.2877698644004989,"score_spread":0.21293796240613752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139245322","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.86968005,0.00025226237,0.11886058,0.0015027862,0.0018234605,0.00041876212,6.7749886e-7,0.000585819,0.006875602],"genre_scores_gemma":[0.9847776,0.0000037957022,0.014835824,0.00025951606,0.000057312034,0.0000043868213,7.3571596e-7,0.0000129565715,0.000047831894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785316,0.000190736,0.00039306164,0.0006857858,0.0004523208,0.00042494934],"domain_scores_gemma":[0.99799263,0.000488522,0.00011526445,0.000784237,0.00032612227,0.00029324074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417663,0.00022251859,0.00026849008,0.00009631821,0.0002263767,0.0002630042,0.0009111346,0.00010104205,0.0000015773974],"category_scores_gemma":[0.0010014559,0.00021713403,0.000052971052,0.0005608042,0.00018454056,0.00034021956,0.0007859505,0.0003057844,0.00007006912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447405,0.00026701324,0.015638072,0.000032617783,0.000011946956,0.000012746332,0.003192689,0.0024807649,0.000039219984,0.9264106,0.00064109283,0.051264774],"study_design_scores_gemma":[0.00022849669,0.00037449316,0.0015063784,0.000047894067,0.0000053642098,0.000021399816,0.00019560727,0.21053253,0.0022080126,0.7827958,0.0016982647,0.00038575384],"about_ca_topic_score_codex":0.000050338756,"about_ca_topic_score_gemma":0.000004240937,"teacher_disagreement_score":0.20805176,"about_ca_system_score_codex":0.00024297707,"about_ca_system_score_gemma":0.00013898381,"threshold_uncertainty_score":0.8854469},"labels":[],"label_agreement":null},{"id":"W2139757566","doi":"10.1017/s0963548302005254","title":"Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Constant (computer programming); Independence number; Random graph; Degree (music); Discrete mathematics; Graph; Random regular graph; Chordal graph; 1-planar graph; Physics","score_opus":0.041858826617103745,"score_gpt":0.2727915680550093,"score_spread":0.23093274143790557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139757566","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.9882004,0.000306347,0.003976853,0.00003349477,0.00038291235,0.0006271898,0.000003008465,0.000092041206,0.006377735],"genre_scores_gemma":[0.9885236,0.00002368831,0.0113511775,0.000018403282,0.000018894818,0.0000054467137,6.287436e-7,0.000024652116,0.000033529348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977479,0.00023206523,0.00075622957,0.0004319802,0.0004731087,0.0003587218],"domain_scores_gemma":[0.99730617,0.0012159054,0.0003864436,0.000722592,0.00025123445,0.00011768109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016036783,0.00027065317,0.00063326326,0.00008455788,0.00035231456,0.000036468387,0.0003796426,0.00018909652,0.000055376688],"category_scores_gemma":[0.0010244113,0.0002357312,0.00014910928,0.00045443757,0.00045417124,0.00011007327,0.00041283807,0.0003724901,0.0000022398392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023981831,0.00030751113,0.03401946,0.0011697956,0.00008195661,0.000009488201,0.0032180946,0.000010551784,0.00014972326,0.9560513,0.00015419623,0.0048039444],"study_design_scores_gemma":[0.001623713,0.00006377481,0.0026160504,0.00018345693,0.000053691132,0.000050351246,0.000086687,0.009089033,0.00063266535,0.98533285,0.000012280321,0.00025542942],"about_ca_topic_score_codex":0.000008548182,"about_ca_topic_score_gemma":0.0000013782072,"teacher_disagreement_score":0.031403407,"about_ca_system_score_codex":0.000058978938,"about_ca_system_score_gemma":0.000021683412,"threshold_uncertainty_score":0.961284},"labels":[],"label_agreement":null},{"id":"W2139855799","doi":"10.1017/s0963548315000073","title":"Forcing a sparse minor","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"McGill University","funders":"","keywords":"Graph; Focus (optics); Forcing (mathematics); Minor (academic); Degree (music); Variation (astronomy)","score_opus":0.135359305568294,"score_gpt":0.32419449488056934,"score_spread":0.18883518931227533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139855799","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.97735786,0.00014075685,0.008050636,0.00009198101,0.0015931614,0.00044705885,0.0000015234268,0.00033193332,0.011985111],"genre_scores_gemma":[0.9828599,6.839853e-7,0.016773801,0.000064848566,0.00013274488,0.0000051269626,0.000001720258,0.0000314729,0.00012967859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980093,0.00020615982,0.00050172437,0.00042194143,0.00040720924,0.00045366623],"domain_scores_gemma":[0.9978553,0.000638964,0.00020493768,0.00072371156,0.00033725583,0.00023982019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020843453,0.000240693,0.00037376146,0.0000827787,0.00034836834,0.00005842521,0.000457458,0.0001330916,0.000008788966],"category_scores_gemma":[0.0025756352,0.00021537229,0.00013349496,0.00038224307,0.00012879597,0.00011281807,0.00059421855,0.0003269948,0.000007998065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015613448,0.00015158567,0.013065217,0.00013717542,0.000022219489,0.0000067770493,0.002738713,0.00005435577,0.000009459444,0.98082936,0.0009920789,0.0019774577],"study_design_scores_gemma":[0.0006771969,0.00008605918,0.0005047823,0.00003991181,0.000024322668,0.000019765295,0.00018693315,0.0036433414,0.00022996221,0.99358505,0.00074263406,0.00026002774],"about_ca_topic_score_codex":0.000012068129,"about_ca_topic_score_gemma":0.0000023843224,"teacher_disagreement_score":0.012755716,"about_ca_system_score_codex":0.00022492686,"about_ca_system_score_gemma":0.00009262979,"threshold_uncertainty_score":0.8782627},"labels":[],"label_agreement":null},{"id":"W2141986577","doi":"10.1017/s0963548309990599","title":"Tight Bounds for Blind Search on the Integers and the Reals","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Security token; Combinatorics; Position (finance); Mathematics; Interval (graph theory); Function (biology); Distribution (mathematics); Mathematical proof; Discrete mathematics; Point (geometry); Computer science; Mathematical analysis; Geometry","score_opus":0.030472075923027673,"score_gpt":0.28445271480498724,"score_spread":0.25398063888195954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141986577","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.34256732,0.00036688265,0.47808164,0.16882186,0.0012186537,0.002310132,0.0000016439024,0.00043127156,0.006200597],"genre_scores_gemma":[0.9928561,0.000005974992,0.005020635,0.0019025472,0.0000748558,0.000008685235,0.0000011485961,0.0000074754503,0.00012261038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997959,0.00047583797,0.0003031307,0.0005148979,0.0003533031,0.00039380832],"domain_scores_gemma":[0.99617094,0.002659428,0.00011524107,0.00081476883,0.00015866949,0.00008092973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005251766,0.00018306458,0.00023858536,0.00005388686,0.00092249905,0.0004903905,0.0011547114,0.000056991146,0.0000012847968],"category_scores_gemma":[0.0008503678,0.000100725934,0.000104790175,0.00049977464,0.00022624386,0.0000986051,0.0003113033,0.00057448656,0.000004921535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029113933,0.00008244041,0.00019711108,0.000014167025,0.000009109655,6.5155166e-7,0.0012288494,0.00039172123,0.0000037913487,0.9546102,0.0005437182,0.042889092],"study_design_scores_gemma":[0.0011279136,0.0002449438,0.00092135696,0.000028401626,0.0000043267764,0.000005648549,0.000024205629,0.47733027,0.00008758631,0.5181355,0.0019631,0.00012672566],"about_ca_topic_score_codex":0.000019155179,"about_ca_topic_score_gemma":5.123186e-7,"teacher_disagreement_score":0.65028876,"about_ca_system_score_codex":0.000073364456,"about_ca_system_score_gemma":0.000072641364,"threshold_uncertainty_score":0.709521},"labels":[],"label_agreement":null},{"id":"W2143613280","doi":"10.1017/s0963548312000594","title":"The Compensation Approach for Walks With Small Steps in the Quarter Plane","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"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":"Compensation (psychology); Set (abstract data type); Plane (geometry); Class (philosophy); Function (biology); Generating function; Zero (linguistics); Quarter (Canadian coin)","score_opus":0.019813710076497584,"score_gpt":0.23111362948082584,"score_spread":0.21129991940432824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143613280","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.9485925,0.000056492045,0.047919862,0.00058679865,0.0000915587,0.0015454926,0.0000020890986,0.000013944758,0.0011913077],"genre_scores_gemma":[0.99634266,0.0000049068317,0.003191711,0.00017018396,0.000039650215,0.000089300855,0.00009450416,0.0000111627405,0.00005590055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998832,0.00019578247,0.00022430289,0.00029314065,0.00015714673,0.00029765783],"domain_scores_gemma":[0.9990684,0.00019177108,0.000078809506,0.00043892558,0.00018021764,0.000041909727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010865348,0.00012721687,0.000112325535,0.000017981674,0.00029175958,0.00013666012,0.00041834734,0.000081202794,7.3166666e-7],"category_scores_gemma":[0.00013288352,0.00007174104,0.00004723955,0.0001289687,0.00010586375,0.0000042372535,0.000103333754,0.00016852627,0.0000015613398],"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.0013272412,0.008091059,0.2733768,0.0016040594,0.00039748268,0.0000074897757,0.011034126,0.013991942,0.02195561,0.5117213,0.010688594,0.1458043],"study_design_scores_gemma":[0.007788696,0.0034033954,0.1564788,0.00007484733,0.000041627765,0.00005965129,0.006176098,0.70777166,0.0011112789,0.10060519,0.015154926,0.0013338247],"about_ca_topic_score_codex":0.000031651212,"about_ca_topic_score_gemma":0.000050144805,"teacher_disagreement_score":0.6937797,"about_ca_system_score_codex":0.000030903808,"about_ca_system_score_gemma":0.000051506122,"threshold_uncertainty_score":0.29255146},"labels":[],"label_agreement":null},{"id":"W2151182440","doi":"10.1017/s0963548313000515","title":"Semi-Strong Colouring of Intersecting Hypergraphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03626950082489224,"score_gpt":0.27890582867761643,"score_spread":0.24263632785272418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151182440","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.98880327,0.000072534305,0.0037140138,0.000036687623,0.00084675715,0.0005754358,0.0000012023188,0.00018407436,0.0057660276],"genre_scores_gemma":[0.99197865,0.0000015035574,0.007873922,0.000018603816,0.00005393293,0.00000949604,9.772411e-7,0.000031291867,0.000031637795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979252,0.00019750517,0.0007476947,0.00038957654,0.00030426896,0.00043575457],"domain_scores_gemma":[0.9973101,0.0012026451,0.00039948348,0.0006144045,0.00036875653,0.00010463784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010797675,0.00024505734,0.00046862065,0.00012930976,0.00036548448,0.00004391588,0.00049019215,0.00013688074,0.000045123295],"category_scores_gemma":[0.0013107699,0.0002246182,0.0002035903,0.00042822916,0.0001929312,0.00015162547,0.0006316177,0.00041629063,0.0000031220554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006892999,0.00019217971,0.054395184,0.00054422556,0.00006720711,0.000001312648,0.0026693346,0.00008410259,0.00058913603,0.938328,0.00012838274,0.0029940277],"study_design_scores_gemma":[0.0003689459,0.00008528464,0.0038680066,0.0001301607,0.000023905175,0.000009521064,0.0005207091,0.0043173865,0.0025380105,0.9878859,0.000019688658,0.00023250448],"about_ca_topic_score_codex":0.000043302396,"about_ca_topic_score_gemma":0.0000018630756,"teacher_disagreement_score":0.050527178,"about_ca_system_score_codex":0.00011674984,"about_ca_system_score_gemma":0.000032115364,"threshold_uncertainty_score":0.91596645},"labels":[],"label_agreement":null},{"id":"W2152948900","doi":"10.1017/s0963548313000059","title":"Towards a Weighted Version of the Hajnal–Szemerédi Theorem","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; Samsung; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Disjoint sets; Degree (music); Vertex (graph theory); Integer (computer science); Discrete mathematics; Physics; Computer science","score_opus":0.031864506738924346,"score_gpt":0.277325883666447,"score_spread":0.24546137692752265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152948900","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.98244363,0.00030169924,0.002014053,0.00022357871,0.0049035517,0.0017229854,0.000027422002,0.00020299196,0.008160105],"genre_scores_gemma":[0.99185884,0.000013321634,0.0077819554,0.000046582518,0.00013067543,0.00001738666,0.000009281351,0.00006197732,0.000079984624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579585,0.00082623446,0.0011633976,0.0008166848,0.0008868869,0.00051095954],"domain_scores_gemma":[0.9943062,0.0010023209,0.0012224233,0.0025216981,0.0008288489,0.00011851148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021879717,0.0005819865,0.0009754973,0.00012373507,0.0005966839,0.0000782751,0.0022095728,0.000653636,0.00008211471],"category_scores_gemma":[0.0016379103,0.00039388996,0.0007196872,0.00047590712,0.0005795197,0.00006054778,0.007591271,0.001684282,0.0000041747135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018354505,0.0002781128,0.0024115662,0.0017477077,0.00014166972,9.051989e-7,0.0027544394,0.000068578694,0.000022876025,0.9886827,0.0008861389,0.002986938],"study_design_scores_gemma":[0.00042269586,0.000047689733,0.0022245625,0.0005438052,0.00013350295,0.0000043064133,0.00008211769,0.0059099183,0.0010531779,0.98896205,0.00021156942,0.00040460622],"about_ca_topic_score_codex":0.00006869571,"about_ca_topic_score_gemma":0.0000015449679,"teacher_disagreement_score":0.009415221,"about_ca_system_score_codex":0.00037864136,"about_ca_system_score_gemma":0.00030730112,"threshold_uncertainty_score":0.9998513},"labels":[],"label_agreement":null},{"id":"W2154770209","doi":"10.1017/s096354830300573x","title":"On the Canonical Version of a Theorem in Ramsey Theory","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Topology and Set Theory","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":"Ramsey theory; Ramsey's theorem; Mathematics; Constant (computer programming); Mathematical physics; Mathematical economics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.03421189513854586,"score_gpt":0.2957466252604868,"score_spread":0.26153473012194095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154770209","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.9703909,0.00006601825,0.011105028,0.00014780629,0.0003088834,0.0004359256,0.0000012852873,0.000049889815,0.017494231],"genre_scores_gemma":[0.99860734,0.0000019436684,0.0012324295,0.00008201661,0.0000074007153,0.0000050268054,6.643162e-7,0.000014649702,0.000048502065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972778,0.0015075286,0.0004368327,0.00028537677,0.00019660284,0.00029588255],"domain_scores_gemma":[0.9896745,0.009415126,0.00018333016,0.00059407484,0.00009071392,0.000042232456],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00510142,0.00016118577,0.0003133177,0.000057732825,0.00016527163,0.000006533756,0.00032957207,0.0001410292,0.00006539809],"category_scores_gemma":[0.008817338,0.00011474841,0.00009500667,0.00034645488,0.00038695618,0.000035611993,0.00011464793,0.0005174891,0.000007790744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067141635,0.00042319036,0.0012294181,0.000053628548,0.000011063924,0.0000028306958,0.0007175591,0.00017567503,0.000019590749,0.99685043,0.00004082473,0.00040864662],"study_design_scores_gemma":[0.0005436577,0.00010387608,0.00027199584,0.00006694622,0.0000088550605,0.0000040073237,0.0002693783,0.00036880575,0.0013079457,0.9968805,0.00006067922,0.000113406626],"about_ca_topic_score_codex":0.0000021123024,"about_ca_topic_score_gemma":0.0000025229895,"teacher_disagreement_score":0.028216435,"about_ca_system_score_codex":0.00015734637,"about_ca_system_score_gemma":0.00009794788,"threshold_uncertainty_score":0.9995318},"labels":[],"label_agreement":null},{"id":"W2155865206","doi":"10.1017/s0963548307008905","title":"Induced Forests in Regular Graphs with Large Girth","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Upper and lower bounds; Random regular graph; Random graph; Graph; Discrete mathematics; Line graph; Pathwidth","score_opus":0.033503244209739276,"score_gpt":0.271821734146239,"score_spread":0.23831848993649973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155865206","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.84225315,0.0000928011,0.15585245,0.00015318084,0.0001921426,0.00063278974,7.1156893e-7,0.00030706174,0.0005157246],"genre_scores_gemma":[0.9846421,0.0000048568436,0.015214978,0.00005087719,0.000014482839,0.00002107814,0.000002340905,0.000025368072,0.000023935034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962868,0.0004132626,0.00049823406,0.0010037158,0.0007743304,0.0010236655],"domain_scores_gemma":[0.99733466,0.00041091876,0.00017091751,0.0014976384,0.00036060263,0.00022527091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018682014,0.00030747795,0.0004192483,0.00040075433,0.00050285977,0.00007724794,0.0017204284,0.00013019143,0.0000020772907],"category_scores_gemma":[0.00034687977,0.00028558722,0.00009314506,0.003407986,0.00020646435,0.0006333402,0.0010201393,0.00073894975,0.000011331878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021248388,0.00044703466,0.31483752,0.00004898432,0.00001003129,0.00012835773,0.00092975254,0.00046062848,0.0000720165,0.68160295,0.000012775729,0.0014286812],"study_design_scores_gemma":[0.0016877177,0.00035590335,0.1376394,0.00006804663,0.0000018591944,0.00008050857,0.000027619273,0.03184645,0.0009132,0.8268795,0.00007898298,0.00042078973],"about_ca_topic_score_codex":0.00002026223,"about_ca_topic_score_gemma":0.000053555013,"teacher_disagreement_score":0.17719811,"about_ca_system_score_codex":0.00026738903,"about_ca_system_score_gemma":0.00025957814,"threshold_uncertainty_score":0.99995965},"labels":[],"label_agreement":null},{"id":"W2156199739","doi":"10.1017/s0963548314000285","title":"Hitting Time Theorems for Random Matrices","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Random Matrices and Applications","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":"McGill University","funders":"","keywords":"Zero (linguistics); Bernoulli's principle; Moment (physics); Random matrix; Matrix (chemical analysis); Work (physics); Bernoulli scheme; Column (typography)","score_opus":0.028469034808558884,"score_gpt":0.29522280510350185,"score_spread":0.26675377029494296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156199739","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.58997524,0.00009137567,0.39900595,0.0005936712,0.00031210494,0.002326266,0.000010794913,0.0006224478,0.0070621525],"genre_scores_gemma":[0.9607235,0.0000020893597,0.03869675,0.000037850965,0.0002444188,0.000071177616,0.0000089024625,0.000042548654,0.00017271751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.00017724112,0.0006438043,0.00045551787,0.00024194794,0.0004149857],"domain_scores_gemma":[0.99285173,0.005782191,0.00038901618,0.000579538,0.00029573307,0.000101804915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003474562,0.00022662863,0.00048463917,0.000068939764,0.00051184854,0.00012095492,0.00045158612,0.0001089197,0.000015181881],"category_scores_gemma":[0.001834056,0.00020120936,0.00021953999,0.00040094624,0.00006838175,0.00009127936,0.00016026967,0.00017279897,0.000029471546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048858292,0.00028496006,0.0007825722,0.00046978684,0.000027879032,1.2325006e-7,0.00029421662,0.00011411082,0.00013967993,0.98787904,0.0011349611,0.008823839],"study_design_scores_gemma":[0.0025905643,0.000049076887,0.0000775383,0.000051142597,0.000046434594,0.000005588546,0.000019752804,0.09829952,0.00017646373,0.89670426,0.0017521102,0.00022753689],"about_ca_topic_score_codex":0.000004606786,"about_ca_topic_score_gemma":3.6449705e-7,"teacher_disagreement_score":0.3707483,"about_ca_system_score_codex":0.00008566518,"about_ca_system_score_gemma":0.000032858847,"threshold_uncertainty_score":0.82050794},"labels":[],"label_agreement":null},{"id":"W2156949757","doi":"10.1017/s0963548314000856","title":"The (7, 4)-Conjecture in Finite Groups","year":2015,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"graph theory and CDMA systems","field":"Engineering","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":"Quasigroup; Conjecture; Mathematics; Order (exchange); Combinatorics; Finite group; Element (criminal law); Discrete mathematics; Group (periodic table); Physics; Political science; Quantum mechanics","score_opus":0.01992793338833089,"score_gpt":0.22215268669550522,"score_spread":0.20222475330717432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156949757","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.973452,0.0058410857,0.0028559535,0.00015121396,0.010168573,0.0013615917,0.000012605371,0.0008847512,0.0052722734],"genre_scores_gemma":[0.9995405,0.000032020835,0.00008761238,0.000012638079,0.0001712878,0.000048124806,0.000020577867,0.00006207531,0.00002516894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727094,0.00038245294,0.0008319862,0.00054879155,0.00035123582,0.00061460934],"domain_scores_gemma":[0.9974987,0.0008302984,0.00016238648,0.0012038756,0.00016682745,0.00013790102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003413387,0.00048472008,0.0005914266,0.00012373597,0.00021063002,0.00022883985,0.0010550424,0.000537175,0.0000019967565],"category_scores_gemma":[0.0004569598,0.00040924744,0.00019013514,0.00051381835,0.00012538148,0.000055085933,0.0008944771,0.0021116734,0.000018378818],"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.000017802624,0.00013827722,0.008462024,0.0019376358,0.00011324196,0.000025404566,0.005461039,0.7783891,0.000009182237,0.19932033,0.0007825391,0.0053434134],"study_design_scores_gemma":[0.00034165295,0.00002400103,0.0008228671,0.0002637714,0.000013051105,0.0000048941665,0.000105796295,0.17748441,0.000032183856,0.81823736,0.0022235569,0.00044645983],"about_ca_topic_score_codex":0.000022672053,"about_ca_topic_score_gemma":0.000028114242,"teacher_disagreement_score":0.618917,"about_ca_system_score_codex":0.0006041622,"about_ca_system_score_gemma":0.00011982541,"threshold_uncertainty_score":0.9998359},"labels":[],"label_agreement":null},{"id":"W2158059367","doi":"10.1017/s0963548310000325","title":"The Diameter of Sparse Random Graphs","year":2010,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":47,"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 graph; Graph; Scaling; Range (aeronautics); Limiting; Branching process; Simple (philosophy); Random variable; Term (time)","score_opus":0.036363164304970434,"score_gpt":0.29718959167455833,"score_spread":0.2608264273695879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158059367","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.30886576,0.0000707196,0.68725294,0.0001587821,0.0017725461,0.0005956539,0.0000062735717,0.00010497551,0.0011723449],"genre_scores_gemma":[0.9561926,0.0000032118858,0.043705553,0.000014863983,0.000032814194,0.00001007908,8.0261213e-7,0.000018650759,0.000021386162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834704,0.0000865272,0.0006013182,0.00027640257,0.00034695034,0.0003417776],"domain_scores_gemma":[0.9920302,0.0065732435,0.0002714156,0.00062409963,0.00040070404,0.00010036341],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018843187,0.00017038768,0.00034772058,0.00003358413,0.00031174993,0.000049333074,0.0004774981,0.00010312173,0.0000110961355],"category_scores_gemma":[0.011576319,0.0001177964,0.00012651601,0.00034190915,0.00021735426,0.000038150953,0.00016518135,0.00047237912,0.0000040529544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026156313,0.00017384789,0.00031914058,0.00015712972,0.000018785875,9.5597e-7,0.00016487081,0.0000023879938,0.00032212908,0.99160224,0.00010290352,0.007109431],"study_design_scores_gemma":[0.0007133037,0.000078939855,0.00015524539,0.000025975889,0.00003059611,0.0000052770515,0.00002773514,0.01232656,0.0011625437,0.9852054,0.00013574248,0.00013267012],"about_ca_topic_score_codex":0.0000059859726,"about_ca_topic_score_gemma":0.000010551267,"teacher_disagreement_score":0.6473269,"about_ca_system_score_codex":0.000022010758,"about_ca_system_score_gemma":0.00006854067,"threshold_uncertainty_score":0.9967496},"labels":[],"label_agreement":null},{"id":"W2164689216","doi":"10.1017/s0963548313000102","title":"Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"Lattice (music); Integer lattice; Lattice constant; Mathematics; Combinatorics; Statistical physics; Condensed matter physics; Physics; Quantum mechanics; Half-integer","score_opus":0.0450147713721705,"score_gpt":0.2955446069150627,"score_spread":0.2505298355428922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164689216","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.7859579,0.00023605768,0.21211961,0.00028031023,0.00018165771,0.0011368234,0.0000079861475,0.000036627167,0.000043071323],"genre_scores_gemma":[0.95999116,0.000010606537,0.03990591,0.00002557842,0.000014322017,0.000030380881,0.0000010039943,0.000016758051,0.0000042859656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850285,0.00008661288,0.00056932966,0.00031814136,0.00023139374,0.00029165857],"domain_scores_gemma":[0.9893578,0.009578609,0.00022673517,0.00027043303,0.0004986599,0.00006773297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010590702,0.00017026764,0.00039230465,0.000044974408,0.00015750746,0.00003846991,0.00019863727,0.00009318936,0.0000062075737],"category_scores_gemma":[0.006580333,0.00012470178,0.00003989072,0.00028206315,0.00011750442,0.00007471216,0.0002144672,0.00016892806,0.0000012525404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024361543,0.00018966348,0.0016123421,0.0006693497,0.000013081059,4.9011356e-7,0.00042761792,0.000010282853,0.00023425123,0.9937188,0.000033080516,0.0030666962],"study_design_scores_gemma":[0.00075667014,0.00019506391,0.0048744157,0.00015180677,0.00003972873,0.0000029627201,0.00019532803,0.1018268,0.0004910683,0.8913378,0.0000020316115,0.00012632587],"about_ca_topic_score_codex":0.00008300717,"about_ca_topic_score_gemma":0.000009674838,"teacher_disagreement_score":0.1740333,"about_ca_system_score_codex":0.000054807315,"about_ca_system_score_gemma":0.000046452475,"threshold_uncertainty_score":0.7877749},"labels":[],"label_agreement":null},{"id":"W2167009466","doi":"10.1017/s0963548314000601","title":"Extremal Numbers for Odd Cycles","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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 Manitoba","funders":"","keywords":"Bipartite graph; Graph; Upper and lower bounds; Extremal graph theory; Value (mathematics); Graph theory","score_opus":0.05537113575030009,"score_gpt":0.3171983033842709,"score_spread":0.26182716763397085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167009466","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.89021665,0.000045487584,0.09974447,0.00012184323,0.0014526013,0.0007242071,0.0000037914342,0.0003320495,0.0073588826],"genre_scores_gemma":[0.96391034,8.434356e-7,0.035692763,0.00007538443,0.00019015651,0.00001370383,0.0000034669345,0.000038965623,0.00007435853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981086,0.0001984071,0.00049981935,0.00047191404,0.0002577092,0.00046352597],"domain_scores_gemma":[0.99635065,0.0024146533,0.00021831515,0.0006715556,0.00022858122,0.00011622355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020333386,0.00024706902,0.0004002882,0.000060521306,0.00064414024,0.000057418813,0.00046026168,0.00015108948,0.000010861987],"category_scores_gemma":[0.0027500903,0.00022425642,0.00021991183,0.0002075488,0.00015339907,0.000076669705,0.00031090953,0.0002328607,0.0000025163897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015669471,0.0001246808,0.005449578,0.00033819664,0.000023562052,3.1658664e-7,0.00068255066,0.00003182885,0.00002186823,0.98613316,0.0004759245,0.0067026597],"study_design_scores_gemma":[0.0006540859,0.00008865806,0.0010759393,0.000039828792,0.00002948346,0.0000052499895,0.000044777797,0.009121793,0.00028851596,0.9867526,0.001625859,0.00027315988],"about_ca_topic_score_codex":0.00000451179,"about_ca_topic_score_gemma":0.0000023644532,"teacher_disagreement_score":0.07369369,"about_ca_system_score_codex":0.00010184561,"about_ca_system_score_gemma":0.00002818127,"threshold_uncertainty_score":0.9144911},"labels":[],"label_agreement":null},{"id":"W2171265914","doi":"10.1017/s0963548306007498","title":"Expansion in ${\\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\\boldsymbol{{\\mathbb Z}^n}}$: the First Three Terms","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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 British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences; Newton Fund","keywords":"Omega; Combinatorics; Cube (algebra); Physics; Mathematics; Quantum mechanics","score_opus":0.05307736462868874,"score_gpt":0.30987840022994106,"score_spread":0.25680103560125234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171265914","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.53447706,0.00015782511,0.45716354,0.0048075076,0.0005802303,0.0021488615,0.000017084198,0.0001402623,0.0005076189],"genre_scores_gemma":[0.9917694,0.000002501385,0.007780419,0.00017247668,0.00013392208,0.00008826482,0.000004106869,0.00003778676,0.000011119409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763745,0.00012127982,0.0007026944,0.0005694195,0.00044323,0.0005259115],"domain_scores_gemma":[0.98603964,0.012924522,0.00015425013,0.0005561782,0.00025790182,0.00006752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020417087,0.00031485883,0.00040783788,0.00006182982,0.0008433282,0.00017853579,0.00040931976,0.00016977626,0.000005936088],"category_scores_gemma":[0.007115046,0.0001990732,0.000100672616,0.00034654074,0.0002275995,0.00009492674,0.0002311148,0.00041345868,0.0000032775065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033561857,0.00038512162,0.0013667642,0.00040952943,0.000006812733,0.0000018210079,0.00046755697,0.00007249365,0.000028190432,0.9950819,0.00040095762,0.001745288],"study_design_scores_gemma":[0.00044921375,0.00016842653,0.005073877,0.00018310949,0.000031627867,0.0000070621686,0.00011662528,0.18890049,0.0000792972,0.8047375,0.00005085626,0.00020189196],"about_ca_topic_score_codex":0.000033538116,"about_ca_topic_score_gemma":0.00007504878,"teacher_disagreement_score":0.45729232,"about_ca_system_score_codex":0.00017245689,"about_ca_system_score_gemma":0.000052001247,"threshold_uncertainty_score":0.8517889},"labels":[],"label_agreement":null},{"id":"W2171769876","doi":"10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Minimum weight; Path (computing); Path length; Random graph; Discrete mathematics; Computer science","score_opus":0.02440755301033561,"score_gpt":0.2437544791994999,"score_spread":0.2193469261891643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171769876","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.57858753,0.0027539318,0.38991532,0.012817341,0.004959644,0.0021657308,0.000006639351,0.0013750957,0.0074187694],"genre_scores_gemma":[0.9853785,0.000033036355,0.01414649,0.00032198493,0.000078097284,0.000008511158,0.0000027988633,0.00001062612,0.000019967638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964102,0.00039752672,0.0007918956,0.00089739973,0.0006011944,0.0009017753],"domain_scores_gemma":[0.9967558,0.0010301861,0.00023951636,0.0015587993,0.00023649642,0.0001792086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002246063,0.00034914573,0.00041066806,0.00018703351,0.0009504557,0.00046951786,0.00280199,0.00011734809,0.0000017246898],"category_scores_gemma":[0.00030596272,0.00029013146,0.000202605,0.0023037163,0.0002428312,0.00034941323,0.00072462537,0.00069323793,0.000015181402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007692336,0.00046305088,0.0049831285,0.00002219167,0.000009096324,0.000027906337,0.00073561165,0.00017668557,0.000030179286,0.92196697,0.00021298155,0.07136448],"study_design_scores_gemma":[0.00060077437,0.0002111236,0.042066377,0.000058220434,0.000003323604,0.00002055013,0.000021989223,0.12513016,0.000042141197,0.829596,0.0019009163,0.0003484185],"about_ca_topic_score_codex":0.000027701024,"about_ca_topic_score_gemma":0.000021730284,"teacher_disagreement_score":0.40679097,"about_ca_system_score_codex":0.00020752633,"about_ca_system_score_gemma":0.000120487435,"threshold_uncertainty_score":0.99995506},"labels":[],"label_agreement":null},{"id":"W2172233838","doi":"10.1017/s096354830621808x","title":"<i>Graphs on Surfaces and Their Applications</i>, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences <b>141</b>, Springer-Verlag, 2004, 455pp., £73.00/$109.00/94.95 Euros","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Euros; Encyclopedia; Philosophy; Humanities; Computer science; Library science","score_opus":0.01573402401454194,"score_gpt":0.2527290843312331,"score_spread":0.23699506031669115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172233838","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.797592,0.0047996407,0.19282828,0.00029679228,0.00017734489,0.0013107623,0.00001620169,0.00029389397,0.0026851064],"genre_scores_gemma":[0.9894175,0.00009673087,0.010295389,0.000046055582,0.000025446589,0.000033314805,0.0000039162032,0.000024701914,0.000056965684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628085,0.00036252182,0.00074021216,0.0012000094,0.00069488556,0.00072150567],"domain_scores_gemma":[0.9965374,0.0017517477,0.0003350849,0.0009039884,0.0002682066,0.00020359256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025056435,0.00041327614,0.00056701264,0.00020571657,0.0006977113,0.00026013423,0.0012608598,0.00014092776,0.000005763254],"category_scores_gemma":[0.00023223142,0.00035436917,0.00010421401,0.0015676897,0.0009474867,0.0004313871,0.0009244205,0.00044087466,0.0000047659405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001906828,0.00085051707,0.05122361,0.00043213044,0.00002472139,0.0000029891858,0.00042574306,0.0007990999,0.0026439421,0.93801206,0.00047857803,0.0050875572],"study_design_scores_gemma":[0.000751285,0.00027171237,0.0039818548,0.00009571303,0.0000071643476,0.000018398963,0.00005337044,0.03354621,0.004094285,0.9559029,0.0008414422,0.00043569054],"about_ca_topic_score_codex":0.0000233076,"about_ca_topic_score_gemma":0.0000026590992,"teacher_disagreement_score":0.1918255,"about_ca_system_score_codex":0.0000758121,"about_ca_system_score_gemma":0.00009868509,"threshold_uncertainty_score":0.9998908},"labels":[],"label_agreement":null},{"id":"W2289474823","doi":"10.1017/s0963548317000165","title":"Fractional Clique Decompositions of Dense Partite Graphs","year":2017,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Trinity College","funders":"European Commission","keywords":"Mathematics; Clique; Simple (philosophy); Degree (music); Decomposition; Graph; Combinatorics; Simple graph; Discrete mathematics; Physics","score_opus":0.06869011615742723,"score_gpt":0.3495413971274826,"score_spread":0.2808512809700554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289474823","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.9767555,0.00040895146,0.014537711,0.00014868763,0.00361737,0.00093820825,0.000061451596,0.00021542535,0.0033166842],"genre_scores_gemma":[0.9818439,0.000033517474,0.01783167,0.00002555176,0.00013313543,0.000024682035,0.000026948159,0.000049997776,0.00003061616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966002,0.00044657776,0.0011878795,0.00078468514,0.0005498729,0.00043079033],"domain_scores_gemma":[0.99351096,0.0016749699,0.0016609513,0.0021599077,0.0008378963,0.00015531365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020610439,0.0004775569,0.0009836978,0.00021050454,0.0010703356,0.000118046824,0.0011806106,0.00061595155,0.000024983527],"category_scores_gemma":[0.002168657,0.0004775633,0.0006389872,0.00014936402,0.0004994975,0.00009362227,0.0026965702,0.001538228,0.0000020051527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028933859,0.0004830896,0.013472185,0.0014820666,0.00019525767,0.0000064640953,0.0007474798,0.00040487555,0.000030136565,0.98214895,0.0002859561,0.0007145834],"study_design_scores_gemma":[0.00035809196,0.000053630698,0.00588645,0.00057217176,0.00013317385,0.000015090271,0.000016098,0.0018830991,0.0005336521,0.9900314,0.00009219784,0.000424928],"about_ca_topic_score_codex":0.000036738573,"about_ca_topic_score_gemma":0.000007791145,"teacher_disagreement_score":0.007882444,"about_ca_system_score_codex":0.00020565395,"about_ca_system_score_gemma":0.0002645922,"threshold_uncertainty_score":0.9997676},"labels":[],"label_agreement":null},{"id":"W2294714952","doi":"10.1017/s0963548312000533","title":"Expanders Are Universal for the Class of All Spanning Trees","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Deutscher Akademischer Austauschdienst","keywords":"Combinatorics; Mathematics; Random regular graph; Discrete mathematics; Vertex (graph theory); Random graph; Graph; Line graph; Pathwidth","score_opus":0.060476734388830486,"score_gpt":0.2922448994312497,"score_spread":0.2317681650424192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294714952","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.9626635,0.00015441593,0.033965323,0.00041808275,0.00072464824,0.0011816343,0.000003564615,0.00010723146,0.00078161375],"genre_scores_gemma":[0.99425006,0.0000031820543,0.0055340496,0.00005605702,0.00005283176,0.000014185216,0.0000013133553,0.000023055241,0.00006527469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862486,0.00012108913,0.0004204483,0.00027826577,0.00022831833,0.0003270099],"domain_scores_gemma":[0.9954753,0.003175672,0.0003684969,0.0005727515,0.00034686914,0.00006092365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088539894,0.00018628921,0.00033226478,0.00005232069,0.00040526057,0.00005408367,0.0005286051,0.00010833334,0.0000103978855],"category_scores_gemma":[0.0010139624,0.00013107879,0.00019321514,0.00019933083,0.00023954752,0.00013581761,0.00030783305,0.00022114898,5.976351e-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.000013578995,0.0001094869,0.007758133,0.00026857876,0.00009626487,3.7224729e-7,0.0026081516,0.00028276283,0.0000572859,0.9852792,0.0007850108,0.0027411708],"study_design_scores_gemma":[0.0005511424,0.00007165856,0.004645447,0.000053362495,0.000053506727,0.0000018156584,0.0015536541,0.01652546,0.00029457014,0.97576123,0.00032800497,0.00016014896],"about_ca_topic_score_codex":0.00002669101,"about_ca_topic_score_gemma":0.000004680226,"teacher_disagreement_score":0.031586565,"about_ca_system_score_codex":0.000090305904,"about_ca_system_score_gemma":0.000032217926,"threshold_uncertainty_score":0.5345238},"labels":[],"label_agreement":null},{"id":"W2346515765","doi":"10.1017/s0963548316000043","title":"On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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; Hungarian Scientific Research Fund; École Polytechnique Fédérale de Lausanne; Fondation Sciences Mathématiques de Paris; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Family of curves; Intersection (aeronautics); Plane curve; Regular polygon; Function (biology); Mathematical analysis; Geometry","score_opus":0.021856556728958237,"score_gpt":0.23857896007353546,"score_spread":0.21672240334457724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346515765","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.41896242,0.00045778017,0.5680351,0.009198429,0.0015109719,0.0005771294,0.0000020699053,0.00036955098,0.00088650815],"genre_scores_gemma":[0.994866,0.0000128271995,0.0036255065,0.0012532691,0.00012344692,0.000015674752,0.000002773608,0.000013754646,0.00008673875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971462,0.0006532553,0.00054307503,0.00073232304,0.00047194917,0.00045323395],"domain_scores_gemma":[0.9938521,0.0044973725,0.00030248932,0.00090579607,0.00031869704,0.00012357991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026771235,0.00026217787,0.00028071454,0.000113061804,0.0005338709,0.00014493943,0.0011398463,0.00008886583,0.000014903229],"category_scores_gemma":[0.0021952924,0.00016386928,0.00015875149,0.0009222782,0.000095645875,0.00030367504,0.0005587096,0.00030404865,0.000039777344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007574195,0.00018535739,0.0018230352,0.00008191661,0.000028122106,0.0000046774207,0.0004087785,0.00058622565,0.00028491425,0.911218,0.0014640548,0.08390738],"study_design_scores_gemma":[0.0008249567,0.00030606193,0.012268932,0.0007566427,0.000012900969,0.000024591573,0.000017007978,0.049882814,0.0027968849,0.93153685,0.0010940202,0.0004783545],"about_ca_topic_score_codex":0.0000047004264,"about_ca_topic_score_gemma":0.0000023177388,"teacher_disagreement_score":0.5759036,"about_ca_system_score_codex":0.00025319072,"about_ca_system_score_gemma":0.00013643375,"threshold_uncertainty_score":0.66823953},"labels":[],"label_agreement":null},{"id":"W2517245760","doi":"10.1017/s0963548318000202","title":"The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Random graph; Random regular graph; Exponential random graph models; Graph; Discrete mathematics; Exponential function; Degree (music); Line graph; Pathwidth; Physics","score_opus":0.058814826800336964,"score_gpt":0.3086478649535586,"score_spread":0.24983303815322166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517245760","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.98720896,0.00049520837,0.0060190344,0.00005155069,0.0016294643,0.0031148102,0.000027025922,0.000084704945,0.0013692338],"genre_scores_gemma":[0.98646957,0.000056456956,0.0132842325,0.000008042868,0.00005705794,0.000059581864,0.0000056526337,0.000049899012,0.000009493029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99353224,0.0011136822,0.0026515867,0.0011278362,0.000856964,0.0007176803],"domain_scores_gemma":[0.9897258,0.0038948474,0.0020207667,0.0028150878,0.001419672,0.00012380171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008967,0.00067342556,0.00178711,0.00027846763,0.0004717018,0.000072137256,0.0020326008,0.00062589935,0.0000046068794],"category_scores_gemma":[0.004261957,0.0005066519,0.0007451496,0.0010066911,0.0019154077,0.00007352141,0.003197462,0.0014776688,3.7261012e-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.0009590078,0.0015548399,0.041435257,0.008970797,0.0002910162,0.0000055920973,0.008499239,0.0016585253,0.000049984526,0.93449557,0.00008720044,0.0019929453],"study_design_scores_gemma":[0.0015401269,0.00016339433,0.007069183,0.0008524246,0.000081588994,0.0000037576972,0.000090213696,0.013537806,0.00093362073,0.9752927,0.000006170996,0.00042902847],"about_ca_topic_score_codex":0.00013377413,"about_ca_topic_score_gemma":0.00006783741,"teacher_disagreement_score":0.04079709,"about_ca_system_score_codex":0.00022547929,"about_ca_system_score_gemma":0.00041642573,"threshold_uncertainty_score":0.9997385},"labels":[],"label_agreement":null},{"id":"W2563982062","doi":"10.1017/s0963548320000048","title":"Estimating parameters associated with monotone properties","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Monotone polygon; Bounded function; Discrete mathematics; Vertex (graph theory); Graph; Graph property; Substructure; Property testing; Line graph; Voltage graph","score_opus":0.06467749679422376,"score_gpt":0.22994760726316446,"score_spread":0.1652701104689407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563982062","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.44365928,0.00006605419,0.5529494,0.0015037623,0.00033070392,0.00042837526,9.993589e-7,0.00082124904,0.00024012984],"genre_scores_gemma":[0.82762223,4.3017636e-7,0.171936,0.00037237635,0.000034334054,0.000010739921,0.0000026046334,0.000017170021,0.0000040989153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973097,0.00023228768,0.00049363467,0.0008548285,0.000545592,0.00056397234],"domain_scores_gemma":[0.99814767,0.0003417584,0.00027315386,0.0006291406,0.00034917306,0.0002591188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072094233,0.00031253585,0.0004279684,0.000064522734,0.00051842554,0.0003674562,0.0013852491,0.00008749912,0.0000018308052],"category_scores_gemma":[0.0012341663,0.00027522608,0.000107888525,0.0014918594,0.00020245036,0.00047142003,0.00087290414,0.0004933185,0.000010347773],"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.000105993095,0.0026284135,0.05236922,0.001100044,0.00057567505,0.00017662442,0.027752534,0.15319026,0.00068212615,0.6205103,0.0004794883,0.14042935],"study_design_scores_gemma":[0.0005554728,0.00034321554,0.0013328921,0.00012701092,0.000011244723,0.000006645811,0.00003116731,0.9103384,0.00071388046,0.08612793,0.000023490977,0.00038862016],"about_ca_topic_score_codex":0.000019298965,"about_ca_topic_score_gemma":0.0000016501568,"teacher_disagreement_score":0.7571482,"about_ca_system_score_codex":0.00015106593,"about_ca_system_score_gemma":0.00013615597,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W2575334355","doi":"10.1017/s0963548315000115","title":"‘Forcing a sparse minor’ — CORRIGENDUM","year":2015,"lang":"en","type":"erratum","venue":"Combinatorics Probability Computing","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"McGill University","funders":"","keywords":"Mistake; Minor (academic); Constant (computer programming); Line (geometry); Forcing (mathematics); Computer science; Mathematics; Philosophy; Geometry; Political science; Mathematical analysis; Humanities; Law; Programming language","score_opus":0.10852157190795325,"score_gpt":0.23399237746360071,"score_spread":0.12547080555564746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575334355","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.0010065488,0.007801785,0.00042223497,0.00013159578,0.18335196,0.0006876393,0.00043134508,0.00025141233,0.8059155],"genre_scores_gemma":[0.022112641,0.00016545437,0.00068725523,0.00016544324,0.0014647596,0.000024684954,0.00027579494,0.00012230108,0.97498167],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99512297,0.000054650984,0.0017289022,0.0018652262,0.00017037727,0.0010578514],"domain_scores_gemma":[0.9963738,0.000088794994,0.0015026007,0.0013737902,0.0003219275,0.00033910328],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0034343426,0.0006815193,0.0017564365,0.00042810518,0.00050063536,0.00036596236,0.0011864244,0.00066655024,0.0009928637],"category_scores_gemma":[0.0009796732,0.00085594854,0.00043761273,0.00067715487,0.00030634558,0.0002591044,0.0013015954,0.0012201286,0.010260588],"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.0000053996428,0.0001680218,0.002738916,0.0002596384,0.00011112018,0.00000875947,0.0008626721,0.00006546327,5.0946603e-8,0.11052474,0.8849765,0.00027873513],"study_design_scores_gemma":[0.0005119547,0.000057430912,0.00021497962,0.0001019904,0.000025075748,0.000004701263,0.00018631047,0.007946747,9.399585e-7,0.21146071,0.7786973,0.0007918284],"about_ca_topic_score_codex":0.0003173816,"about_ca_topic_score_gemma":0.000014384311,"teacher_disagreement_score":0.18188721,"about_ca_system_score_codex":0.0015529433,"about_ca_system_score_gemma":0.00030253918,"threshold_uncertainty_score":0.99992037},"labels":[],"label_agreement":null},{"id":"W2581287304","doi":"10.1017/s0963548318000147","title":"A Stability Theorem for Matchings in Tripartite 3-Graphs","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Hypergraph; Combinatorics; Mathematics; Matching (statistics); Stability (learning theory); Degree (music); Statement (logic); Class (philosophy); Discrete mathematics; Upper and lower bounds; Computer science; Physics; Law","score_opus":0.07684350629081063,"score_gpt":0.32599971682115114,"score_spread":0.2491562105303405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581287304","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.97732264,0.00020903046,0.012816744,0.00012321104,0.003553257,0.0039010905,0.00006657451,0.00040337717,0.0016041006],"genre_scores_gemma":[0.97402364,0.0000076126157,0.025419272,0.00006228134,0.00019462172,0.00014656688,0.000028240547,0.000100301084,0.000017484179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442434,0.00074934156,0.0017249126,0.0016015909,0.0005469034,0.00095292204],"domain_scores_gemma":[0.99256694,0.0034874785,0.0008965706,0.002166017,0.0007022895,0.00018068276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008336224,0.0007726485,0.0014127115,0.00028868628,0.0005538864,0.00016456854,0.0014389592,0.00083136,0.000027911256],"category_scores_gemma":[0.0038794884,0.00072498235,0.0006868952,0.00054510025,0.00056349643,0.00009673458,0.003157026,0.001577707,0.0000017776247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013441553,0.0006223534,0.012405472,0.0036318724,0.00008020335,0.000002319541,0.006718708,0.000042436463,0.000009477102,0.974975,0.00023948913,0.0011382762],"study_design_scores_gemma":[0.0011114964,0.00013648017,0.0016513035,0.00045027694,0.00007277226,0.0000030920928,0.000128846,0.0068200952,0.000361128,0.9884186,0.0001303438,0.0007155652],"about_ca_topic_score_codex":0.000040056337,"about_ca_topic_score_gemma":0.000028702318,"teacher_disagreement_score":0.013443624,"about_ca_system_score_codex":0.00060023065,"about_ca_system_score_gemma":0.00025988754,"threshold_uncertainty_score":0.9995201},"labels":[],"label_agreement":null},{"id":"W2731346518","doi":"10.1017/s0963548318000342","title":"Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Upper and lower bounds; Bounding overwatch; Combinatorics; Hermite polynomials; Uniqueness; Polynomial; Context (archaeology); Grid; Orthogonal polynomials; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.03031485595492576,"score_gpt":0.2887224744568492,"score_spread":0.2584076185019234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731346518","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.8664152,0.0002613118,0.1307729,0.00014351019,0.0010360989,0.0007330406,0.000015614114,0.00011162674,0.00051072746],"genre_scores_gemma":[0.9918423,0.000013187449,0.0080301305,0.00002958151,0.000047563117,0.000012006076,0.0000035480414,0.000018827059,0.0000028270756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627286,0.0011901347,0.0010024441,0.0008458577,0.00029313954,0.0003955377],"domain_scores_gemma":[0.99352795,0.0028798534,0.0013519062,0.0015630483,0.0005861666,0.000091048685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003395704,0.0004511034,0.00095798174,0.00012379762,0.00043435546,0.00017881802,0.0020407313,0.00026548374,0.0000030103192],"category_scores_gemma":[0.0005907389,0.00034107003,0.00028610678,0.00061211886,0.0014009402,0.00014325175,0.005928988,0.00071226485,8.25048e-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.000036736583,0.00047287942,0.0588283,0.0006623022,0.00023406505,8.8476924e-7,0.017573388,0.00007616388,0.00077665906,0.91661364,0.00001549482,0.0047094785],"study_design_scores_gemma":[0.00040306197,0.00011117742,0.021083705,0.0005137997,0.00002777391,0.000008683751,0.00016321658,0.011886277,0.009403174,0.9560233,0.00003109236,0.00034475417],"about_ca_topic_score_codex":0.00009572018,"about_ca_topic_score_gemma":0.0000017628472,"teacher_disagreement_score":0.12542716,"about_ca_system_score_codex":0.00008323867,"about_ca_system_score_gemma":0.00021341367,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W2751658478","doi":"10.1017/s0963548320000620","title":"Full rainbow matchings in graphs and hypergraphs","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Rainbow; Counterexample; Conjecture; Generalization; Matching (statistics); Bounded function; Simple (philosophy)","score_opus":0.028745771658093888,"score_gpt":0.2781035584465096,"score_spread":0.2493577867884157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751658478","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.99577385,0.00056820444,0.00038595076,0.00020166514,0.00059650035,0.00026889748,0.0000021590402,0.00015601216,0.0020467462],"genre_scores_gemma":[0.9895587,0.000025321064,0.010218223,0.000106352396,0.000018987124,0.0000047810304,0.0000026782036,0.000027611957,0.00003733472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978734,0.00030203315,0.00054986466,0.0005775403,0.0002737857,0.0004233344],"domain_scores_gemma":[0.99795437,0.0010326394,0.000144523,0.0005708437,0.00018292449,0.00011468904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013805673,0.00025310312,0.00045256704,0.00014142085,0.00034936282,0.00007415094,0.00025573932,0.00015914696,0.000012979504],"category_scores_gemma":[0.0012447591,0.0002470283,0.00012642557,0.0007688041,0.00017666994,0.000100583864,0.0006166239,0.0004878402,7.9546635e-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.000014781876,0.00018328488,0.035720576,0.00030872173,0.000020450983,0.000030341651,0.0020456898,0.000008431703,0.00013092611,0.9589866,0.000054025248,0.0024962148],"study_design_scores_gemma":[0.00067022134,0.00004936538,0.009498664,0.00008495265,0.000015611875,0.000064161875,0.00020116745,0.00071480626,0.00025950006,0.98806083,0.00011018254,0.00027050634],"about_ca_topic_score_codex":0.0000108826525,"about_ca_topic_score_gemma":0.000013675135,"teacher_disagreement_score":0.029074304,"about_ca_system_score_codex":0.00007639457,"about_ca_system_score_gemma":0.000057210047,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2753506939","doi":"10.1017/s0963548319000385","title":"The string of diamonds is nearly tight for rumour spreading","year":2019,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Upper and lower bounds; Bounded function; String (physics); Graph; Asynchronous communication","score_opus":0.011024349043444879,"score_gpt":0.25558355549403144,"score_spread":0.24455920645058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753506939","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.9430187,0.000106124775,0.0524928,0.00010426587,0.00029249696,0.0008440256,0.0000070734245,0.0000862848,0.0030482542],"genre_scores_gemma":[0.9974674,0.0000010328761,0.002199403,0.000009529698,0.00010740413,0.000016334856,0.000007876872,0.000022387572,0.00016865243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983388,0.000080927115,0.0005369072,0.00037700543,0.00022401282,0.00044234926],"domain_scores_gemma":[0.99774617,0.0008728424,0.0003523297,0.0006726323,0.00029680054,0.000059240905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012430188,0.00018921561,0.00036836753,0.0000509072,0.00037646032,0.00010440054,0.0005399811,0.000044501663,0.000025893512],"category_scores_gemma":[0.000036973383,0.0001587537,0.0002883821,0.0004313582,0.00006551297,0.00009253222,0.00036150916,0.00021543032,0.0000056807066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009829481,0.00011859902,0.36346248,0.00006751026,0.000092302325,4.736388e-8,0.0002943974,0.0002791369,0.00028665815,0.6177411,0.00039656923,0.017251356],"study_design_scores_gemma":[0.0006478353,0.00015286848,0.0076282322,0.00010605733,0.00006671052,2.3844953e-7,0.00015573442,0.097519614,0.010735902,0.87835526,0.0042668795,0.00036468395],"about_ca_topic_score_codex":0.00007523788,"about_ca_topic_score_gemma":0.0000011915699,"teacher_disagreement_score":0.35583425,"about_ca_system_score_codex":0.000082077604,"about_ca_system_score_gemma":0.000060078408,"threshold_uncertainty_score":0.6473788},"labels":[],"label_agreement":null},{"id":"W2885507564","doi":"10.1017/s0963548313000576","title":"Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"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; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Permutation (music); Neighbourhood (mathematics); Diagonal; Random permutation; Limit (mathematics); Discrete mathematics; Geometry; Physics; Mathematical analysis; Symmetric group","score_opus":0.05303729583454216,"score_gpt":0.3152075288856322,"score_spread":0.26217023305109005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885507564","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.41259328,0.00006482612,0.5841063,0.00032550117,0.0004753615,0.0018478701,0.000009785705,0.00025191938,0.00032510568],"genre_scores_gemma":[0.98140186,0.000006297955,0.018025216,0.000064415006,0.000111647125,0.00024696309,0.000015643694,0.00006500587,0.000062930005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997625,0.00021004153,0.00078370556,0.0005175745,0.00029677624,0.00056692824],"domain_scores_gemma":[0.9932006,0.0049230466,0.00038639866,0.00059291493,0.0007325462,0.00016450639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014315477,0.00031992383,0.00048799723,0.00010251486,0.0009856699,0.00021402225,0.00031466875,0.00014878872,0.000020174191],"category_scores_gemma":[0.006408795,0.0003212658,0.0001259197,0.00036238422,0.000092942595,0.00036182563,0.0003065418,0.00035068055,0.000015323702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018160649,0.00035984797,0.0017203746,0.0004465577,0.0000323918,3.3755873e-7,0.0027651775,0.000029103967,0.00012579422,0.99329776,0.00029404668,0.000926809],"study_design_scores_gemma":[0.0009102854,0.000089662775,0.0004316824,0.00008135719,0.00004980399,0.000005757324,0.0006786302,0.0525161,0.0003185265,0.9444477,0.00014224913,0.00032826568],"about_ca_topic_score_codex":0.0000059922745,"about_ca_topic_score_gemma":0.0000042266283,"teacher_disagreement_score":0.5688086,"about_ca_system_score_codex":0.00023741918,"about_ca_system_score_gemma":0.000072058356,"threshold_uncertainty_score":0.99992394},"labels":[],"label_agreement":null},{"id":"W2899926070","doi":"10.1017/s0963548320000127","title":"Finding independent transversals efficiently","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Dominating set; Vertex (graph theory); Partition (number theory); Graph; Independent set; Efficient algorithm; Set (abstract data type)","score_opus":0.05420302350043195,"score_gpt":0.2914215236149398,"score_spread":0.23721850011450785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899926070","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.27382398,0.00012129025,0.7215109,0.0017316111,0.00042696382,0.0005265049,0.0000014760637,0.0006052304,0.0012520816],"genre_scores_gemma":[0.98355615,0.0000025801323,0.016028164,0.0003198185,0.00005006111,0.0000066381763,0.0000018394254,0.000020666854,0.000014082523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648386,0.00035544872,0.0005154322,0.0010366512,0.0008493279,0.00075925264],"domain_scores_gemma":[0.9977818,0.0005539236,0.00015477029,0.0008174247,0.00026005288,0.0004320369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015104766,0.00027143446,0.00036051293,0.00012532769,0.0004320675,0.00024779575,0.0023326261,0.00010974798,0.000011067144],"category_scores_gemma":[0.00072577555,0.00028643015,0.00016705111,0.0019735638,0.00012931493,0.00045944127,0.0011647572,0.0006679073,0.00007656643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020315952,0.00026067696,0.0069607766,0.00016657478,0.000026543927,0.00003797543,0.004096345,0.0073088794,0.0012340647,0.9661727,0.000080780104,0.013634398],"study_design_scores_gemma":[0.00154731,0.0004404028,0.0026687293,0.00005130972,0.000009371306,0.000015521024,0.00011415637,0.41892418,0.0064227344,0.56802773,0.001073493,0.00070508005],"about_ca_topic_score_codex":0.0000032125579,"about_ca_topic_score_gemma":3.734241e-7,"teacher_disagreement_score":0.7097322,"about_ca_system_score_codex":0.00021835678,"about_ca_system_score_gemma":0.00014564744,"threshold_uncertainty_score":0.9999588},"labels":[],"label_agreement":null},{"id":"W2913080482","doi":"10.1017/s0963548303005789","title":"Frank Ramsey","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Topology and Set Theory","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":"Trinity College","funders":"","keywords":"Casual; Ramsey theory; Ramsey's theorem; Philosophy; Mathematical economics; Philosophy of science; Mathematics; Combinatorics; Epistemology; Law; Political science","score_opus":0.05593328044751458,"score_gpt":0.32056012039819776,"score_spread":0.26462683995068315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913080482","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.7653331,0.00027066548,0.19421221,0.0001054068,0.0013529604,0.0005095531,0.0000012196238,0.00047380698,0.037741065],"genre_scores_gemma":[0.97417796,0.0000028369034,0.025454618,0.00008109748,0.000030668125,0.0000054644547,0.0000013384189,0.000025120255,0.00022087496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998154,0.0004203845,0.00041561367,0.000398159,0.00018371623,0.00042815565],"domain_scores_gemma":[0.9976522,0.001342389,0.0001525326,0.0005982903,0.00015072155,0.00010390421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016665268,0.00020493005,0.00033385653,0.000049805963,0.00034369127,0.000019359957,0.00026250677,0.00013547523,0.00007570052],"category_scores_gemma":[0.00371394,0.0002034542,0.000106055915,0.00031505508,0.00018347467,0.00008575826,0.00010247638,0.00042635275,0.000038162507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057614634,0.00025801294,0.0027925149,0.000079799116,0.000015809355,0.0000064045644,0.00037937792,0.000046974175,0.00001751737,0.99541837,0.000176817,0.0008026187],"study_design_scores_gemma":[0.0004944362,0.000048943148,0.00017256332,0.00001834221,0.00001400408,0.000023448565,0.00007850249,0.00036376822,0.0008198147,0.99586314,0.0018832225,0.0002198003],"about_ca_topic_score_codex":0.0000011849853,"about_ca_topic_score_gemma":7.752458e-7,"teacher_disagreement_score":0.20884487,"about_ca_system_score_codex":0.00012273752,"about_ca_system_score_gemma":0.00006379563,"threshold_uncertainty_score":0.82966214},"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":"W2946174826","doi":"10.1017/s0963548322000281","title":"On mappings on the hypercube with small average stretch","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Simon Fraser University","funders":"","keywords":"Bijection; Combinatorics; Hypercube; Physics; Mathematics","score_opus":0.05258960458816773,"score_gpt":0.2450905242325298,"score_spread":0.19250091964436208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946174826","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.9902123,0.000022314916,0.0006749776,0.00056914875,0.0006106591,0.0007620816,0.000007403332,0.00019642955,0.006944687],"genre_scores_gemma":[0.9981216,7.546025e-7,0.001034719,0.0006229406,0.000043603803,0.00003165389,0.0000030802594,0.00004127657,0.00010034171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975471,0.0005442082,0.00035705167,0.00052551465,0.0006104876,0.00041567572],"domain_scores_gemma":[0.9956302,0.0029395912,0.000215265,0.001031154,0.00011035712,0.000073411065],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019141899,0.00028744683,0.00030949415,0.00007821356,0.0017632869,0.00005541827,0.0007958725,0.00005965218,0.00013529629],"category_scores_gemma":[0.0006881811,0.00018891558,0.00012470773,0.0004973219,0.00014438193,0.000026273141,0.00074067106,0.0010411964,0.0000036488186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064875094,0.00035220408,0.00084555824,0.000074666,0.000039916504,0.000011165176,0.0022388315,0.0013002583,0.000005744681,0.99299026,0.00037320773,0.0017033451],"study_design_scores_gemma":[0.00045854168,0.00057792134,0.0005650063,0.00004120633,0.000017077959,0.000018539284,0.00029216916,0.0030044501,0.000099250086,0.9940416,0.00062221254,0.00026201957],"about_ca_topic_score_codex":0.0000069221724,"about_ca_topic_score_gemma":0.0000011886249,"teacher_disagreement_score":0.0079093315,"about_ca_system_score_codex":0.000304098,"about_ca_system_score_gemma":0.00005545576,"threshold_uncertainty_score":0.9995363},"labels":[],"label_agreement":null},{"id":"W2949342774","doi":"10.1017/s096354830700884x","title":"On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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 Calgary","funders":"","keywords":"Combinatorics; Tetrahedron; Mathematics; Hyperplane; Unit (ring theory); Zero (linguistics); Space (punctuation); Volume (thermodynamics); Physics; Geometry; Computer science","score_opus":0.02058352999818149,"score_gpt":0.25732123944233193,"score_spread":0.23673770944415043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949342774","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.72115225,0.000037864713,0.27709714,0.00034938566,0.0001374184,0.00023028224,4.0282234e-7,0.00003606753,0.00095917867],"genre_scores_gemma":[0.99017805,7.840075e-7,0.00972625,0.000047498474,0.00001939653,0.0000024574383,0.00000139702,0.000006362901,0.000017817147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985492,0.00010620029,0.00034496386,0.00038444498,0.0003553754,0.00025978606],"domain_scores_gemma":[0.99739754,0.0017512602,0.0001613346,0.00040960693,0.00021467116,0.00006558417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822533,0.00015305127,0.00019103778,0.00009744264,0.00017412913,0.000070407084,0.00041514446,0.000052600783,0.0000024776125],"category_scores_gemma":[0.00033012888,0.00011257812,0.000030987594,0.0012618279,0.00012669241,0.00014214072,0.0002422836,0.00022896087,0.000002337312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017721715,0.00023119473,0.19428822,0.000041630647,0.0000076086444,0.000004496765,0.00046849588,0.0014502141,0.00002124287,0.7953331,0.000012766257,0.008123315],"study_design_scores_gemma":[0.00055771886,0.00019913423,0.36902478,0.00008048656,0.0000045093298,0.00001843859,0.000043233566,0.16196506,0.0005818185,0.46726906,0.000053403928,0.00020234333],"about_ca_topic_score_codex":0.000033155233,"about_ca_topic_score_gemma":0.000062324645,"teacher_disagreement_score":0.32806402,"about_ca_system_score_codex":0.00006733518,"about_ca_system_score_gemma":0.000083407605,"threshold_uncertainty_score":0.45908025},"labels":[],"label_agreement":null},{"id":"W2963578227","doi":"10.1017/s0963548313000060","title":"Arithmetic Progressions in Sumsets and <i>L<sup>p</sup></i>-Almost-Periodicity","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Science Foundation","keywords":"Mathematics; Lemma (botany); Arithmetic progression; Combinatorics; Arithmetic; Simple (philosophy); BETA (programming language); Binary logarithm; Discrete mathematics; Computer science","score_opus":0.028311161675105,"score_gpt":0.27888195625352474,"score_spread":0.25057079457841974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963578227","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.9965945,0.0002665703,0.00035184223,0.0002064797,0.00023970187,0.0012555438,0.0000031548625,0.00018899783,0.0008932266],"genre_scores_gemma":[0.99029505,0.000006789137,0.00946299,0.0000913136,0.000040658608,0.00004119275,0.000003042573,0.00003261273,0.000026325086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973986,0.00035816772,0.0006929261,0.00061125425,0.0003473616,0.0005916638],"domain_scores_gemma":[0.9976502,0.0010668255,0.00018614317,0.0006669639,0.00023000807,0.00019984583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012586215,0.0003291525,0.000522373,0.00015066213,0.0005523146,0.00015545177,0.0003966471,0.00021092143,0.000034256926],"category_scores_gemma":[0.0016698566,0.00028078447,0.00009441759,0.0005453881,0.00031122193,0.00019462834,0.0007727239,0.0006303408,0.0000056782524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014992752,0.00079567696,0.23741475,0.000758278,0.00003951702,0.000015022271,0.011887386,0.00012251362,0.000027119058,0.727803,0.00038497942,0.020736799],"study_design_scores_gemma":[0.00066349626,0.00008132065,0.028092055,0.00014554037,0.000015958776,0.000023057566,0.0004604914,0.020820348,0.000055742905,0.9492535,0.000068535795,0.0003199707],"about_ca_topic_score_codex":0.000045611963,"about_ca_topic_score_gemma":0.000005748077,"teacher_disagreement_score":0.22145052,"about_ca_system_score_codex":0.00013237713,"about_ca_system_score_gemma":0.00005337947,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W2979430184","doi":"10.1017/s096354831900018x","title":"Long Monotone Trails in Random Edge-Labellings of Random Graphs","year":2019,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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 British Columbia","funders":"","keywords":"Combinatorics; Bijection; Mathematics; Random graph; Monotone polygon; Path (computing); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.023265063278616504,"score_gpt":0.27092241780898535,"score_spread":0.24765735453036886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979430184","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.98962796,0.00030408226,0.0053736814,0.000036789126,0.0010489785,0.0015783433,0.0000029496164,0.00010996138,0.0019172432],"genre_scores_gemma":[0.99722654,0.00001350798,0.0026075444,0.000022464903,0.000027066599,0.000009723456,0.0000029875139,0.00003802304,0.000052125666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969066,0.0004110103,0.0011743848,0.00056289724,0.00043708325,0.0005080497],"domain_scores_gemma":[0.99611264,0.0022248474,0.00046651956,0.00084249215,0.00025606173,0.0000974185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033544153,0.0003303963,0.0010388934,0.00024565743,0.00015146413,0.00003161902,0.000591471,0.00022565546,0.000031868647],"category_scores_gemma":[0.00090826926,0.00029861258,0.00030140433,0.000814731,0.00019949487,0.00012953897,0.00031619624,0.0005378261,0.0000038111618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035141397,0.00055347045,0.13164099,0.0011455823,0.00006910148,0.000005134924,0.0045867707,0.00038820776,0.00019101289,0.8588769,0.000024465691,0.0021669643],"study_design_scores_gemma":[0.008917687,0.00012867042,0.0059308684,0.00021467218,0.000033442633,0.0000054179495,0.00007770334,0.004758343,0.0014574808,0.978162,0.000022383094,0.0002913331],"about_ca_topic_score_codex":0.000021675389,"about_ca_topic_score_gemma":0.000006600791,"teacher_disagreement_score":0.12571011,"about_ca_system_score_codex":0.00010750057,"about_ca_system_score_gemma":0.00007260559,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2990658245","doi":"10.1017/s096354831900035x","title":"Counting higher order tangencies for plane curves","year":2019,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Algebraic Geometry and Number Theory","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":"Plane curve; Tangent; Order (exchange); Plane (geometry); Mathematics; Algebraic curve; Algebraic number; Quartic plane curve; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.04374170868733731,"score_gpt":0.2878291383974293,"score_spread":0.24408742971009198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990658245","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.98240715,0.0006609622,0.0055701607,0.00041221103,0.0019826803,0.0014885716,0.00000931222,0.0003653876,0.0071035563],"genre_scores_gemma":[0.9900238,0.000006474878,0.007760315,0.00023175553,0.00012328956,0.000020514257,0.000017578739,0.000043840013,0.0017724441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800104,0.00012487815,0.00052745536,0.0004933898,0.0003457773,0.000507449],"domain_scores_gemma":[0.996108,0.0024804045,0.00027960062,0.0005969218,0.00045431152,0.0000807793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00238195,0.00025931402,0.00047179323,0.000061511906,0.00023619374,0.00004900897,0.00040524406,0.00013817189,0.00019308545],"category_scores_gemma":[0.0015359063,0.0002501959,0.00012676425,0.0005330902,0.000081904785,0.00014195802,0.00023793182,0.00026581262,0.000059069844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026027326,0.00032902838,0.021144165,0.004106411,0.00006707772,0.000001148412,0.00043114464,0.000019596942,0.00010666226,0.97025925,0.0029026319,0.00060685567],"study_design_scores_gemma":[0.00070370414,0.0001116207,0.0011881983,0.00031410233,0.000042380914,0.0000055818086,0.000108084685,0.0008228653,0.0005144762,0.9924551,0.0033738595,0.00036000143],"about_ca_topic_score_codex":0.000006998301,"about_ca_topic_score_gemma":9.254134e-7,"teacher_disagreement_score":0.022195872,"about_ca_system_score_codex":0.00013258128,"about_ca_system_score_gemma":0.000073945565,"threshold_uncertainty_score":0.99999505},"labels":[],"label_agreement":null},{"id":"W3007271564","doi":"10.1017/s0963548321000213","title":"Clustered 3-colouring graphs of bounded degree","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Carleton University; Wilfrid Laurier University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bounded function; Planar graph; Degree (music); Vertex (graph theory); 1-planar graph; Discrete mathematics; Cluster analysis; Graph; Chordal graph; Statistics; Physics","score_opus":0.0581101267166381,"score_gpt":0.2964187187545243,"score_spread":0.2383085920378862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007271564","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.6560835,0.00038646915,0.33972263,0.0002531668,0.0006601726,0.0003299217,0.0000012937935,0.00025205227,0.0023107876],"genre_scores_gemma":[0.9302079,0.000007303989,0.06964932,0.00004178203,0.000015430009,0.000006134804,0.0000023361863,0.000016936792,0.000052868832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966402,0.00051977,0.0006663555,0.000849268,0.0006697716,0.0006546428],"domain_scores_gemma":[0.9961007,0.00081254647,0.00026416767,0.0016495107,0.0009857339,0.00018731778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017431788,0.00023674121,0.00045192565,0.00018795265,0.000344405,0.00014855021,0.0016277452,0.00011720881,0.000006844771],"category_scores_gemma":[0.00109199,0.00026119562,0.00020983462,0.0023524256,0.00023096312,0.0004016124,0.0021944556,0.00046459006,0.00000774131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402508,0.0003679863,0.014939749,0.0002095403,0.000032014832,0.00003598083,0.00052734837,0.00039320215,0.0013473633,0.9695171,0.000016412274,0.012603899],"study_design_scores_gemma":[0.0006799645,0.00009557339,0.007409776,0.000066899556,0.000005560305,0.000032347874,0.000038948834,0.022487039,0.017228309,0.95160264,0.000097935794,0.00025502988],"about_ca_topic_score_codex":0.000007700619,"about_ca_topic_score_gemma":0.000007068993,"teacher_disagreement_score":0.27412438,"about_ca_system_score_codex":0.00019960606,"about_ca_system_score_gemma":0.00035095427,"threshold_uncertainty_score":0.999984},"labels":[],"label_agreement":null},{"id":"W3034713230","doi":"10.1017/s0963548322000189","title":"A BK inequality for random matchings","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Random Matrices and Applications","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Matching (statistics); Graph; Inequality; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis; Statistics","score_opus":0.0721353858554621,"score_gpt":0.3360541155324927,"score_spread":0.2639187296770306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034713230","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.83931565,0.00007853361,0.1557713,0.0008049832,0.0004356961,0.0022676147,0.000033721615,0.00033068212,0.0009618084],"genre_scores_gemma":[0.9825473,0.0000010195104,0.016710011,0.00009140821,0.000068816145,0.00041350254,0.000017975417,0.000031547752,0.000118436394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794745,0.0002495646,0.0006455716,0.00044508473,0.00035774647,0.0003545557],"domain_scores_gemma":[0.9962383,0.002582395,0.00034360046,0.00057717075,0.00017555595,0.000082978164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035759083,0.00018132314,0.0004190024,0.000060126884,0.001159632,0.00006302329,0.0004917515,0.000044549874,0.000035857378],"category_scores_gemma":[0.00093636755,0.00018738686,0.00022502894,0.00050761475,0.000039859246,0.00006220088,0.0005070879,0.00031414573,0.0000029155483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112087815,0.00078986416,0.0017772579,0.00043102246,0.000030448908,6.376797e-7,0.001199353,0.000410182,0.000058262696,0.99097365,0.0022838674,0.0019333627],"study_design_scores_gemma":[0.00353506,0.000082413695,0.0001230275,0.000007423411,0.000036278496,0.0000060695234,0.0001680473,0.016075736,0.00007320593,0.9734445,0.006229699,0.00021851403],"about_ca_topic_score_codex":0.000025931418,"about_ca_topic_score_gemma":0.0000013695419,"teacher_disagreement_score":0.14323163,"about_ca_system_score_codex":0.00026611693,"about_ca_system_score_gemma":0.00007933074,"threshold_uncertainty_score":0.8919069},"labels":[],"label_agreement":null},{"id":"W3037879963","doi":"10.1017/s0963548322000098","title":"Community detection and percolation of information in a geometric setting","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"Azrieli Foundation","keywords":"Mathematics; Stochastic block model; Percolation (cognitive psychology); Block (permutation group theory); Combinatorics; Branching random walk; Spatial network; Random graph; Geometric networks; Isomorphism (crystallography); Metric space; Random walk; Graph; Discrete mathematics; Graph theory; Cluster analysis","score_opus":0.03349989339541534,"score_gpt":0.2802713720489709,"score_spread":0.24677147865355556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037879963","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.6476695,0.00001761429,0.3517855,0.0000195576,0.00010206839,0.00027208278,0.0000049600203,0.000031360167,0.00009737656],"genre_scores_gemma":[0.9919662,6.303854e-7,0.007990636,0.0000118653725,0.0000040735636,0.000015518828,0.0000042648217,0.0000058254154,9.794277e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866706,0.0003027894,0.0005053041,0.0001030822,0.00026699377,0.00015478932],"domain_scores_gemma":[0.99787116,0.0015083087,0.0002589831,0.00017654577,0.00015159328,0.00003342726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688277,0.0000879773,0.0001984011,0.00023658639,0.00039245785,0.000020697315,0.00013640692,0.000039177092,0.0000048498246],"category_scores_gemma":[0.0052890824,0.000101509075,0.00002347707,0.0010325067,0.00002565957,0.00014630845,0.0004083947,0.00050289516,2.483343e-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.00007848221,0.00091139425,0.008109159,0.0027680988,0.000018314653,0.0000011041722,0.011288099,0.0023879607,0.0002310778,0.8380178,0.000013123217,0.13617536],"study_design_scores_gemma":[0.0003898756,0.00019407106,0.0045422143,0.000020105126,0.000008180821,0.000006747706,0.0009202981,0.21064176,0.00009006458,0.78309387,0.0000086547325,0.000084167266],"about_ca_topic_score_codex":0.0000764287,"about_ca_topic_score_gemma":0.000007687985,"teacher_disagreement_score":0.34429672,"about_ca_system_score_codex":0.00025554115,"about_ca_system_score_gemma":0.000040474213,"threshold_uncertainty_score":0.63319075},"labels":[],"label_agreement":null},{"id":"W3093799740","doi":"10.1017/s0963548320000395","title":"Mixing properties of colourings of the ℤ<i><sup>d</sup></i> lattice","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Cellular Automata and Applications","field":"Computer Science","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 British Columbia","funders":"","keywords":"Combinatorics; Lattice (music); Mixing (physics); Mathematics; Physics; Space (punctuation); Discrete mathematics; Quantum mechanics; Computer science","score_opus":0.033059731071304485,"score_gpt":0.21504371675848513,"score_spread":0.18198398568718066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093799740","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.9433876,0.00019507704,0.05290376,0.0022725188,0.00008806512,0.0005169239,0.0000014669308,0.00015615037,0.00047841982],"genre_scores_gemma":[0.9936582,0.000001392932,0.0061592334,0.00013723393,0.000019024343,0.000006027496,4.2571406e-7,0.000008900675,0.000009602986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836576,0.00013692793,0.00052948523,0.00038416905,0.0003566242,0.0002270632],"domain_scores_gemma":[0.9984053,0.00015291729,0.00031349022,0.0007752588,0.00027301905,0.00008002993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190024,0.00014039154,0.0002763605,0.000025534762,0.00020398427,0.00004832457,0.0016520066,0.00005700574,0.0000012593375],"category_scores_gemma":[0.00035459438,0.00011101231,0.00013339515,0.0010240995,0.00016687225,0.00015697311,0.0013512566,0.00021496782,0.000003836375],"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.000010557795,0.0007096284,0.022186983,0.0015790068,0.000049427992,0.0000013868353,0.017235823,0.014425579,0.02198839,0.91521543,0.00021715068,0.006380642],"study_design_scores_gemma":[0.0004010147,0.00008143306,0.0022095866,0.00013829464,0.0000203493,0.000004445256,0.000107529086,0.8602547,0.10246876,0.0333911,0.0007038165,0.00021894125],"about_ca_topic_score_codex":0.000025007816,"about_ca_topic_score_gemma":3.5093188e-7,"teacher_disagreement_score":0.8818243,"about_ca_system_score_codex":0.000049059836,"about_ca_system_score_gemma":0.00012178723,"threshold_uncertainty_score":0.45269507},"labels":[],"label_agreement":null},{"id":"W3111722804","doi":"10.1017/s0963548322000165","title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Friendship graph; Graph; Discrete mathematics; Class (philosophy); Upper and lower bounds; Pathwidth; Integer (computer science); Graph power; Computer science; Line graph","score_opus":0.03701321584223581,"score_gpt":0.2773013662615847,"score_spread":0.24028815041934887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111722804","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.7549986,0.00010644385,0.24223551,0.00020921836,0.00040942142,0.0008857388,0.000005496263,0.00035090206,0.0007986342],"genre_scores_gemma":[0.96765155,0.0000027703948,0.03212298,0.000050067727,0.000014472316,0.000047783185,0.00000355208,0.00002808753,0.00007875087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958736,0.00076385,0.00062619516,0.0008983186,0.001112816,0.0007252531],"domain_scores_gemma":[0.9966277,0.0009986145,0.00042462227,0.0013704709,0.00040185134,0.0001767286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022027383,0.00029079238,0.0005077856,0.000329161,0.0010031883,0.0001291381,0.002338827,0.000055651042,0.000016107157],"category_scores_gemma":[0.00029776525,0.00025437816,0.00013062872,0.0031982444,0.0003087695,0.00037900265,0.0029137717,0.00068730215,0.0000014971857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005061374,0.001647409,0.03999922,0.0004310505,0.00010681606,0.0001053336,0.0027264773,0.015626904,0.00044295177,0.9269603,0.00006788844,0.011379497],"study_design_scores_gemma":[0.0028843158,0.002690921,0.005304653,0.00006945715,0.000016363176,0.000117927586,0.0004884337,0.07462389,0.00198208,0.9107177,0.00046924155,0.0006350014],"about_ca_topic_score_codex":0.000023098944,"about_ca_topic_score_gemma":0.000017815059,"teacher_disagreement_score":0.21265289,"about_ca_system_score_codex":0.00042931997,"about_ca_system_score_gemma":0.00049275515,"threshold_uncertainty_score":0.9999908},"labels":[],"label_agreement":null},{"id":"W3166161324","doi":"10.1017/s0963548322000219","title":"Towards the 0-statement of the Kohayakawa-Kreuter conjecture","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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 Victoria","funders":"UK Research and Innovation","keywords":"Conjecture; Combinatorics; Statement (logic); Mathematics; Graph; Monochromatic color; Function (biology); Discrete mathematics; Physics; Philosophy","score_opus":0.050724031928611975,"score_gpt":0.28393126006565145,"score_spread":0.23320722813703948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166161324","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.99096304,0.00016573735,0.0010897256,0.0014940996,0.0023700148,0.00097639096,0.000017020717,0.00007662939,0.0028473241],"genre_scores_gemma":[0.9987691,0.0000012863965,0.0008132643,0.00023850458,0.000046753346,0.000022296294,0.0000014164191,0.000021656137,0.000085703905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972843,0.0007953981,0.0006165903,0.0003108374,0.00067704084,0.00031581125],"domain_scores_gemma":[0.9974809,0.0007686974,0.00042942323,0.0011368361,0.00014412671,0.000039984632],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027481823,0.00020085106,0.00029700142,0.000035309266,0.0015595064,0.000028073902,0.0012939865,0.000053020838,0.00008033383],"category_scores_gemma":[0.00053735386,0.00011244785,0.00024792133,0.00054996763,0.0002749873,0.00003134232,0.0025940968,0.00068794854,3.4940558e-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.000011306023,0.00016878627,0.0040470315,0.00014064358,0.00005293563,9.780531e-7,0.004743632,0.0005447774,0.000020645586,0.9874937,0.00121984,0.0015557421],"study_design_scores_gemma":[0.0003536632,0.000084800056,0.0025036575,0.000014518341,0.000037441743,0.000013424044,0.000379025,0.0010387563,0.0005381223,0.9907609,0.0041340375,0.00014165086],"about_ca_topic_score_codex":0.00001732008,"about_ca_topic_score_gemma":0.0000020393259,"teacher_disagreement_score":0.0078060613,"about_ca_system_score_codex":0.00022877578,"about_ca_system_score_gemma":0.00011322678,"threshold_uncertainty_score":0.9997403},"labels":[],"label_agreement":null},{"id":"W3177061711","doi":"10.1017/s0963548321000250","title":"Triangle-free subgraphs with large fractional chromatic number","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.029466258867352248,"score_gpt":0.2874517273114743,"score_spread":0.257985468444122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177061711","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.97091895,0.00013664017,0.013074848,0.0002527389,0.0009822539,0.00042861077,0.000011692623,0.00030904863,0.013885224],"genre_scores_gemma":[0.9792458,0.0000031332456,0.020314408,0.000114304195,0.000115695155,0.000010285458,0.000012899792,0.000044209657,0.00013926455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973417,0.00036620253,0.00058728724,0.0005741216,0.0006046018,0.00052607304],"domain_scores_gemma":[0.9961783,0.0016066765,0.0002864938,0.0012643815,0.00051961216,0.00014448927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013184934,0.00030520553,0.0005443585,0.00006234532,0.0007398165,0.00009286311,0.00048443023,0.00016597935,0.00024057347],"category_scores_gemma":[0.0023140586,0.00025842193,0.00021821105,0.0008120417,0.00014037518,0.00014675279,0.00060457556,0.0005170781,0.00000978586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025273877,0.00056753965,0.023917304,0.00035767377,0.00010868983,0.00003963121,0.00074191985,0.000015974983,0.000011568523,0.97338516,0.0005014366,0.0003278398],"study_design_scores_gemma":[0.0019347592,0.00005434293,0.00439232,0.00010281778,0.00006559083,0.00013944489,0.00015291075,0.0008782487,0.00032602853,0.9907768,0.00084144913,0.00033533794],"about_ca_topic_score_codex":0.0000047655626,"about_ca_topic_score_gemma":0.000012349723,"teacher_disagreement_score":0.019524984,"about_ca_system_score_codex":0.00016078619,"about_ca_system_score_gemma":0.00017865302,"threshold_uncertainty_score":0.9999868},"labels":[],"label_agreement":null},{"id":"W4235676350","doi":"10.1017/s0963548306007954","title":"Colouring Random Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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 Waterloo","funders":"","keywords":"Mathematics; Random graph; Chromatic scale; Combinatorics; Discrete mathematics; Random regular graph; Graph; Foster graph; Upper and lower bounds; Line graph; Voltage graph; 1-planar graph; Mathematical analysis","score_opus":0.022199893848720106,"score_gpt":0.2602597606684917,"score_spread":0.2380598668197716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235676350","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.98183584,0.00022881432,0.006718085,0.000075788535,0.001049494,0.0006038947,0.0000020345988,0.0004402976,0.009045725],"genre_scores_gemma":[0.9907948,0.0000020559273,0.008862659,0.000029940047,0.00012220923,0.000008116047,0.0000037921923,0.000038553055,0.00013787944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976051,0.00028333394,0.0006815053,0.00050482166,0.00040683776,0.0005183992],"domain_scores_gemma":[0.9975558,0.001101541,0.00026830952,0.00076143985,0.00022571883,0.000087188266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018403687,0.00029130906,0.00048312094,0.00012132451,0.0008009745,0.0000744493,0.00047766507,0.00016927601,0.000015543808],"category_scores_gemma":[0.0006597689,0.00026669254,0.00024874762,0.0005175887,0.00020708979,0.00009414373,0.0004162871,0.000373992,0.0000029869468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026314528,0.00019711607,0.011666345,0.00018340543,0.000024413848,0.0000075197418,0.00025077988,0.00012096179,0.00008244307,0.98632354,0.0005415315,0.0005756428],"study_design_scores_gemma":[0.0014665592,0.000044592434,0.002870673,0.000048770646,0.000034697143,0.000014122932,0.000026657763,0.0014135577,0.0010570054,0.9922777,0.00043656406,0.00030911263],"about_ca_topic_score_codex":0.000024155934,"about_ca_topic_score_gemma":0.0000037977281,"teacher_disagreement_score":0.008958928,"about_ca_system_score_codex":0.00014254679,"about_ca_system_score_gemma":0.000036183403,"threshold_uncertainty_score":0.99997854},"labels":[],"label_agreement":null},{"id":"W4243536351","doi":"10.1017/s0963548314000789","title":"CPC volume 24 issue 1 Cover and Back matter","year":2015,"lang":"en","type":"paratext","venue":"Combinatorics Probability Computing","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Cover (algebra); Volume (thermodynamics); Content (measure theory); Action (physics); Computer science; Engineering; Mathematics; Physics; Mechanical engineering","score_opus":0.051057839609885074,"score_gpt":0.22704934705516253,"score_spread":0.17599150744527745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243536351","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.0044684256,0.0077971285,0.0003685639,0.0004281514,0.02761953,0.0006732903,0.00074411253,0.00003702306,0.95786375],"genre_scores_gemma":[0.011686478,0.00020444459,0.00045373035,0.00032023477,0.0004223181,0.0000113485585,0.0001100072,0.00006521811,0.9867262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963468,0.00005026069,0.0012252938,0.0015706181,0.000093917944,0.00071314676],"domain_scores_gemma":[0.9977018,0.000101856494,0.00085866865,0.0008954974,0.00019112018,0.00025103858],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016860171,0.00054476236,0.0014036128,0.00024808996,0.00030637984,0.0004183947,0.0006182794,0.00043645367,0.10250262],"category_scores_gemma":[0.00015515879,0.0006652249,0.00020383582,0.00033368418,0.00036113829,0.0002482614,0.0012415064,0.0005669034,0.7857852],"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.000006427836,0.00011153647,0.009948658,0.00040319335,0.00010056983,0.0000010090004,0.0005792757,0.00014572772,7.360738e-8,0.003929785,0.98469037,0.000083350016],"study_design_scores_gemma":[0.0006297382,0.00004925942,0.00042658974,0.00006674164,0.000015954918,0.000004113228,0.00007266424,0.0024334178,0.0000012044233,0.016743435,0.9788428,0.00071407197],"about_ca_topic_score_codex":0.0001309178,"about_ca_topic_score_gemma":4.2693256e-7,"teacher_disagreement_score":0.68328255,"about_ca_system_score_codex":0.0006604793,"about_ca_system_score_gemma":0.00008654272,"threshold_uncertainty_score":0.9995799},"labels":[],"label_agreement":null},{"id":"W4281652242","doi":"10.1017/s0963548322000128","title":"On the peel number and the leaf-height of Galton–Watson trees","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Tree (set theory); Random variable; Binary logarithm; Discrete mathematics; Statistics","score_opus":0.041132627287450395,"score_gpt":0.28649969450118057,"score_spread":0.24536706721373017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281652242","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.8398757,0.0002473042,0.14777432,0.003541026,0.00089016627,0.0016608436,0.000032272244,0.00012642896,0.005851906],"genre_scores_gemma":[0.99815315,0.000002739256,0.0015570011,0.00013547506,0.000022157368,0.00003812599,0.0000012773594,0.00001843356,0.00007164129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980632,0.0003849252,0.00045423256,0.00030234156,0.00053559616,0.0002597258],"domain_scores_gemma":[0.9904011,0.008625883,0.0002619388,0.0005084632,0.0001530487,0.000049550643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025410356,0.0001715762,0.00035345953,0.00002062511,0.0007323837,0.000037624417,0.00046247654,0.000038909824,0.00009208407],"category_scores_gemma":[0.0048122397,0.000100943056,0.00008779278,0.00034720288,0.00023403448,0.000021953803,0.00063520373,0.00048870646,0.0000026337711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006846995,0.00023984944,0.00012842362,0.00013177414,0.000022799257,9.022208e-7,0.0010424079,0.000057803507,0.000004714945,0.9966608,0.00050208875,0.0011399428],"study_design_scores_gemma":[0.00079583057,0.00013773023,0.00008661217,0.000026657093,0.000038487848,0.000011765773,0.00030564237,0.04818306,0.00006996392,0.9501114,0.00012041548,0.00011243842],"about_ca_topic_score_codex":0.000015151318,"about_ca_topic_score_gemma":0.0000016960548,"teacher_disagreement_score":0.15827742,"about_ca_system_score_codex":0.000091903596,"about_ca_system_score_gemma":0.00006405542,"threshold_uncertainty_score":0.5761048},"labels":[],"label_agreement":null},{"id":"W4366829792","doi":"10.1017/s096354832300010x","title":"Expected number of faces in a random embedding of any graph is at most linear","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Embedding; Conjecture; Multigraph; Upper and lower bounds; Vertex (graph theory); Random regular graph; Discrete mathematics; Random graph; Graph embedding; Multiplicity (mathematics); Graph; 1-planar graph; Line graph; Computer science; Geometry","score_opus":0.04208248376731293,"score_gpt":0.31914944790481203,"score_spread":0.2770669641374991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366829792","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.9711897,0.00025903838,0.02663802,0.00027979413,0.00028473427,0.00039566428,0.0000021737578,0.00020634058,0.00074455974],"genre_scores_gemma":[0.99357194,0.00012525318,0.006194407,0.00003280816,0.000010417767,0.0000091954125,0.0000051696657,0.0000111827185,0.00003962816],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763656,0.00039829258,0.00081167754,0.0004544148,0.00035231837,0.00034675864],"domain_scores_gemma":[0.99728507,0.0008852487,0.00034175467,0.0009626697,0.00045281634,0.00007246906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015745315,0.00018545361,0.00048809848,0.00022568763,0.00019516985,0.0000325957,0.0011666539,0.00008618517,0.000014945803],"category_scores_gemma":[0.00050994894,0.00019247153,0.00011518585,0.004201904,0.000121736,0.00019202671,0.0017950836,0.00024312234,0.000011935755],"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.00010744051,0.0012687327,0.63790154,0.0007762903,0.0001266048,0.0000144410515,0.042258546,0.019170461,0.0063242675,0.2665857,0.00108134,0.024384635],"study_design_scores_gemma":[0.002653453,0.000072019066,0.023030248,0.0003348141,0.000007319368,0.0000051188094,0.00016779684,0.92300385,0.008998178,0.041115507,0.00023070535,0.00038100206],"about_ca_topic_score_codex":0.000021229293,"about_ca_topic_score_gemma":0.000012131031,"teacher_disagreement_score":0.9038334,"about_ca_system_score_codex":0.00013684426,"about_ca_system_score_gemma":0.000103083185,"threshold_uncertainty_score":0.7848761},"labels":[],"label_agreement":null},{"id":"W4387101675","doi":"10.1017/s0963548323000275","title":"The Excluded Tree Minor Theorem Revisited","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Minor (academic); Combinatorics; Mathematics; Robertson–Seymour theorem; Graph minor; Discrete mathematics; Graph; Upper and lower bounds; Tree (set theory); RADIUS; Pathwidth; Line graph; Computer science; Graph power; Law; Mathematical analysis","score_opus":0.039797771614092606,"score_gpt":0.30333307116574887,"score_spread":0.2635352995516563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387101675","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.57299536,0.0011342801,0.39350343,0.00638315,0.003003493,0.002815102,0.000004681942,0.0051430995,0.015017429],"genre_scores_gemma":[0.9950553,0.00003410738,0.0041442253,0.00007441372,0.000068949914,0.000027658567,0.0000046794935,0.000027614811,0.000563044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959488,0.00077161036,0.0005633752,0.000874504,0.0008049975,0.0010367144],"domain_scores_gemma":[0.9936701,0.003294396,0.00019246027,0.0021800755,0.00045872983,0.00020426039],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0057664276,0.0002735893,0.000308232,0.00019586207,0.0014511369,0.00046055837,0.0034529811,0.00009825653,0.0000025549143],"category_scores_gemma":[0.0021626102,0.00020697806,0.00017955816,0.0045382795,0.00035291616,0.00033754297,0.0024266185,0.0005516963,0.00018823537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652026,0.00006019693,0.002430325,0.00004297485,0.000016427666,0.000013408008,0.00039548252,0.00015518178,0.0001335686,0.94884247,0.00071274024,0.047187556],"study_design_scores_gemma":[0.00035299352,0.0000778931,0.0057115383,0.00002878879,0.0000030290964,0.00000744624,0.00004405258,0.09975204,0.00044258867,0.8905907,0.0027535253,0.0002353939],"about_ca_topic_score_codex":0.000003209346,"about_ca_topic_score_gemma":0.0000020863765,"teacher_disagreement_score":0.42205998,"about_ca_system_score_codex":0.00020704941,"about_ca_system_score_gemma":0.00012343674,"threshold_uncertainty_score":0.99984884},"labels":[],"label_agreement":null},{"id":"W4393989900","doi":"10.1017/s0963548324000087","title":"Algorithms for the ferromagnetic Potts model on expanders","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","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":"Potts model; Ferromagnetism; Chiral Potts curve; Condensed matter physics; Physics; Ising model","score_opus":0.03536160677643764,"score_gpt":0.2918236170857931,"score_spread":0.25646201030935545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393989900","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.12254073,0.0001543904,0.8706339,0.0011244763,0.00087190256,0.0006796283,0.000021339782,0.00017023353,0.0038033726],"genre_scores_gemma":[0.9980114,3.6291527e-7,0.0014245145,0.00007791618,0.00027014187,0.000042352443,0.000015707254,0.000023956427,0.00013362539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988213,0.000038349765,0.00023607966,0.0003873649,0.00022714846,0.00028976874],"domain_scores_gemma":[0.99832743,0.0011898878,0.00003782504,0.00026210747,0.00011482484,0.00006790148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034792264,0.0001831724,0.00015715795,0.000026174288,0.0003295125,0.00016206526,0.0002815902,0.000031867137,0.000013606988],"category_scores_gemma":[0.000021754442,0.0001320995,0.0001877571,0.00023753062,0.00011052122,0.00005713051,0.00010858295,0.0002468928,0.00002123253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069144426,0.00013186331,0.00005995003,0.000041728752,0.000033161145,2.1473736e-7,0.00022425537,0.10023437,0.000007131812,0.84880763,0.0002252347,0.05022753],"study_design_scores_gemma":[0.00012427349,0.000051320076,0.000056661564,0.000020504198,0.000015672307,1.5493758e-7,0.000028431426,0.49096137,0.000064786684,0.5084839,0.000106468186,0.000086451415],"about_ca_topic_score_codex":0.000006069843,"about_ca_topic_score_gemma":5.991639e-8,"teacher_disagreement_score":0.8754707,"about_ca_system_score_codex":0.000057936144,"about_ca_system_score_gemma":0.00009396031,"threshold_uncertainty_score":0.53868616},"labels":[],"label_agreement":null},{"id":"W4394647973","doi":"10.1017/s0963548325000100","title":"On the size of temporal cliques in subcritical random temporal graphs","year":2025,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"McGill University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Banco Bilbao Vizcaya Argentaria; Ministerio de Economía y Competitividad; Fundación BBVA","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.03185927900268365,"score_gpt":0.32426746321180594,"score_spread":0.2924081842091223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394647973","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.9818783,0.00022912367,0.0020908113,0.0047227843,0.0008521992,0.0018892464,0.00002348772,0.00015529855,0.008158751],"genre_scores_gemma":[0.9992902,0.000021128657,0.00027476953,0.00017305154,0.00006232195,0.000050478367,0.000022590397,0.000010577249,0.0000948393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933543,0.0032756757,0.0012391704,0.00081698527,0.0008186327,0.000495226],"domain_scores_gemma":[0.9881874,0.009591465,0.00040820253,0.0009942866,0.00069824734,0.00012040949],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010905222,0.00033250975,0.0008996163,0.0002293601,0.00063724385,0.00014384142,0.0012121986,0.0004975006,0.00006738195],"category_scores_gemma":[0.011868733,0.00029105254,0.00051853067,0.0012286016,0.0011155386,0.000054581444,0.0006222953,0.0014721229,0.000002805802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00007532368,0.0010480756,0.13875909,0.0006138928,0.00005973833,0.0000026523444,0.006751721,0.0015666002,8.974334e-7,0.84972745,0.00014281135,0.00125177],"study_design_scores_gemma":[0.00056571193,0.00005388333,0.005252582,0.0005167696,0.0000523652,4.6819103e-8,0.0008840759,0.007028028,0.000030675026,0.98518884,0.00015083354,0.0002762047],"about_ca_topic_score_codex":0.015706068,"about_ca_topic_score_gemma":0.0057835802,"teacher_disagreement_score":0.13546139,"about_ca_system_score_codex":0.0006344469,"about_ca_system_score_gemma":0.0016044908,"threshold_uncertainty_score":0.99995416},"labels":[],"label_agreement":null},{"id":"W4402616002","doi":"10.1017/s0963548324000233","title":"A new formula for the determinant and bounds on its tensor and Waring ranks","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Tensor decomposition and applications","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":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Mathematics; Mathematical economics; Algebra over a field; Pure mathematics; Statistics","score_opus":0.08689395350699279,"score_gpt":0.34970296613357243,"score_spread":0.26280901262657963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402616002","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.87100816,0.0011081473,0.122113146,0.0027221788,0.00043714265,0.0017715625,0.0000088773395,0.00036463886,0.00046616915],"genre_scores_gemma":[0.98972976,0.000016286844,0.009821712,0.000068758956,0.00007590557,0.000039330484,0.0000012298644,0.000024070805,0.00022297127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989804,0.00002933629,0.00028492484,0.00035748794,0.00012770144,0.00022015293],"domain_scores_gemma":[0.9971058,0.0023834524,0.000058445752,0.00028168698,0.00008127029,0.00008939546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924472,0.00015492148,0.00018917845,0.000045641475,0.0004662533,0.00025847575,0.00014355469,0.00006739456,0.0000027434398],"category_scores_gemma":[0.00031358903,0.00011195016,0.00006739941,0.00017035323,0.000047748395,0.00006576085,0.00013695892,0.00020447373,0.000002750951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010551476,0.000062013685,0.00018678849,0.0004966394,0.000024661886,0.0000011401248,0.0008417969,0.000010115846,0.0001701416,0.95625067,0.00061641756,0.04132906],"study_design_scores_gemma":[0.00045194107,0.00009410954,0.0010902475,0.00015453322,0.000059748592,0.000030460067,0.000043932934,0.121305756,0.00047449706,0.8718238,0.0043068076,0.00016416666],"about_ca_topic_score_codex":0.0000043135674,"about_ca_topic_score_gemma":0.0000021203218,"teacher_disagreement_score":0.121295646,"about_ca_system_score_codex":0.00006745325,"about_ca_system_score_gemma":0.000040084473,"threshold_uncertainty_score":0.4565195},"labels":[],"label_agreement":null},{"id":"W4402687120","doi":"10.1017/s096354832400021x","title":"The full rank condition for sparse random matrices","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Random Matrices and Applications","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":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft","keywords":"Rank (graph theory); Mathematics; Statistics; Combinatorics","score_opus":0.04308626993844079,"score_gpt":0.3308651380438634,"score_spread":0.28777886810542264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402687120","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.53077006,0.0045575425,0.44892022,0.0034568359,0.0023113352,0.005675119,0.00004388036,0.0012661414,0.0029988675],"genre_scores_gemma":[0.9935954,0.00005829061,0.005624059,0.0000145762915,0.00023815219,0.0002102486,0.000014075924,0.00003571655,0.00020943607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983106,0.00011193408,0.0005906416,0.00039409724,0.00024455084,0.00034814345],"domain_scores_gemma":[0.9914655,0.0076228594,0.00016057912,0.00046172418,0.0002200949,0.000069241716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024634327,0.00018911585,0.00027953123,0.000056266854,0.00083600753,0.0004239642,0.0003649404,0.00008735504,0.000007395858],"category_scores_gemma":[0.0008572148,0.00013423942,0.00023382949,0.0005208408,0.000093881645,0.00011058968,0.00010507528,0.00021605332,0.000023944322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006795761,0.00011551305,0.00004127414,0.00075012224,0.00004865744,9.3530736e-7,0.00027621345,0.00007923576,0.000058184298,0.9854566,0.0064865407,0.0066187703],"study_design_scores_gemma":[0.0014299329,0.00005042313,0.000019470614,0.00008614494,0.000076696735,0.000008005584,0.000058680922,0.071061045,0.00012372527,0.90285516,0.024070274,0.00016041344],"about_ca_topic_score_codex":0.000005084998,"about_ca_topic_score_gemma":0.0000037448515,"teacher_disagreement_score":0.4628254,"about_ca_system_score_codex":0.00012608679,"about_ca_system_score_gemma":0.00007750418,"threshold_uncertainty_score":0.64299786},"labels":[],"label_agreement":null},{"id":"W4403475401","doi":"10.1017/s0963548324000300","title":"Embedding theorems for random graphs with specified degrees","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Embedding; Mathematics; Random graph; Discrete mathematics; Combinatorics; Computer science; Graph; Artificial intelligence","score_opus":0.048649579879659344,"score_gpt":0.31920845635587564,"score_spread":0.2705588764762163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403475401","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.8139531,0.00071002485,0.17692499,0.000121061064,0.0020132945,0.0015826621,0.000010700577,0.0008028165,0.003881349],"genre_scores_gemma":[0.9709492,0.0000060856864,0.028699303,0.000018690573,0.00015140646,0.000032095,0.0000052736036,0.00006824917,0.00006970966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978588,0.00015833003,0.00051268283,0.00063566683,0.0003370347,0.00049744826],"domain_scores_gemma":[0.9951836,0.0038011696,0.000091224014,0.0005932498,0.00022493688,0.00010585306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020847602,0.00033689552,0.0004885435,0.00015219336,0.0006170253,0.00021206622,0.000426082,0.00013974219,0.000011854468],"category_scores_gemma":[0.00070797384,0.00024084395,0.00026904882,0.00052543,0.0002384747,0.00013014165,0.00021349185,0.00037701783,0.0000014010243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014424743,0.00008440666,0.0004334297,0.00090904,0.00012033851,0.000007729483,0.0016961646,0.00023117369,0.000026793197,0.9916471,0.00025404716,0.004445486],"study_design_scores_gemma":[0.00092242326,0.0001541454,0.00009783027,0.0002662224,0.00008271063,0.000023957524,0.00012759544,0.035942804,0.00036570698,0.9611226,0.0005608774,0.0003331666],"about_ca_topic_score_codex":0.0000019906795,"about_ca_topic_score_gemma":0.0000017358251,"teacher_disagreement_score":0.15699609,"about_ca_system_score_codex":0.000120258126,"about_ca_system_score_gemma":0.00006253808,"threshold_uncertainty_score":0.9821331},"labels":[],"label_agreement":null},{"id":"W4404160237","doi":"10.1017/s0963548324000270","title":"Expansion of the critical intensity for the random connection model","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","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":"Deutsche Forschungsgemeinschaft","keywords":"Connection (principal bundle); Intensity (physics); Statistical physics; Mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.07982986471347835,"score_gpt":0.34560669428142493,"score_spread":0.26577682956794657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404160237","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.027905764,0.00023560232,0.968082,0.00101738,0.0017893525,0.00078488106,0.0000130671715,0.00010035708,0.00007160984],"genre_scores_gemma":[0.98671055,0.0000022736047,0.013133349,0.000044580014,0.000051653744,0.0000233123,6.892382e-7,0.000017104065,0.000016462782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875516,0.000059398233,0.00042001696,0.0002786247,0.0002687623,0.00021804305],"domain_scores_gemma":[0.98831064,0.010659776,0.000071157905,0.00037881313,0.0005386368,0.000040995714],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001448337,0.00013316779,0.0002672123,0.000020455762,0.0003348019,0.00005446965,0.0002840919,0.00008339908,0.0000025969512],"category_scores_gemma":[0.016188022,0.00007568892,0.00016728636,0.00027629756,0.00014636987,0.000043641885,0.00022491573,0.00027549345,7.9050545e-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.00004473992,0.00007152233,0.0000061399473,0.0010390402,0.000018761168,2.6008007e-7,0.00041429006,0.0005987501,0.000088299574,0.9949174,0.0002897522,0.002511034],"study_design_scores_gemma":[0.0001682036,0.000033882763,0.0000048855622,0.00010614133,0.000054493128,0.0000034543732,0.000041450643,0.49187857,0.0004426841,0.5072076,0.000012291302,0.000046381996],"about_ca_topic_score_codex":0.0000041979265,"about_ca_topic_score_gemma":0.0000011698442,"teacher_disagreement_score":0.9588048,"about_ca_system_score_codex":0.00008860911,"about_ca_system_score_gemma":0.00012881412,"threshold_uncertainty_score":0.99209905},"labels":[],"label_agreement":null},{"id":"W4405231961","doi":"10.1017/s0963548324000415","title":"Tight bound for the Erdős–Pósa property of tree minors","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; University of Ottawa","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Minor (academic); Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics; Integer (computer science); Pairwise comparison; Computer science; Statistics","score_opus":0.043453593176519964,"score_gpt":0.3042557150052427,"score_spread":0.2608021218287227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231961","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.050597858,0.0024692349,0.9387618,0.0019593555,0.0019662639,0.0018889479,0.000005335349,0.0004525721,0.0018986873],"genre_scores_gemma":[0.9823351,0.000010778688,0.017073886,0.000035137004,0.00007008469,0.00005178588,0.0000017190683,0.000024552122,0.0003969827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997429,0.00021212432,0.0005165519,0.0007488333,0.00052462105,0.0005688314],"domain_scores_gemma":[0.9953952,0.0027063051,0.00011116259,0.0012453862,0.000436475,0.00010550085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027998388,0.00022846927,0.00030138835,0.00014125279,0.00044131928,0.00030213085,0.002117881,0.00008657003,0.0000036010858],"category_scores_gemma":[0.00069111004,0.000134934,0.00023035245,0.0015142537,0.00036072824,0.00037055823,0.00093799975,0.00039113636,0.000009510112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001306522,0.00014190964,0.00053406117,0.0005045357,0.000048175512,0.0000038209946,0.0010446332,0.00030644514,0.00032303765,0.89668304,0.0003613777,0.10003592],"study_design_scores_gemma":[0.00023016035,0.00016772725,0.0003741757,0.00007852906,0.0000116336705,0.000007943224,0.000027768285,0.30260736,0.0023265886,0.68770534,0.0062904907,0.0001722699],"about_ca_topic_score_codex":0.000015164133,"about_ca_topic_score_gemma":0.0000052818837,"teacher_disagreement_score":0.93173724,"about_ca_system_score_codex":0.00019241251,"about_ca_system_score_gemma":0.00029482468,"threshold_uncertainty_score":0.5502449},"labels":[],"label_agreement":null},{"id":"W4405231962","doi":"10.1017/s0963548324000439","title":"Twin-width of sparse random graphs","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Random graph; Vertex (graph theory); Graph; Upper and lower bounds; Integer (computer science); Random regular graph; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.0403164595525289,"score_gpt":0.2983269296256195,"score_spread":0.25801047007309064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231962","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.9796696,0.0011442758,0.009621785,0.00007943175,0.0026080713,0.00058054965,0.000007158336,0.00043118847,0.0058579785],"genre_scores_gemma":[0.99346447,0.000011651045,0.0063307863,0.000022201031,0.000065303924,0.000004851037,0.00000235444,0.00003710755,0.000061245504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978144,0.00024166521,0.00072912243,0.00046734302,0.00038996837,0.0003574975],"domain_scores_gemma":[0.996651,0.0022135365,0.00015853673,0.00068658305,0.00019560574,0.00009473905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095912,0.0002562568,0.00052009063,0.00017734444,0.00023281673,0.000060054925,0.0004399438,0.00014325435,0.00003166971],"category_scores_gemma":[0.0011339963,0.00021381125,0.00032505472,0.00076277455,0.00024509136,0.0000964528,0.00038800438,0.0004062051,0.0000037125121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908668,0.00014151249,0.0025569296,0.0011947465,0.00008227693,0.000009228606,0.0016413119,0.000031606152,0.00006130908,0.9891951,0.00043206915,0.0046289703],"study_design_scores_gemma":[0.000624543,0.000072566465,0.0004041042,0.000216583,0.0000633141,0.000013149633,0.000038520433,0.004504204,0.0008581694,0.9924625,0.00052074733,0.00022158847],"about_ca_topic_score_codex":0.0000069089765,"about_ca_topic_score_gemma":8.506397e-7,"teacher_disagreement_score":0.013794938,"about_ca_system_score_codex":0.00008145282,"about_ca_system_score_gemma":0.00007277934,"threshold_uncertainty_score":0.871897},"labels":[],"label_agreement":null},{"id":"W4410902982","doi":"10.1017/s0963548325000057","title":"Tight Hamilton cycles with high discrepancy","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University College London; Universität Passau","keywords":"Hypergraph; Combinatorics; Mathematics; Omega; Degree (music); Vertex (graph theory); Discrete mathematics; Probabilistic logic; Hamiltonian path; Probabilistic method; Graph; Physics","score_opus":0.019131648080465344,"score_gpt":0.28234206316745997,"score_spread":0.2632104150869946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410902982","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.9736651,0.0001525592,0.012192963,0.00019395373,0.00090227055,0.0005437861,0.0000031068723,0.000364011,0.011982231],"genre_scores_gemma":[0.98283947,0.0000046083906,0.016677884,0.00007949186,0.000046916804,0.000009770212,0.0000037875257,0.000025678468,0.00031239647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807376,0.00018833399,0.000479618,0.0005402623,0.00030269814,0.00041532537],"domain_scores_gemma":[0.997733,0.0008760549,0.00018145179,0.0009088545,0.00022257502,0.00007806861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007574671,0.00029115856,0.000441309,0.000120154255,0.000674528,0.00007168836,0.0004999991,0.00013680838,0.000012071841],"category_scores_gemma":[0.00042229542,0.00021926842,0.00010964333,0.00064435415,0.00023376115,0.00009282102,0.00037562932,0.00038252593,0.000001842191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002802742,0.000202446,0.020421803,0.00036125537,0.00006572408,0.0000047594713,0.00069258065,0.000023055962,0.000009937006,0.9762611,0.00020253194,0.0017267752],"study_design_scores_gemma":[0.00063888956,0.00007699424,0.010711261,0.00019115192,0.000054030097,0.0000046572195,0.00005530823,0.0005139838,0.00068877195,0.98629624,0.0005083882,0.00026033053],"about_ca_topic_score_codex":0.000019240444,"about_ca_topic_score_gemma":0.0000076095503,"teacher_disagreement_score":0.011669835,"about_ca_system_score_codex":0.00016090815,"about_ca_system_score_gemma":0.00007525771,"threshold_uncertainty_score":0.8941506},"labels":[],"label_agreement":null},{"id":"W4411837996","doi":"10.1017/s0963548325000094","title":"Common pairs of graphs","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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; Computer science","score_opus":0.028797372974541352,"score_gpt":0.3041248824459258,"score_spread":0.2753275094713844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411837996","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.97765005,0.00019422032,0.0034315437,0.00008537446,0.0010342537,0.00039823086,0.000002542581,0.00016905034,0.01703475],"genre_scores_gemma":[0.9955132,0.000003505231,0.0043418575,0.00004885517,0.000011487499,0.000003429483,0.000001454497,0.000013022085,0.000063183645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.00023421168,0.0006535238,0.0003132767,0.00023398611,0.00027597402],"domain_scores_gemma":[0.99734604,0.0013693548,0.0002368298,0.00076514244,0.00023262514,0.000049990547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470369,0.00019019256,0.0004703221,0.00015917214,0.0003206698,0.000017778211,0.0005025906,0.00013336333,0.000008981004],"category_scores_gemma":[0.00092168804,0.00017307929,0.00019728298,0.0007673593,0.00024170017,0.000046614172,0.00053086056,0.00029810486,4.738913e-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.00001188407,0.00021072025,0.061483994,0.0005703468,0.000046650854,8.8369455e-7,0.00043371366,0.000016485452,0.000029447066,0.9337498,0.0003244939,0.003121558],"study_design_scores_gemma":[0.00039219373,0.00004824817,0.0070760367,0.00012141468,0.000035725974,0.0000014006228,0.000068047724,0.0007693741,0.0010589636,0.9901327,0.00015268677,0.00014320659],"about_ca_topic_score_codex":0.000009926342,"about_ca_topic_score_gemma":0.00000238479,"teacher_disagreement_score":0.05638288,"about_ca_system_score_codex":0.000076695964,"about_ca_system_score_gemma":0.000052612293,"threshold_uncertainty_score":0.70579684},"labels":[],"label_agreement":null},{"id":"W4415569780","doi":"10.1017/s0963548325100205","title":"Disperse hypergraphs","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","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":"Hypergraph; Set (abstract data type); Independent set; Clique; Set theory","score_opus":0.02924122589144217,"score_gpt":0.315248863617299,"score_spread":0.2860076377258568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415569780","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.9516793,0.0002102668,0.008316553,0.00022323981,0.0019389855,0.0004431319,0.0000018737023,0.00036698053,0.03681966],"genre_scores_gemma":[0.9940817,0.0000042182614,0.005405572,0.00014099418,0.00003887929,0.000005889433,0.0000014453267,0.000016889504,0.00030446373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983165,0.00017809725,0.0004648856,0.00044015725,0.00022585141,0.00037448062],"domain_scores_gemma":[0.9979045,0.00092548924,0.00011625727,0.00078932877,0.0001897741,0.00007467156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100653,0.00022673316,0.00034863132,0.00014527605,0.000636611,0.000049495997,0.00050246966,0.00013715932,0.00001684556],"category_scores_gemma":[0.001327356,0.00020127706,0.0001905796,0.000758021,0.00019223736,0.0000672216,0.0005635682,0.0003509608,0.0000029479295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009247288,0.00017048989,0.01846005,0.00022335853,0.000040964813,0.000002131215,0.00045275604,0.000010619002,0.000023536584,0.9764069,0.0007053456,0.0034946285],"study_design_scores_gemma":[0.00041298065,0.000026517293,0.0031960765,0.00006746547,0.000033888333,0.0000027926512,0.00007789308,0.0010665708,0.00025023895,0.99351305,0.0011560033,0.00019655128],"about_ca_topic_score_codex":0.0000062748795,"about_ca_topic_score_gemma":0.000001814802,"teacher_disagreement_score":0.04240234,"about_ca_system_score_codex":0.00012524863,"about_ca_system_score_gemma":0.000058199337,"threshold_uncertainty_score":0.82078403},"labels":[],"label_agreement":null},{"id":"W4417182444","doi":"10.1017/s0963548325100242","title":"Sidorenko’s conjecture for subdivisions and theta substitutions","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"semigroups and automata theory","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Bipartite graph; Conjecture; Line graph; Graph; Graph minor; Edge-transitive graph; Voltage graph; Homomorphism; 1-planar graph","score_opus":0.012298313793150262,"score_gpt":0.26165046518098756,"score_spread":0.24935215138783728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417182444","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.16714594,0.0006951703,0.82614154,0.0021470783,0.0011181951,0.00068824546,0.0000061109386,0.00045293197,0.001604779],"genre_scores_gemma":[0.9839961,0.0000069407547,0.015602698,0.00021586988,0.000024103405,0.000019628042,0.0000051441016,0.000006752919,0.00012277187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846554,0.00010116144,0.00032972323,0.0006075415,0.0001383799,0.00035767385],"domain_scores_gemma":[0.9978685,0.0010240265,0.00009309038,0.0007484806,0.00017746071,0.00008847983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009597792,0.00019245055,0.00026683565,0.00012007256,0.0006890335,0.00024489284,0.0007934242,0.00010676378,0.0000013323933],"category_scores_gemma":[0.00047189268,0.00017660714,0.000098991586,0.0006707973,0.00015734993,0.00020855917,0.0007221128,0.00020391628,0.000002093756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020209382,0.00010599558,0.002059389,0.000085607164,0.00001617457,8.640977e-7,0.00023175373,0.00011539697,0.000059573966,0.9853548,0.0002948374,0.011673628],"study_design_scores_gemma":[0.00048716576,0.00004720895,0.003936662,0.00005989702,0.000013407887,0.0000054438997,0.000019790594,0.11348839,0.00041755498,0.8785575,0.0027919116,0.00017505712],"about_ca_topic_score_codex":0.000009960227,"about_ca_topic_score_gemma":0.0000028938673,"teacher_disagreement_score":0.8168501,"about_ca_system_score_codex":0.000095041665,"about_ca_system_score_gemma":0.00015405109,"threshold_uncertainty_score":0.72018296},"labels":[],"label_agreement":null}]}