{"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372454,0.00026122082,0.049782358,0.000507315,0.000013955093,0.000027570415,0.00012890158,0.00014474672,0.011888501],"genre_scores_gemma":[0.9937616,0.00008506977,0.004067947,0.00004314363,0.000012195685,0.000027517284,0.00010529628,0.000018686847,0.0018786665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996594,0.000089671616,0.000012025387,0.000063904525,0.00009878056,0.00007613613],"domain_scores_gemma":[0.99779874,0.0010035407,0.00038661037,0.00014507005,0.00031140298,0.00035465762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063863577,0.00033260268,0.0004936688,0.0019360165,0.0010502638,0.0015556751,0.0009987454,0.0009375947,0.0023071745],"category_scores_gemma":[0.005233946,0.0003871154,0.00035483175,0.0007577412,0.0017489267,0.0015230334,0.0011762617,0.0008309231,0.00041720303],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002135332,0.00006603466,0.0043958817,0.00008194323,0.00002287241,0.00059695024,0.0006547093,0.0927225,0.007113896,0.8869681,0.0014956412,0.005667896],"study_design_scores_gemma":[0.000051229872,0.000045049062,0.0021066675,0.000022380375,0.00001728699,0.0003415512,0.0002234086,0.4677503,0.0028237144,0.5255,0.0010779992,0.000040414314],"about_ca_topic_score_codex":0.0026437957,"about_ca_topic_score_gemma":0.0024160428,"teacher_disagreement_score":0.0026437957,"about_ca_system_score_codex":0.0012505273,"about_ca_system_score_gemma":0.00040201933,"threshold_uncertainty_score":0.009073198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033608,0.0011040553,0.051918846,0.0021186431,0.00006457295,0.000020381662,0.00023695907,0.00023454196,0.040941153],"genre_scores_gemma":[0.99303997,0.00015609707,0.003350741,0.00012050898,0.000095619085,0.00002551955,0.00006859052,0.000032684573,0.003110277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993882,0.0001558604,0.00003128507,0.00013480644,0.0001405594,0.00014924206],"domain_scores_gemma":[0.9964893,0.0022998268,0.00037702196,0.00025070878,0.00021326052,0.00036989228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732871,0.00034006865,0.0007359809,0.0013702445,0.0013683635,0.002161438,0.00081423356,0.0008102765,0.0051544127],"category_scores_gemma":[0.008095798,0.0004159392,0.0004888568,0.00094008044,0.0027613202,0.004500095,0.001738846,0.001443081,0.00052219693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029488653,0.000054053766,0.002200064,0.00019849224,0.000026720201,0.00028875328,0.0006602918,0.007239374,0.006995251,0.9630193,0.0027949945,0.016227826],"study_design_scores_gemma":[0.000031441894,0.00004580016,0.0017278702,0.000026440168,0.000016678008,0.00023716562,0.00017791298,0.021340184,0.0023683677,0.971854,0.0021508809,0.000023430699],"about_ca_topic_score_codex":0.00047961783,"about_ca_topic_score_gemma":0.0005838286,"teacher_disagreement_score":0.0051544127,"about_ca_system_score_codex":0.0011851698,"about_ca_system_score_gemma":0.00025248723,"threshold_uncertainty_score":0.017243207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86783755,0.0011363451,0.098468564,0.0014234452,0.000071064795,0.00010555322,0.0005458458,0.00072743144,0.029684149],"genre_scores_gemma":[0.987633,0.0003574193,0.009043448,0.00018982444,0.00007283278,0.00012549071,0.0002971664,0.00011382261,0.0021668554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827266,0.00039452367,0.00009515087,0.00044833648,0.00032628715,0.00046298173],"domain_scores_gemma":[0.9735807,0.016954416,0.0030023588,0.0019072882,0.0010602818,0.0034948934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022230716,0.00051982614,0.0010192833,0.0020369687,0.0010282716,0.0033135656,0.0012749734,0.0014687651,0.0050068004],"category_scores_gemma":[0.026194926,0.00071664643,0.00053023454,0.00097634766,0.0025718291,0.0044713253,0.0019036018,0.0015220431,0.00047705421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007118007,0.00021620266,0.013047116,0.0002726474,0.00007261626,0.00049977703,0.00091102783,0.040263213,0.016092986,0.8941074,0.005918075,0.02788714],"study_design_scores_gemma":[0.000121850244,0.00017393309,0.006893892,0.00009126649,0.00005411818,0.0006552176,0.00043186726,0.15020488,0.007531195,0.8294091,0.0043434263,0.000089243666],"about_ca_topic_score_codex":0.001093281,"about_ca_topic_score_gemma":0.0006968327,"teacher_disagreement_score":0.0050068004,"about_ca_system_score_codex":0.0022411325,"about_ca_system_score_gemma":0.000521966,"threshold_uncertainty_score":0.016749382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8972751,0.00036012506,0.07428471,0.0003082696,0.000030447989,0.000019367953,0.00025397938,0.00027177104,0.02719616],"genre_scores_gemma":[0.9932094,0.00011976666,0.004112476,0.000051438637,0.000033609205,0.000032624062,0.00015029813,0.000041427214,0.0022489824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968433,0.000059906815,0.000009590347,0.000059731792,0.00010329256,0.0000832157],"domain_scores_gemma":[0.99909055,0.00039614912,0.00015185744,0.0000940275,0.00011180705,0.00015563575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794072,0.00031284775,0.00034780707,0.001917906,0.0005850167,0.0008074267,0.0004144344,0.00033710257,0.004129106],"category_scores_gemma":[0.0019546174,0.00019897906,0.0001691001,0.00081249786,0.00101139,0.0008650318,0.00085887156,0.00045411676,0.00047976052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038142267,0.00008093275,0.00397239,0.00012292001,0.000033038574,0.00034221384,0.0006332865,0.032374363,0.028054204,0.8909586,0.004715816,0.038330782],"study_design_scores_gemma":[0.000024895553,0.000027823367,0.003630234,0.000018588064,0.0000072196917,0.00016075608,0.00020303845,0.104466744,0.004177085,0.8846129,0.0026508789,0.000019820054],"about_ca_topic_score_codex":0.00052957464,"about_ca_topic_score_gemma":0.0004366452,"teacher_disagreement_score":0.004129106,"about_ca_system_score_codex":0.0005020081,"about_ca_system_score_gemma":0.0001852547,"threshold_uncertainty_score":0.013813257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20753598,0.002881481,0.760775,0.0009666538,0.00012908946,0.00006386407,0.00025774716,0.00030724867,0.027082967],"genre_scores_gemma":[0.94628334,0.0021926595,0.039528616,0.00018350373,0.000264502,0.00015168184,0.000315493,0.00024552655,0.010834622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985043,0.0004574158,0.00007333706,0.00022492283,0.00050471764,0.00023540528],"domain_scores_gemma":[0.99293137,0.004264341,0.0008753946,0.00064737425,0.0007916326,0.00048981706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035063867,0.0006168325,0.0011480832,0.002615098,0.0010066552,0.003499311,0.0013089472,0.0012591394,0.0029368026],"category_scores_gemma":[0.023116522,0.00063215045,0.0008818498,0.002053251,0.0029484665,0.00648253,0.0018965635,0.0018586383,0.0008697622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017240916,0.00001117271,0.0006277405,0.000029263418,0.00001357575,0.00006049757,0.00011733096,0.02668284,0.0007389459,0.9663798,0.0005282673,0.0047932514],"study_design_scores_gemma":[0.000005947901,0.000017965647,0.00053354236,0.000022283699,0.000008529064,0.000069676185,0.000032124444,0.18326324,0.00033257506,0.8146525,0.0010379218,0.000023725104],"about_ca_topic_score_codex":0.0011443099,"about_ca_topic_score_gemma":0.0010113188,"teacher_disagreement_score":0.0035063867,"about_ca_system_score_codex":0.0017260925,"about_ca_system_score_gemma":0.0010904351,"threshold_uncertainty_score":0.01854378},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66604686,0.0019648483,0.30285734,0.003178336,0.0002901037,0.00006993836,0.00043846457,0.0004764952,0.024677515],"genre_scores_gemma":[0.98601335,0.00079386495,0.008850573,0.00017961198,0.00020831818,0.00007292042,0.00014248806,0.00007371732,0.0036653075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909544,0.00040056912,0.00002320702,0.00018539526,0.00013467355,0.00016063562],"domain_scores_gemma":[0.9947706,0.0028901154,0.0009828833,0.00042357933,0.0003423488,0.0005905075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011928856,0.0007979403,0.001068546,0.0013729394,0.0011156953,0.0015245178,0.001748832,0.001571903,0.00251898],"category_scores_gemma":[0.007196738,0.0005947732,0.00073253893,0.0008982337,0.0023527842,0.0036026358,0.0015673895,0.0012806254,0.00043821472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002082175,0.000052695712,0.0013280609,0.00008827262,0.000057788384,0.0006272185,0.0002522221,0.21716182,0.003976227,0.76941895,0.004220601,0.0026079034],"study_design_scores_gemma":[0.000048023976,0.000088749184,0.0005786313,0.000015914646,0.000029758881,0.00038816067,0.00010123989,0.7725496,0.00068772974,0.2231891,0.002294159,0.000028911816],"about_ca_topic_score_codex":0.0016671378,"about_ca_topic_score_gemma":0.0010309706,"teacher_disagreement_score":0.00251898,"about_ca_system_score_codex":0.0015470919,"about_ca_system_score_gemma":0.000405035,"threshold_uncertainty_score":0.011225045},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608509,0.005160426,0.48318118,0.007776014,0.00087573647,0.00035063832,0.0018303806,0.0016914787,0.23828319],"genre_scores_gemma":[0.89854944,0.0036173244,0.070498355,0.0010885692,0.0009057146,0.0006448266,0.0014083597,0.0011060955,0.022181382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961628,0.00062067725,0.00012980818,0.000981848,0.00072649214,0.0013783991],"domain_scores_gemma":[0.97704005,0.015682511,0.0014767761,0.0028380547,0.0009838585,0.001978804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443523,0.0021211335,0.0024451877,0.0029136243,0.0030591849,0.0055467417,0.005011554,0.002857913,0.017952215],"category_scores_gemma":[0.024161996,0.0012406205,0.0024257738,0.002374635,0.0052243047,0.015304529,0.004667162,0.006976787,0.0028363694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014164025,0.0004286306,0.0046014986,0.00070488645,0.0002115692,0.00092904334,0.00059071305,0.14718641,0.010998516,0.7621681,0.028071217,0.042692993],"study_design_scores_gemma":[0.00010599472,0.0001981281,0.0014312755,0.00016155609,0.00011935187,0.0007017583,0.00018509977,0.35485893,0.009537738,0.6201557,0.012404504,0.00013998685],"about_ca_topic_score_codex":0.0024170028,"about_ca_topic_score_gemma":0.0025889925,"teacher_disagreement_score":0.017952215,"about_ca_system_score_codex":0.0040121656,"about_ca_system_score_gemma":0.0016528717,"threshold_uncertainty_score":0.06005609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32630238,0.010854557,0.23777147,0.18166882,0.0029717477,0.000051642877,0.00080018106,0.0012158199,0.23836343],"genre_scores_gemma":[0.9430269,0.0038522684,0.020921765,0.007303485,0.0029492965,0.000073568684,0.00033550226,0.0003902666,0.021146968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0006589559,0.000065748165,0.00044922277,0.00049180194,0.0002549732],"domain_scores_gemma":[0.9885998,0.008778317,0.00050231646,0.00086285226,0.0007472173,0.0005096495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022794944,0.0005263516,0.0016009558,0.0016366115,0.003400915,0.005220217,0.0014950709,0.0036932603,0.009299529],"category_scores_gemma":[0.025273263,0.0005803248,0.0009239611,0.0024261673,0.010998352,0.01439741,0.0050918525,0.0069157975,0.0018093867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098057826,0.000018348472,0.00045215542,0.000053576012,0.000007879216,0.00006876416,0.00043640044,0.0011739333,0.00036934006,0.9794448,0.008888864,0.008987889],"study_design_scores_gemma":[0.00001528434,0.000013345332,0.0001743594,0.00001763951,0.000004076883,0.00008892541,0.00022441098,0.0009263788,0.00020156185,0.989546,0.008778176,0.0000098818255],"about_ca_topic_score_codex":0.0018155678,"about_ca_topic_score_gemma":0.00071491493,"teacher_disagreement_score":0.009299529,"about_ca_system_score_codex":0.0023251306,"about_ca_system_score_gemma":0.0008332442,"threshold_uncertainty_score":0.031109989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6347346,0.0032807563,0.19332457,0.0051339976,0.00034532184,0.00007548492,0.0003671024,0.0006017757,0.16213648],"genre_scores_gemma":[0.96552414,0.0010571016,0.020650305,0.0004046878,0.0002362381,0.000068822745,0.00019862893,0.000059576974,0.011800516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894315,0.00030364562,0.00006834414,0.00022371771,0.0003017286,0.00015934605],"domain_scores_gemma":[0.9961302,0.0021673637,0.00036098828,0.00052982476,0.00041848308,0.00039308608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018863021,0.0003431781,0.0005268232,0.0011879022,0.0018800793,0.001850639,0.0014170604,0.00079107267,0.0057113827],"category_scores_gemma":[0.004817798,0.0003855742,0.00061643467,0.000982495,0.002753339,0.008075789,0.0030057416,0.0021479046,0.0005425835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038231003,0.000033191765,0.00037883507,0.000055164586,0.000006544478,0.000091879134,0.00026107245,0.0012635009,0.0008437152,0.99187815,0.0010323449,0.0041172914],"study_design_scores_gemma":[0.0000120891,0.000024412922,0.00025906393,0.000016491695,0.00000888846,0.00017195001,0.0001512446,0.0086159315,0.00096890045,0.98574567,0.004013818,0.000011507723],"about_ca_topic_score_codex":0.00073493837,"about_ca_topic_score_gemma":0.0009041525,"teacher_disagreement_score":0.0057113827,"about_ca_system_score_codex":0.0011169066,"about_ca_system_score_gemma":0.0006197557,"threshold_uncertainty_score":0.019106448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98285264,0.000103819206,0.012322254,0.00008201192,0.000013810348,0.0000072441726,0.000027532082,0.000038263133,0.004552494],"genre_scores_gemma":[0.9960265,0.000089016175,0.0024351967,0.000024648794,0.000009680937,0.0000063227503,0.00003877826,0.00000905257,0.0013606544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989164,0.000025442929,0.000005104163,0.000020694346,0.000025115929,0.0000318821],"domain_scores_gemma":[0.99928683,0.00030613504,0.00017299518,0.000074739546,0.00005447528,0.00010487785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012554385,0.00019210913,0.00021118468,0.00045227553,0.00037882564,0.00057859224,0.0003827065,0.0003278133,0.0014015363],"category_scores_gemma":[0.0011267043,0.00016031222,0.00019395407,0.00031185022,0.0010467462,0.00080190477,0.0004583533,0.0003766648,0.00014453496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002049522,0.00011996099,0.009626417,0.00012910823,0.00004328553,0.0010239551,0.0008877131,0.09051574,0.029247459,0.84911585,0.0017768957,0.017308787],"study_design_scores_gemma":[0.000053722557,0.00009929636,0.0048832633,0.000023104394,0.000019891095,0.00055045745,0.0006802235,0.33873218,0.009260943,0.64168364,0.003986259,0.000027016798],"about_ca_topic_score_codex":0.0009192572,"about_ca_topic_score_gemma":0.0011970465,"teacher_disagreement_score":0.0014015363,"about_ca_system_score_codex":0.0003212371,"about_ca_system_score_gemma":0.0001319993,"threshold_uncertainty_score":0.0046886206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85024613,0.00039745227,0.13539729,0.00033148404,0.00003538928,0.00006274141,0.0003141343,0.0002671197,0.012948276],"genre_scores_gemma":[0.98754334,0.00017870861,0.009890984,0.000055106557,0.0000444391,0.0000971974,0.0002750093,0.00009043065,0.0018248942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866796,0.00020790396,0.00007366832,0.00026695622,0.0005776294,0.00020589198],"domain_scores_gemma":[0.9868335,0.006983726,0.0024070966,0.0010479805,0.0014801286,0.0012474451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017250295,0.0005454976,0.00078454224,0.0044663227,0.0014358856,0.0033350347,0.0016740885,0.0011279726,0.004794687],"category_scores_gemma":[0.015028428,0.00084991223,0.0008022441,0.0014241394,0.004180852,0.0042834263,0.0031432111,0.0014189131,0.00041707835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025324765,0.00006385419,0.016379694,0.00017070514,0.000064581625,0.0005606036,0.0010369837,0.033372432,0.018673068,0.9155821,0.0009343591,0.012908383],"study_design_scores_gemma":[0.000023351296,0.00007969947,0.0078040906,0.000055083572,0.00005156357,0.00067981164,0.00043725534,0.17607462,0.010583316,0.8017726,0.0023720542,0.00006657433],"about_ca_topic_score_codex":0.0007540657,"about_ca_topic_score_gemma":0.00061843335,"teacher_disagreement_score":0.004794687,"about_ca_system_score_codex":0.0016383764,"about_ca_system_score_gemma":0.0006932644,"threshold_uncertainty_score":0.016039848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80776036,0.0015543096,0.06181247,0.0015480587,0.0001788091,0.000057504167,0.00067245244,0.00038652206,0.12602963],"genre_scores_gemma":[0.98670924,0.00045994384,0.0050791595,0.00006765596,0.00009753381,0.000034882778,0.00016436566,0.00007013771,0.0073172622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994313,0.00010597603,0.000020247668,0.00015388337,0.00013360736,0.00015498947],"domain_scores_gemma":[0.99652916,0.00211589,0.00030622593,0.00044359354,0.00027635437,0.0003288099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048610615,0.00031580852,0.00030988434,0.0016471321,0.0009808906,0.0027087193,0.00069750805,0.0005272326,0.00904639],"category_scores_gemma":[0.00562758,0.0003388518,0.00029178732,0.0012024621,0.0025934118,0.0030821927,0.0012086205,0.00092489476,0.00073279074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004297562,0.000035824887,0.004121155,0.00012778686,0.000025668853,0.00019067552,0.00043378037,0.036635406,0.010821796,0.90876865,0.0053642606,0.033045236],"study_design_scores_gemma":[0.000050232546,0.000057620462,0.002657763,0.000040383544,0.000027277227,0.00035161752,0.00020276563,0.074750535,0.0053771273,0.9057058,0.010733531,0.0000453066],"about_ca_topic_score_codex":0.0021926714,"about_ca_topic_score_gemma":0.0020571551,"teacher_disagreement_score":0.00904639,"about_ca_system_score_codex":0.0016608933,"about_ca_system_score_gemma":0.00058936636,"threshold_uncertainty_score":0.030263126},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086898535,0.005076143,0.8293839,0.015368223,0.0008140916,0.00024523446,0.0009437578,0.0013138924,0.059956215],"genre_scores_gemma":[0.8682293,0.006311251,0.090045564,0.006665098,0.0027662786,0.00078621117,0.0007683216,0.000610116,0.023817891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637574,0.0011311366,0.00011350104,0.0008860363,0.0010550831,0.0004384228],"domain_scores_gemma":[0.961129,0.02750546,0.0019128087,0.005478426,0.002426238,0.0015479898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007249996,0.00134137,0.002932967,0.004036695,0.002712015,0.0027689557,0.0034802477,0.0027675114,0.009062541],"category_scores_gemma":[0.049996834,0.00097159785,0.0029061409,0.003216894,0.00746355,0.011841315,0.005185906,0.006028851,0.001535961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009125544,0.000033873042,0.00092922716,0.0001729443,0.00005047502,0.0001419847,0.00022021556,0.009223512,0.0006904725,0.9692975,0.0077867787,0.011361712],"study_design_scores_gemma":[0.00006861193,0.00006680933,0.0007851861,0.000044628163,0.000044537726,0.00033209193,0.0000549849,0.088474676,0.0007549264,0.89922553,0.010103906,0.0000441552],"about_ca_topic_score_codex":0.0035399091,"about_ca_topic_score_gemma":0.0020304401,"teacher_disagreement_score":0.009062541,"about_ca_system_score_codex":0.003183066,"about_ca_system_score_gemma":0.0015726449,"threshold_uncertainty_score":0.03834212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79132974,0.00026136488,0.1952634,0.00082867104,0.0000498311,0.000052087453,0.00012832278,0.0005226363,0.01156393],"genre_scores_gemma":[0.97680205,0.00017455274,0.018387944,0.00016485143,0.000025626718,0.000041968633,0.00010082857,0.00010671488,0.0041955076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.000422757,0.000029356093,0.00020972642,0.00022622832,0.0002355298],"domain_scores_gemma":[0.9891043,0.007046641,0.001216841,0.0013764191,0.0006594766,0.0005964276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065452,0.00041442714,0.00051255804,0.00097297906,0.0008444585,0.0014887616,0.0014613521,0.0009883704,0.0029701386],"category_scores_gemma":[0.011646857,0.0003894078,0.0005535803,0.00056811544,0.002986294,0.0020489898,0.0017284432,0.0012017287,0.0004649905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058779615,0.00008874074,0.007376977,0.000154708,0.000085366446,0.0006465111,0.0006229372,0.2116222,0.025392445,0.73221844,0.00311928,0.018084526],"study_design_scores_gemma":[0.000046411522,0.00006560146,0.00117469,0.000017929808,0.000021973698,0.00024025077,0.000082438186,0.5297604,0.005461101,0.46119863,0.0018965214,0.000034035995],"about_ca_topic_score_codex":0.0030864682,"about_ca_topic_score_gemma":0.0032901666,"teacher_disagreement_score":0.0030864682,"about_ca_system_score_codex":0.0021622786,"about_ca_system_score_gemma":0.0007272932,"threshold_uncertainty_score":0.015688479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43066958,0.003911766,0.54319346,0.0018602023,0.000110164154,0.00010506044,0.00081927073,0.000502688,0.018827733],"genre_scores_gemma":[0.9456387,0.0017079667,0.046238694,0.00024545734,0.0001547497,0.0001758365,0.00049521105,0.00017421773,0.005169103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893194,0.0003281546,0.00006250308,0.00027743977,0.00025847726,0.00014146215],"domain_scores_gemma":[0.9837076,0.012904984,0.0014781336,0.00069763715,0.00067814667,0.0005334955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013230004,0.00049467257,0.0007690434,0.0022123957,0.0007621424,0.0015802485,0.0012452484,0.0010353861,0.0032095492],"category_scores_gemma":[0.017873514,0.0003754291,0.0005175785,0.0018917873,0.0014722182,0.004586783,0.0011619045,0.0012961433,0.00036383572],"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.00015233555,0.00004835411,0.0024667736,0.00023688818,0.000044455628,0.0002113502,0.00025836483,0.12990867,0.0036001697,0.8337404,0.0024469225,0.026885344],"study_design_scores_gemma":[0.000030151257,0.00006882972,0.0007368225,0.00003451509,0.000021109883,0.0002028228,0.000059538816,0.28886706,0.0015047011,0.7054812,0.0029690927,0.000024173996],"about_ca_topic_score_codex":0.00074087403,"about_ca_topic_score_gemma":0.0007822937,"teacher_disagreement_score":0.0032095492,"about_ca_system_score_codex":0.0017994196,"about_ca_system_score_gemma":0.00054442673,"threshold_uncertainty_score":0.013055742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6232248,0.002111363,0.33791608,0.0031702435,0.00022708483,0.00009139648,0.0005127101,0.00044407806,0.03230223],"genre_scores_gemma":[0.96072173,0.0014959412,0.030304,0.00030186842,0.00026580616,0.00016475501,0.00028722195,0.00018265923,0.006276131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.00025347812,0.000053152682,0.0002751702,0.00024518135,0.00024210614],"domain_scores_gemma":[0.991987,0.0037796416,0.0012554487,0.0012586358,0.0007376022,0.0009816624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027414958,0.0006605702,0.0006274491,0.0019619286,0.0011161859,0.0029222437,0.0014340455,0.0010199109,0.0022894756],"category_scores_gemma":[0.016048834,0.0005231131,0.0005749245,0.0015283368,0.0055740625,0.0065398416,0.0017481976,0.0021099248,0.00036533724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010927313,0.000023452538,0.0021160627,0.00005875497,0.000014859691,0.000094463,0.00021686133,0.02999544,0.0030165066,0.9573233,0.001315049,0.005715789],"study_design_scores_gemma":[0.000018976843,0.00003723126,0.0016425607,0.000035673496,0.00001621217,0.00016011935,0.000085990716,0.16042143,0.0019460617,0.83284765,0.0027414167,0.00004666801],"about_ca_topic_score_codex":0.0018661417,"about_ca_topic_score_gemma":0.0010697178,"teacher_disagreement_score":0.0029222437,"about_ca_system_score_codex":0.0027390956,"about_ca_system_score_gemma":0.00093293336,"threshold_uncertainty_score":0.019873679},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65341574,0.00093317387,0.327565,0.0012540567,0.000083458035,0.000046305213,0.00055007945,0.0002687324,0.015883544],"genre_scores_gemma":[0.9875536,0.00028128567,0.010208236,0.000069332804,0.00010399424,0.00004873475,0.00016083397,0.000043886488,0.0015301646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816895,0.0005026933,0.00011146512,0.00041877205,0.00037112154,0.00042691515],"domain_scores_gemma":[0.98168623,0.01119407,0.0034848945,0.0011620475,0.0014904076,0.0009823205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025842588,0.00079299277,0.000661555,0.002091373,0.000751898,0.0019566137,0.0011733936,0.00083079684,0.0023243208],"category_scores_gemma":[0.018812813,0.00060128234,0.00063175923,0.0013568824,0.003478229,0.003313046,0.0010081874,0.0019542787,0.00034381275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017625726,0.000036708323,0.0028404286,0.00011051103,0.00002479015,0.00017132712,0.00038178626,0.025760034,0.0048432327,0.95173496,0.0011547902,0.0127651915],"study_design_scores_gemma":[0.000043848464,0.000114160255,0.0030870764,0.00004671047,0.000019096331,0.0004314127,0.00020637395,0.1517888,0.0045467857,0.83754027,0.0020934201,0.000082083396],"about_ca_topic_score_codex":0.0016344065,"about_ca_topic_score_gemma":0.0006587972,"teacher_disagreement_score":0.0025842588,"about_ca_system_score_codex":0.0019339242,"about_ca_system_score_gemma":0.0004953494,"threshold_uncertainty_score":0.014031589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74987864,0.00077865383,0.17579976,0.0010112254,0.000107938016,0.00013875478,0.0008986634,0.0015095851,0.0698769],"genre_scores_gemma":[0.95889074,0.00019789797,0.03261886,0.00024404182,0.000065370084,0.000115838244,0.00035222515,0.00023554054,0.0072794757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855393,0.00009034182,0.000112791335,0.000416301,0.00024720994,0.000579305],"domain_scores_gemma":[0.9937236,0.0023309493,0.0010035639,0.0012989212,0.00079915,0.00084378803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368212,0.00081662094,0.0010851796,0.0007747326,0.0013754003,0.0029648875,0.0013472326,0.00088339555,0.007521914],"category_scores_gemma":[0.004525881,0.00072437525,0.001024244,0.0006258923,0.0023891802,0.004662236,0.0021536045,0.0017052963,0.001761604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017240954,0.0005305528,0.038007345,0.0009162122,0.00014199715,0.0017968699,0.0023060464,0.021979569,0.08417944,0.766355,0.012985139,0.069077775],"study_design_scores_gemma":[0.00015530261,0.00034622257,0.007815968,0.00012920698,0.00017037163,0.0043519866,0.00095639157,0.062237523,0.07976001,0.82095534,0.023026971,0.00009460109],"about_ca_topic_score_codex":0.0011477848,"about_ca_topic_score_gemma":0.0012594141,"teacher_disagreement_score":0.007521914,"about_ca_system_score_codex":0.0011724996,"about_ca_system_score_gemma":0.00063007744,"threshold_uncertainty_score":0.025163352},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6146016,0.0007819477,0.25974992,0.00060004886,0.0001595034,0.00018190306,0.0015306267,0.0017134205,0.120681055],"genre_scores_gemma":[0.9501911,0.0003199416,0.031869315,0.00010008899,0.00004642795,0.000101613114,0.00093884417,0.00047018618,0.015962427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998357,0.00023074457,0.00006190714,0.00041057888,0.0004010227,0.0005386535],"domain_scores_gemma":[0.99669254,0.0011792643,0.00023663507,0.0007752827,0.0005719111,0.0005443113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089622085,0.0004938659,0.00072152703,0.0017557123,0.0022188448,0.005452708,0.0013449494,0.0010351499,0.014695795],"category_scores_gemma":[0.0072643803,0.0004991714,0.0008051236,0.0012842678,0.0026628063,0.004924136,0.0026445026,0.0010415869,0.0019781063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010130312,0.000025912252,0.0011526379,0.000038623428,0.00000907887,0.00012367089,0.0004221974,0.0035935752,0.0023903504,0.98293555,0.0014742428,0.0077329087],"study_design_scores_gemma":[0.000016327123,0.000021836608,0.0004948404,0.000020789455,0.000016179654,0.00020976813,0.00040459147,0.024998732,0.0051563354,0.9621139,0.0065195803,0.000027102773],"about_ca_topic_score_codex":0.0019761408,"about_ca_topic_score_gemma":0.0027979307,"teacher_disagreement_score":0.014695795,"about_ca_system_score_codex":0.0019286162,"about_ca_system_score_gemma":0.0010522221,"threshold_uncertainty_score":0.04916233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6529448,0.0017461836,0.32344872,0.0061256546,0.00013648279,0.00020292288,0.0010860215,0.00055567344,0.013753574],"genre_scores_gemma":[0.9801768,0.0012274506,0.013969521,0.0003858394,0.0002490625,0.0003235649,0.00041403924,0.00012420384,0.003129515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958813,0.002296038,0.00009468804,0.0007800597,0.00056891766,0.00037892882],"domain_scores_gemma":[0.92794657,0.060597464,0.0035209386,0.0049302583,0.0014964304,0.0015083834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083022425,0.00085229415,0.002019182,0.0034793087,0.0012887807,0.0027366544,0.0025755602,0.0021853133,0.0034509231],"category_scores_gemma":[0.06484288,0.0010364717,0.0008041752,0.0021058354,0.0076771853,0.006918883,0.0027075345,0.0021159572,0.0006231875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077397504,0.00007535025,0.0082216505,0.00030234456,0.00014517092,0.0004361591,0.00058598915,0.22035766,0.005176772,0.74115384,0.004375116,0.018395951],"study_design_scores_gemma":[0.00019931226,0.00017215726,0.003523505,0.00013576381,0.000081944134,0.00057182496,0.00019380452,0.52555007,0.0024949736,0.46460417,0.0023601162,0.000112424284],"about_ca_topic_score_codex":0.0016311225,"about_ca_topic_score_gemma":0.0011235585,"teacher_disagreement_score":0.0083022425,"about_ca_system_score_codex":0.0022790432,"about_ca_system_score_gemma":0.0006415662,"threshold_uncertainty_score":0.043906987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79106855,0.0009674144,0.14771625,0.007181566,0.00014581993,0.00025371055,0.0017773926,0.0020456405,0.04884359],"genre_scores_gemma":[0.98034245,0.00036551317,0.012117491,0.00061913906,0.00010626971,0.00017626431,0.0006645526,0.00027686957,0.0053314297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986394,0.00025231176,0.000034267126,0.0005180158,0.00021531843,0.00034064215],"domain_scores_gemma":[0.9906144,0.004404317,0.001434556,0.0017252177,0.0007591942,0.0010622485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952887,0.00058220234,0.0013205267,0.0011726426,0.0017247915,0.0026005383,0.0020100314,0.001427258,0.005498831],"category_scores_gemma":[0.012651773,0.00060525484,0.0011124283,0.00076846173,0.0032984617,0.0029774918,0.001849217,0.0021900565,0.00093623286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011407842,0.00033965908,0.019783195,0.0010769167,0.00028926623,0.0019973414,0.0017321546,0.037837222,0.055659357,0.82259506,0.021766247,0.03578279],"study_design_scores_gemma":[0.0002308461,0.00040801024,0.020771287,0.00019827434,0.00026434372,0.0036573347,0.00086658273,0.22593637,0.033354133,0.69926995,0.014860312,0.00018257929],"about_ca_topic_score_codex":0.002090024,"about_ca_topic_score_gemma":0.0020736214,"teacher_disagreement_score":0.005498831,"about_ca_system_score_codex":0.0023568617,"about_ca_system_score_gemma":0.0012356403,"threshold_uncertainty_score":0.018395424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80098546,0.0028859833,0.15023024,0.0057486193,0.00030201752,0.00009037846,0.0020129282,0.0018525756,0.035891846],"genre_scores_gemma":[0.9704625,0.0009319766,0.022241142,0.0003269004,0.00014283344,0.00009995488,0.00080901594,0.00033970742,0.0046459544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989548,0.00012750374,0.00003168209,0.00041829856,0.00024214169,0.00022565955],"domain_scores_gemma":[0.9921548,0.005097873,0.0006079492,0.0009055117,0.00067802815,0.00055585266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012120745,0.0005123265,0.0006670643,0.001579294,0.0008787333,0.001845851,0.0014163684,0.0020131068,0.005316165],"category_scores_gemma":[0.019146306,0.00063022756,0.00062855304,0.000905979,0.001962655,0.0051439456,0.0011713359,0.0032819163,0.0006395348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057000056,0.0001903631,0.01711471,0.00041865068,0.00014622703,0.00075801666,0.0010343557,0.187393,0.053297557,0.67590946,0.01316017,0.050007425],"study_design_scores_gemma":[0.00004783827,0.00015665682,0.011320161,0.00011156728,0.000061035724,0.0009269009,0.00034467183,0.7110638,0.012733112,0.2434281,0.01970031,0.00010583124],"about_ca_topic_score_codex":0.00335737,"about_ca_topic_score_gemma":0.0014119006,"teacher_disagreement_score":0.005316165,"about_ca_system_score_codex":0.0032673515,"about_ca_system_score_gemma":0.00081794796,"threshold_uncertainty_score":0.023706377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8915918,0.0002389794,0.09371302,0.0010503143,0.000031115494,0.00007711316,0.0003543244,0.00016072695,0.012782597],"genre_scores_gemma":[0.9908494,0.00014378474,0.007288808,0.00013495456,0.000087040775,0.00008996671,0.00027757374,0.000038575297,0.0010898568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982247,0.0004141481,0.000074278374,0.00047002584,0.00050645793,0.00031042082],"domain_scores_gemma":[0.97678214,0.015877448,0.0025712808,0.0018530169,0.0011037394,0.001812365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019712762,0.00032068146,0.00059930276,0.0018528565,0.0014650403,0.0020270457,0.0014980094,0.0013861437,0.0058579664],"category_scores_gemma":[0.021573935,0.00046175264,0.00076010684,0.00079017907,0.0023170004,0.004023502,0.0019946604,0.0018856127,0.0002758274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006605704,0.00020555954,0.024396908,0.00026329706,0.00007724739,0.0004764939,0.0013707918,0.02630849,0.011656225,0.89399606,0.00424294,0.036345337],"study_design_scores_gemma":[0.0001256235,0.00023226769,0.008214235,0.00006333516,0.00006712039,0.0011817195,0.00032218095,0.2684784,0.0039025242,0.71256316,0.004803846,0.00004551457],"about_ca_topic_score_codex":0.0008046209,"about_ca_topic_score_gemma":0.00084401766,"teacher_disagreement_score":0.0058579664,"about_ca_system_score_codex":0.0011635255,"about_ca_system_score_gemma":0.00042830457,"threshold_uncertainty_score":0.019596875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0737733,0.0042050923,0.6530944,0.019728113,0.00096820656,0.00010102365,0.0010886644,0.0009854082,0.24605581],"genre_scores_gemma":[0.8226587,0.0030462313,0.12151674,0.0062720436,0.0018934323,0.00039227013,0.00047708568,0.00037334987,0.043370105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00034711204,0.000060217753,0.00040295452,0.00038974892,0.00018527372],"domain_scores_gemma":[0.99348724,0.004140724,0.00035972058,0.0008443963,0.00074798096,0.00041993157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022220977,0.0008566884,0.00081827893,0.0014432404,0.0011719358,0.0018848098,0.001917616,0.0011405449,0.019265253],"category_scores_gemma":[0.007876341,0.0004683754,0.001026526,0.0014531694,0.004067715,0.0116639715,0.004802803,0.005020993,0.0017564754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030510344,0.000027432887,0.0002321066,0.00008161123,0.000009689247,0.000060069295,0.00017195255,0.0008184482,0.0015591135,0.9868117,0.003378067,0.006819277],"study_design_scores_gemma":[0.000029976707,0.00008685744,0.000623011,0.000034280994,0.000023238726,0.00027866627,0.00009154372,0.01101046,0.0028725308,0.9586256,0.026286867,0.000036769656],"about_ca_topic_score_codex":0.0013142588,"about_ca_topic_score_gemma":0.0010420965,"teacher_disagreement_score":0.019265253,"about_ca_system_score_codex":0.0017947936,"about_ca_system_score_gemma":0.000985112,"threshold_uncertainty_score":0.064448714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521589,0.0006183028,0.1392742,0.00058480917,0.000054038857,0.00007268928,0.00034392538,0.00038814766,0.006504911],"genre_scores_gemma":[0.9835533,0.00025599945,0.012784857,0.00008654021,0.00006126702,0.000085228356,0.0002700285,0.00016993057,0.002732716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904865,0.00026010303,0.000041951804,0.00013333846,0.00021763075,0.00029835667],"domain_scores_gemma":[0.9848626,0.010629817,0.0014365274,0.0013265031,0.0008712895,0.0008732586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001843677,0.000551744,0.0008902187,0.0016886507,0.0007439807,0.0014561157,0.0019012113,0.001172459,0.0034842172],"category_scores_gemma":[0.01574256,0.00071037584,0.0008437314,0.0013972684,0.0023438793,0.0032549547,0.0016409713,0.0012563153,0.0004006262],"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.000660969,0.00013052904,0.008272642,0.0002755752,0.0001477699,0.0006478034,0.00053701975,0.61852854,0.017748866,0.33192647,0.0027923125,0.018331528],"study_design_scores_gemma":[0.000036266272,0.00013769702,0.0013572205,0.00002244984,0.000039551964,0.00018539482,0.000096586926,0.88940865,0.0028932684,0.10518199,0.0006119794,0.000028927896],"about_ca_topic_score_codex":0.001107367,"about_ca_topic_score_gemma":0.0010779707,"teacher_disagreement_score":0.0034842172,"about_ca_system_score_codex":0.0012831136,"about_ca_system_score_gemma":0.0007880057,"threshold_uncertainty_score":0.011655867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29150218,0.0025211878,0.683743,0.0011754314,0.000056090925,0.00008216221,0.00041839815,0.00038528876,0.020116197],"genre_scores_gemma":[0.92808247,0.0010881972,0.0664855,0.00020836655,0.00017600825,0.0001215097,0.00027342056,0.000093718634,0.0034707629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967073,0.0012576083,0.000107082094,0.0006615609,0.0008249768,0.0004414313],"domain_scores_gemma":[0.975226,0.020855322,0.0013458687,0.0009493199,0.00075503124,0.0008684528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041193315,0.00095597096,0.0010309274,0.0016683334,0.0009983919,0.0025905936,0.0015484102,0.0011959455,0.0036802918],"category_scores_gemma":[0.022624567,0.00084399356,0.0015176451,0.0016678179,0.0033057705,0.0051858667,0.0018517537,0.0030608855,0.00041141195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026435513,0.00004240931,0.0029809582,0.00014365587,0.00008367378,0.00021679187,0.00049739954,0.13919602,0.0027060944,0.8303468,0.00082103367,0.022700839],"study_design_scores_gemma":[0.000048200316,0.000089493726,0.0016770428,0.00004820298,0.00005650363,0.00015406517,0.000053875738,0.38222706,0.0020970935,0.6102722,0.0032398547,0.000036391626],"about_ca_topic_score_codex":0.002557813,"about_ca_topic_score_gemma":0.0014053086,"teacher_disagreement_score":0.0041193315,"about_ca_system_score_codex":0.0029083467,"about_ca_system_score_gemma":0.00073054864,"threshold_uncertainty_score":0.021785378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76813245,0.0011595339,0.2121719,0.001298872,0.00007583395,0.000047418354,0.00027659212,0.0003173186,0.016520072],"genre_scores_gemma":[0.9841282,0.0002517996,0.012986303,0.000103415834,0.000042278203,0.00003637702,0.000117660304,0.000069638525,0.0022644445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988317,0.00040848294,0.000031467447,0.00024735634,0.00027076842,0.00021029447],"domain_scores_gemma":[0.9872938,0.007736663,0.0013852816,0.0016924705,0.000882499,0.0010092594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977582,0.0004580978,0.0004662579,0.0018349777,0.0015790671,0.0021226741,0.0021579415,0.0010098366,0.0027151583],"category_scores_gemma":[0.0142621705,0.00051573373,0.00048280464,0.001438188,0.0032203284,0.0035731243,0.0019361004,0.0017672704,0.00023964254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018788381,0.00004743217,0.00461535,0.00009756668,0.000051814357,0.00015122726,0.00056884665,0.103394546,0.008214234,0.87022096,0.0020344923,0.010415631],"study_design_scores_gemma":[0.00003161126,0.00003029265,0.0019375834,0.000019965435,0.00001316231,0.00018238636,0.00011603525,0.27448538,0.0028098735,0.7181676,0.0021734443,0.000032656197],"about_ca_topic_score_codex":0.0028367809,"about_ca_topic_score_gemma":0.0022233902,"teacher_disagreement_score":0.0028367809,"about_ca_system_score_codex":0.0027748581,"about_ca_system_score_gemma":0.0007130448,"threshold_uncertainty_score":0.020133138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23264691,0.00052011124,0.72215647,0.00069629645,0.00040087497,0.0001035916,0.00063889596,0.0015271532,0.041309703],"genre_scores_gemma":[0.7077319,0.00047112803,0.26388246,0.0003453368,0.00018777854,0.00010458899,0.0010111608,0.00066084473,0.025604837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.00022259164,0.000085016465,0.00028351825,0.00050192524,0.0002165366],"domain_scores_gemma":[0.99604475,0.00126036,0.00029958307,0.0017964658,0.0003882974,0.00021059896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692461,0.0006827644,0.0008243875,0.0016082198,0.0014766447,0.0019638417,0.0011894476,0.0012941473,0.009702491],"category_scores_gemma":[0.007850242,0.00060364866,0.00084849057,0.0008455366,0.0022958617,0.0036836434,0.004107514,0.002250515,0.002180714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053689396,0.00006184308,0.0017761311,0.0003047356,0.000040457162,0.0004930073,0.0008550202,0.0280066,0.016422436,0.83906066,0.00981196,0.102630265],"study_design_scores_gemma":[0.00004362068,0.00011714461,0.000542594,0.00009558848,0.00003416497,0.0005100559,0.00034295826,0.098251544,0.029358173,0.84218544,0.028461644,0.00005711089],"about_ca_topic_score_codex":0.0007289936,"about_ca_topic_score_gemma":0.0009242337,"teacher_disagreement_score":0.009702491,"about_ca_system_score_codex":0.0006757932,"about_ca_system_score_gemma":0.00052799226,"threshold_uncertainty_score":0.032458127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28086892,0.00017984399,0.70073193,0.001322971,0.00008369012,0.00020064578,0.00014174,0.0018913101,0.014578862],"genre_scores_gemma":[0.87799865,0.00015449317,0.11601209,0.0002647887,0.000029286228,0.00019653549,0.00013436278,0.00033594653,0.0048738844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993375,0.00022263202,0.000024348874,0.00015688951,0.00018898371,0.000069747824],"domain_scores_gemma":[0.9912786,0.0058923424,0.00062002183,0.0013107656,0.0004254948,0.00047268363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014990524,0.00044885566,0.0005667838,0.0006745681,0.0007192495,0.0009753295,0.00088256306,0.0012540808,0.0025722026],"category_scores_gemma":[0.018484166,0.0004354593,0.00058657274,0.0004030485,0.0012786065,0.0019711505,0.0019274675,0.0011158389,0.0006205835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056553626,0.0002477882,0.002907078,0.00028558463,0.00006723974,0.0008162885,0.00058180635,0.40431017,0.058230486,0.48170266,0.00553725,0.044748142],"study_design_scores_gemma":[0.0001269559,0.00019025397,0.0004988922,0.000017581837,0.000025216734,0.000329598,0.0000637274,0.73841107,0.013120729,0.24423923,0.0029519668,0.000024770019],"about_ca_topic_score_codex":0.00075001805,"about_ca_topic_score_gemma":0.00082669704,"teacher_disagreement_score":0.0025722026,"about_ca_system_score_codex":0.0007572384,"about_ca_system_score_gemma":0.0005381659,"threshold_uncertainty_score":0.008604884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50757164,0.005733598,0.45304352,0.0061219214,0.00017914052,0.000103737715,0.00035385392,0.0008761218,0.026016379],"genre_scores_gemma":[0.9843352,0.0013369776,0.011001649,0.00019877002,0.00013006982,0.00009615017,0.00012748643,0.000084610125,0.002689069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00024222893,0.000013365566,0.00008596885,0.00009657455,0.00007565353],"domain_scores_gemma":[0.98935205,0.008721293,0.00075927057,0.00045469924,0.00032156406,0.00039106383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010978956,0.0007554096,0.00078521686,0.0022872777,0.00081768737,0.0017912289,0.0009874504,0.0010757553,0.0017383852],"category_scores_gemma":[0.013540031,0.0005840236,0.00051051093,0.0010183437,0.0029191137,0.00277272,0.0015191624,0.0015520183,0.00029962574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019544302,0.000055489178,0.0033264768,0.0002740431,0.000072836825,0.00040889293,0.0004986764,0.15001577,0.0061372733,0.8201678,0.0053481287,0.01349917],"study_design_scores_gemma":[0.000024497476,0.000023483064,0.0012620514,0.00003588808,0.000025819154,0.000106778156,0.00007813152,0.3616885,0.001245923,0.63416743,0.0013147566,0.000026687514],"about_ca_topic_score_codex":0.0023904718,"about_ca_topic_score_gemma":0.0029941895,"teacher_disagreement_score":0.0023904718,"about_ca_system_score_codex":0.0013378443,"about_ca_system_score_gemma":0.00062631356,"threshold_uncertainty_score":0.009706736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84626734,0.0007403759,0.126453,0.0013334281,0.00006868775,0.000039678955,0.0004101828,0.00029037523,0.024396926],"genre_scores_gemma":[0.9907624,0.00020252375,0.0061339675,0.000092923336,0.00010826316,0.00005088211,0.000191406,0.00008435927,0.0023731117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990274,0.00032730482,0.0000441349,0.00018501598,0.00026277849,0.00015343426],"domain_scores_gemma":[0.9906452,0.0063173017,0.0008018292,0.0010228818,0.000513676,0.00069911516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308671,0.00033024023,0.00051747344,0.0019382825,0.00090423867,0.0017885809,0.0008786978,0.00062467955,0.0019713691],"category_scores_gemma":[0.008597683,0.00035844295,0.0005405935,0.0007975788,0.00392605,0.0047008414,0.001853152,0.0010358751,0.00022375937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007376595,0.00002378862,0.0015151093,0.00005706887,0.00001215115,0.0000735717,0.00019540172,0.013125333,0.0022732094,0.9786048,0.0006011081,0.0034445864],"study_design_scores_gemma":[0.00001236504,0.000021289985,0.0012254479,0.000011968435,0.0000078371595,0.00010598527,0.000044706718,0.05661771,0.0019608014,0.93897855,0.0009928973,0.00002053247],"about_ca_topic_score_codex":0.00060570583,"about_ca_topic_score_gemma":0.0005159053,"teacher_disagreement_score":0.0019713691,"about_ca_system_score_codex":0.0013808629,"about_ca_system_score_gemma":0.00040636776,"threshold_uncertainty_score":0.010018885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17317902,0.00029267577,0.81119204,0.00025720242,0.00004757114,0.00004541911,0.00007891134,0.00040165914,0.014505472],"genre_scores_gemma":[0.9159205,0.00028234968,0.07674318,0.00005065926,0.00006889271,0.0000644482,0.00008769478,0.0001372368,0.006645122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997017,0.00010198136,0.00001460433,0.0000310987,0.00009677969,0.000053814303],"domain_scores_gemma":[0.9993839,0.00023511144,0.00007839803,0.00010727099,0.000121798344,0.000073527495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297472,0.00035913748,0.0006088188,0.0021347997,0.00040722688,0.0008398712,0.0011305732,0.00044048805,0.0034107976],"category_scores_gemma":[0.0020492987,0.00019425075,0.00065015967,0.0005664166,0.0010959343,0.0017136283,0.0011174041,0.0008665489,0.0004908768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026524467,0.00003826951,0.0007729558,0.000050987364,0.000018971557,0.00015474664,0.00010108407,0.02892802,0.0027496072,0.953422,0.0006616885,0.013075128],"study_design_scores_gemma":[0.000010568051,0.000018724719,0.0003331805,0.000011737067,0.000006164142,0.00006729925,0.000033576835,0.68958974,0.0009102448,0.30820203,0.0008025696,0.00001417871],"about_ca_topic_score_codex":0.0012801784,"about_ca_topic_score_gemma":0.0011671798,"teacher_disagreement_score":0.0034107976,"about_ca_system_score_codex":0.0006067418,"about_ca_system_score_gemma":0.0005567046,"threshold_uncertainty_score":0.011410236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82781625,0.0036691509,0.10841098,0.0010088485,0.00005835166,0.000059173424,0.000619243,0.00045582067,0.057902206],"genre_scores_gemma":[0.9877123,0.0008436872,0.008352218,0.00015564328,0.00007158883,0.000058670994,0.00027182596,0.00007959745,0.0024543277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992157,0.00014413286,0.000029486544,0.00022314198,0.00017171087,0.00021568981],"domain_scores_gemma":[0.9935515,0.004366145,0.0005981439,0.00047647455,0.00034083176,0.00066688645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357686,0.00059843034,0.0005657279,0.0027471806,0.0010509779,0.0021030828,0.0011364926,0.0007390354,0.003252626],"category_scores_gemma":[0.0061945454,0.0004602614,0.00061014673,0.0013610492,0.0027566168,0.0031838983,0.0015704862,0.0019434476,0.00039118872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026055897,0.00006130691,0.00892741,0.00014538363,0.000060377388,0.00021345752,0.00080623047,0.054156568,0.019799894,0.898309,0.0028217577,0.01443817],"study_design_scores_gemma":[0.000039915056,0.00011775201,0.010567403,0.00014561706,0.000071304916,0.0004607013,0.00039082248,0.26412398,0.009500525,0.7074045,0.0070886514,0.00008888049],"about_ca_topic_score_codex":0.002774825,"about_ca_topic_score_gemma":0.0017039785,"teacher_disagreement_score":0.003252626,"about_ca_system_score_codex":0.003186551,"about_ca_system_score_gemma":0.00044968823,"threshold_uncertainty_score":0.023120165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93007636,0.0012501545,0.043854646,0.0009893228,0.000052108797,0.000036735073,0.00040514354,0.00023657281,0.023098951],"genre_scores_gemma":[0.99145836,0.00040541147,0.0058452343,0.000101335856,0.00004080294,0.000060265527,0.00013936684,0.000044873443,0.0019043641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994947,0.0001439438,0.000022358168,0.00012010599,0.00009028354,0.0001285488],"domain_scores_gemma":[0.9953957,0.0026933283,0.00055409747,0.0004795414,0.0003117199,0.00056550116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010902482,0.0002499941,0.00051185157,0.0013409652,0.0011959905,0.0019541662,0.000729884,0.0006868381,0.004709175],"category_scores_gemma":[0.010540796,0.00046218856,0.00037038236,0.0007979376,0.001565689,0.0034554163,0.0014076647,0.00083843153,0.00038177255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006968223,0.00006773258,0.008677724,0.00020968844,0.000045135854,0.00019204292,0.00080660585,0.032092046,0.0093628215,0.9037634,0.0073192474,0.03676665],"study_design_scores_gemma":[0.00006777107,0.000110711495,0.005780526,0.00009472212,0.000053283944,0.0005442908,0.000382023,0.14806473,0.004732131,0.83255464,0.0075544277,0.000060736613],"about_ca_topic_score_codex":0.0013295772,"about_ca_topic_score_gemma":0.0010513033,"teacher_disagreement_score":0.004709175,"about_ca_system_score_codex":0.0011873862,"about_ca_system_score_gemma":0.0006148598,"threshold_uncertainty_score":0.015753806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710342,0.0011982197,0.10387908,0.0009342064,0.000027001961,0.000047431877,0.00047185156,0.0002772587,0.022130767],"genre_scores_gemma":[0.9812275,0.0008261092,0.013918709,0.00015092024,0.00006632557,0.000053013267,0.0003382412,0.00006196773,0.0033572426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.00022256866,0.000027420636,0.00010431464,0.0000932391,0.00015436139],"domain_scores_gemma":[0.99581593,0.0028086843,0.00053542934,0.0003466635,0.00018447558,0.000308828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063479727,0.00044924606,0.00047994597,0.0017371908,0.0008641882,0.0014225154,0.0005560078,0.0004845446,0.0027264876],"category_scores_gemma":[0.004839545,0.00045101476,0.00036034436,0.00177552,0.0013627758,0.0029213752,0.0013070606,0.00063966925,0.00026495708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044032375,0.00008785536,0.010705226,0.00029360628,0.00005166194,0.00097463315,0.0014779307,0.074722536,0.02379995,0.8350481,0.003172442,0.049225703],"study_design_scores_gemma":[0.000040407365,0.00005043215,0.0060265767,0.00007404334,0.000043158463,0.0005959285,0.0003510219,0.16984648,0.0069825794,0.8110014,0.0049542286,0.000033641347],"about_ca_topic_score_codex":0.0037021597,"about_ca_topic_score_gemma":0.004724401,"teacher_disagreement_score":0.0037021597,"about_ca_system_score_codex":0.0017885375,"about_ca_system_score_gemma":0.000400642,"threshold_uncertainty_score":0.012976825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5103283,0.00186224,0.44048798,0.0029861636,0.00046718583,0.00017418875,0.0022887962,0.0005200073,0.040885117],"genre_scores_gemma":[0.8163715,0.00084326876,0.17086701,0.00051300443,0.0002059557,0.0002505557,0.0020234706,0.00014893828,0.008776317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493814,0.0009874132,0.00037619675,0.0010132933,0.002063549,0.00062139874],"domain_scores_gemma":[0.98710537,0.006430025,0.0015510725,0.0023815124,0.0013921994,0.0011399144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014984552,0.0009652477,0.0011875214,0.0015794617,0.0023118793,0.0030300121,0.003477725,0.0027637517,0.01054205],"category_scores_gemma":[0.017525272,0.00087300414,0.0010117028,0.0031427178,0.002545616,0.005849179,0.008346431,0.005091998,0.002785479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021499046,0.00022129217,0.010927883,0.0007429649,0.00025968128,0.0019521025,0.0013342819,0.02592909,0.024526916,0.8106147,0.012476881,0.108864315],"study_design_scores_gemma":[0.00034206477,0.0002103266,0.00456996,0.00012969344,0.000101598525,0.0026187592,0.0009878015,0.058283072,0.018928465,0.87832516,0.035334088,0.00016904247],"about_ca_topic_score_codex":0.0009090473,"about_ca_topic_score_gemma":0.00092457805,"teacher_disagreement_score":0.01054205,"about_ca_system_score_codex":0.0015115114,"about_ca_system_score_gemma":0.0008158906,"threshold_uncertainty_score":0.035266697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2140519,0.013975191,0.73874795,0.006158551,0.00024390225,0.000106598935,0.0006195525,0.0006060334,0.025490312],"genre_scores_gemma":[0.9592234,0.0070790807,0.02523601,0.0006178919,0.0010361146,0.00022523063,0.00040138874,0.00021416813,0.0059668086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978446,0.0008544381,0.00007045435,0.00048176985,0.0005434571,0.00020534704],"domain_scores_gemma":[0.9744392,0.019796062,0.0019011243,0.0016480836,0.0012184281,0.0009971358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032796112,0.0014977611,0.0016687124,0.0042939736,0.0011971131,0.0028203938,0.0024907426,0.002906536,0.003226021],"category_scores_gemma":[0.035782613,0.00085153437,0.0008402298,0.0023422674,0.0056349067,0.0073262244,0.0035102007,0.0031896345,0.0006384407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012783647,0.000030969783,0.0019402829,0.00017814113,0.00007263093,0.00019831468,0.0003347663,0.10055449,0.0025350251,0.8814903,0.0026867015,0.009850521],"study_design_scores_gemma":[0.000030181727,0.00004360933,0.0007708707,0.000082348626,0.000028410925,0.00015689996,0.00006984839,0.2516818,0.0007595756,0.74377924,0.0025578542,0.000039263992],"about_ca_topic_score_codex":0.0020343,"about_ca_topic_score_gemma":0.0007428079,"teacher_disagreement_score":0.0042939736,"about_ca_system_score_codex":0.0026076091,"about_ca_system_score_gemma":0.0005072003,"threshold_uncertainty_score":0.018919647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9145416,0.00070590293,0.052286405,0.0007035916,0.000080953134,0.00006646986,0.00064496027,0.00030452025,0.030665603],"genre_scores_gemma":[0.9827208,0.00020680403,0.011776734,0.00011562946,0.00002103856,0.000058748232,0.00055543863,0.000043759104,0.004501034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983228,0.00018423829,0.00010396546,0.00064681406,0.0002831988,0.00045888865],"domain_scores_gemma":[0.9885621,0.004937453,0.0015946701,0.0019292933,0.001134635,0.0018417874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843914,0.0005971805,0.0010167529,0.0016455811,0.003204638,0.0032363508,0.002090947,0.0017155152,0.0051227473],"category_scores_gemma":[0.006652794,0.000789571,0.0008763398,0.002275403,0.004063106,0.006389035,0.0036227265,0.0013902435,0.00060112565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033692035,0.00010284161,0.011470253,0.0002488296,0.0000862377,0.0013462375,0.0015293106,0.0040210416,0.007189121,0.9519518,0.0023254722,0.019391945],"study_design_scores_gemma":[0.000043920885,0.000073539675,0.003765197,0.000060265393,0.00008358176,0.0016728529,0.0013199924,0.011641174,0.0068144593,0.9576833,0.016784286,0.00005736821],"about_ca_topic_score_codex":0.002231184,"about_ca_topic_score_gemma":0.00377703,"teacher_disagreement_score":0.0051227473,"about_ca_system_score_codex":0.0016530952,"about_ca_system_score_gemma":0.0010071319,"threshold_uncertainty_score":0.017137289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68096954,0.0016258743,0.27789202,0.0040335427,0.00010601881,0.00015439272,0.0004665664,0.00063056033,0.034121506],"genre_scores_gemma":[0.97252613,0.0010478339,0.017589819,0.0003487923,0.0001497549,0.0001982039,0.00029360096,0.00012974477,0.0077161514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720496,0.0012610966,0.00010198349,0.00044885706,0.00048681963,0.00049631955],"domain_scores_gemma":[0.9789828,0.013969201,0.0026846926,0.0016184222,0.00074944826,0.0019954024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025667863,0.0010695277,0.0016041183,0.0027414907,0.0019971689,0.0029328691,0.0022077458,0.0019276601,0.0047651487],"category_scores_gemma":[0.022712667,0.00089901715,0.0010636587,0.0015216933,0.005500495,0.0068269516,0.003056587,0.0026391312,0.0007219342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105915264,0.00005139425,0.0009496085,0.00008483595,0.000028590262,0.00015223955,0.00043090605,0.043761756,0.0012736205,0.9454691,0.0020375664,0.005654468],"study_design_scores_gemma":[0.000041404706,0.0000449554,0.00057102164,0.000030810414,0.000015104514,0.0001606864,0.00013837166,0.19281742,0.00049094524,0.8038088,0.0018537596,0.000026733245],"about_ca_topic_score_codex":0.0026064,"about_ca_topic_score_gemma":0.0020436563,"teacher_disagreement_score":0.0047651487,"about_ca_system_score_codex":0.0026871685,"about_ca_system_score_gemma":0.0009244767,"threshold_uncertainty_score":0.019496858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16949616,0.003935365,0.7810568,0.0018387439,0.00024730936,0.00027456225,0.0010080108,0.0009321127,0.041210998],"genre_scores_gemma":[0.73406917,0.003832068,0.2422017,0.0009895214,0.00070329965,0.0004586619,0.0013698614,0.0005012023,0.015874472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997095,0.00079357275,0.00017702494,0.000830725,0.0006901456,0.0004135808],"domain_scores_gemma":[0.99019367,0.0055991653,0.001239872,0.0017717875,0.00043901853,0.0007564523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016544053,0.0011352985,0.0007848032,0.0017648687,0.0014279765,0.004319634,0.001944456,0.0017213771,0.008098092],"category_scores_gemma":[0.010479238,0.0012719617,0.0013576942,0.003946762,0.0052838447,0.00771868,0.004039353,0.004149661,0.0011596555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017197515,0.00005740304,0.0011394024,0.00027092465,0.00004402402,0.00025979488,0.0008171726,0.03023293,0.0055056177,0.9180157,0.004888369,0.03859671],"study_design_scores_gemma":[0.000031378757,0.000021892309,0.0005335979,0.000027550888,0.000013820414,0.00025389143,0.00012227107,0.022089232,0.0014456988,0.967602,0.007836103,0.000022580245],"about_ca_topic_score_codex":0.0020974553,"about_ca_topic_score_gemma":0.0020352828,"teacher_disagreement_score":0.008098092,"about_ca_system_score_codex":0.0028952002,"about_ca_system_score_gemma":0.00080353406,"threshold_uncertainty_score":0.027090847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08483986,0.015869651,0.5983899,0.035207238,0.010629705,0.00025957444,0.0006002998,0.0026883255,0.2515154],"genre_scores_gemma":[0.6707684,0.01313729,0.26185095,0.007937414,0.0048393034,0.00024526851,0.00052119704,0.0007866382,0.039913557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733704,0.0008280021,0.00013053344,0.0005430761,0.00064257975,0.0005187181],"domain_scores_gemma":[0.9865317,0.009147561,0.0004049576,0.0024600332,0.0009197989,0.0005360684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546254,0.0007093928,0.0009299457,0.0011136072,0.002540449,0.0028874825,0.0019048097,0.001758443,0.0062207207],"category_scores_gemma":[0.01519387,0.0005523718,0.00094953144,0.0022770846,0.005189228,0.008547033,0.0035706973,0.0057351766,0.0018410201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037113926,0.00008750379,0.0022947048,0.00039349849,0.00002855655,0.00048143108,0.00073896314,0.009401885,0.0041403677,0.8514119,0.037523758,0.09312635],"study_design_scores_gemma":[0.000044425982,0.00012286662,0.0007093574,0.00011556106,0.000053808173,0.0004598743,0.00021177661,0.021583958,0.004943327,0.8706885,0.101017326,0.000049156],"about_ca_topic_score_codex":0.003727537,"about_ca_topic_score_gemma":0.0025751009,"teacher_disagreement_score":0.0062207207,"about_ca_system_score_codex":0.00229533,"about_ca_system_score_gemma":0.0010666832,"threshold_uncertainty_score":0.020810425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06777526,0.0017420738,0.9128399,0.003470536,0.0002698044,0.00046858558,0.0007324831,0.0040539866,0.008647351],"genre_scores_gemma":[0.47778878,0.0012484804,0.5058901,0.0015549546,0.0008858436,0.0013077533,0.0020299046,0.0012089863,0.008085332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97978824,0.009686023,0.00091467274,0.0040358156,0.0025982384,0.0029770688],"domain_scores_gemma":[0.9073517,0.07224523,0.004680553,0.011790601,0.0020100132,0.0019219726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010517607,0.0027776568,0.0041367114,0.002581744,0.0029561988,0.0060461573,0.008206433,0.004984918,0.0066475742],"category_scores_gemma":[0.055919956,0.0019638005,0.0024319363,0.0041901157,0.0060895593,0.01606632,0.0067706844,0.006634994,0.0020251493],"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.00360842,0.0009359199,0.0039267563,0.0010722636,0.00048585248,0.00024603744,0.00074139173,0.4135832,0.0073832027,0.36936948,0.026050407,0.17259704],"study_design_scores_gemma":[0.00039913997,0.00012581206,0.00030376876,0.00004468543,0.000071297276,0.000089773144,0.00006693347,0.51133454,0.0019985638,0.48306683,0.0024503744,0.000048346978],"about_ca_topic_score_codex":0.0032414955,"about_ca_topic_score_gemma":0.0043202,"teacher_disagreement_score":0.010517607,"about_ca_system_score_codex":0.005158265,"about_ca_system_score_gemma":0.0047993376,"threshold_uncertainty_score":0.055623114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57785946,0.0013033027,0.40038672,0.000544452,0.00010347902,0.00008911903,0.0009730615,0.0008411473,0.017899225],"genre_scores_gemma":[0.96256495,0.0005000456,0.032627802,0.00008803245,0.00014276193,0.00009919177,0.0005950542,0.000103907085,0.0032783647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814475,0.00050581497,0.00013237701,0.00040540253,0.00043527078,0.0003763206],"domain_scores_gemma":[0.98991114,0.005709679,0.0015192986,0.001015388,0.00067245576,0.001172092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019480768,0.0005195586,0.0009573118,0.0021886097,0.0013784007,0.0034886969,0.0010902642,0.0008148716,0.0038619987],"category_scores_gemma":[0.011007682,0.0005774915,0.0009669298,0.0024235523,0.0028906625,0.006109957,0.0022265331,0.0013637436,0.00037247926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009859663,0.000026894222,0.0029035846,0.00007872182,0.000027758944,0.00030761666,0.00051735266,0.010350024,0.003922788,0.9754504,0.00056839833,0.005747946],"study_design_scores_gemma":[0.00003031042,0.000076076656,0.0021110498,0.000025682742,0.00003426667,0.00034408414,0.00019879169,0.08675238,0.003464916,0.9024426,0.004487507,0.000032383527],"about_ca_topic_score_codex":0.0010611154,"about_ca_topic_score_gemma":0.0006243176,"teacher_disagreement_score":0.0038619987,"about_ca_system_score_codex":0.0016791056,"about_ca_system_score_gemma":0.000553402,"threshold_uncertainty_score":0.012919664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21605286,0.0033315467,0.5645575,0.0096702585,0.0011726622,0.00060382887,0.004095501,0.002903771,0.19761208],"genre_scores_gemma":[0.72652954,0.0021606877,0.1740678,0.0030115172,0.0010042684,0.0008481544,0.004806795,0.0014098888,0.08616141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738973,0.00072199065,0.00011210594,0.0007525278,0.00038130034,0.0006423888],"domain_scores_gemma":[0.99397534,0.0034941507,0.0004736623,0.0010690985,0.00036303842,0.00062476756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712335,0.001396445,0.0015325338,0.0012408834,0.0031612332,0.0028434733,0.0033741388,0.0020713876,0.026338192],"category_scores_gemma":[0.008973916,0.00075441285,0.0020401478,0.0017153315,0.0027856962,0.009492574,0.0045687715,0.0043870914,0.003346089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023837158,0.00011805168,0.0005489612,0.0004062505,0.00006492703,0.000130382,0.0002775089,0.01801666,0.0013755064,0.9210076,0.029018585,0.02879718],"study_design_scores_gemma":[0.000045610825,0.000045320972,0.00036694584,0.00003826865,0.00003244069,0.00013810092,0.000104007406,0.037120983,0.0010084695,0.94771665,0.013355122,0.000028149958],"about_ca_topic_score_codex":0.0018614385,"about_ca_topic_score_gemma":0.0026700255,"teacher_disagreement_score":0.026338192,"about_ca_system_score_codex":0.002981319,"about_ca_system_score_gemma":0.0016721133,"threshold_uncertainty_score":0.08811003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83259624,0.00080143515,0.13575238,0.0010880128,0.0001365884,0.00009541793,0.00068998086,0.001228152,0.027611755],"genre_scores_gemma":[0.95006204,0.00020316035,0.041851737,0.0002751188,0.00005212149,0.00005212646,0.00060116005,0.000114150585,0.006788498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938023,0.0000934026,0.000033478613,0.00022464017,0.00013260434,0.00013566857],"domain_scores_gemma":[0.99757224,0.00065533555,0.00045181403,0.0008369528,0.00022289951,0.00026088062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030154784,0.00036238704,0.0005106664,0.00041670576,0.0006747507,0.0011059791,0.00087236136,0.0007549846,0.002795473],"category_scores_gemma":[0.0028444433,0.00038115252,0.00052358053,0.00062132056,0.0010034502,0.0013599356,0.001074008,0.00074746256,0.00053447246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002441482,0.00024405193,0.015459645,0.0007624627,0.00020812669,0.0015769617,0.0013967815,0.08654274,0.2790339,0.46698982,0.020308511,0.12503555],"study_design_scores_gemma":[0.00022521942,0.0005438641,0.0118385,0.000060771825,0.00016274524,0.0029798923,0.00035379722,0.27009985,0.0592016,0.61289847,0.041531652,0.000103674516],"about_ca_topic_score_codex":0.0018364629,"about_ca_topic_score_gemma":0.0021512224,"teacher_disagreement_score":0.002795473,"about_ca_system_score_codex":0.001086894,"about_ca_system_score_gemma":0.0004994951,"threshold_uncertainty_score":0.00935185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35270688,0.00045865614,0.6416901,0.0005913411,0.000025029347,0.000056783552,0.000102776925,0.00040041836,0.003968125],"genre_scores_gemma":[0.8702657,0.0005031447,0.12612775,0.00009859369,0.00003131931,0.00008037104,0.00015779573,0.000056785822,0.0026785815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954826,0.00016787143,0.000020751873,0.00007794101,0.000075637596,0.0001095022],"domain_scores_gemma":[0.9972675,0.0017738251,0.0004068555,0.00018610842,0.00016638606,0.00019931624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008899401,0.00029285444,0.00057654356,0.0006968304,0.0009349519,0.001095453,0.0008667909,0.0010338165,0.0017005168],"category_scores_gemma":[0.005581857,0.00030756707,0.0003233184,0.0007326409,0.00080923334,0.0031697403,0.0010695446,0.00053943106,0.00030110512],"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.0008087551,0.00015764553,0.004429109,0.0002527554,0.000064141364,0.00061178184,0.000984046,0.58215773,0.016126804,0.28115928,0.0061243884,0.10712357],"study_design_scores_gemma":[0.000032540433,0.00007226209,0.00023845478,0.000012620514,0.000011695533,0.000110474415,0.0001536699,0.86975414,0.0021996542,0.12568496,0.0017211253,0.000008434427],"about_ca_topic_score_codex":0.0012023699,"about_ca_topic_score_gemma":0.001635912,"teacher_disagreement_score":0.0017005168,"about_ca_system_score_codex":0.00065692415,"about_ca_system_score_gemma":0.00061581074,"threshold_uncertainty_score":0.0056887865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30384707,0.0011113837,0.6210206,0.0014890383,0.00027578243,0.00025073017,0.00033194153,0.00029500722,0.07137837],"genre_scores_gemma":[0.9040642,0.0008838216,0.06935194,0.00031148814,0.00018843336,0.00040611767,0.00024931793,0.00022731438,0.024317546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975019,0.0010095531,0.00009132977,0.00042855213,0.000457893,0.0005107508],"domain_scores_gemma":[0.99491465,0.00267664,0.00072964124,0.00055120396,0.0002803339,0.00084743765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017698945,0.0011186858,0.0016084985,0.0012797401,0.0019275986,0.0030254938,0.0019320181,0.0016883349,0.009068692],"category_scores_gemma":[0.010257748,0.0007085371,0.0010730819,0.0011297674,0.0042474237,0.007619324,0.0035771024,0.0024181285,0.0010498991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012724678,0.00003386286,0.00027539252,0.000072442555,0.00002176477,0.00016574678,0.00016622039,0.060681086,0.0010353752,0.93155706,0.001562945,0.0043008095],"study_design_scores_gemma":[0.000040716146,0.000055718807,0.0001924253,0.000028960867,0.000011390623,0.00011402823,0.00016851284,0.22370873,0.00089284696,0.77057284,0.0041872025,0.000026524762],"about_ca_topic_score_codex":0.0014355875,"about_ca_topic_score_gemma":0.0011661513,"teacher_disagreement_score":0.009068692,"about_ca_system_score_codex":0.0016973934,"about_ca_system_score_gemma":0.00075901934,"threshold_uncertainty_score":0.03033781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71259665,0.00074466696,0.2657293,0.0030011924,0.000053084306,0.000120214034,0.000453401,0.00053566514,0.016765779],"genre_scores_gemma":[0.9818288,0.0005166534,0.013635241,0.0002061988,0.000115432,0.0001335046,0.0002547991,0.00008512136,0.0032242388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814284,0.0007067683,0.000044412016,0.00041039707,0.00037809118,0.00031743362],"domain_scores_gemma":[0.9574071,0.030169494,0.0051008333,0.004307941,0.0014125915,0.0016020075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032714147,0.0006184923,0.00077911693,0.0021282255,0.0014079778,0.0022636144,0.0022777435,0.001061496,0.0021795563],"category_scores_gemma":[0.027351027,0.00087631395,0.0006768261,0.0012162136,0.005872347,0.00472452,0.0018544067,0.0025838038,0.0003205711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048542282,0.00016092206,0.009827147,0.00013073816,0.00009868182,0.0003081307,0.0007018123,0.09502537,0.008326188,0.8705935,0.0037660256,0.010575964],"study_design_scores_gemma":[0.000120295415,0.00006832116,0.0064730993,0.00003643986,0.00005779978,0.00042570083,0.00013620782,0.5765814,0.003596302,0.4094601,0.0029763735,0.00006798176],"about_ca_topic_score_codex":0.003019578,"about_ca_topic_score_gemma":0.0037918517,"teacher_disagreement_score":0.0032714147,"about_ca_system_score_codex":0.002979531,"about_ca_system_score_gemma":0.0008950262,"threshold_uncertainty_score":0.021618128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6256072,0.001001325,0.27105507,0.009585175,0.0006824164,0.00017496009,0.0013986325,0.0023468658,0.088148445],"genre_scores_gemma":[0.9484692,0.0002909906,0.03109518,0.0012346372,0.0004965576,0.00016387888,0.00087892177,0.0003478499,0.017022735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00038046998,0.00008154959,0.0005238557,0.00030862846,0.0003770635],"domain_scores_gemma":[0.98988706,0.00520784,0.00081814564,0.0020095473,0.00084066513,0.0012367346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486347,0.0004910193,0.0010632039,0.0008423762,0.0022284957,0.0019079809,0.0011995158,0.0015025388,0.013545294],"category_scores_gemma":[0.013913188,0.00061235327,0.0009953685,0.0006283668,0.0027107669,0.0059794625,0.004148215,0.0018651285,0.0019418002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039968794,0.00009638811,0.0026654569,0.00027611246,0.00003942409,0.00036578573,0.0008312095,0.010957802,0.014943826,0.92928165,0.01873847,0.021404127],"study_design_scores_gemma":[0.00009380739,0.00015211219,0.00095164275,0.000050826813,0.000026018339,0.0007031631,0.00038502115,0.04671917,0.006157093,0.9186607,0.026062496,0.000037876463],"about_ca_topic_score_codex":0.0009480507,"about_ca_topic_score_gemma":0.001309368,"teacher_disagreement_score":0.013545294,"about_ca_system_score_codex":0.0014918866,"about_ca_system_score_gemma":0.0007694381,"threshold_uncertainty_score":0.045313537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065827996,0.0074785315,0.9038102,0.0036377443,0.00022781885,0.00013775518,0.0004963641,0.00083130103,0.017552173],"genre_scores_gemma":[0.8257432,0.004914681,0.15324934,0.0014500516,0.00051675324,0.00058454776,0.00052438164,0.0007469439,0.0122700585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930407,0.0024780785,0.0002955914,0.0011763269,0.0014826255,0.0015267181],"domain_scores_gemma":[0.92631894,0.061847426,0.003998841,0.0040794485,0.0017574896,0.0019977894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013096468,0.0025884174,0.0038905018,0.0033373353,0.0020823672,0.0051337653,0.0040196516,0.003000097,0.0075017926],"category_scores_gemma":[0.08573004,0.0013275367,0.0019821038,0.003311154,0.007088396,0.014820004,0.0059419423,0.005635059,0.0012807687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009136267,0.00022676043,0.0015907567,0.00071450236,0.00018850266,0.00020903462,0.0004887685,0.3307489,0.0030515306,0.62753296,0.005068961,0.02926571],"study_design_scores_gemma":[0.00008037749,0.0001055836,0.00034088315,0.0001400034,0.000060270842,0.00009911362,0.000067854344,0.56159544,0.0011416925,0.43423536,0.002083593,0.000049740163],"about_ca_topic_score_codex":0.003384494,"about_ca_topic_score_gemma":0.0027044332,"teacher_disagreement_score":0.013096468,"about_ca_system_score_codex":0.005608568,"about_ca_system_score_gemma":0.0035557281,"threshold_uncertainty_score":0.06926155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086077124,0.00034276381,0.9005345,0.00058302894,0.00008500741,0.000056488298,0.000065386375,0.00022807335,0.012027501],"genre_scores_gemma":[0.85111445,0.00048510253,0.13358444,0.00038154935,0.00017778663,0.00023853774,0.00016330293,0.00015678695,0.013698044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961203,0.000089451016,0.000019177432,0.00005842139,0.00014370639,0.0000771826],"domain_scores_gemma":[0.9989373,0.00056095317,0.000103054546,0.00014306467,0.00012989578,0.00012576033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007313971,0.00032409458,0.00064140843,0.0014415303,0.0007775575,0.00083923753,0.0010937002,0.0007432987,0.004788352],"category_scores_gemma":[0.0027273109,0.0002237963,0.00058059976,0.0007004948,0.0012817632,0.0018806825,0.0010241274,0.00084467174,0.0004418039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040913594,0.00002531495,0.0004539396,0.000047629048,0.000007267173,0.00009613023,0.00006162317,0.027048016,0.004118589,0.9488642,0.0008791319,0.01835723],"study_design_scores_gemma":[0.000015102157,0.000037601865,0.00046103453,0.000013296529,0.0000068199674,0.00013392414,0.000040803443,0.5056123,0.0024294432,0.4882984,0.0029298796,0.000021342878],"about_ca_topic_score_codex":0.0010322512,"about_ca_topic_score_gemma":0.0010763746,"teacher_disagreement_score":0.004788352,"about_ca_system_score_codex":0.00091874046,"about_ca_system_score_gemma":0.00091510837,"threshold_uncertainty_score":0.01601857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962303,0.0008435991,0.27437535,0.001191097,0.000072588955,0.00007489188,0.00043620507,0.0004685732,0.026307464],"genre_scores_gemma":[0.9362835,0.00034715392,0.057808902,0.00020872874,0.00009016746,0.00008162609,0.00032643272,0.00009668299,0.004756747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757916,0.0007392766,0.00018639842,0.0005838245,0.0005573281,0.0003540217],"domain_scores_gemma":[0.9839706,0.008325939,0.0017711358,0.0023239127,0.0013742732,0.0022341528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403016,0.0004627972,0.000824809,0.0015818796,0.001673013,0.0035481097,0.0012799681,0.0010441238,0.0034358255],"category_scores_gemma":[0.011950328,0.0008973005,0.0007837703,0.0016122728,0.0038005076,0.0052181403,0.0038445573,0.0018714446,0.00041377186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019932391,0.00005023776,0.0027769685,0.00011580029,0.000031472275,0.00026470298,0.00085861806,0.012657915,0.008809383,0.9579807,0.0015383577,0.01471644],"study_design_scores_gemma":[0.000025144707,0.000042795928,0.00077963265,0.000031266958,0.000017818214,0.00031452638,0.00023816306,0.039643373,0.0030836998,0.9527928,0.0030099957,0.000020797024],"about_ca_topic_score_codex":0.0010282138,"about_ca_topic_score_gemma":0.0012555412,"teacher_disagreement_score":0.0035481097,"about_ca_system_score_codex":0.0018324832,"about_ca_system_score_gemma":0.0007122335,"threshold_uncertainty_score":0.0132956505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.242954,0.0033803908,0.687274,0.0070607327,0.0005000286,0.000071446906,0.0004978106,0.000561482,0.05770005],"genre_scores_gemma":[0.82654756,0.002654477,0.15208404,0.0018204935,0.0009973265,0.00018560498,0.0004099278,0.00040666127,0.014893904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980647,0.00044230826,0.00007538752,0.0005945441,0.00057130854,0.00025171845],"domain_scores_gemma":[0.9927099,0.0037378536,0.00069110474,0.0015542335,0.0007607701,0.00054608827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035254867,0.0008044182,0.0014805243,0.0031689992,0.0014236206,0.004043643,0.0026140532,0.0018204256,0.0038299155],"category_scores_gemma":[0.017613975,0.00071802735,0.0012246416,0.0023807792,0.0049117804,0.01287293,0.004031821,0.0038697182,0.0009358569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055562778,0.000019282543,0.00046790447,0.000052861404,0.000012083819,0.000048913247,0.00011349646,0.004435448,0.0010948079,0.98491293,0.0012749177,0.0075117634],"study_design_scores_gemma":[0.000010264627,0.0000150713695,0.0001549362,0.000014527583,0.000007241792,0.000060968836,0.000033172564,0.023044009,0.00063469604,0.9732106,0.002802739,0.00001172265],"about_ca_topic_score_codex":0.0012280705,"about_ca_topic_score_gemma":0.00081887055,"teacher_disagreement_score":0.004043643,"about_ca_system_score_codex":0.0021856367,"about_ca_system_score_gemma":0.00087522174,"threshold_uncertainty_score":0.01864475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09256928,0.0027320546,0.62268007,0.01381495,0.0040791235,0.00017144787,0.00074393454,0.0012431754,0.261966],"genre_scores_gemma":[0.85491097,0.003938247,0.09664513,0.0061058407,0.0030052867,0.00032053684,0.00079013297,0.0007361307,0.03354777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967007,0.00090633373,0.00017897288,0.0010128913,0.000663719,0.00053737895],"domain_scores_gemma":[0.98945963,0.004793935,0.00051263673,0.002420243,0.002061655,0.00075192243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060409014,0.0007771146,0.0012769945,0.0017366118,0.0042491686,0.0053558713,0.0018290726,0.0024516236,0.014085305],"category_scores_gemma":[0.017414942,0.00073956774,0.0019447069,0.0020451176,0.010681471,0.02040232,0.0055625057,0.006107867,0.00293779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010456878,0.000007755019,0.000088270615,0.00002013092,0.000002753312,0.000033221404,0.00007200329,0.00017391921,0.000104167026,0.9962703,0.0013538352,0.0018632304],"study_design_scores_gemma":[0.0000068982267,0.000011741465,0.000090368536,0.000013639784,0.0000075195776,0.00011422663,0.00007760668,0.0011493778,0.00029645514,0.9941035,0.0041185208,0.000010196367],"about_ca_topic_score_codex":0.00174931,"about_ca_topic_score_gemma":0.0015962739,"teacher_disagreement_score":0.014085305,"about_ca_system_score_codex":0.0018225809,"about_ca_system_score_gemma":0.0015896093,"threshold_uncertainty_score":0.047119975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56410044,0.0008813976,0.42325148,0.00048799522,0.00003571068,0.00010123272,0.0004200816,0.00072293245,0.009998647],"genre_scores_gemma":[0.93921584,0.0005008742,0.056782007,0.00011323033,0.00007082516,0.0001359801,0.00046456495,0.00014859394,0.002568023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.0003379783,0.000043957407,0.00022369681,0.00022074976,0.00020283138],"domain_scores_gemma":[0.98429626,0.012295198,0.0012165364,0.0011140051,0.0005555185,0.00052253413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511354,0.00033191248,0.00045827683,0.0011074118,0.0005665373,0.0012639457,0.0007355108,0.0006621264,0.0018912554],"category_scores_gemma":[0.009852075,0.00046982686,0.00055666716,0.0009865895,0.0013997303,0.0025056025,0.0008478198,0.000896173,0.0003082405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065661443,0.00022866059,0.014482694,0.0005078159,0.00012908732,0.0010566753,0.0007275153,0.31932342,0.045835093,0.53584343,0.0040688803,0.07714012],"study_design_scores_gemma":[0.000045766705,0.00009995424,0.0043367697,0.000036584355,0.000050396884,0.0008470249,0.0001425284,0.4413971,0.010055093,0.53929454,0.0036644964,0.000029773038],"about_ca_topic_score_codex":0.00058203697,"about_ca_topic_score_gemma":0.0012920599,"teacher_disagreement_score":0.0018912554,"about_ca_system_score_codex":0.00075895566,"about_ca_system_score_gemma":0.00042934497,"threshold_uncertainty_score":0.006326854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07020154,0.003298883,0.8608267,0.0042414526,0.00034746702,0.00030761026,0.0013596803,0.001224502,0.058192194],"genre_scores_gemma":[0.8065671,0.0062573887,0.11623046,0.0034675722,0.0018878465,0.0030548004,0.002907993,0.0012799173,0.058346987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512285,0.0015961247,0.00021180445,0.0009316855,0.0012561386,0.0008813818],"domain_scores_gemma":[0.90779227,0.07345274,0.0051735095,0.00558961,0.0041132797,0.0038786356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0090499045,0.0034419522,0.0033330633,0.0062142033,0.0029225617,0.0055808965,0.0060196486,0.0035274774,0.024262311],"category_scores_gemma":[0.06074605,0.0015280923,0.0030664227,0.003975361,0.0068206303,0.012839017,0.005632719,0.007335611,0.003120293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005079234,0.00002996748,0.00036850033,0.00013382548,0.000039730494,0.000085936954,0.00017631607,0.011074279,0.0006240654,0.98141795,0.00263306,0.003365489],"study_design_scores_gemma":[0.00005202607,0.000055710847,0.00038822755,0.00006579504,0.00003466698,0.00013011586,0.000055036122,0.13785051,0.0006035337,0.8588726,0.0018436931,0.000048110334],"about_ca_topic_score_codex":0.0019709377,"about_ca_topic_score_gemma":0.0013914865,"teacher_disagreement_score":0.024262311,"about_ca_system_score_codex":0.0042309887,"about_ca_system_score_gemma":0.0024479015,"threshold_uncertainty_score":0.08116549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78422654,0.00090008636,0.10618899,0.01275112,0.00078744104,0.00007980239,0.00079165096,0.0005749225,0.09369943],"genre_scores_gemma":[0.9785478,0.00025282134,0.01296383,0.0007083433,0.00033640384,0.000065864326,0.00042413987,0.000043508262,0.0066572786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981261,0.00042518403,0.00012702223,0.00049563206,0.00038469347,0.00044127958],"domain_scores_gemma":[0.99481094,0.0026757026,0.00047995948,0.0010050702,0.0005040737,0.00052422367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787884,0.0004610733,0.0009875746,0.0008787978,0.0019166707,0.0027356304,0.0010168338,0.0022977053,0.0089839],"category_scores_gemma":[0.006481428,0.00040712656,0.0009408775,0.0009158192,0.0060396795,0.006912154,0.00322763,0.0026687258,0.0012352896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780732,0.00003972765,0.0014807837,0.00011222387,0.000014708794,0.00020599773,0.00058307406,0.0033564926,0.0018056206,0.97809327,0.005314127,0.0087158615],"study_design_scores_gemma":[0.00003725937,0.000024941344,0.000275189,0.000020866239,0.0000068192467,0.000101620295,0.00022639516,0.0060288734,0.0010218658,0.9879219,0.0043203,0.000013869457],"about_ca_topic_score_codex":0.00081247813,"about_ca_topic_score_gemma":0.0006488115,"teacher_disagreement_score":0.0089839,"about_ca_system_score_codex":0.0010773251,"about_ca_system_score_gemma":0.000816125,"threshold_uncertainty_score":0.030054152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63710105,0.0041214693,0.33853528,0.0032722855,0.0001939106,0.00007525628,0.0006959706,0.00067006104,0.015334689],"genre_scores_gemma":[0.98203975,0.0013350968,0.013898349,0.00021445788,0.00028355807,0.000091945956,0.00025312052,0.00012898649,0.0017547783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990144,0.00035011937,0.00003398119,0.00026176008,0.00018609193,0.00015369777],"domain_scores_gemma":[0.98710513,0.009225915,0.0015017049,0.0007748784,0.000687526,0.0007047884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018278621,0.00054672314,0.00075833395,0.0018161279,0.00072053616,0.0016587977,0.0012004143,0.0009687781,0.0010518929],"category_scores_gemma":[0.017273162,0.00055432005,0.0003926539,0.0007241343,0.002220163,0.0036941129,0.0015805191,0.0010482714,0.00026263867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043519415,0.000092241055,0.014723032,0.00043116754,0.00012294263,0.0005272306,0.00082198944,0.28475308,0.024318757,0.6392132,0.0075787636,0.026982319],"study_design_scores_gemma":[0.00003370145,0.00010579676,0.004931243,0.00007230044,0.0000410788,0.0004557504,0.00016423546,0.6837154,0.005473746,0.30057034,0.0043877456,0.00004866751],"about_ca_topic_score_codex":0.0011054828,"about_ca_topic_score_gemma":0.0007639531,"teacher_disagreement_score":0.0018278621,"about_ca_system_score_codex":0.001376979,"about_ca_system_score_gemma":0.00043755837,"threshold_uncertainty_score":0.009990692},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2439632,0.0025274802,0.6805266,0.0025669285,0.0005553557,0.00011012292,0.0003807496,0.0013187514,0.068050824],"genre_scores_gemma":[0.85132986,0.0013146383,0.12318992,0.0007398608,0.00035993653,0.0003477281,0.00042776228,0.00084159075,0.021448696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951625,0.00013510342,0.000021703385,0.000042841148,0.0002101029,0.00007405386],"domain_scores_gemma":[0.9968225,0.0020119154,0.000263549,0.0002516064,0.00042341277,0.00022700892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350929,0.0010542826,0.00069611456,0.0028176862,0.00069344847,0.0014200344,0.0014083239,0.00097049744,0.0048791487],"category_scores_gemma":[0.009789523,0.00030520806,0.00085024396,0.0008712901,0.0028063888,0.0029986098,0.002152399,0.0023453091,0.0014842765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090197194,0.00007405153,0.0014275366,0.00022439174,0.00003318986,0.00021624392,0.00031112766,0.08501765,0.003837856,0.8879934,0.0040752552,0.016699027],"study_design_scores_gemma":[0.000029319932,0.000019228535,0.0009151825,0.00007702983,0.000022349695,0.0001429184,0.000094430514,0.6489119,0.0030609672,0.34352028,0.0031458186,0.00006050346],"about_ca_topic_score_codex":0.0029852265,"about_ca_topic_score_gemma":0.0034541558,"teacher_disagreement_score":0.0048791487,"about_ca_system_score_codex":0.0018321344,"about_ca_system_score_gemma":0.0008286933,"threshold_uncertainty_score":0.016322374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7313871,0.0044495002,0.08059835,0.0019235659,0.00045599177,0.00005033935,0.0003458607,0.00034507952,0.18044424],"genre_scores_gemma":[0.9883503,0.0004251236,0.0058883284,0.0001411136,0.00009886828,0.000026913876,0.00007007328,0.000041423948,0.0049579325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.000057711564,0.000011609787,0.00005593591,0.000067857276,0.00009416344],"domain_scores_gemma":[0.99952793,0.00017128409,0.00007712711,0.000050741546,0.00007267968,0.00010027252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027642053,0.00040039918,0.00029739455,0.001806976,0.001140004,0.0014816173,0.0006569768,0.0006191207,0.0037281767],"category_scores_gemma":[0.0019140436,0.00018594596,0.00020830373,0.00086796406,0.0015395164,0.0016151667,0.0010298437,0.0007794159,0.0003386301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006172935,0.000015396747,0.0006615286,0.00006136367,0.000005540667,0.0001527398,0.00017241575,0.0044435402,0.0016919482,0.97899866,0.0026249741,0.011110107],"study_design_scores_gemma":[0.0000066896027,0.000014828432,0.00047775806,0.000025651352,0.000007870688,0.00014703309,0.00008000838,0.01667876,0.0009915812,0.97533923,0.0062166154,0.000013873491],"about_ca_topic_score_codex":0.000726733,"about_ca_topic_score_gemma":0.00095691776,"teacher_disagreement_score":0.0037281767,"about_ca_system_score_codex":0.0010428503,"about_ca_system_score_gemma":0.00028085665,"threshold_uncertainty_score":0.0124720335},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13925478,0.0051804716,0.19131838,0.010775357,0.004261019,0.00028760027,0.0012689622,0.0033093926,0.6443441],"genre_scores_gemma":[0.6881425,0.0041790484,0.07074177,0.0039835228,0.0014229754,0.0012470831,0.00161281,0.004442663,0.22422768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937195,0.00013199044,0.000016949369,0.00006722351,0.0002689897,0.00014291427],"domain_scores_gemma":[0.99895966,0.0003784163,0.00008463614,0.00008955477,0.00028151978,0.00020618046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011021291,0.0018565271,0.0010874672,0.0035527237,0.001699253,0.0019777564,0.0022989223,0.001535138,0.027448317],"category_scores_gemma":[0.003102617,0.00037637085,0.0009633156,0.0010415794,0.0035945196,0.0026374075,0.0019706562,0.0039300034,0.0054946863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010006594,0.00007132605,0.00030209316,0.00023046958,0.00001726494,0.00042997254,0.00040367633,0.005532534,0.004541989,0.95785767,0.018551858,0.011960996],"study_design_scores_gemma":[0.00007495473,0.00005365025,0.0026073514,0.00041975483,0.00004346814,0.00072880497,0.00048376765,0.24932258,0.006502385,0.6930806,0.046480816,0.0002019644],"about_ca_topic_score_codex":0.0063996813,"about_ca_topic_score_gemma":0.011182992,"teacher_disagreement_score":0.027448317,"about_ca_system_score_codex":0.0025079004,"about_ca_system_score_gemma":0.0014940014,"threshold_uncertainty_score":0.09182382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.862172,0.00075281516,0.122765325,0.0013832003,0.000051600404,0.0000377839,0.00088484475,0.0001689421,0.011783509],"genre_scores_gemma":[0.9584022,0.0005547088,0.03720811,0.000108609565,0.00006412953,0.00005327518,0.0005516275,0.000048399572,0.0030088627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997664,0.00005248859,0.000008105775,0.00006783944,0.000053136642,0.000052023483],"domain_scores_gemma":[0.9984327,0.00082333025,0.00031701353,0.00011733374,0.00012844554,0.00018127444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031739895,0.00025467842,0.00032206325,0.00060406566,0.00080067007,0.0007737896,0.00067044573,0.0006801138,0.0024533852],"category_scores_gemma":[0.0045903195,0.00020940058,0.00023355347,0.0007568399,0.000825471,0.0023113075,0.0008284047,0.0005817184,0.00026081855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006346507,0.00011756136,0.008505217,0.00067534664,0.00010491544,0.0010527672,0.0006567642,0.15451415,0.019683296,0.7458602,0.009074884,0.059120238],"study_design_scores_gemma":[0.000059119706,0.00013734095,0.003312541,0.000048586087,0.000031888525,0.00069658214,0.00029730515,0.21647577,0.004717115,0.7657368,0.008448993,0.00003788893],"about_ca_topic_score_codex":0.0006500859,"about_ca_topic_score_gemma":0.0008205942,"teacher_disagreement_score":0.0024533852,"about_ca_system_score_codex":0.00047793722,"about_ca_system_score_gemma":0.00048713636,"threshold_uncertainty_score":0.008207381},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002531012,0.8496402,0.019035773,0.018037273,0.021978011,0.000050317332,0.00056821504,0.00052327104,0.08763585],"genre_scores_gemma":[0.03405739,0.71202034,0.0257777,0.005389971,0.03275601,0.00012871876,0.0015113809,0.00093880197,0.1874197],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968266,0.00006478721,0.000015146299,0.00010581221,0.000102936305,0.000028604558],"domain_scores_gemma":[0.99947923,0.0002524445,0.00004842309,0.00004658295,0.00009668104,0.00007679791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048494246,0.0018842734,0.001118964,0.0032893303,0.00069335295,0.00205946,0.0010191149,0.0009468934,0.021900779],"category_scores_gemma":[0.0010208144,0.00073870126,0.0007631086,0.0048581,0.0017565524,0.0041580815,0.0018496299,0.0030313218,0.015415148],"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.00004408528,0.000028307506,0.0002758931,0.0009616629,0.0000422146,0.00006866039,0.00016284098,0.0014648157,0.00096930383,0.065911904,0.7360259,0.1940444],"study_design_scores_gemma":[0.000008810444,0.000031922056,0.0011026277,0.00029288506,0.000020595495,0.0004189753,0.00012450393,0.0013664175,0.00044546917,0.07156238,0.92459446,0.000030952902],"about_ca_topic_score_codex":0.0023498398,"about_ca_topic_score_gemma":0.0028161472,"teacher_disagreement_score":0.021900779,"about_ca_system_score_codex":0.0018948194,"about_ca_system_score_gemma":0.0006052087,"threshold_uncertainty_score":0.07326537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6602718,0.0005725431,0.3018978,0.0008253676,0.000054249056,0.00006592568,0.0005179607,0.00026592828,0.03552846],"genre_scores_gemma":[0.9538793,0.00025246406,0.040553562,0.000113258335,0.00005338427,0.000058889425,0.00041347818,0.00006267204,0.0046132016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995228,0.00008846594,0.000022570679,0.00010947488,0.00011809691,0.000138698],"domain_scores_gemma":[0.9981875,0.0008563946,0.00023402447,0.00023693191,0.00019535676,0.0002896817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593073,0.0003298573,0.00040110707,0.000990222,0.0012137654,0.001399008,0.0006874032,0.0007450808,0.0041918987],"category_scores_gemma":[0.0038946634,0.00046300367,0.00051492493,0.00074098184,0.000939017,0.0019511953,0.0011508606,0.0008771315,0.00032296783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019332951,0.000065529355,0.0019819203,0.00014979807,0.000027604458,0.00039960933,0.0006534813,0.037266154,0.018933363,0.91803026,0.003269054,0.019029966],"study_design_scores_gemma":[0.000048601683,0.000047857033,0.001261858,0.00003539427,0.000020438698,0.00035376856,0.0003000095,0.19351174,0.0060368846,0.7930668,0.0052986955,0.00001797914],"about_ca_topic_score_codex":0.0015106803,"about_ca_topic_score_gemma":0.0020261565,"teacher_disagreement_score":0.0041918987,"about_ca_system_score_codex":0.00082755025,"about_ca_system_score_gemma":0.00035418588,"threshold_uncertainty_score":0.014023304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72827095,0.0011450017,0.23100854,0.0008572535,0.000059295922,0.00013498333,0.0016128828,0.0011194936,0.035791554],"genre_scores_gemma":[0.9762818,0.0005075242,0.015758296,0.0002764355,0.00013267898,0.00010728718,0.00109038,0.00016812934,0.0056772917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993678,0.00009604804,0.000028353648,0.00022995177,0.00013832949,0.00013952894],"domain_scores_gemma":[0.9964282,0.0018804471,0.00052107713,0.00051078567,0.00026417413,0.00039527568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079958397,0.0003570884,0.0005524202,0.001415957,0.0009514834,0.0010661031,0.00061282003,0.0006091598,0.0041270247],"category_scores_gemma":[0.0054498515,0.00033053444,0.00059936044,0.0007508544,0.0014718552,0.0021430138,0.0012244759,0.0011752167,0.00037950536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018830893,0.000077999604,0.005326261,0.00021180502,0.00007118701,0.00047142647,0.001019138,0.019358912,0.014402926,0.90483904,0.0068711145,0.047161873],"study_design_scores_gemma":[0.0000426652,0.00011847208,0.008078982,0.000086537104,0.000075246,0.0015108979,0.00039637808,0.096129306,0.006556995,0.8663869,0.020574622,0.00004299274],"about_ca_topic_score_codex":0.00081582373,"about_ca_topic_score_gemma":0.0007492233,"teacher_disagreement_score":0.0041270247,"about_ca_system_score_codex":0.0005769614,"about_ca_system_score_gemma":0.00031309752,"threshold_uncertainty_score":0.0138062835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7315653,0.0030034315,0.18389043,0.00984253,0.00052325655,0.00012374377,0.00090307597,0.00059813756,0.06955006],"genre_scores_gemma":[0.96377856,0.001714411,0.023612415,0.0009993964,0.00082402024,0.00016930571,0.00096036843,0.00017958779,0.007762007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495465,0.0011077381,0.0002703133,0.0013866337,0.0012086686,0.0010720297],"domain_scores_gemma":[0.9596404,0.02662116,0.0038445618,0.006043645,0.0018350222,0.0020151576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005893594,0.0010989294,0.002462242,0.0031861193,0.0039945543,0.0044591054,0.002777901,0.0031260015,0.010567223],"category_scores_gemma":[0.035857536,0.0012031301,0.0024838203,0.0031238536,0.008459939,0.01428182,0.0062656077,0.0050732596,0.0013256245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007420262,0.00013632295,0.007885363,0.00029393262,0.00009943323,0.00060685794,0.0010033383,0.046163004,0.0025024,0.9071633,0.009262723,0.02414113],"study_design_scores_gemma":[0.000084181105,0.00009614866,0.001482885,0.000078685196,0.00004305101,0.00045916965,0.00035756332,0.061501827,0.0014643627,0.92982227,0.004557285,0.000052523174],"about_ca_topic_score_codex":0.0018225835,"about_ca_topic_score_gemma":0.0011747003,"teacher_disagreement_score":0.010567223,"about_ca_system_score_codex":0.0022619232,"about_ca_system_score_gemma":0.0010757647,"threshold_uncertainty_score":0.03535086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83042055,0.0002695488,0.15906532,0.0020933738,0.000048099286,0.000066807595,0.0005650694,0.0005319733,0.0069391336],"genre_scores_gemma":[0.9876188,0.00017951454,0.010079154,0.00014651647,0.00007554056,0.00010054969,0.00040772365,0.000063763255,0.0013284406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986386,0.00045698657,0.00004925087,0.00036880025,0.00027729402,0.0002090699],"domain_scores_gemma":[0.97106844,0.022681005,0.0022849615,0.0021150173,0.0008347765,0.0010157092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030982473,0.00031589225,0.00083686033,0.0017807878,0.0007634203,0.0015388025,0.0018376557,0.0012175263,0.0024481323],"category_scores_gemma":[0.0318842,0.0005561056,0.0006190257,0.0010352258,0.0034457205,0.0036775724,0.0016648688,0.0015010386,0.00024606104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009383582,0.00017429973,0.07423803,0.0003780042,0.00017290209,0.0016357814,0.0010667982,0.25798184,0.024856627,0.60301393,0.0058233375,0.029720066],"study_design_scores_gemma":[0.00006677941,0.0001742124,0.0154776005,0.00005612819,0.000054227112,0.0007412954,0.00025761806,0.8262634,0.004934349,0.15041398,0.0014583732,0.00010193682],"about_ca_topic_score_codex":0.0033809557,"about_ca_topic_score_gemma":0.0032895727,"teacher_disagreement_score":0.0033809557,"about_ca_system_score_codex":0.0015416193,"about_ca_system_score_gemma":0.00058334187,"threshold_uncertainty_score":0.016385317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49679637,0.0002517666,0.49853623,0.001247457,0.00001898243,0.00014453368,0.0008386444,0.00085591903,0.0013100813],"genre_scores_gemma":[0.912811,0.00013326385,0.08468222,0.00015491419,0.000063660926,0.00013245648,0.0013660821,0.00016281646,0.0004935966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939355,0.002302283,0.00034946573,0.0017576457,0.0011858803,0.00046921553],"domain_scores_gemma":[0.83310986,0.1395181,0.0085051255,0.014490004,0.0030640534,0.0013129519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006656358,0.00083644217,0.0018630887,0.0018728516,0.00076860085,0.0024738547,0.0033279401,0.0024721422,0.001888316],"category_scores_gemma":[0.08317092,0.00093763793,0.0013270614,0.0015556078,0.003554339,0.007086302,0.0027186999,0.0036787973,0.00025273144],"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.0008631065,0.0002747366,0.038574357,0.00035456952,0.00034438004,0.00038148017,0.0004205677,0.83005106,0.016357014,0.07386604,0.0017025165,0.036810234],"study_design_scores_gemma":[0.000021615588,0.000055992135,0.0022426103,0.000014201721,0.000020391235,0.00008569235,0.00004824297,0.9132847,0.00399694,0.079968214,0.00024207075,0.000019324565],"about_ca_topic_score_codex":0.0032558832,"about_ca_topic_score_gemma":0.0022600591,"teacher_disagreement_score":0.006656358,"about_ca_system_score_codex":0.0029033083,"about_ca_system_score_gemma":0.0011270778,"threshold_uncertainty_score":0.035202622},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061990606,0.004490754,0.024493659,0.11688829,0.8240265,0.0000706639,0.0016517623,0.0029891657,0.024769304],"genre_scores_gemma":[0.061547443,0.012299525,0.058248278,0.18920293,0.3102517,0.0005939536,0.005866278,0.014171998,0.34781787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948242,0.0012418679,0.00047052407,0.0011431298,0.0019660273,0.00035423064],"domain_scores_gemma":[0.9842121,0.0056383274,0.0004161988,0.0019142772,0.007311779,0.0005072549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036617715,0.0019563362,0.0021735488,0.0018918351,0.0024489928,0.0035517714,0.0024328309,0.0030826414,0.061641507],"category_scores_gemma":[0.061075594,0.00096613273,0.0018086858,0.001682776,0.0029458068,0.0044823186,0.0027163324,0.006765581,0.041403536],"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.000017786131,0.0000072580215,0.000043129447,0.00006975948,0.000011486163,0.0001076217,0.000017962062,0.00021579248,0.00006566773,0.0067363684,0.98292726,0.009780022],"study_design_scores_gemma":[0.0000426893,0.00003682161,0.0006198005,0.00021563203,0.000054432883,0.000596437,0.000045807363,0.0027839246,0.0007307267,0.04789419,0.9468906,0.000088849454],"about_ca_topic_score_codex":0.0103632165,"about_ca_topic_score_gemma":0.012509263,"teacher_disagreement_score":0.061641507,"about_ca_system_score_codex":0.0050981296,"about_ca_system_score_gemma":0.0026313048,"threshold_uncertainty_score":0.20621139},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50969046,0.0010195635,0.43406492,0.0023789357,0.00012486802,0.00010229045,0.0006928365,0.00066041196,0.051265713],"genre_scores_gemma":[0.96446645,0.00037992134,0.027576415,0.00039152484,0.00016454761,0.00014461656,0.00030993644,0.000109714834,0.0064569446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944407,0.0000953175,0.000026755879,0.00019302928,0.00016744273,0.00007334626],"domain_scores_gemma":[0.9971685,0.0014878672,0.00037106703,0.00023593666,0.0004615549,0.00027507712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993885,0.0003426459,0.00047559448,0.0015514755,0.0014626413,0.0016155143,0.0011088474,0.0009348624,0.0063682063],"category_scores_gemma":[0.0053511714,0.0002929544,0.00065729144,0.001190753,0.0018868346,0.0033384506,0.0018283068,0.0014812894,0.0010135936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089337555,0.000026974634,0.0012798334,0.00009931608,0.000029555347,0.00015952485,0.0005209384,0.008006377,0.0076516042,0.96409667,0.0027325668,0.015307186],"study_design_scores_gemma":[0.000012297409,0.000036898404,0.00074612745,0.000016530243,0.000010182202,0.00021161274,0.00009535378,0.042231742,0.0025569445,0.95100695,0.0030572282,0.000018151979],"about_ca_topic_score_codex":0.0008450642,"about_ca_topic_score_gemma":0.0004927647,"teacher_disagreement_score":0.0063682063,"about_ca_system_score_codex":0.001121585,"about_ca_system_score_gemma":0.00029760555,"threshold_uncertainty_score":0.021303833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59497684,0.00054786296,0.3913942,0.000505425,0.000045756915,0.00004218228,0.00027449295,0.00021792836,0.011995306],"genre_scores_gemma":[0.9700528,0.00029957216,0.02733729,0.00004751397,0.00005641859,0.00005173347,0.00015188067,0.000068470385,0.0019343136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983126,0.00036136742,0.00008504689,0.0003165262,0.0005504203,0.00037406967],"domain_scores_gemma":[0.98991966,0.0059828707,0.0014224625,0.0014601856,0.0005475346,0.0006672901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019303912,0.0007225282,0.0010139588,0.0019386773,0.00096261513,0.0020908616,0.0019116785,0.0006997422,0.0032558972],"category_scores_gemma":[0.012018635,0.00039804686,0.0005752797,0.0016712387,0.00363968,0.005468875,0.0035915782,0.0017549954,0.00043782665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000453095,0.00013834322,0.014652446,0.00021185503,0.00006421543,0.0005372044,0.00044788638,0.07738073,0.01779499,0.8527178,0.0013474292,0.034253996],"study_design_scores_gemma":[0.000028361334,0.0001895317,0.0020758286,0.000046233592,0.00004209974,0.0006032068,0.00016512591,0.33739093,0.025665719,0.630638,0.0031057561,0.000049154987],"about_ca_topic_score_codex":0.0004143078,"about_ca_topic_score_gemma":0.0005240638,"teacher_disagreement_score":0.0032558972,"about_ca_system_score_codex":0.001246648,"about_ca_system_score_gemma":0.0005558189,"threshold_uncertainty_score":0.010892093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7983863,0.0015757269,0.16216475,0.0023911702,0.00013479828,0.00007803327,0.0004919807,0.0006973606,0.034079894],"genre_scores_gemma":[0.97963595,0.00035240478,0.015803661,0.00022745629,0.00007525612,0.00004895094,0.00013857726,0.00004519742,0.0036725204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852115,0.00037288826,0.00010790204,0.0003780311,0.000371389,0.00024869296],"domain_scores_gemma":[0.9931531,0.0034761275,0.0009633402,0.001053287,0.00063805137,0.0007161043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017501944,0.00024915603,0.00061696896,0.0019229769,0.0016497548,0.002293592,0.0011895887,0.0010752395,0.005707403],"category_scores_gemma":[0.00907014,0.0006043,0.0005481207,0.002196772,0.002987893,0.007891431,0.003193102,0.0012481551,0.00042823845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001401949,0.000042105425,0.0015318285,0.000094743256,0.000017279703,0.00020542485,0.00044352288,0.005209004,0.0022809731,0.97819114,0.0013837862,0.010459955],"study_design_scores_gemma":[0.000019267018,0.000019724845,0.00035903582,0.000021377044,0.00000892029,0.00013731758,0.00015754215,0.012611927,0.0013919963,0.982851,0.002409756,0.000012225531],"about_ca_topic_score_codex":0.0012042101,"about_ca_topic_score_gemma":0.0011789595,"teacher_disagreement_score":0.005707403,"about_ca_system_score_codex":0.0019112144,"about_ca_system_score_gemma":0.00067792484,"threshold_uncertainty_score":0.019093215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18355899,0.0023877057,0.727136,0.00883487,0.00050677836,0.00022850896,0.003049001,0.0023678527,0.07193028],"genre_scores_gemma":[0.8448857,0.0018227117,0.13143773,0.003250863,0.00042635412,0.00046838788,0.002210164,0.0009456866,0.014552422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929194,0.0020543656,0.0003693747,0.0017325497,0.002104427,0.0008198806],"domain_scores_gemma":[0.94812876,0.035625845,0.0026667796,0.0089009125,0.0025603953,0.0021174017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004305506,0.0010661138,0.0022550195,0.0018291449,0.0037162562,0.005577108,0.0029478793,0.002889603,0.013891316],"category_scores_gemma":[0.051946867,0.0013050082,0.0015491872,0.0030287954,0.0031212869,0.010965751,0.0050134133,0.005155904,0.0024649044],"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.00095520855,0.00015520935,0.001363213,0.0005298428,0.000100764206,0.00028764573,0.000800607,0.03216858,0.0080063185,0.8989188,0.014316491,0.042397313],"study_design_scores_gemma":[0.00008164382,0.0001063674,0.00041768377,0.00006084155,0.000047100646,0.00026172007,0.00014542777,0.085787825,0.0026368548,0.90263903,0.00776508,0.000050472278],"about_ca_topic_score_codex":0.0036513812,"about_ca_topic_score_gemma":0.0020256995,"teacher_disagreement_score":0.013891316,"about_ca_system_score_codex":0.0023553718,"about_ca_system_score_gemma":0.0018524879,"threshold_uncertainty_score":0.04647106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49336064,0.0025877017,0.44763502,0.0043338514,0.00026068397,0.0002515094,0.0019102758,0.0020367026,0.04762359],"genre_scores_gemma":[0.93009347,0.0012061419,0.05400745,0.0010290522,0.00043565643,0.00095714384,0.0016754514,0.000649898,0.009945625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956091,0.0015649098,0.00016218008,0.0011439227,0.0009937965,0.0005261334],"domain_scores_gemma":[0.9503784,0.038046457,0.0038118851,0.004055778,0.0017048739,0.0020026579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063383146,0.001980348,0.0025823764,0.0044218134,0.0019625085,0.0031574788,0.004720423,0.0021933904,0.0100668045],"category_scores_gemma":[0.050807625,0.00096847076,0.00312515,0.0021698817,0.0048755845,0.007174049,0.0036695981,0.005047784,0.0017042307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003825982,0.00015694673,0.00417345,0.0002451605,0.0002134164,0.000548078,0.00056838087,0.040027466,0.004292369,0.92921394,0.005785455,0.014392755],"study_design_scores_gemma":[0.000118033844,0.0001009987,0.0013690058,0.00006283759,0.000052307765,0.0004203021,0.00007662311,0.21935084,0.0018968354,0.7746189,0.0018552223,0.0000779802],"about_ca_topic_score_codex":0.0010745979,"about_ca_topic_score_gemma":0.000728804,"teacher_disagreement_score":0.0100668045,"about_ca_system_score_codex":0.0028150573,"about_ca_system_score_gemma":0.00095815945,"threshold_uncertainty_score":0.033676803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33985287,0.0007693568,0.6369054,0.0010788433,0.00015167444,0.00052895676,0.0014150616,0.00404743,0.015250337],"genre_scores_gemma":[0.47806236,0.00039943733,0.5065831,0.00028900534,0.000056601762,0.00023283779,0.0045352397,0.0005407008,0.00930077],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988642,0.0002124376,0.00008762049,0.000414052,0.00018875826,0.0002330431],"domain_scores_gemma":[0.9973732,0.0010051096,0.00022860903,0.00091100833,0.00028996228,0.00019208007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080439134,0.0010266638,0.0013065683,0.0012794537,0.00086688664,0.0016451315,0.0018217587,0.0012337116,0.006844588],"category_scores_gemma":[0.003940216,0.0008790332,0.0015359451,0.0016249005,0.0008137562,0.0031324155,0.002625104,0.0014439992,0.002033366],"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.0021055066,0.0011070138,0.014651036,0.0014782842,0.00050668936,0.0010780944,0.0015613415,0.14492303,0.14808522,0.10619818,0.029123375,0.5491823],"study_design_scores_gemma":[0.00034214367,0.0006350071,0.0029897254,0.00014636185,0.00030887593,0.0016113752,0.0013618994,0.67504716,0.051929366,0.24035649,0.025197094,0.000074422205],"about_ca_topic_score_codex":0.0012292232,"about_ca_topic_score_gemma":0.0031842024,"teacher_disagreement_score":0.006844588,"about_ca_system_score_codex":0.0008003657,"about_ca_system_score_gemma":0.0013090812,"threshold_uncertainty_score":0.022897422},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011068759,0.17144316,0.038405694,0.31811604,0.03424431,0.00004653291,0.00072161574,0.00092938857,0.42502457],"genre_scores_gemma":[0.37854415,0.08483429,0.02092705,0.09182141,0.019089686,0.00010664501,0.00046986097,0.0008356331,0.4033712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990301,0.00025222302,0.000040699004,0.00028700873,0.00030537765,0.000084609346],"domain_scores_gemma":[0.99862885,0.00056430645,0.000106484884,0.000110180066,0.0003776643,0.00021265366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011118954,0.00049556786,0.00062960613,0.0010090575,0.002625316,0.00271923,0.0003970195,0.0012980946,0.017043663],"category_scores_gemma":[0.0061189374,0.00029014423,0.00029537024,0.0007876896,0.003107519,0.0052089356,0.0014292329,0.0039513814,0.008035258],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006326246,0.00002421376,0.00032813576,0.00010732681,0.000012228309,0.00016618932,0.0004568893,0.00033114644,0.00031014605,0.54832816,0.40574217,0.044130128],"study_design_scores_gemma":[0.00001034226,0.000019344876,0.00020522572,0.00014670809,0.0000051965185,0.00033403377,0.00014966272,0.00039637563,0.0003534497,0.22910467,0.7692496,0.000025331787],"about_ca_topic_score_codex":0.0023836337,"about_ca_topic_score_gemma":0.0023341486,"teacher_disagreement_score":0.017043663,"about_ca_system_score_codex":0.0017556121,"about_ca_system_score_gemma":0.0012343685,"threshold_uncertainty_score":0.05701667},"labels":[],"label_agreement":null},{"id":"W2913888525","doi":"10.1017/s0963548306007541","title":"Rayleigh Matroids","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Binary number; Matroid partitioning; Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","score_opus":0.05178645719083579,"score_gpt":0.3178471076443546,"score_spread":0.2660606504535188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913888525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28481543,0.0014174626,0.62884384,0.0014361413,0.00017387405,0.00017678879,0.0010507631,0.0006505529,0.08143511],"genre_scores_gemma":[0.9171931,0.00090525416,0.055193856,0.00039407835,0.00033805013,0.00016228131,0.00059310044,0.00009894925,0.025121303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933016,0.00012292157,0.00003853723,0.00016645805,0.00021359474,0.00012837097],"domain_scores_gemma":[0.9985959,0.0004611299,0.00030375057,0.00020505492,0.00028968055,0.00014444541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365456,0.0005378233,0.00050588895,0.0007643208,0.00070090115,0.0016698176,0.0007785915,0.00061996246,0.007164749],"category_scores_gemma":[0.0019674422,0.00030683607,0.000513425,0.00057307835,0.0010570639,0.0026033684,0.0012372071,0.0010723701,0.0011335555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008128049,0.00002858219,0.0009663114,0.00009179279,0.00002207677,0.00018828982,0.00019493191,0.015533667,0.00790301,0.9496801,0.0027828587,0.022527065],"study_design_scores_gemma":[0.000030828778,0.000113561066,0.0013639953,0.00003664033,0.000023570501,0.0009983849,0.00023159343,0.14152323,0.007112643,0.8218814,0.026648508,0.000035662117],"about_ca_topic_score_codex":0.00062211754,"about_ca_topic_score_gemma":0.0006169715,"teacher_disagreement_score":0.007164749,"about_ca_system_score_codex":0.00060291355,"about_ca_system_score_gemma":0.00028381328,"threshold_uncertainty_score":0.023968458},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48666278,0.0011166264,0.48744813,0.0010457771,0.00017806946,0.00014717312,0.00023401498,0.00038992442,0.022777539],"genre_scores_gemma":[0.9225587,0.00084771315,0.065334596,0.00020597014,0.00016653664,0.00029202708,0.00018035657,0.00022426095,0.010189807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987827,0.00043168044,0.00007134063,0.00020997094,0.00037714117,0.0001271007],"domain_scores_gemma":[0.9957632,0.0025756697,0.00043101038,0.0005913752,0.00029984533,0.00033890942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294682,0.00074274215,0.0007712256,0.001085483,0.00084478804,0.0015338449,0.001016395,0.0008981888,0.004501063],"category_scores_gemma":[0.009699238,0.00033613064,0.0005813016,0.0011828701,0.0016483158,0.003322485,0.0024956628,0.0012253119,0.0005722471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003758088,0.0001293549,0.0014449105,0.00019852367,0.00004722137,0.000577225,0.0006044986,0.24332182,0.01897932,0.6908252,0.0023028634,0.041193135],"study_design_scores_gemma":[0.00003956787,0.00015418416,0.0006909488,0.000027239945,0.000008760229,0.0003276035,0.00020975785,0.59678006,0.0044096317,0.39402494,0.0032995027,0.000027773813],"about_ca_topic_score_codex":0.0007174764,"about_ca_topic_score_gemma":0.000353102,"teacher_disagreement_score":0.004501063,"about_ca_system_score_codex":0.0013850181,"about_ca_system_score_gemma":0.00052106875,"threshold_uncertainty_score":0.015057623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5533393,0.0032428252,0.4088416,0.008419298,0.00028856893,0.00015923096,0.0034393151,0.0008928773,0.021377046],"genre_scores_gemma":[0.7569037,0.002004633,0.22817583,0.00069531635,0.0006388418,0.0003414042,0.0041195443,0.00045380273,0.006666923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969855,0.0006825202,0.0002554091,0.0009745145,0.0006811527,0.00042089733],"domain_scores_gemma":[0.9753043,0.018289676,0.002092435,0.0018081015,0.001244314,0.0012612102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028767884,0.0011038493,0.0019872587,0.002805703,0.0024963266,0.006908525,0.004085485,0.002369209,0.0067666415],"category_scores_gemma":[0.025661305,0.0014374952,0.0015987394,0.0034878766,0.004526687,0.012679816,0.0029417244,0.002776207,0.0007421831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015934879,0.0003530074,0.017593488,0.0010953731,0.00019275515,0.00031168928,0.0011853972,0.25540853,0.0075921835,0.5454219,0.019549156,0.14970312],"study_design_scores_gemma":[0.00021091943,0.00015915875,0.0032814427,0.00011779,0.000090271045,0.0006211378,0.00049081014,0.44532454,0.0044619576,0.53714985,0.007985671,0.00010637138],"about_ca_topic_score_codex":0.003045309,"about_ca_topic_score_gemma":0.0027745941,"teacher_disagreement_score":0.006908525,"about_ca_system_score_codex":0.0030664722,"about_ca_system_score_gemma":0.0012798053,"threshold_uncertainty_score":0.022636712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52112865,0.001855209,0.41054645,0.0023538822,0.00045278788,0.00006308489,0.00040379044,0.000965254,0.062230825],"genre_scores_gemma":[0.9277935,0.0005045739,0.060526893,0.0005522749,0.0004128785,0.000119045726,0.00024420983,0.00027188266,0.009574665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834454,0.00035712894,0.00012439581,0.0003352273,0.00054572325,0.00029303486],"domain_scores_gemma":[0.99492514,0.0027236023,0.00064568233,0.0007328694,0.0005134686,0.0004592101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018859043,0.00064569357,0.00068727223,0.0014187754,0.0012587503,0.002155452,0.0011443611,0.00073844194,0.0037812162],"category_scores_gemma":[0.009023289,0.000568103,0.0011349515,0.0012238753,0.0035221048,0.005317993,0.0027238373,0.0026495466,0.0009248322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016669865,0.0000436223,0.0016543632,0.0001032183,0.000016937958,0.0004524033,0.00036570342,0.0060016033,0.0061105588,0.95990556,0.0021416596,0.023037719],"study_design_scores_gemma":[0.000019088136,0.00010866042,0.0012067647,0.000040209994,0.000018446559,0.00073657645,0.00010567405,0.040187642,0.0063763317,0.94563156,0.005531971,0.000037094233],"about_ca_topic_score_codex":0.00050845207,"about_ca_topic_score_gemma":0.000318876,"teacher_disagreement_score":0.0037812162,"about_ca_system_score_codex":0.0012137752,"about_ca_system_score_gemma":0.0005924959,"threshold_uncertainty_score":0.0126494765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79701316,0.00044961958,0.19343625,0.0007264274,0.00005134035,0.00012663972,0.0005742802,0.00084382336,0.0067785624],"genre_scores_gemma":[0.9743635,0.00023351947,0.0218116,0.0001279131,0.000041684547,0.00011609714,0.00035271657,0.000121175915,0.0028317827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986646,0.00042939265,0.00007233118,0.0003518364,0.00024849016,0.00023331516],"domain_scores_gemma":[0.97348714,0.017788256,0.0032355255,0.002855762,0.0013250726,0.0013081946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029108883,0.00034625147,0.0006664949,0.002142982,0.0010410849,0.0018050084,0.0014641957,0.0009734937,0.003542438],"category_scores_gemma":[0.025955008,0.00074656913,0.00065147964,0.0010742669,0.0026845299,0.0038850335,0.0011025639,0.0013188897,0.00045508638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012120632,0.0003357771,0.032913778,0.00048811806,0.00013695884,0.0010281631,0.0010060689,0.28779244,0.02965934,0.6017395,0.005733832,0.03795401],"study_design_scores_gemma":[0.00008268032,0.00020602114,0.0057410244,0.000075641474,0.000036861195,0.00047863042,0.00016801077,0.6634137,0.0062285876,0.32107568,0.0024391708,0.000054022967],"about_ca_topic_score_codex":0.0018125129,"about_ca_topic_score_gemma":0.0026231308,"teacher_disagreement_score":0.003542438,"about_ca_system_score_codex":0.0023634837,"about_ca_system_score_gemma":0.0006675495,"threshold_uncertainty_score":0.017148376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501517,0.0007691792,0.03509789,0.00014958462,0.000026092088,0.000028573975,0.0003034899,0.00009971699,0.013373892],"genre_scores_gemma":[0.9884282,0.00034409677,0.009117274,0.000017058668,0.000032745724,0.000018611303,0.00025649022,0.00002294755,0.0017625801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.00013893555,0.00009391548,0.00027276503,0.00036015702,0.00018087843],"domain_scores_gemma":[0.99507785,0.0026196798,0.00084175024,0.0006600056,0.0004893529,0.0003113201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577737,0.00047240703,0.00075092237,0.005158989,0.0012309579,0.0027941945,0.0007844567,0.0007197699,0.005811223],"category_scores_gemma":[0.005716316,0.0003016729,0.000392466,0.003660843,0.0019761417,0.005182052,0.0013319004,0.0008659298,0.00046483806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007982863,0.0001643974,0.10109162,0.00067906117,0.00017055786,0.0021387984,0.002108517,0.048609708,0.035180237,0.6836511,0.003890468,0.12151726],"study_design_scores_gemma":[0.00004193228,0.00013553086,0.029236393,0.00014878169,0.00009728557,0.0031640108,0.0007837763,0.1259262,0.024064844,0.8039349,0.012344386,0.00012198296],"about_ca_topic_score_codex":0.0011032767,"about_ca_topic_score_gemma":0.0010543464,"teacher_disagreement_score":0.005811223,"about_ca_system_score_codex":0.0010918358,"about_ca_system_score_gemma":0.00024787558,"threshold_uncertainty_score":0.019440472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87062216,0.0004748793,0.114403844,0.00067402166,0.00004436578,0.00007354705,0.000731555,0.00049618306,0.012479526],"genre_scores_gemma":[0.96719414,0.00019341859,0.027900344,0.00014493072,0.000018131472,0.000037069945,0.00049036415,0.000083639985,0.0039380006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992415,0.0001111117,0.00003274691,0.00023752254,0.00019572816,0.00018138826],"domain_scores_gemma":[0.9959565,0.0016326511,0.0006795158,0.00071899773,0.0005830878,0.00042926066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033537907,0.0005031885,0.0006730892,0.0010503613,0.0009658975,0.0014600153,0.0015305089,0.0009234111,0.0048288414],"category_scores_gemma":[0.0029558784,0.0007175533,0.00060531835,0.0012878408,0.001402051,0.0017663151,0.0018302648,0.0011191815,0.0005335263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011271408,0.0002368937,0.012061741,0.0007164016,0.00020769413,0.0012469601,0.0014036178,0.2453171,0.18616,0.48981878,0.0084558865,0.053247783],"study_design_scores_gemma":[0.00014901567,0.0002604065,0.01276676,0.00012436984,0.0001574212,0.0014386926,0.00067156483,0.34515643,0.06695306,0.55410504,0.01807105,0.00014630344],"about_ca_topic_score_codex":0.0042678127,"about_ca_topic_score_gemma":0.0053210915,"teacher_disagreement_score":0.0048288414,"about_ca_system_score_codex":0.0020461192,"about_ca_system_score_gemma":0.000553945,"threshold_uncertainty_score":0.01615411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099629864,0.0031641466,0.7075464,0.009153234,0.000847911,0.00022706567,0.0033519955,0.0009848902,0.17509446],"genre_scores_gemma":[0.881664,0.0024884508,0.0646881,0.0028836597,0.0012723,0.0005569651,0.0018641279,0.00055101357,0.044031464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927699,0.0021520099,0.00033668216,0.0011817343,0.002225348,0.0013342644],"domain_scores_gemma":[0.96822304,0.02221354,0.0016630964,0.002911816,0.003352493,0.0016360129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006474627,0.0009669302,0.0019077747,0.0027276494,0.0020895724,0.0041238978,0.0035223104,0.0020578916,0.023570742],"category_scores_gemma":[0.036950123,0.00081641553,0.0013206966,0.0032291154,0.0036132634,0.015584357,0.0045370637,0.0066309883,0.004193573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020510197,0.00005199765,0.0006747204,0.0001444462,0.000024022234,0.000118390635,0.00017392938,0.0065163774,0.0016447096,0.9716017,0.007727667,0.011117052],"study_design_scores_gemma":[0.000044373,0.000030307207,0.0005734707,0.000045310313,0.000019732901,0.00011460804,0.00006027434,0.08675885,0.0009200654,0.9078262,0.003575316,0.00003154187],"about_ca_topic_score_codex":0.003682884,"about_ca_topic_score_gemma":0.0022265299,"teacher_disagreement_score":0.023570742,"about_ca_system_score_codex":0.003994357,"about_ca_system_score_gemma":0.0013901328,"threshold_uncertainty_score":0.078852},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15574431,0.0002809885,0.8365708,0.0011402979,0.000048431957,0.00007934902,0.00018711087,0.00020279648,0.005745944],"genre_scores_gemma":[0.9291707,0.00021639411,0.068089485,0.00017651133,0.000113083755,0.00008585263,0.00021112629,0.00005711039,0.0018796613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602807,0.0016050978,0.00013638152,0.000770914,0.0010670071,0.000392509],"domain_scores_gemma":[0.9811204,0.012817956,0.0023272755,0.0015152554,0.0012107773,0.0010083352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029284663,0.0005036547,0.0010610108,0.0029832828,0.001033019,0.0019810938,0.0020050672,0.0018074733,0.0017799406],"category_scores_gemma":[0.020642586,0.00058047695,0.00091422163,0.0013736914,0.0045110406,0.0044539156,0.0037781443,0.001601668,0.00022635817],"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.00007762479,0.00004629975,0.0010076583,0.00008942939,0.00003370535,0.00024398431,0.00019571511,0.113958694,0.0038485192,0.87210774,0.0010701464,0.007320548],"study_design_scores_gemma":[0.000023861221,0.000029294937,0.00042610208,0.000014881901,0.000010160699,0.00013677808,0.000044543995,0.5654228,0.0011273699,0.43167806,0.001065596,0.000020576133],"about_ca_topic_score_codex":0.0019078283,"about_ca_topic_score_gemma":0.0016488842,"teacher_disagreement_score":0.0029832828,"about_ca_system_score_codex":0.0014784358,"about_ca_system_score_gemma":0.0007886044,"threshold_uncertainty_score":0.015487373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479194,0.00024218712,0.045269895,0.00018113911,0.000025001022,0.00004041228,0.00018131247,0.00012192586,0.0060188146],"genre_scores_gemma":[0.9886938,0.000081659025,0.009612023,0.000043190066,0.000013402453,0.000036357713,0.00016637894,0.000033201868,0.0013200758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874,0.0002549124,0.000149716,0.00030450273,0.00027186234,0.00027908705],"domain_scores_gemma":[0.9958617,0.0015804344,0.0008284617,0.0006644299,0.00033390013,0.0007309868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075699,0.0003624102,0.00045311856,0.0012604605,0.0011013153,0.0031699257,0.0007179316,0.0007882884,0.002487567],"category_scores_gemma":[0.0037784367,0.00054289657,0.00067531265,0.00088636763,0.003507143,0.002611162,0.0012993972,0.00086122437,0.00026137664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019392252,0.0002846377,0.042478565,0.0002967379,0.00011913148,0.0010614444,0.0026002936,0.04857284,0.11403103,0.7467028,0.0020509546,0.03986235],"study_design_scores_gemma":[0.0001523727,0.0005818703,0.013978686,0.0001037995,0.00008465723,0.0012649157,0.0013726105,0.21989663,0.053420905,0.69942516,0.009561621,0.00015683037],"about_ca_topic_score_codex":0.0012064541,"about_ca_topic_score_gemma":0.0013282602,"teacher_disagreement_score":0.0031699257,"about_ca_system_score_codex":0.0012130338,"about_ca_system_score_gemma":0.00047975202,"threshold_uncertainty_score":0.008801162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8698038,0.00027222285,0.11811701,0.0003166749,0.000032682492,0.00007175623,0.0005820687,0.00034212324,0.010461631],"genre_scores_gemma":[0.9665346,0.00010306677,0.029756341,0.00007982122,0.00003485312,0.000049288457,0.00045328905,0.00012456792,0.0028642684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994393,0.000056084416,0.0000213801,0.00021585496,0.00012017232,0.00014720576],"domain_scores_gemma":[0.99680066,0.0013597304,0.00041014218,0.00058706413,0.00035083026,0.0004915069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046478197,0.00040379938,0.00051677943,0.0010813896,0.0012262716,0.0018487277,0.0015355451,0.00062462746,0.005024367],"category_scores_gemma":[0.0027935423,0.00035997457,0.00068590435,0.0009295842,0.0013673037,0.0025741889,0.0013423957,0.001022884,0.00026954492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017398616,0.00031151608,0.013842456,0.00044783897,0.00012851325,0.00030662067,0.0012268266,0.10352365,0.14278091,0.6609659,0.0070452173,0.0676807],"study_design_scores_gemma":[0.00016431669,0.00032734475,0.011983077,0.00008474414,0.00010355222,0.00073438796,0.00050001213,0.35508817,0.04553106,0.570422,0.014975675,0.0000856843],"about_ca_topic_score_codex":0.0033475712,"about_ca_topic_score_gemma":0.004354188,"teacher_disagreement_score":0.005024367,"about_ca_system_score_codex":0.002367073,"about_ca_system_score_gemma":0.00057406595,"threshold_uncertainty_score":0.017174423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6405981,0.0034069992,0.17955169,0.025061043,0.0010976285,0.00008616753,0.0007836471,0.0007874532,0.1486273],"genre_scores_gemma":[0.97870994,0.0006382652,0.011547894,0.0023756626,0.000701636,0.00007185444,0.00025737754,0.00010677912,0.005590501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816126,0.0006513596,0.000065707805,0.00039112841,0.00039644114,0.00033416724],"domain_scores_gemma":[0.9890505,0.007293419,0.0007657519,0.0011760932,0.0009705259,0.00074377615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003127528,0.00048033296,0.0012093184,0.001129401,0.0017385788,0.0029745318,0.0018712307,0.0026594857,0.0067155613],"category_scores_gemma":[0.018666418,0.0004738785,0.0009643096,0.000912479,0.003599592,0.007988335,0.0027310227,0.0047990573,0.0010001385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000130522,0.000044231878,0.00092518533,0.000074901385,0.000013914832,0.000094779905,0.00016807503,0.0028199812,0.0009265159,0.98550826,0.0048705577,0.0044229496],"study_design_scores_gemma":[0.00001914826,0.000016932252,0.0002713344,0.000017094815,0.0000066255766,0.000070202994,0.00006186029,0.018520437,0.00039569027,0.97916096,0.0014463519,0.000013524697],"about_ca_topic_score_codex":0.0010892776,"about_ca_topic_score_gemma":0.0006403216,"teacher_disagreement_score":0.0067155613,"about_ca_system_score_codex":0.0015589865,"about_ca_system_score_gemma":0.00084994227,"threshold_uncertainty_score":0.022465825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9048602,0.0005611788,0.06550307,0.001553214,0.00007318016,0.00005620542,0.0004202249,0.00031027416,0.026662512],"genre_scores_gemma":[0.98354673,0.00017963588,0.011436166,0.0001825173,0.000054756863,0.000043125772,0.00033519624,0.000045101857,0.0041768015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995709,0.00008067426,0.000018377967,0.00011865894,0.00010893701,0.0001025117],"domain_scores_gemma":[0.99675876,0.0017264106,0.00042476904,0.00041535607,0.00032591043,0.0003487457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003968424,0.0002447753,0.00039330346,0.0011647786,0.00097144704,0.0013278004,0.00091494137,0.00076033,0.006009996],"category_scores_gemma":[0.0036509337,0.00043220172,0.00040452875,0.0012653761,0.0013889895,0.0023986092,0.0013604985,0.00080520695,0.00033161833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032651564,0.000081339094,0.0065110633,0.0001916493,0.000042074276,0.00091241836,0.00080539077,0.027588306,0.022027869,0.92226267,0.005453589,0.0137971],"study_design_scores_gemma":[0.000095600844,0.000055192715,0.0044996063,0.000043206554,0.000039099217,0.0011198366,0.0003274298,0.10224044,0.008855157,0.87307465,0.009618252,0.000031390387],"about_ca_topic_score_codex":0.003018037,"about_ca_topic_score_gemma":0.0035812773,"teacher_disagreement_score":0.006009996,"about_ca_system_score_codex":0.0014611677,"about_ca_system_score_gemma":0.00039958223,"threshold_uncertainty_score":0.020105422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187362,0.00040835893,0.4648634,0.00094240124,0.000081765844,0.00011745404,0.00012893196,0.0005067826,0.014214789],"genre_scores_gemma":[0.95070046,0.0002324568,0.04337145,0.0002209066,0.00003752757,0.00008973862,0.00008964623,0.000108016604,0.005149782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848866,0.0006146962,0.000039853185,0.00030376084,0.00030428765,0.00024877832],"domain_scores_gemma":[0.9916407,0.0055381632,0.0006910596,0.0011766958,0.00055516104,0.00039827282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019252734,0.0003091664,0.0006364383,0.0011324524,0.00083847746,0.0011739815,0.0012238158,0.0009962437,0.002575401],"category_scores_gemma":[0.012943468,0.00046772242,0.00072517915,0.00054861075,0.0031917063,0.0021261557,0.0015728013,0.0012191858,0.00035660074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025493535,0.000052720887,0.0027042418,0.0001228878,0.000053792144,0.000259313,0.00039286792,0.13075875,0.015317276,0.8343968,0.0016672583,0.014019131],"study_design_scores_gemma":[0.000045019602,0.00005285961,0.00091826014,0.000017493683,0.000018482491,0.0001679657,0.00006708438,0.520689,0.00440871,0.47132656,0.0022563052,0.000032220916],"about_ca_topic_score_codex":0.0020410002,"about_ca_topic_score_gemma":0.002012039,"teacher_disagreement_score":0.002575401,"about_ca_system_score_codex":0.0020457122,"about_ca_system_score_gemma":0.0005882257,"threshold_uncertainty_score":0.014842689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052376266,0.0036930414,0.000848991,0.006955978,0.042349897,0.0001558224,0.004101253,0.0013149681,0.94005626],"genre_scores_gemma":[0.0023463569,0.002059449,0.0003302949,0.0019020459,0.0074168057,0.000058881764,0.0022741505,0.00078377425,0.98282826],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847907,0.00010073797,0.00006249131,0.00023884469,0.00096730446,0.00015153151],"domain_scores_gemma":[0.9954867,0.00041254802,0.00019679811,0.0006000512,0.0022918747,0.0010120646],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010410909,0.0010825751,0.0010699797,0.0032135472,0.0022569075,0.009973085,0.0013370413,0.0022630673,0.8077819],"category_scores_gemma":[0.0063635795,0.00039270666,0.000713611,0.003438506,0.00081685133,0.0033751575,0.002482788,0.003076683,0.76758957],"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.000014940164,0.000022072953,0.000047033667,0.000083149185,0.0000026303017,0.00001629934,0.000006183423,0.000037507878,0.000111972724,0.0015171757,0.9681695,0.029971467],"study_design_scores_gemma":[0.000004074097,0.00000677753,0.0001948486,0.00007866284,0.0000014248469,0.000022734175,0.000011172159,0.00005011409,0.000082012855,0.0005777718,0.9989674,0.0000029884036],"about_ca_topic_score_codex":0.0032734664,"about_ca_topic_score_gemma":0.0043142517,"teacher_disagreement_score":0.19221812,"about_ca_system_score_codex":0.0027919658,"about_ca_system_score_gemma":0.002992556,"threshold_uncertainty_score":0.27417582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81925255,0.0015693295,0.15966551,0.002050092,0.00007453006,0.00009145567,0.00028406942,0.00028354855,0.016728949],"genre_scores_gemma":[0.9870143,0.0005757307,0.009228076,0.00010295654,0.00006479061,0.00008885097,0.00014849202,0.00015906835,0.0026176951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.00035488975,0.000027993017,0.00016218855,0.000177905,0.00015357065],"domain_scores_gemma":[0.9857091,0.010105072,0.0015920146,0.00057202653,0.0005009291,0.0015209563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037018673,0.0008716152,0.0012936594,0.0021871785,0.0015906261,0.0025280926,0.0025095458,0.0026959507,0.005491787],"category_scores_gemma":[0.02385756,0.0009414276,0.0008706204,0.001041023,0.0054448987,0.005228849,0.0018738367,0.0028711476,0.00069838704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034448822,0.00009178436,0.006915091,0.00016561522,0.000068634436,0.0005844413,0.0007203753,0.2901095,0.011815026,0.6784946,0.0018661304,0.008824375],"study_design_scores_gemma":[0.000057958572,0.00010181101,0.0024127294,0.00008819382,0.000027392054,0.0005283188,0.0002955599,0.5994364,0.003626462,0.39165437,0.0016780331,0.00009263732],"about_ca_topic_score_codex":0.0015412332,"about_ca_topic_score_gemma":0.0011207653,"teacher_disagreement_score":0.005491787,"about_ca_system_score_codex":0.0027321826,"about_ca_system_score_gemma":0.0006629356,"threshold_uncertainty_score":0.019823492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8663377,0.00028168556,0.12239304,0.001714745,0.00007077939,0.00007987395,0.00070702744,0.00035384225,0.008061304],"genre_scores_gemma":[0.9809039,0.00018881069,0.0157442,0.00015123075,0.00006455577,0.00011413416,0.0005170274,0.00009591721,0.0022201578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984113,0.00049227476,0.000074057905,0.0003645619,0.00033684343,0.00032104005],"domain_scores_gemma":[0.9853284,0.010018084,0.0010908217,0.002063782,0.00067724776,0.00082162657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013432052,0.00067016017,0.00093921076,0.0007150488,0.0011443567,0.0016492546,0.0015669275,0.0013059368,0.004164035],"category_scores_gemma":[0.011542842,0.0006352191,0.00074829004,0.00059230305,0.0014412655,0.0038585623,0.0011608276,0.0014545226,0.00055064284],"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.0035234003,0.00057965284,0.063576095,0.00057646283,0.00039727546,0.0016377583,0.0005025039,0.53490835,0.09174483,0.21416715,0.012748115,0.0756384],"study_design_scores_gemma":[0.00008328198,0.00037137346,0.010093929,0.00002878464,0.00008743715,0.0012543881,0.00023591665,0.84993863,0.03228432,0.10305766,0.0024812196,0.000083101484],"about_ca_topic_score_codex":0.0007762094,"about_ca_topic_score_gemma":0.0011867185,"teacher_disagreement_score":0.004164035,"about_ca_system_score_codex":0.0015985135,"about_ca_system_score_gemma":0.00055923103,"threshold_uncertainty_score":0.013930082},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34633029,0.0050691236,0.532524,0.005275037,0.0005525695,0.00013495197,0.00075837737,0.0013689994,0.107986666],"genre_scores_gemma":[0.9533998,0.000777374,0.03399145,0.00089190487,0.00029973697,0.00010887313,0.00033139088,0.00029790937,0.00990165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983729,0.00038601732,0.0000646001,0.00044939414,0.00046331092,0.0002636492],"domain_scores_gemma":[0.99401253,0.0034594315,0.00046327795,0.0008349718,0.0006826943,0.00054706726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013693835,0.00042678195,0.00094313966,0.0010245104,0.0016806737,0.0017274324,0.0017652368,0.0010992032,0.007928499],"category_scores_gemma":[0.006665265,0.00042191386,0.0009968437,0.000732666,0.0030384765,0.0043044332,0.0027705794,0.0021434654,0.0014192591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003693644,0.00006495949,0.0019953717,0.00034042876,0.00005758424,0.00075697235,0.00066985225,0.006944664,0.0208251,0.9384995,0.008392264,0.021083904],"study_design_scores_gemma":[0.00008533644,0.00022850612,0.0022657237,0.000084161125,0.000076604374,0.002884239,0.00037861857,0.047826193,0.018307982,0.8779981,0.049804702,0.000059794827],"about_ca_topic_score_codex":0.0012324179,"about_ca_topic_score_gemma":0.001027588,"teacher_disagreement_score":0.007928499,"about_ca_system_score_codex":0.0009506435,"about_ca_system_score_gemma":0.0005916776,"threshold_uncertainty_score":0.02652347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19541089,0.00029485874,0.7897708,0.0010613846,0.000069060974,0.00017716436,0.00042379354,0.003616013,0.009176033],"genre_scores_gemma":[0.72216356,0.0001348191,0.26949948,0.00025483454,0.00006299951,0.00024053642,0.0007564682,0.00048160413,0.0064055566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991283,0.00024084831,0.000036811434,0.00021700228,0.0001983098,0.00017880346],"domain_scores_gemma":[0.99702245,0.0017969023,0.00017357261,0.00064570206,0.00020202673,0.00015934042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011519388,0.0008679839,0.0010006092,0.0008450779,0.0008001648,0.0016026961,0.0027003775,0.001573868,0.008367838],"category_scores_gemma":[0.0067076273,0.00045800346,0.0009913751,0.001066851,0.00125184,0.0037583834,0.0025794622,0.0017828124,0.0010720275],"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.0008229564,0.00021182728,0.0021755272,0.00024127612,0.000079624166,0.00022294791,0.000440833,0.6166896,0.0060864342,0.25501388,0.0100051155,0.108009964],"study_design_scores_gemma":[0.000045459856,0.000017503235,0.00007904091,0.000008195297,0.00000700777,0.000022211809,0.000027478478,0.8912943,0.00096504623,0.1069396,0.00058784336,0.000006265104],"about_ca_topic_score_codex":0.0035917608,"about_ca_topic_score_gemma":0.0052074236,"teacher_disagreement_score":0.008367838,"about_ca_system_score_codex":0.002654915,"about_ca_system_score_gemma":0.0014365127,"threshold_uncertainty_score":0.027993202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7944643,0.0013820973,0.17577267,0.0057026627,0.00014890905,0.00024931083,0.0014607046,0.00047869913,0.020340608],"genre_scores_gemma":[0.9911795,0.00037269268,0.0062413625,0.00022503687,0.00016190737,0.00015355728,0.00034937245,0.000090467634,0.0012261822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732345,0.001102947,0.000086468,0.00055707956,0.0005079787,0.00042209536],"domain_scores_gemma":[0.912328,0.071620055,0.005091738,0.0035529523,0.00336814,0.0040391246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048218053,0.0005246031,0.0012668872,0.0032885177,0.0023365105,0.002837636,0.002600692,0.0016435034,0.006734494],"category_scores_gemma":[0.05271352,0.0011435454,0.0009947954,0.0016174704,0.004777926,0.0050004125,0.003160246,0.0021524634,0.00033699247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009222676,0.00021113816,0.016716013,0.00046480287,0.00023016543,0.00053379533,0.0012728744,0.094529845,0.007306656,0.84795004,0.013504449,0.016357811],"study_design_scores_gemma":[0.00014931937,0.00008629408,0.005105076,0.00011082747,0.000086307904,0.0003954655,0.00035340624,0.48369843,0.0025504685,0.504795,0.0025937129,0.00007562542],"about_ca_topic_score_codex":0.005267264,"about_ca_topic_score_gemma":0.00446814,"teacher_disagreement_score":0.006734494,"about_ca_system_score_codex":0.002836007,"about_ca_system_score_gemma":0.0012198193,"threshold_uncertainty_score":0.025500476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.164081,0.0026107503,0.65663624,0.0032398067,0.001088798,0.00012085463,0.0006862728,0.0016101301,0.16992617],"genre_scores_gemma":[0.86647797,0.0017086107,0.1005818,0.00060435984,0.0012139337,0.00014876986,0.00040961162,0.0010418374,0.02781316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785763,0.00026932027,0.00013788698,0.00035898073,0.0009129632,0.000463218],"domain_scores_gemma":[0.9956801,0.0017674677,0.00029303087,0.0010021467,0.00080548454,0.0004517956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053983,0.00097469875,0.00094691233,0.003296642,0.0017415008,0.00345175,0.0016452358,0.0010181046,0.015655028],"category_scores_gemma":[0.008934589,0.000585351,0.0009984301,0.0020367962,0.004132239,0.01029038,0.0033046203,0.004366323,0.0034965053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419628,0.000036476904,0.0004155376,0.00006651258,0.0000057763905,0.000112685775,0.00017847487,0.00309295,0.0025737197,0.9739596,0.004320081,0.015196218],"study_design_scores_gemma":[0.000012238399,0.000050101353,0.0005062462,0.000050175277,0.000019390782,0.00029141025,0.00010130505,0.050415795,0.0057268646,0.92791814,0.014840594,0.00006787096],"about_ca_topic_score_codex":0.0013912434,"about_ca_topic_score_gemma":0.0016253553,"teacher_disagreement_score":0.015655028,"about_ca_system_score_codex":0.0017765404,"about_ca_system_score_gemma":0.0009868748,"threshold_uncertainty_score":0.052371323},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18886276,0.0008169552,0.75636834,0.004282873,0.00039297406,0.00021070364,0.0036140596,0.0011065283,0.04434491],"genre_scores_gemma":[0.951517,0.0005101525,0.038923554,0.0008787135,0.0006907146,0.00026696004,0.0017218762,0.0002048789,0.005286184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952054,0.0015390347,0.00032854194,0.000719637,0.0013408153,0.0008666273],"domain_scores_gemma":[0.96264446,0.022061853,0.003142601,0.003779923,0.0065379986,0.001833167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034017023,0.00083966553,0.0013240555,0.002002913,0.00095529953,0.001989663,0.0010393625,0.0016497775,0.014713951],"category_scores_gemma":[0.038397036,0.0007287581,0.00072205433,0.0011930964,0.0031792116,0.0046812026,0.0021970451,0.0026259378,0.0029800464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042325244,0.00013156867,0.0018782421,0.00035430194,0.000055974462,0.0007945723,0.00027505498,0.03566646,0.016574236,0.9164274,0.012682258,0.014736735],"study_design_scores_gemma":[0.00016118097,0.00018863169,0.0013506868,0.00011090375,0.000023466895,0.0007121798,0.00019655394,0.20209287,0.009752269,0.7798948,0.0054261484,0.00009025634],"about_ca_topic_score_codex":0.0009888748,"about_ca_topic_score_gemma":0.00094136444,"teacher_disagreement_score":0.014713951,"about_ca_system_score_codex":0.0008298224,"about_ca_system_score_gemma":0.001758581,"threshold_uncertainty_score":0.049223065},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11567365,0.0009999368,0.8596258,0.0024234015,0.00012976432,0.00024618037,0.00093178934,0.0012131304,0.018756313],"genre_scores_gemma":[0.8669946,0.0015546326,0.10516403,0.0019062121,0.00048880815,0.0011685733,0.002257512,0.0011583178,0.019307397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936009,0.0026257015,0.00023534335,0.00164788,0.0012568263,0.0006332915],"domain_scores_gemma":[0.9515074,0.03361725,0.004126249,0.0054980307,0.0029994892,0.0022514958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006962094,0.0025351932,0.0021570104,0.004025492,0.0018316775,0.0033882307,0.0049189287,0.0031916532,0.010181526],"category_scores_gemma":[0.04289083,0.0019283098,0.002332601,0.002582454,0.0036228884,0.012514177,0.0062832916,0.0052602408,0.0023166211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021758083,0.00013490423,0.0011291961,0.00025523483,0.00010279232,0.0002610253,0.00043949854,0.07691548,0.0029855391,0.8991653,0.006055059,0.012338391],"study_design_scores_gemma":[0.000101323705,0.0001084841,0.0006519358,0.00007284417,0.0000618369,0.0002390786,0.00008621403,0.46455258,0.002259832,0.5286831,0.0031130072,0.000069821974],"about_ca_topic_score_codex":0.0016436246,"about_ca_topic_score_gemma":0.0015222621,"teacher_disagreement_score":0.010181526,"about_ca_system_score_codex":0.0040175025,"about_ca_system_score_gemma":0.0011467972,"threshold_uncertainty_score":0.036819518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4633318,0.0022410227,0.4457511,0.003552484,0.00025894807,0.00014097927,0.00024235288,0.0013873689,0.083094],"genre_scores_gemma":[0.97549284,0.00063119485,0.015529319,0.00029801406,0.00015795516,0.000111608075,0.00011049511,0.0003381787,0.007330516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.00014553442,0.000012662163,0.000052673047,0.00015249636,0.000077648634],"domain_scores_gemma":[0.9973527,0.0013404351,0.00022674917,0.00018817252,0.0005916026,0.00030028386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012086631,0.00068756734,0.000837226,0.0025026868,0.0006533652,0.0010567638,0.00133642,0.00078794,0.0050659287],"category_scores_gemma":[0.009013952,0.00032563476,0.0006476797,0.00048293464,0.0024038178,0.0022948005,0.0016982615,0.0016049723,0.0006564908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003538033,0.000069488546,0.00070770376,0.00012063161,0.000016900456,0.00033420633,0.00022739243,0.042743802,0.0076487935,0.94236237,0.0022229562,0.0035104346],"study_design_scores_gemma":[0.000014265262,0.00002270723,0.0008490683,0.000076393044,0.000017732642,0.00032456068,0.00006017842,0.71828246,0.0018933923,0.27719563,0.0012289336,0.00003477947],"about_ca_topic_score_codex":0.0024716859,"about_ca_topic_score_gemma":0.002015066,"teacher_disagreement_score":0.0050659287,"about_ca_system_score_codex":0.0023949484,"about_ca_system_score_gemma":0.0010572094,"threshold_uncertainty_score":0.017376602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39458805,0.0055405702,0.5155463,0.010894599,0.00090864423,0.00048428428,0.0041596526,0.0030769145,0.06480102],"genre_scores_gemma":[0.9051137,0.002527488,0.07613949,0.001430191,0.0011749949,0.00045821635,0.0021343555,0.0010657447,0.009955898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962231,0.0007570723,0.00020865255,0.0011778866,0.00085419626,0.00077902246],"domain_scores_gemma":[0.96428174,0.023383697,0.0022566377,0.0048091444,0.0022077835,0.003061012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021193,0.0018117074,0.0032133288,0.0023020448,0.003229123,0.006295982,0.004265562,0.0024168866,0.017068502],"category_scores_gemma":[0.030776048,0.0018431145,0.0029456501,0.0026528602,0.0037284596,0.01610162,0.005918266,0.006590003,0.0033479072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025599939,0.0006520219,0.008878295,0.0013806951,0.0003642952,0.0013405953,0.0018991051,0.053400274,0.044690125,0.78840446,0.040752582,0.05567755],"study_design_scores_gemma":[0.0002247177,0.00033303804,0.0022181529,0.00019008826,0.000273842,0.0017453474,0.00040626852,0.18623534,0.010680812,0.7790874,0.018467428,0.00013755636],"about_ca_topic_score_codex":0.0012802046,"about_ca_topic_score_gemma":0.001148004,"teacher_disagreement_score":0.017068502,"about_ca_system_score_codex":0.0025659865,"about_ca_system_score_gemma":0.001317877,"threshold_uncertainty_score":0.05709982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74999386,0.00086049055,0.23255344,0.000938481,0.00007275312,0.000063306914,0.0006781088,0.00042507343,0.014414472],"genre_scores_gemma":[0.98086953,0.00026561655,0.016456245,0.0001425301,0.00004731491,0.00005511158,0.0002473546,0.00009225582,0.0018239253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851125,0.0003954362,0.00009011011,0.00047274018,0.00028235203,0.0002481035],"domain_scores_gemma":[0.990182,0.0052525713,0.00097127404,0.0017146425,0.00077823765,0.0011013914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017094446,0.0004967677,0.0010986845,0.0014257466,0.0008960817,0.002136394,0.0017460304,0.0007046551,0.0042914995],"category_scores_gemma":[0.013356757,0.00067519356,0.000616747,0.0010580443,0.0019583679,0.005775417,0.0025559464,0.0015523444,0.00044300623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013303291,0.00016530608,0.008361233,0.00044927094,0.00014925546,0.0003626259,0.0009174519,0.07205859,0.02005905,0.85665596,0.0043779365,0.035113007],"study_design_scores_gemma":[0.000059156057,0.00010946826,0.0018486136,0.0000541084,0.000076473865,0.00063609006,0.00028487114,0.32719418,0.009439018,0.65564907,0.0046073226,0.00004160402],"about_ca_topic_score_codex":0.0005926371,"about_ca_topic_score_gemma":0.00062427303,"teacher_disagreement_score":0.0042914995,"about_ca_system_score_codex":0.00094498496,"about_ca_system_score_gemma":0.00043754143,"threshold_uncertainty_score":0.014356494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84030503,0.0007435854,0.14684543,0.001815656,0.000056876637,0.000054346958,0.0003752351,0.00033198303,0.009471917],"genre_scores_gemma":[0.9746684,0.00020942916,0.022378376,0.00021101758,0.000051352978,0.00005118835,0.00026396321,0.00007697755,0.0020893002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985362,0.00051399134,0.00006360072,0.0003911905,0.0003013584,0.00019363883],"domain_scores_gemma":[0.9901599,0.006215111,0.001178637,0.0010317671,0.0006081798,0.00080653414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370041,0.00033687876,0.00090506434,0.00087929197,0.0011269378,0.0014158188,0.0015143349,0.0012462676,0.0036673588],"category_scores_gemma":[0.015123112,0.0007814729,0.0005305126,0.00095737743,0.0019561055,0.003827446,0.00180104,0.0015519749,0.00032927227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061163254,0.0001275904,0.010134089,0.00035593458,0.00008315382,0.0004812996,0.0008935156,0.142252,0.010678395,0.8073462,0.0040694405,0.0229667],"study_design_scores_gemma":[0.00007095121,0.00010278877,0.0018496361,0.000048400627,0.0000232047,0.000334058,0.00033760708,0.24409093,0.004068156,0.7449863,0.0040545934,0.000033412216],"about_ca_topic_score_codex":0.0016886378,"about_ca_topic_score_gemma":0.001475265,"teacher_disagreement_score":0.0036673588,"about_ca_system_score_codex":0.0018158737,"about_ca_system_score_gemma":0.000577873,"threshold_uncertainty_score":0.01317513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5672765,0.0005669364,0.39383897,0.0010782167,0.00014775393,0.00026174568,0.00071251194,0.0005618538,0.035555538],"genre_scores_gemma":[0.95208114,0.00019864882,0.04099023,0.0003099779,0.0000924373,0.00020809485,0.00047549533,0.00013831232,0.005505655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344265,0.0021097357,0.00023879722,0.002003859,0.0014528019,0.0007522412],"domain_scores_gemma":[0.9823064,0.007832595,0.0020760954,0.0032033254,0.002559578,0.0020219728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024526406,0.0006159337,0.0012303822,0.0030374741,0.002633254,0.0032858693,0.0022008407,0.0014368752,0.0059618345],"category_scores_gemma":[0.017202826,0.00072539895,0.00094110164,0.0020991566,0.005202693,0.006729667,0.0056182593,0.0018556489,0.0007058605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026545257,0.00007468677,0.0044690496,0.00016404138,0.00008142808,0.000507115,0.0009140118,0.009502465,0.005730739,0.95508826,0.0027024657,0.0205003],"study_design_scores_gemma":[0.000025764466,0.000115125265,0.0012310867,0.000035676352,0.00003751347,0.00073109183,0.0005047621,0.027139492,0.0027570825,0.96111184,0.0062753484,0.000035264715],"about_ca_topic_score_codex":0.0011515706,"about_ca_topic_score_gemma":0.0011590674,"teacher_disagreement_score":0.0059618345,"about_ca_system_score_codex":0.0017528889,"about_ca_system_score_gemma":0.0009222035,"threshold_uncertainty_score":0.01994431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.541138,0.0008150334,0.3915577,0.0021842604,0.000068773064,0.00016165148,0.0012500569,0.00043109202,0.06239346],"genre_scores_gemma":[0.93291444,0.00043506126,0.052489873,0.00033669017,0.0001006694,0.00016776593,0.0006702169,0.000082852865,0.012802488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917847,0.0001919241,0.000043509393,0.0003051284,0.00018651377,0.000094397255],"domain_scores_gemma":[0.99520504,0.00251472,0.0005248349,0.0007513924,0.0004742336,0.000529791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062633323,0.00026730896,0.00052278687,0.0015239125,0.0013442591,0.0017822041,0.0006095875,0.0006751785,0.0078054676],"category_scores_gemma":[0.005264979,0.0005827361,0.0003761133,0.0015467361,0.0024353121,0.0042225337,0.002114565,0.0014585847,0.00062730734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057486406,0.000024188039,0.0011255067,0.00006131885,0.000019552834,0.00015422764,0.00039845484,0.005166709,0.0029228244,0.97872967,0.0019730967,0.009366968],"study_design_scores_gemma":[0.000023405777,0.000027928514,0.0011218799,0.000024796276,0.000015462427,0.00046107176,0.00029245016,0.036453158,0.0024831137,0.9455677,0.013511634,0.000017292738],"about_ca_topic_score_codex":0.00074597565,"about_ca_topic_score_gemma":0.0009130243,"teacher_disagreement_score":0.0078054676,"about_ca_system_score_codex":0.0009850463,"about_ca_system_score_gemma":0.00026345576,"threshold_uncertainty_score":0.0261119},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8257061,0.00037225737,0.12891647,0.0033862726,0.00020948067,0.000077309414,0.00041207668,0.0003189549,0.040601026],"genre_scores_gemma":[0.98484343,0.00012635125,0.010061715,0.0003583262,0.00006938025,0.00007345066,0.0002928351,0.000040293962,0.004134247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983021,0.00037452765,0.00012485309,0.000546241,0.00031859375,0.00033373854],"domain_scores_gemma":[0.9902111,0.0052351546,0.0007312075,0.0023400749,0.00071595394,0.00076663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019521324,0.0003123462,0.0010300134,0.0005842338,0.0017082992,0.0017008617,0.0012241337,0.0013974081,0.0083510345],"category_scores_gemma":[0.011019254,0.00043154307,0.0012340107,0.00071939966,0.0037543168,0.004400788,0.002467842,0.0019736728,0.00079947466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815209,0.00007241675,0.004273528,0.000087789136,0.000015830137,0.00016707946,0.0005341803,0.008079012,0.0041164523,0.9700041,0.002175065,0.01019305],"study_design_scores_gemma":[0.00005816977,0.000059898834,0.0012388136,0.000022846705,0.000016374584,0.00021983442,0.00019143583,0.030191155,0.0020638085,0.9621136,0.003806744,0.000017272987],"about_ca_topic_score_codex":0.001285194,"about_ca_topic_score_gemma":0.0011877702,"teacher_disagreement_score":0.0083510345,"about_ca_system_score_codex":0.0014107474,"about_ca_system_score_gemma":0.0010075249,"threshold_uncertainty_score":0.027936995},"labels":[],"label_agreement":null}]}