{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":106,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":106,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"252b0e7a09be","filters":{"venue":"Combinatorics Probability Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","authors":[{"name":"Penny Haxell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03238984281134506,"gpt":0.3031178416169424,"spread":0.2707279988055973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546254,0.0007093928,0.0009299457,0.001113607,0.002540449,0.002887483,0.00190481,0.001758443,0.006220721],"category_scores_gemma":[0.01519387,0.0005523718,0.0009495314,0.002277085,0.005189228,0.008547033,0.003570697,0.005735177,0.00184102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00229533,"about_ca_system_score_gemma":0.001066683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003727537,"about_ca_topic_score_gemma":0.002575101,"domain_scores_codex":[0.997337,0.0008280021,0.0001305334,0.0005430761,0.0006425797,0.0005187181],"domain_scores_gemma":[0.9865317,0.009147561,0.0004049576,0.002460033,0.0009197989,0.0005360684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003711393,0.00008750379,0.002294705,0.0003934985,0.00002855655,0.0004814311,0.0007389631,0.009401885,0.004140368,0.8514119,0.03752376,0.09312635],"study_design_scores_gemma":[0.00004442598,0.0001228666,0.0007093574,0.0001155611,0.00005380817,0.0004598743,0.0002117766,0.02158396,0.004943327,0.8706885,0.1010173,0.000049156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08483986,0.01586965,0.5983899,0.03520724,0.01062971,0.0002595744,0.0006002998,0.002688325,0.2515154],"genre_scores_gemma":[0.6707684,0.01313729,0.261851,0.007937414,0.004839303,0.0002452685,0.000521197,0.0007866382,0.03991356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006220721,"threshold_uncertainty_score":0.02081043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"János Pach","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02230752856673305,"gpt":0.2705696345529421,"spread":0.248262105986209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654405,0.001135299,0.0007848032,0.001764869,0.001427977,0.004319634,0.001944456,0.001721377,0.008098092],"category_scores_gemma":[0.01047924,0.001271962,0.001357694,0.003946762,0.005283845,0.00771868,0.004039353,0.004149661,0.001159656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0028952,"about_ca_system_score_gemma":0.0008035341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097455,"about_ca_topic_score_gemma":0.002035283,"domain_scores_codex":[0.997095,0.0007935727,0.0001770249,0.000830725,0.0006901456,0.0004135808],"domain_scores_gemma":[0.9901937,0.005599165,0.001239872,0.001771788,0.0004390185,0.0007564523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001719751,0.00005740304,0.001139402,0.0002709246,0.00004402402,0.0002597949,0.0008171726,0.03023293,0.005505618,0.9180157,0.004888369,0.03859671],"study_design_scores_gemma":[0.00003137876,0.00002189231,0.0005335979,0.00002755089,0.00001382041,0.0002538914,0.0001222711,0.02208923,0.001445699,0.967602,0.007836103,0.00002258025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1694962,0.003935365,0.7810568,0.001838744,0.0002473094,0.0002745622,0.001008011,0.0009321127,0.041211],"genre_scores_gemma":[0.7340692,0.003832068,0.2422017,0.0009895214,0.0007032997,0.0004586619,0.001369861,0.0005012023,0.01587447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008098092,"threshold_uncertainty_score":0.02709085,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Keevash","is_ca":false},{"name":"Dhruv Mubayi","is_ca":false},{"name":"Benny Sudakov","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03322687722485506,"gpt":0.2691535873263459,"spread":0.2359267101014909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712335,0.001396445,0.001532534,0.001240883,0.003161233,0.002843473,0.003374139,0.002071388,0.02633819],"category_scores_gemma":[0.008973916,0.0007544128,0.002040148,0.001715331,0.002785696,0.009492574,0.004568771,0.004387091,0.003346089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002981319,"about_ca_system_score_gemma":0.001672113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861439,"about_ca_topic_score_gemma":0.002670025,"domain_scores_codex":[0.9973897,0.0007219907,0.0001121059,0.0007525278,0.0003813003,0.0006423888],"domain_scores_gemma":[0.9939753,0.003494151,0.0004736623,0.001069098,0.0003630384,0.0006247676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002383716,0.0001180517,0.0005489612,0.0004062505,0.00006492703,0.000130382,0.0002775089,0.01801666,0.001375506,0.9210076,0.02901858,0.02879718],"study_design_scores_gemma":[0.00004561082,0.00004532097,0.0003669458,0.00003826865,0.00003244069,0.0001381009,0.0001040074,0.03712098,0.001008469,0.9477167,0.01335512,0.00002814996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2160529,0.003331547,0.5645575,0.009670258,0.001172662,0.0006038289,0.004095501,0.002903771,0.1976121],"genre_scores_gemma":[0.7265295,0.002160688,0.1740678,0.003011517,0.001004268,0.0008481544,0.004806795,0.001409889,0.08616141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02633819,"threshold_uncertainty_score":0.08811003,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Noga Alon","is_ca":false},{"name":"Bojan Mohar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02818838614938516,"gpt":0.2838933543736482,"spread":0.255704968224263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861061,0.0003158085,0.0003098843,0.001647132,0.0009808906,0.002708719,0.000697508,0.0005272326,0.00904639],"category_scores_gemma":[0.00562758,0.0003388518,0.0002917873,0.001202462,0.002593412,0.003082193,0.00120862,0.0009248948,0.0007327907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660893,"about_ca_system_score_gemma":0.0005893664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002192671,"about_ca_topic_score_gemma":0.002057155,"domain_scores_codex":[0.9994313,0.000105976,0.00002024767,0.0001538834,0.0001336074,0.0001549895],"domain_scores_gemma":[0.9965292,0.00211589,0.0003062259,0.0004435935,0.0002763544,0.0003288099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004297562,0.00003582489,0.004121155,0.0001277869,0.00002566885,0.0001906755,0.0004337804,0.03663541,0.0108218,0.9087687,0.005364261,0.03304524],"study_design_scores_gemma":[0.00005023255,0.00005762046,0.002657763,0.00004038354,0.00002727723,0.0003516175,0.0002027656,0.07475054,0.005377127,0.9057058,0.01073353,0.0000453066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8077604,0.00155431,0.06181247,0.001548059,0.0001788091,0.00005750417,0.0006724524,0.0003865221,0.1260296],"genre_scores_gemma":[0.9867092,0.0004599438,0.00507916,0.00006765596,0.00009753381,0.00003488278,0.0001643657,0.00007013771,0.007317262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00904639,"threshold_uncertainty_score":0.03026313,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ralph Neininger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0516463126219221,"gpt":0.2780597385568273,"spread":0.2264134259349052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003506387,0.0006168325,0.001148083,0.002615098,0.001006655,0.003499311,0.001308947,0.001259139,0.002936803],"category_scores_gemma":[0.02311652,0.0006321504,0.0008818498,0.002053251,0.002948466,0.00648253,0.001896563,0.001858638,0.0008697622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726093,"about_ca_system_score_gemma":0.001090435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114431,"about_ca_topic_score_gemma":0.001011319,"domain_scores_codex":[0.9985043,0.0004574158,0.00007333706,0.0002249228,0.0005047176,0.0002354053],"domain_scores_gemma":[0.9929314,0.004264341,0.0008753946,0.0006473743,0.0007916326,0.0004898171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001724092,0.00001117271,0.0006277405,0.00002926342,0.00001357575,0.00006049757,0.000117331,0.02668284,0.0007389459,0.9663798,0.0005282673,0.004793251],"study_design_scores_gemma":[0.000005947901,0.00001796565,0.0005335424,0.0000222837,0.000008529064,0.00006967619,0.00003212444,0.1832632,0.0003325751,0.8146525,0.001037922,0.0000237251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.207536,0.002881481,0.760775,0.0009666538,0.0001290895,0.00006386407,0.0002577472,0.0003072487,0.02708297],"genre_scores_gemma":[0.9462833,0.00219266,0.03952862,0.0001835037,0.000264502,0.0001516818,0.000315493,0.0002455265,0.01083462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003506387,"threshold_uncertainty_score":0.01854378,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David G. Wagner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02961836125564239,"gpt":0.2931619989030069,"spread":0.2635436376473645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002584259,0.0007929928,0.000661555,0.002091373,0.000751898,0.001956614,0.001173394,0.0008307968,0.002324321],"category_scores_gemma":[0.01881281,0.0006012823,0.0006317592,0.001356882,0.003478229,0.003313046,0.001008187,0.001954279,0.0003438127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933924,"about_ca_system_score_gemma":0.0004953494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001634407,"about_ca_topic_score_gemma":0.0006587972,"domain_scores_codex":[0.9981689,0.0005026933,0.0001114651,0.000418772,0.0003711215,0.0004269152],"domain_scores_gemma":[0.9816862,0.01119407,0.003484895,0.001162047,0.001490408,0.0009823205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001762573,0.00003670832,0.002840429,0.000110511,0.00002479015,0.0001713271,0.0003817863,0.02576003,0.004843233,0.951735,0.00115479,0.01276519],"study_design_scores_gemma":[0.00004384846,0.0001141603,0.003087076,0.00004671047,0.00001909633,0.0004314127,0.000206374,0.1517888,0.004546786,0.8375403,0.00209342,0.0000820834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.6534157,0.0009331739,0.327565,0.001254057,0.00008345804,0.00004630521,0.0005500795,0.0002687324,0.01588354],"genre_scores_gemma":[0.9875536,0.0002812857,0.01020824,0.0000693328,0.0001039942,0.00004873475,0.000160834,0.00004388649,0.001530165],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.002584259,"threshold_uncertainty_score":0.01403159,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Conjecture; Discrete mathematics; Graph","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Jan Hladký","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Serguei Norine","is_ca":false},{"name":"Alexander Razborov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04941527205811196,"gpt":0.3042241545118432,"spread":0.2548088824537312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843914,0.0005971805,0.001016753,0.001645581,0.003204638,0.003236351,0.002090947,0.001715515,0.005122747],"category_scores_gemma":[0.006652794,0.000789571,0.0008763398,0.002275403,0.004063106,0.006389035,0.003622727,0.001390244,0.0006011256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001653095,"about_ca_system_score_gemma":0.001007132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231184,"about_ca_topic_score_gemma":0.00377703,"domain_scores_codex":[0.9983228,0.0001842383,0.0001039655,0.0006468141,0.0002831988,0.0004588887],"domain_scores_gemma":[0.9885621,0.004937453,0.00159467,0.001929293,0.001134635,0.001841787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003369203,0.0001028416,0.01147025,0.0002488296,0.0000862377,0.001346237,0.001529311,0.004021042,0.007189121,0.9519518,0.002325472,0.01939194],"study_design_scores_gemma":[0.00004392089,0.00007353968,0.003765197,0.00006026539,0.00008358176,0.001672853,0.001319992,0.01164117,0.006814459,0.9576833,0.01678429,0.00005736821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9145416,0.0007059029,0.05228641,0.0007035916,0.00008095313,0.00006646986,0.0006449603,0.0003045202,0.0306656],"genre_scores_gemma":[0.9827208,0.000206804,0.01177673,0.0001156295,0.00002103856,0.00005874823,0.0005554386,0.0000437591,0.004501034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005122747,"threshold_uncertainty_score":0.01713729,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Ευριπίδης Μάρκου","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0150184468477144,"gpt":0.2385637551410454,"spread":0.223545308293331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008899401,0.0002928544,0.0005765436,0.0006968304,0.0009349519,0.001095453,0.0008667909,0.001033816,0.001700517],"category_scores_gemma":[0.005581857,0.0003075671,0.0003233184,0.0007326409,0.0008092333,0.00316974,0.001069545,0.0005394311,0.0003011051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006569242,"about_ca_system_score_gemma":0.0006158107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00120237,"about_ca_topic_score_gemma":0.001635912,"domain_scores_codex":[0.9995483,0.0001678714,0.00002075187,0.00007794101,0.0000756376,0.0001095022],"domain_scores_gemma":[0.9972675,0.001773825,0.0004068555,0.0001861084,0.0001663861,0.0001993162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008087551,0.0001576455,0.004429109,0.0002527554,0.00006414136,0.0006117818,0.000984046,0.5821577,0.0161268,0.2811593,0.006124388,0.1071236],"study_design_scores_gemma":[0.00003254043,0.00007226209,0.0002384548,0.00001262051,0.00001169553,0.0001104744,0.0001536699,0.8697541,0.002199654,0.125685,0.001721125,0.000008434427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3527069,0.0004586561,0.6416901,0.0005913411,0.00002502935,0.00005678355,0.0001027769,0.0004004184,0.003968125],"genre_scores_gemma":[0.8702657,0.0005031447,0.1261277,0.00009859369,0.00003131931,0.00008037104,0.0001577957,0.00005678582,0.002678582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001700517,"threshold_uncertainty_score":0.005688787,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stephen Melczer","is_ca":true},{"name":"Marni Mishna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03995653147379943,"gpt":0.3344978425721223,"spread":0.2945413110983229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297472,0.0003591375,0.0006088188,0.0021348,0.0004072269,0.0008398712,0.001130573,0.000440488,0.003410798],"category_scores_gemma":[0.002049299,0.0001942508,0.0006501597,0.0005664166,0.001095934,0.001713628,0.001117404,0.0008665489,0.0004908768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006067418,"about_ca_system_score_gemma":0.0005567046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001280178,"about_ca_topic_score_gemma":0.00116718,"domain_scores_codex":[0.9997017,0.0001019814,0.00001460433,0.0000310987,0.00009677969,0.0000538143],"domain_scores_gemma":[0.9993839,0.0002351114,0.00007839803,0.000107271,0.0001217983,0.0000735275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002652447,0.00003826951,0.0007729558,0.00005098736,0.00001897156,0.0001547466,0.0001010841,0.02892802,0.002749607,0.953422,0.0006616885,0.01307513],"study_design_scores_gemma":[0.00001056805,0.00001872472,0.0003331805,0.00001173707,0.000006164142,0.00006729925,0.00003357683,0.6895897,0.0009102448,0.308202,0.0008025696,0.00001417871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.173179,0.0002926758,0.811192,0.0002572024,0.00004757114,0.00004541911,0.00007891134,0.0004016591,0.01450547],"genre_scores_gemma":[0.9159205,0.0002823497,0.07674318,0.00005065926,0.00006889271,0.0000644482,0.00008769478,0.0001372368,0.006645122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003410798,"threshold_uncertainty_score":0.01141024,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Veselin Jungić","is_ca":true},{"name":"Jonathan D. Licht","is_ca":false},{"name":"Mohammad Mahdian","is_ca":false},{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Radoš Radoičić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04527451832759227,"gpt":0.3025124357384132,"spread":0.257237917410821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886302,0.0003431781,0.0005268232,0.001187902,0.001880079,0.001850639,0.00141706,0.0007910727,0.005711383],"category_scores_gemma":[0.004817798,0.0003855742,0.0006164347,0.000982495,0.002753339,0.008075789,0.003005742,0.002147905,0.0005425835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116907,"about_ca_system_score_gemma":0.0006197557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007349384,"about_ca_topic_score_gemma":0.0009041525,"domain_scores_codex":[0.9989432,0.0003036456,0.00006834414,0.0002237177,0.0003017286,0.000159346],"domain_scores_gemma":[0.9961302,0.002167364,0.0003609883,0.0005298248,0.0004184831,0.0003930861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000038231,0.00003319177,0.0003788351,0.00005516459,0.000006544478,0.00009187913,0.0002610724,0.001263501,0.0008437152,0.9918782,0.001032345,0.004117291],"study_design_scores_gemma":[0.0000120891,0.00002441292,0.0002590639,0.00001649169,0.00000888846,0.00017195,0.0001512446,0.008615931,0.0009689005,0.9857457,0.004013818,0.00001150772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6347346,0.003280756,0.1933246,0.005133998,0.0003453218,0.00007548492,0.0003671024,0.0006017757,0.1621365],"genre_scores_gemma":[0.9655241,0.001057102,0.0206503,0.0004046878,0.0002362381,0.00006882274,0.0001986289,0.00005957697,0.01180052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005711383,"threshold_uncertainty_score":0.01910645,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03636316430497043,"gpt":0.2971895916745583,"spread":0.2608264273695879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827862,0.0005467231,0.0007583339,0.001816128,0.0007205362,0.001658798,0.001200414,0.0009687781,0.001051893],"category_scores_gemma":[0.01727316,0.0005543201,0.0003926539,0.0007241343,0.002220163,0.003694113,0.001580519,0.001048271,0.0002626387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376979,"about_ca_system_score_gemma":0.0004375584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001105483,"about_ca_topic_score_gemma":0.0007639531,"domain_scores_codex":[0.9990144,0.0003501194,0.00003398119,0.0002617601,0.0001860919,0.0001536978],"domain_scores_gemma":[0.9871051,0.009225915,0.001501705,0.0007748784,0.000687526,0.0007047884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004351941,0.00009224105,0.01472303,0.0004311675,0.0001229426,0.0005272306,0.0008219894,0.2847531,0.02431876,0.6392132,0.007578764,0.02698232],"study_design_scores_gemma":[0.00003370145,0.0001057968,0.004931243,0.00007230044,0.0000410788,0.0004557504,0.0001642355,0.6837154,0.005473746,0.3005703,0.004387746,0.00004866751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6371011,0.004121469,0.3385353,0.003272285,0.0001939106,0.00007525628,0.0006959706,0.000670061,0.01533469],"genre_scores_gemma":[0.9820397,0.001335097,0.01389835,0.0002144579,0.0002835581,0.00009194596,0.0002531205,0.0001289865,0.001754778],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001827862,"threshold_uncertainty_score":0.009990692,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrzej Dudek","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02437239546565568,"gpt":0.296762292521978,"spread":0.2723898970563223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222098,0.0008566884,0.0008182789,0.00144324,0.001171936,0.00188481,0.001917616,0.001140545,0.01926525],"category_scores_gemma":[0.007876341,0.0004683754,0.001026526,0.001453169,0.004067715,0.01166397,0.004802803,0.005020993,0.001756475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001794794,"about_ca_system_score_gemma":0.000985112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314259,"about_ca_topic_score_gemma":0.001042097,"domain_scores_codex":[0.9986147,0.000347112,0.00006021775,0.0004029545,0.0003897489,0.0001852737],"domain_scores_gemma":[0.9934872,0.004140724,0.0003597206,0.0008443963,0.000747981,0.0004199316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003051034,0.00002743289,0.0002321066,0.00008161123,0.000009689247,0.00006006929,0.0001719525,0.0008184482,0.001559114,0.9868117,0.003378067,0.006819277],"study_design_scores_gemma":[0.00002997671,0.00008685744,0.000623011,0.00003428099,0.00002323873,0.0002786663,0.00009154372,0.01101046,0.002872531,0.9586256,0.02628687,0.00003676966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0737733,0.004205092,0.6530944,0.01972811,0.0009682066,0.0001010237,0.001088664,0.0009854082,0.2460558],"genre_scores_gemma":[0.8226587,0.003046231,0.1215167,0.006272044,0.001893432,0.0003922701,0.0004770857,0.0003733499,0.04337011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01926525,"threshold_uncertainty_score":0.06444871,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Bipartite graph; Graph; Upper and lower bounds; Extremal graph theory; Value (mathematics); Graph theory","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.05537113575030009,"gpt":0.3171983033842709,"spread":0.2618271676339708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002764205,0.0004003992,0.0002973946,0.001806976,0.001140004,0.001481617,0.0006569768,0.0006191207,0.003728177],"category_scores_gemma":[0.001914044,0.000185946,0.0002083037,0.0008679641,0.001539516,0.001615167,0.001029844,0.0007794159,0.0003386301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104285,"about_ca_system_score_gemma":0.0002808566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000726733,"about_ca_topic_score_gemma":0.0009569178,"domain_scores_codex":[0.9997128,0.00005771156,0.00001160979,0.00005593591,0.00006785728,0.00009416344],"domain_scores_gemma":[0.9995279,0.0001712841,0.00007712711,0.00005074155,0.00007267968,0.0001002725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006172935,0.00001539675,0.0006615286,0.00006136367,0.000005540667,0.0001527398,0.0001724157,0.00444354,0.001691948,0.9789987,0.002624974,0.01111011],"study_design_scores_gemma":[0.000006689603,0.00001482843,0.0004777581,0.00002565135,0.000007870688,0.0001470331,0.00008000838,0.01667876,0.0009915812,0.9753392,0.006216615,0.00001387349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7313871,0.0044495,0.08059835,0.001923566,0.0004559918,0.00005033935,0.0003458607,0.0003450795,0.1804442],"genre_scores_gemma":[0.9883503,0.0004251236,0.005888328,0.0001411136,0.00009886828,0.00002691388,0.00007007328,0.00004142395,0.004957933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003728177,"threshold_uncertainty_score":0.01247203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913888525","doi":"10.1017/s0963548306007541","title":"Rayleigh Matroids","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Binary number; Matroid partitioning; Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","authors":[{"name":"YoungBin Choe","is_ca":true},{"name":"David G. Wagner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05178645719083579,"gpt":0.3178471076443546,"spread":0.2660606504535188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365456,0.0005378233,0.000505889,0.0007643208,0.0007009011,0.001669818,0.0007785915,0.0006199625,0.007164749],"category_scores_gemma":[0.001967442,0.0003068361,0.000513425,0.0005730783,0.001057064,0.002603368,0.001237207,0.00107237,0.001133556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006029136,"about_ca_system_score_gemma":0.0002838133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006221175,"about_ca_topic_score_gemma":0.0006169715,"domain_scores_codex":[0.9993302,0.0001229216,0.00003853723,0.000166458,0.0002135947,0.000128371],"domain_scores_gemma":[0.9985959,0.0004611299,0.0003037506,0.0002050549,0.0002896806,0.0001444454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008128049,0.00002858219,0.0009663114,0.00009179279,0.00002207677,0.0001882898,0.0001949319,0.01553367,0.00790301,0.9496801,0.002782859,0.02252707],"study_design_scores_gemma":[0.00003082878,0.0001135611,0.001363995,0.00003664033,0.0000235705,0.0009983849,0.0002315934,0.1415232,0.007112643,0.8218814,0.02664851,0.00003566212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2848154,0.001417463,0.6288438,0.001436141,0.0001738741,0.0001767888,0.001050763,0.0006505529,0.08143511],"genre_scores_gemma":[0.9171931,0.0009052542,0.05519386,0.0003940783,0.0003380501,0.0001622813,0.0005931004,0.00009894925,0.0251213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007164749,"threshold_uncertainty_score":0.02396846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Remco van der Hofstad","is_ca":false},{"name":"Gordon Slade","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05307736462868874,"gpt":0.3098784002299411,"spread":0.2568010356012523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102129,0.001856527,0.001087467,0.003552724,0.001699253,0.001977756,0.002298922,0.001535138,0.02744832],"category_scores_gemma":[0.003102617,0.0003763709,0.0009633156,0.001041579,0.00359452,0.002637408,0.001970656,0.003930003,0.005494686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0025079,"about_ca_system_score_gemma":0.001494001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006399681,"about_ca_topic_score_gemma":0.01118299,"domain_scores_codex":[0.9993719,0.0001319904,0.00001694937,0.00006722351,0.0002689897,0.0001429143],"domain_scores_gemma":[0.9989597,0.0003784163,0.00008463614,0.00008955477,0.0002815198,0.0002061805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001000659,0.00007132605,0.0003020932,0.0002304696,0.00001726494,0.0004299725,0.0004036763,0.005532534,0.004541989,0.9578577,0.01855186,0.011961],"study_design_scores_gemma":[0.00007495473,0.00005365025,0.002607351,0.0004197548,0.00004346814,0.000728805,0.0004837677,0.2493226,0.006502385,0.6930806,0.04648082,0.0002019644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1392548,0.005180472,0.1913184,0.01077536,0.004261019,0.0002876003,0.001268962,0.003309393,0.6443441],"genre_scores_gemma":[0.6881425,0.004179048,0.07074177,0.003983523,0.001422975,0.001247083,0.00161281,0.004442663,0.2242277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02744832,"threshold_uncertainty_score":0.09182382,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07886002661000079,"gpt":0.270923936666516,"spread":0.1920639100565152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008302242,0.0008522941,0.002019182,0.003479309,0.001288781,0.002736654,0.00257556,0.002185313,0.003450923],"category_scores_gemma":[0.06484288,0.001036472,0.0008041752,0.002105835,0.007677185,0.006918883,0.002707534,0.002115957,0.0006231875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279043,"about_ca_system_score_gemma":0.0006415662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631123,"about_ca_topic_score_gemma":0.001123558,"domain_scores_codex":[0.9958813,0.002296038,0.00009468804,0.0007800597,0.0005689177,0.0003789288],"domain_scores_gemma":[0.9279466,0.06059746,0.003520939,0.004930258,0.00149643,0.001508383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000773975,0.00007535025,0.00822165,0.0003023446,0.0001451709,0.0004361591,0.0005859892,0.2203577,0.005176772,0.7411538,0.004375116,0.01839595],"study_design_scores_gemma":[0.0001993123,0.0001721573,0.003523505,0.0001357638,0.00008194413,0.000571825,0.0001938045,0.5255501,0.002494974,0.4646042,0.002360116,0.0001124243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6529448,0.001746184,0.3234487,0.006125655,0.0001364828,0.0002029229,0.001086022,0.0005556734,0.01375357],"genre_scores_gemma":[0.9801768,0.001227451,0.01396952,0.0003858394,0.0002490625,0.0003235649,0.0004140392,0.0001242038,0.003129515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008302242,"threshold_uncertainty_score":0.04390699,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Oliver Riordan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01325639483048388,"gpt":0.2363868157909862,"spread":0.2231304209605023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097896,0.0007554096,0.0007852169,0.002287278,0.0008176874,0.001791229,0.0009874504,0.001075755,0.001738385],"category_scores_gemma":[0.01354003,0.0005840236,0.0005105109,0.001018344,0.002919114,0.00277272,0.001519162,0.001552018,0.0002996257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337844,"about_ca_system_score_gemma":0.0006263136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002390472,"about_ca_topic_score_gemma":0.00299419,"domain_scores_codex":[0.9994862,0.0002422289,0.00001336557,0.00008596885,0.00009657455,0.00007565353],"domain_scores_gemma":[0.989352,0.008721293,0.0007592706,0.0004546992,0.0003215641,0.0003910638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000195443,0.00005548918,0.003326477,0.0002740431,0.00007283682,0.0004088929,0.0004986764,0.1500158,0.006137273,0.8201678,0.005348129,0.01349917],"study_design_scores_gemma":[0.00002449748,0.00002348306,0.001262051,0.00003588808,0.00002581915,0.0001067782,0.00007813152,0.3616885,0.001245923,0.6341674,0.001314757,0.00002668751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5075716,0.005733598,0.4530435,0.006121921,0.0001791405,0.0001037377,0.0003538539,0.0008761218,0.02601638],"genre_scores_gemma":[0.9843352,0.001336978,0.01100165,0.00019877,0.0001300698,0.00009615017,0.0001274864,0.00008461012,0.002689069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002390472,"threshold_uncertainty_score":0.009706736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Colin Cooper","is_ca":false},{"name":"Alan Frieze","is_ca":false},{"name":"Bruce Reed","is_ca":false},{"name":"Oliver Riordan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04185882661710374,"gpt":0.2727915680550093,"spread":0.2309327414379056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271415,0.0006184923,0.0007791169,0.002128226,0.001407978,0.002263614,0.002277744,0.001061496,0.002179556],"category_scores_gemma":[0.02735103,0.0008763139,0.0006768261,0.001216214,0.005872347,0.00472452,0.001854407,0.002583804,0.0003205711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002979531,"about_ca_system_score_gemma":0.0008950262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003019578,"about_ca_topic_score_gemma":0.003791852,"domain_scores_codex":[0.9981428,0.0007067683,0.00004441202,0.0004103971,0.0003780912,0.0003174336],"domain_scores_gemma":[0.9574071,0.03016949,0.005100833,0.004307941,0.001412592,0.001602008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004854228,0.0001609221,0.009827147,0.0001307382,0.00009868182,0.0003081307,0.0007018123,0.09502537,0.008326188,0.8705935,0.003766026,0.01057596],"study_design_scores_gemma":[0.0001202954,0.00006832116,0.006473099,0.00003643986,0.00005779978,0.0004257008,0.0001362078,0.5765814,0.003596302,0.4094601,0.002976374,0.00006798176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7125967,0.000744667,0.2657293,0.003001192,0.00005308431,0.000120214,0.000453401,0.0005356651,0.01676578],"genre_scores_gemma":[0.9818288,0.0005166534,0.01363524,0.0002061988,0.000115432,0.0001335046,0.0002547991,0.00008512136,0.003224239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003271415,"threshold_uncertainty_score":0.02161813,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Tomasz Łuczak","is_ca":false},{"name":"Yuejian Peng","is_ca":false},{"name":"V. Rödl","is_ca":false},{"name":"Andrzej Ruciński","is_ca":false},{"name":"Jozef Skokan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03560432321952448,"gpt":0.3152638023033849,"spread":0.2796594790838604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090248,0.0002499941,0.0005118516,0.001340965,0.00119599,0.001954166,0.000729884,0.0006868381,0.004709175],"category_scores_gemma":[0.0105408,0.0004621886,0.0003703824,0.0007979376,0.001565689,0.003455416,0.001407665,0.0008384315,0.0003817726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187386,"about_ca_system_score_gemma":0.0006148598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001329577,"about_ca_topic_score_gemma":0.001051303,"domain_scores_codex":[0.9994947,0.0001439438,0.00002235817,0.000120106,0.00009028354,0.0001285488],"domain_scores_gemma":[0.9953957,0.002693328,0.0005540975,0.0004795414,0.0003117199,0.0005655012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006968223,0.00006773258,0.008677724,0.0002096884,0.00004513585,0.0001920429,0.0008066059,0.03209205,0.009362821,0.9037634,0.007319247,0.03676665],"study_design_scores_gemma":[0.00006777107,0.0001107115,0.005780526,0.00009472212,0.00005328394,0.0005442908,0.000382023,0.1480647,0.004732131,0.8325546,0.007554428,0.00006073661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9300764,0.001250154,0.04385465,0.0009893228,0.0000521088,0.00003673507,0.0004051435,0.0002365728,0.02309895],"genre_scores_gemma":[0.9914584,0.0004054115,0.005845234,0.0001013359,0.00004080294,0.00006026553,0.0001393668,0.00004487344,0.001904364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004709175,"threshold_uncertainty_score":0.01575381,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Neal Madras","is_ca":true},{"name":"C. Chris Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04799376499972036,"gpt":0.3051219160581148,"spread":0.2571281510583945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001255439,0.0001921091,0.0002111847,0.0004522755,0.0003788256,0.0005785922,0.0003827065,0.0003278133,0.001401536],"category_scores_gemma":[0.001126704,0.0001603122,0.0001939541,0.0003118502,0.001046746,0.0008019048,0.0004583533,0.0003766648,0.000144535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003212371,"about_ca_system_score_gemma":0.0001319993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009192572,"about_ca_topic_score_gemma":0.001197046,"domain_scores_codex":[0.9998916,0.00002544293,0.000005104163,0.00002069435,0.00002511593,0.0000318821],"domain_scores_gemma":[0.9992868,0.000306135,0.0001729952,0.00007473955,0.00005447528,0.0001048779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002049522,0.000119961,0.009626417,0.0001291082,0.00004328553,0.001023955,0.0008877131,0.09051574,0.02924746,0.8491158,0.001776896,0.01730879],"study_design_scores_gemma":[0.00005372256,0.00009929636,0.004883263,0.00002310439,0.00001989109,0.0005504575,0.0006802235,0.3387322,0.009260943,0.6416836,0.003986259,0.0000270168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9828526,0.0001038192,0.01232225,0.00008201192,0.00001381035,0.000007244173,0.00002753208,0.00003826313,0.004552494],"genre_scores_gemma":[0.9960265,0.00008901618,0.002435197,0.00002464879,0.000009680937,0.00000632275,0.00003877826,0.00000905257,0.001360654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001401536,"threshold_uncertainty_score":0.004688621,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nathan Linial","is_ca":false},{"name":"Jiřı́ Matoušek","is_ca":false},{"name":"Or Sheffet","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03306435827015908,"gpt":0.2590236197809189,"spread":0.2259592615107598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003015478,0.000362387,0.0005106664,0.0004167058,0.0006747507,0.001105979,0.0008723614,0.0007549846,0.002795473],"category_scores_gemma":[0.002844443,0.0003811525,0.0005235805,0.0006213206,0.00100345,0.001359936,0.001074008,0.0007474626,0.0005344725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086894,"about_ca_system_score_gemma":0.0004994951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836463,"about_ca_topic_score_gemma":0.002151222,"domain_scores_codex":[0.9993802,0.0000934026,0.00003347861,0.0002246402,0.0001326043,0.0001356686],"domain_scores_gemma":[0.9975722,0.0006553355,0.000451814,0.0008369528,0.0002228995,0.0002608806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002441482,0.0002440519,0.01545964,0.0007624627,0.0002081267,0.001576962,0.001396782,0.08654274,0.2790339,0.4669898,0.02030851,0.1250356],"study_design_scores_gemma":[0.0002252194,0.0005438641,0.0118385,0.00006077182,0.0001627452,0.002979892,0.0003537972,0.2700998,0.0592016,0.6128985,0.04153165,0.0001036745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8325962,0.0008014351,0.1357524,0.001088013,0.0001365884,0.00009541793,0.0006899809,0.001228152,0.02761175],"genre_scores_gemma":[0.950062,0.0002031604,0.04185174,0.0002751188,0.00005212149,0.00005212646,0.00060116,0.0001141506,0.006788498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002795473,"threshold_uncertainty_score":0.00935185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Roman Glebov","is_ca":false},{"name":"Tibor Szabó","is_ca":false},{"name":"Gábor Tardos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04105905275934962,"gpt":0.2772389971211725,"spread":0.2361799443618229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497758,0.0004580978,0.0004662579,0.001834978,0.001579067,0.002122674,0.002157941,0.001009837,0.002715158],"category_scores_gemma":[0.01426217,0.0005157337,0.0004828046,0.001438188,0.003220328,0.003573124,0.0019361,0.00176727,0.0002396425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002774858,"about_ca_system_score_gemma":0.0007130448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002836781,"about_ca_topic_score_gemma":0.00222339,"domain_scores_codex":[0.9988317,0.0004084829,0.00003146745,0.0002473563,0.0002707684,0.0002102945],"domain_scores_gemma":[0.9872938,0.007736663,0.001385282,0.001692471,0.000882499,0.001009259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001878838,0.00004743217,0.00461535,0.00009756668,0.00005181436,0.0001512273,0.0005688466,0.1033945,0.008214234,0.870221,0.002034492,0.01041563],"study_design_scores_gemma":[0.00003161126,0.00003029265,0.001937583,0.00001996544,0.00001316231,0.0001823864,0.0001160352,0.2744854,0.002809874,0.7181676,0.002173444,0.0000326562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7681324,0.001159534,0.2121719,0.001298872,0.00007583395,0.00004741835,0.0002765921,0.0003173186,0.01652007],"genre_scores_gemma":[0.9841282,0.0002517996,0.0129863,0.0001034158,0.0000422782,0.00003637702,0.0001176603,0.00006963853,0.002264444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002836781,"threshold_uncertainty_score":0.02013314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Independent set; Graph; Random graph; Binary logarithm; Discrete mathematics; Computer science","authors":[{"name":"József Balogh","is_ca":false},{"name":"Choongbum Lee","is_ca":false},{"name":"Wojciech Samotij","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04987376170402692,"gpt":0.296083561940946,"spread":0.2462098002369191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007249996,0.00134137,0.002932967,0.004036695,0.002712015,0.002768956,0.003480248,0.002767511,0.009062541],"category_scores_gemma":[0.04999683,0.0009715979,0.002906141,0.003216894,0.00746355,0.01184131,0.005185906,0.006028851,0.001535961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003183066,"about_ca_system_score_gemma":0.001572645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003539909,"about_ca_topic_score_gemma":0.00203044,"domain_scores_codex":[0.9963757,0.001131137,0.000113501,0.0008860363,0.001055083,0.0004384228],"domain_scores_gemma":[0.961129,0.02750546,0.001912809,0.005478426,0.002426238,0.00154799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009125544,0.00003387304,0.0009292272,0.0001729443,0.00005047502,0.0001419847,0.0002202156,0.009223512,0.0006904725,0.9692975,0.007786779,0.01136171],"study_design_scores_gemma":[0.00006861193,0.00006680933,0.0007851861,0.00004462816,0.00004453773,0.0003320919,0.0000549849,0.08847468,0.0007549264,0.8992255,0.01010391,0.0000441552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08689854,0.005076143,0.8293839,0.01536822,0.0008140916,0.0002452345,0.0009437578,0.001313892,0.05995622],"genre_scores_gemma":[0.8682293,0.006311251,0.09004556,0.006665098,0.002766279,0.0007862112,0.0007683216,0.000610116,0.02381789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009062541,"threshold_uncertainty_score":0.03834212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ross J. Kang","is_ca":true},{"name":"Colin McDiarmid","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02305560789031328,"gpt":0.2937450395494833,"spread":0.27068943165917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741496,0.0006605702,0.0006274491,0.001961929,0.001116186,0.002922244,0.001434045,0.001019911,0.002289476],"category_scores_gemma":[0.01604883,0.0005231131,0.0005749245,0.001528337,0.005574062,0.006539842,0.001748198,0.002109925,0.0003653372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002739096,"about_ca_system_score_gemma":0.0009329334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001866142,"about_ca_topic_score_gemma":0.001069718,"domain_scores_codex":[0.998931,0.0002534781,0.00005315268,0.0002751702,0.0002451813,0.0002421061],"domain_scores_gemma":[0.991987,0.003779642,0.001255449,0.001258636,0.0007376022,0.0009816624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001092731,0.00002345254,0.002116063,0.00005875497,0.00001485969,0.000094463,0.0002168613,0.02999544,0.003016507,0.9573233,0.001315049,0.005715789],"study_design_scores_gemma":[0.00001897684,0.00003723126,0.001642561,0.0000356735,0.00001621217,0.0001601194,0.00008599072,0.1604214,0.001946062,0.8328477,0.002741417,0.00004666801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6232248,0.002111363,0.3379161,0.003170243,0.0002270848,0.00009139648,0.0005127101,0.0004440781,0.03230223],"genre_scores_gemma":[0.9607217,0.001495941,0.030304,0.0003018684,0.0002658062,0.000164755,0.0002872219,0.0001826592,0.006276131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002922244,"threshold_uncertainty_score":0.01987368,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ernie Croot","is_ca":false},{"name":"Izabella Łaba","is_ca":true},{"name":"Olof Sisask","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.028311161675105,"gpt":0.2788819562535247,"spread":0.2505707945784197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885904,0.0006456936,0.0006872722,0.001418775,0.00125875,0.002155452,0.001144361,0.0007384419,0.003781216],"category_scores_gemma":[0.009023289,0.000568103,0.001134951,0.001223875,0.003522105,0.005317993,0.002723837,0.002649547,0.0009248322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213775,"about_ca_system_score_gemma":0.0005924959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005084521,"about_ca_topic_score_gemma":0.000318876,"domain_scores_codex":[0.9983445,0.0003571289,0.0001243958,0.0003352273,0.0005457232,0.0002930349],"domain_scores_gemma":[0.9949251,0.002723602,0.0006456823,0.0007328694,0.0005134686,0.0004592101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001666986,0.0000436223,0.001654363,0.0001032183,0.00001693796,0.0004524033,0.0003657034,0.006001603,0.006110559,0.9599056,0.00214166,0.02303772],"study_design_scores_gemma":[0.00001908814,0.0001086604,0.001206765,0.00004020999,0.00001844656,0.0007365764,0.0001056741,0.04018764,0.006376332,0.9456316,0.005531971,0.00003709423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5211287,0.001855209,0.4105465,0.002353882,0.0004527879,0.00006308489,0.0004037904,0.000965254,0.06223083],"genre_scores_gemma":[0.9277935,0.0005045739,0.06052689,0.0005522749,0.0004128785,0.0001190457,0.0002442098,0.0002718827,0.009574665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003781216,"threshold_uncertainty_score":0.01264948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lingsheng Shi","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02171806529547255,"gpt":0.2602170401959569,"spread":0.2384989749004844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506545,0.0004144271,0.000512558,0.0009729791,0.0008444585,0.001488762,0.001461352,0.0009883704,0.002970139],"category_scores_gemma":[0.01164686,0.0003894078,0.0005535803,0.0005681154,0.002986294,0.00204899,0.001728443,0.001201729,0.0004649905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002162279,"about_ca_system_score_gemma":0.0007272932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003086468,"about_ca_topic_score_gemma":0.003290167,"domain_scores_codex":[0.9988763,0.000422757,0.00002935609,0.0002097264,0.0002262283,0.0002355298],"domain_scores_gemma":[0.9891043,0.007046641,0.001216841,0.001376419,0.0006594766,0.0005964276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005877962,0.00008874074,0.007376977,0.000154708,0.00008536645,0.0006465111,0.0006229372,0.2116222,0.02539244,0.7322184,0.00311928,0.01808453],"study_design_scores_gemma":[0.00004641152,0.00006560146,0.00117469,0.00001792981,0.0000219737,0.0002402508,0.00008243819,0.5297604,0.005461101,0.4611986,0.001896521,0.00003403599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7913297,0.0002613649,0.1952634,0.000828671,0.0000498311,0.00005208745,0.0001283228,0.0005226363,0.01156393],"genre_scores_gemma":[0.9768021,0.0001745527,0.01838794,0.0001648514,0.00002562672,0.00004196863,0.0001008286,0.0001067149,0.004195508],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003086468,"threshold_uncertainty_score":0.01568848,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"N. Sauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439963554927065,"gpt":0.248925663942766,"spread":0.2245260283934953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962209,0.0004938659,0.000721527,0.001755712,0.002218845,0.005452708,0.001344949,0.00103515,0.0146958],"category_scores_gemma":[0.00726438,0.0004991714,0.0008051236,0.001284268,0.002662806,0.004924136,0.002644503,0.001041587,0.001978106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001928616,"about_ca_system_score_gemma":0.001052222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001976141,"about_ca_topic_score_gemma":0.002797931,"domain_scores_codex":[0.998357,0.0002307446,0.00006190714,0.0004105789,0.0004010227,0.0005386535],"domain_scores_gemma":[0.9966925,0.001179264,0.0002366351,0.0007752827,0.0005719111,0.0005443113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001013031,0.00002591225,0.001152638,0.00003862343,0.00000907887,0.0001236709,0.0004221974,0.003593575,0.00239035,0.9829355,0.001474243,0.007732909],"study_design_scores_gemma":[0.00001632712,0.00002183661,0.0004948404,0.00002078946,0.00001617965,0.0002097681,0.0004045915,0.02499873,0.005156335,0.9621139,0.00651958,0.00002710277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6146016,0.0007819477,0.2597499,0.0006000489,0.0001595034,0.0001819031,0.001530627,0.00171342,0.1206811],"genre_scores_gemma":[0.9501911,0.0003199416,0.03186931,0.000100089,0.00004642795,0.0001016131,0.0009388442,0.0004701862,0.01596243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0146958,"threshold_uncertainty_score":0.04916233,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mahshid Atapour","is_ca":true},{"name":"Neal Madras","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05303729583454216,"gpt":0.3152075288856322,"spread":0.2621702330510901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006338315,0.001980348,0.002582376,0.004421813,0.001962509,0.003157479,0.004720423,0.00219339,0.0100668],"category_scores_gemma":[0.05080763,0.0009684708,0.00312515,0.002169882,0.004875585,0.007174049,0.003669598,0.005047784,0.001704231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002815057,"about_ca_system_score_gemma":0.0009581594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074598,"about_ca_topic_score_gemma":0.000728804,"domain_scores_codex":[0.9956091,0.00156491,0.0001621801,0.001143923,0.0009937965,0.0005261334],"domain_scores_gemma":[0.9503784,0.03804646,0.003811885,0.004055778,0.001704874,0.002002658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003825982,0.0001569467,0.00417345,0.0002451605,0.0002134164,0.000548078,0.0005683809,0.04002747,0.004292369,0.9292139,0.005785455,0.01439275],"study_design_scores_gemma":[0.0001180338,0.0001009987,0.001369006,0.00006283759,0.00005230777,0.0004203021,0.00007662311,0.2193508,0.001896835,0.7746189,0.001855222,0.0000779802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4933606,0.002587702,0.447635,0.004333851,0.000260684,0.0002515094,0.001910276,0.002036703,0.04762359],"genre_scores_gemma":[0.9300935,0.001206142,0.05400745,0.001029052,0.0004356564,0.0009571438,0.001675451,0.000649898,0.009945625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0100668,"threshold_uncertainty_score":0.0336768,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Louis Esperet","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Bartosz Walczak","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0581101267166381,"gpt":0.2964187187545243,"spread":0.2383085920378862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353791,0.0005031885,0.0006730892,0.001050361,0.0009658975,0.001460015,0.001530509,0.0009234111,0.004828841],"category_scores_gemma":[0.002955878,0.0007175533,0.0006053183,0.001287841,0.001402051,0.001766315,0.001830265,0.001119182,0.0005335263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002046119,"about_ca_system_score_gemma":0.000553945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004267813,"about_ca_topic_score_gemma":0.005321092,"domain_scores_codex":[0.9992415,0.0001111117,0.00003274691,0.0002375225,0.0001957282,0.0001813883],"domain_scores_gemma":[0.9959565,0.001632651,0.0006795158,0.0007189977,0.0005830878,0.0004292607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001127141,0.0002368937,0.01206174,0.0007164016,0.0002076941,0.00124696,0.001403618,0.2453171,0.18616,0.4898188,0.008455887,0.05324778],"study_design_scores_gemma":[0.0001490157,0.0002604065,0.01276676,0.0001243698,0.0001574212,0.001438693,0.0006715648,0.3451564,0.06695306,0.554105,0.01807105,0.0001463034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8706222,0.0004748793,0.1144038,0.0006740217,0.00004436578,0.00007354705,0.000731555,0.0004961831,0.01247953],"genre_scores_gemma":[0.9671941,0.0001934186,0.02790034,0.0001449307,0.00001813147,0.00003706995,0.0004903642,0.00008363998,0.003938001],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004828841,"threshold_uncertainty_score":0.01615411,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Deepak Bal","is_ca":true},{"name":"Anthony Bonato","is_ca":true},{"name":"William B. Kinnersley","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07483190199436138,"gpt":0.2877698644004989,"spread":0.2129379624061375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001769895,0.001118686,0.001608499,0.00127974,0.001927599,0.003025494,0.001932018,0.001688335,0.009068692],"category_scores_gemma":[0.01025775,0.0007085371,0.001073082,0.001129767,0.004247424,0.007619324,0.003577102,0.002418129,0.001049899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001697393,"about_ca_system_score_gemma":0.0007590193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001435588,"about_ca_topic_score_gemma":0.001166151,"domain_scores_codex":[0.9975019,0.001009553,0.00009132977,0.0004285521,0.000457893,0.0005107508],"domain_scores_gemma":[0.9949147,0.00267664,0.0007296412,0.000551204,0.0002803339,0.0008474377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001272468,0.00003386286,0.0002753925,0.00007244256,0.00002176477,0.0001657468,0.0001662204,0.06068109,0.001035375,0.9315571,0.001562945,0.004300809],"study_design_scores_gemma":[0.00004071615,0.00005571881,0.0001924253,0.00002896087,0.00001139062,0.0001140282,0.0001685128,0.2237087,0.000892847,0.7705728,0.004187203,0.00002652476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3038471,0.001111384,0.6210206,0.001489038,0.0002757824,0.0002507302,0.0003319415,0.0002950072,0.07137837],"genre_scores_gemma":[0.9040642,0.0008838216,0.06935194,0.0003114881,0.0001884334,0.0004061177,0.0002493179,0.0002273144,0.02431755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009068692,"threshold_uncertainty_score":0.03033781,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Monotone polygon; Mathematics; Vertex (graph theory); Graph; Monotonic function; Discrete mathematics; Geometry","authors":[{"name":"Louigi Addario‐Berry","is_ca":false},{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05812707044240926,"gpt":0.3213482555105076,"spread":0.2632211850680983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971276,0.0003206815,0.0005993028,0.001852856,0.00146504,0.002027046,0.001498009,0.001386144,0.005857966],"category_scores_gemma":[0.02157393,0.0004617526,0.0007601068,0.0007901791,0.002317,0.004023502,0.00199466,0.001885613,0.0002758274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001163526,"about_ca_system_score_gemma":0.0004283046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008046209,"about_ca_topic_score_gemma":0.0008440177,"domain_scores_codex":[0.9982247,0.0004141481,0.00007427837,0.0004700258,0.0005064579,0.0003104208],"domain_scores_gemma":[0.9767821,0.01587745,0.002571281,0.001853017,0.001103739,0.001812365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006605704,0.0002055595,0.02439691,0.0002632971,0.00007724739,0.0004764939,0.001370792,0.02630849,0.01165622,0.8939961,0.00424294,0.03634534],"study_design_scores_gemma":[0.0001256235,0.0002322677,0.008214235,0.00006333516,0.00006712039,0.001181719,0.0003221809,0.2684784,0.003902524,0.7125632,0.004803846,0.00004551457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8915918,0.0002389794,0.09371302,0.001050314,0.00003111549,0.00007711316,0.0003543244,0.000160727,0.0127826],"genre_scores_gemma":[0.9908494,0.0001437847,0.007288808,0.0001349546,0.00008704077,0.00008996671,0.0002775737,0.0000385753,0.001089857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005857966,"threshold_uncertainty_score":0.01959687,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Nicolas Broutin","is_ca":false},{"name":"Gábor Lugosi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02440755301033561,"gpt":0.2437544791994999,"spread":0.2193469261891643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000317399,0.0002546784,0.0003220632,0.0006040657,0.0008006701,0.0007737896,0.0006704457,0.0006801138,0.002453385],"category_scores_gemma":[0.004590319,0.0002094006,0.0002335535,0.0007568399,0.000825471,0.002311307,0.0008284047,0.0005817184,0.0002608185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004779372,"about_ca_system_score_gemma":0.0004871364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006500859,"about_ca_topic_score_gemma":0.0008205942,"domain_scores_codex":[0.9997664,0.00005248859,0.000008105775,0.00006783944,0.00005313664,0.00005202348],"domain_scores_gemma":[0.9984327,0.0008233303,0.0003170135,0.0001173337,0.0001284455,0.0001812744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006346507,0.0001175614,0.008505217,0.0006753466,0.0001049154,0.001052767,0.0006567642,0.1545141,0.0196833,0.7458602,0.009074884,0.05912024],"study_design_scores_gemma":[0.00005911971,0.0001373409,0.003312541,0.00004858609,0.00003188852,0.0006965821,0.0002973051,0.2164758,0.004717115,0.7657368,0.008448993,0.00003788893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.862172,0.0007528152,0.1227653,0.0013832,0.0000516004,0.0000377839,0.0008848447,0.0001689421,0.01178351],"genre_scores_gemma":[0.9584022,0.0005547088,0.03720811,0.0001086096,0.00006412953,0.00005327518,0.0005516275,0.00004839957,0.003008863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002453385,"threshold_uncertainty_score":0.008207381,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Martin T. Barlow","is_ca":true},{"name":"Jian Ding","is_ca":false},{"name":"Asaf Nachmias","is_ca":false},{"name":"Yuval Peres","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04537290750389973,"gpt":0.2617930503216758,"spread":0.2164201428177761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212075,0.0005123265,0.0006670643,0.001579294,0.0008787333,0.001845851,0.001416368,0.002013107,0.005316165],"category_scores_gemma":[0.01914631,0.0006302276,0.000628553,0.000905979,0.001962655,0.005143946,0.001171336,0.003281916,0.0006395348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003267352,"about_ca_system_score_gemma":0.000817948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00335737,"about_ca_topic_score_gemma":0.001411901,"domain_scores_codex":[0.9989548,0.0001275037,0.00003168209,0.0004182986,0.0002421417,0.0002256595],"domain_scores_gemma":[0.9921548,0.005097873,0.0006079492,0.0009055117,0.0006780282,0.0005558527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005700006,0.0001903631,0.01711471,0.0004186507,0.000146227,0.0007580167,0.001034356,0.187393,0.05329756,0.6759095,0.01316017,0.05000743],"study_design_scores_gemma":[0.00004783827,0.0001566568,0.01132016,0.0001115673,0.00006103572,0.0009269009,0.0003446718,0.7110638,0.01273311,0.2434281,0.01970031,0.0001058312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8009855,0.002885983,0.1502302,0.005748619,0.0003020175,0.00009037846,0.002012928,0.001852576,0.03589185],"genre_scores_gemma":[0.9704625,0.0009319766,0.02224114,0.0003269004,0.0001428334,0.00009995488,0.0008090159,0.0003397074,0.004645954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005316165,"threshold_uncertainty_score":0.02370638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Carlos Hoppen","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03350324420973928,"gpt":0.271821734146239,"spread":0.2383184899364997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009511354,0.0003319125,0.0004582768,0.001107412,0.0005665373,0.001263946,0.0007355108,0.0006621264,0.001891255],"category_scores_gemma":[0.009852075,0.0004698269,0.0005566672,0.0009865895,0.00139973,0.002505603,0.0008478198,0.000896173,0.0003082405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007589557,"about_ca_system_score_gemma":0.000429345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000582037,"about_ca_topic_score_gemma":0.00129206,"domain_scores_codex":[0.9989707,0.0003379783,0.00004395741,0.0002236968,0.0002207498,0.0002028314],"domain_scores_gemma":[0.9842963,0.0122952,0.001216536,0.001114005,0.0005555185,0.0005225341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006566144,0.0002286606,0.01448269,0.0005078159,0.0001290873,0.001056675,0.0007275153,0.3193234,0.04583509,0.5358434,0.00406888,0.07714012],"study_design_scores_gemma":[0.0000457667,0.00009995424,0.00433677,0.00003658436,0.00005039688,0.0008470249,0.0001425284,0.4413971,0.01005509,0.5392945,0.003664496,0.00002977304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5641004,0.0008813976,0.4232515,0.0004879952,0.00003571068,0.0001012327,0.0004200816,0.0007229325,0.009998647],"genre_scores_gemma":[0.9392158,0.0005008742,0.05678201,0.0001132303,0.00007082516,0.0001359801,0.0004645649,0.0001485939,0.002568023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001891255,"threshold_uncertainty_score":0.006326854,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianluca De Marco","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.040548659523732,"gpt":0.3082475723341714,"spread":0.2676989128104394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051761,0.002777657,0.004136711,0.002581744,0.002956199,0.006046157,0.008206433,0.004984918,0.006647574],"category_scores_gemma":[0.05591996,0.001963801,0.002431936,0.004190116,0.006089559,0.01606632,0.006770684,0.006634994,0.002025149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005158265,"about_ca_system_score_gemma":0.004799338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003241495,"about_ca_topic_score_gemma":0.0043202,"domain_scores_codex":[0.9797882,0.009686023,0.0009146727,0.004035816,0.002598238,0.002977069],"domain_scores_gemma":[0.9073517,0.07224523,0.004680553,0.0117906,0.002010013,0.001921973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00360842,0.0009359199,0.003926756,0.001072264,0.0004858525,0.0002460374,0.0007413917,0.4135832,0.007383203,0.3693695,0.02605041,0.172597],"study_design_scores_gemma":[0.00039914,0.0001258121,0.0003037688,0.00004468543,0.00007129728,0.00008977314,0.00006693347,0.5113345,0.001998564,0.4830668,0.002450374,0.00004834698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06777526,0.001742074,0.9128399,0.003470536,0.0002698044,0.0004685856,0.0007324831,0.004053987,0.008647351],"genre_scores_gemma":[0.4777888,0.00124848,0.5058901,0.001554955,0.0008858436,0.001307753,0.002029905,0.001208986,0.008085332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051761,"threshold_uncertainty_score":0.05562311,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Graph; Focus (optics); Forcing (mathematics); Minor (academic); Degree (music); Variation (astronomy)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.135359305568294,"gpt":0.3241944948805693,"spread":0.1888351893122753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448635,0.0004910193,0.001063204,0.0008423762,0.002228496,0.001907981,0.001199516,0.001502539,0.01354529],"category_scores_gemma":[0.01391319,0.0006123533,0.0009953685,0.0006283668,0.002710767,0.005979463,0.004148215,0.001865129,0.0019418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001491887,"about_ca_system_score_gemma":0.0007694381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009480507,"about_ca_topic_score_gemma":0.001309368,"domain_scores_codex":[0.9983285,0.00038047,0.00008154959,0.0005238557,0.0003086285,0.0003770635],"domain_scores_gemma":[0.9898871,0.00520784,0.0008181456,0.002009547,0.0008406651,0.001236735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003996879,0.00009638811,0.002665457,0.0002761125,0.00003942409,0.0003657857,0.0008312095,0.0109578,0.01494383,0.9292817,0.01873847,0.02140413],"study_design_scores_gemma":[0.00009380739,0.0001521122,0.0009516428,0.00005082681,0.00002601834,0.0007031631,0.0003850212,0.04671917,0.006157093,0.9186607,0.0260625,0.00003787646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6256072,0.001001325,0.2710551,0.009585175,0.0006824164,0.0001749601,0.001398633,0.002346866,0.08814844],"genre_scores_gemma":[0.9484692,0.0002909906,0.03109518,0.001234637,0.0004965576,0.0001638789,0.0008789218,0.0003478499,0.01702273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01354529,"threshold_uncertainty_score":0.04531354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hamed Hatami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02129531390923371,"gpt":0.2567866917483657,"spread":0.235491377839132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004119331,0.000955971,0.001030927,0.001668333,0.0009983919,0.002590594,0.00154841,0.001195946,0.003680292],"category_scores_gemma":[0.02262457,0.0008439936,0.001517645,0.001667818,0.00330577,0.005185867,0.001851754,0.003060885,0.000411412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002908347,"about_ca_system_score_gemma":0.0007305486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002557813,"about_ca_topic_score_gemma":0.001405309,"domain_scores_codex":[0.9967073,0.001257608,0.0001070821,0.0006615609,0.0008249768,0.0004414313],"domain_scores_gemma":[0.975226,0.02085532,0.001345869,0.0009493199,0.0007550312,0.0008684528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002643551,0.00004240931,0.002980958,0.0001436559,0.00008367378,0.0002167919,0.0004973995,0.139196,0.002706094,0.8303468,0.0008210337,0.02270084],"study_design_scores_gemma":[0.00004820032,0.00008949373,0.001677043,0.00004820298,0.00005650363,0.0001540652,0.00005387574,0.3822271,0.002097094,0.6102722,0.003239855,0.00003639163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2915022,0.002521188,0.683743,0.001175431,0.00005609092,0.00008216221,0.0004183982,0.0003852888,0.0201162],"genre_scores_gemma":[0.9280825,0.001088197,0.0664855,0.0002083665,0.0001760083,0.0001215097,0.0002734206,0.00009371863,0.003470763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004119331,"threshold_uncertainty_score":0.02178538,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","authors":[{"name":"Abbas Mehrabian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04472043208422285,"gpt":0.2486108397810878,"spread":0.2038904076968649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443523,0.002121133,0.002445188,0.002913624,0.003059185,0.005546742,0.005011554,0.002857913,0.01795221],"category_scores_gemma":[0.024162,0.001240621,0.002425774,0.002374635,0.005224305,0.01530453,0.004667162,0.006976787,0.002836369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004012166,"about_ca_system_score_gemma":0.001652872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002417003,"about_ca_topic_score_gemma":0.002588992,"domain_scores_codex":[0.9961628,0.0006206773,0.0001298082,0.000981848,0.0007264921,0.001378399],"domain_scores_gemma":[0.9770401,0.01568251,0.001476776,0.002838055,0.0009838585,0.001978804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001416403,0.0004286306,0.004601499,0.0007048864,0.0002115692,0.0009290433,0.0005907131,0.1471864,0.01099852,0.7621681,0.02807122,0.04269299],"study_design_scores_gemma":[0.0001059947,0.0001981281,0.001431276,0.0001615561,0.0001193519,0.0007017583,0.0001850998,0.3548589,0.009537738,0.6201557,0.0124045,0.0001399868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2608509,0.005160426,0.4831812,0.007776014,0.0008757365,0.0003506383,0.001830381,0.001691479,0.2382832],"genre_scores_gemma":[0.8985494,0.003617324,0.07049835,0.001088569,0.0009057146,0.0006448266,0.00140836,0.001106096,0.02218138],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01795221,"threshold_uncertainty_score":0.06005609,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Johannsen","is_ca":false},{"name":"Michael Krivelevich","is_ca":false},{"name":"Wojciech Samotij","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06047673438883049,"gpt":0.2922448994312497,"spread":0.2317681650424192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000799584,0.0003570884,0.0005524202,0.001415957,0.0009514834,0.001066103,0.00061282,0.0006091598,0.004127025],"category_scores_gemma":[0.005449852,0.0003305344,0.0005993604,0.0007508544,0.001471855,0.002143014,0.001224476,0.001175217,0.0003795054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005769614,"about_ca_system_score_gemma":0.0003130975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008158237,"about_ca_topic_score_gemma":0.0007492233,"domain_scores_codex":[0.9993678,0.00009604804,0.00002835365,0.0002299518,0.0001383295,0.0001395289],"domain_scores_gemma":[0.9964282,0.001880447,0.0005210771,0.0005107857,0.0002641741,0.0003952757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001883089,0.0000779996,0.005326261,0.000211805,0.00007118701,0.0004714265,0.001019138,0.01935891,0.01440293,0.904839,0.006871114,0.04716187],"study_design_scores_gemma":[0.0000426652,0.0001184721,0.008078982,0.0000865371,0.000075246,0.001510898,0.0003963781,0.09612931,0.006556995,0.8663869,0.02057462,0.00004299274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7282709,0.001145002,0.2310085,0.0008572535,0.00005929592,0.0001349833,0.001612883,0.001119494,0.03579155],"genre_scores_gemma":[0.9762818,0.0005075242,0.0157583,0.0002764355,0.000132679,0.0001072872,0.00109038,0.0001681293,0.005677292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004127025,"threshold_uncertainty_score":0.01380628,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Core (optical fiber); Discrete mathematics; Computer science; Telecommunications","authors":[{"name":"Siu On Chan","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07341463199734996,"gpt":0.3134788066533757,"spread":0.2400641746560258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368212,0.0008166209,0.00108518,0.0007747326,0.0013754,0.002964888,0.001347233,0.0008833956,0.007521914],"category_scores_gemma":[0.004525881,0.0007243752,0.001024244,0.0006258923,0.00238918,0.004662236,0.002153605,0.001705296,0.001761604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0011725,"about_ca_system_score_gemma":0.0006300774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147785,"about_ca_topic_score_gemma":0.001259414,"domain_scores_codex":[0.9985539,0.00009034182,0.0001127913,0.000416301,0.0002472099,0.000579305],"domain_scores_gemma":[0.9937236,0.002330949,0.001003564,0.001298921,0.00079915,0.000843788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001724095,0.0005305528,0.03800735,0.0009162122,0.0001419972,0.00179687,0.002306046,0.02197957,0.08417944,0.766355,0.01298514,0.06907777],"study_design_scores_gemma":[0.0001553026,0.0003462226,0.007815968,0.000129207,0.0001703716,0.004351987,0.0009563916,0.06223752,0.07976001,0.8209553,0.02302697,0.00009460109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7498786,0.0007786538,0.1757998,0.001011225,0.000107938,0.0001387548,0.0008986634,0.001509585,0.0698769],"genre_scores_gemma":[0.9588907,0.000197898,0.03261886,0.0002440418,0.00006537008,0.0001158382,0.0003522251,0.0002355405,0.007279476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007521914,"threshold_uncertainty_score":0.02516335,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yuri Mejía Miranda","is_ca":true},{"name":"Gordon Slade","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0450147713721705,"gpt":0.2955446069150627,"spread":0.2505298355428922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350929,0.001054283,0.0006961146,0.002817686,0.0006934485,0.001420034,0.001408324,0.0009704974,0.004879149],"category_scores_gemma":[0.009789523,0.0003052081,0.000850244,0.0008712901,0.002806389,0.00299861,0.002152399,0.002345309,0.001484276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001832134,"about_ca_system_score_gemma":0.0008286933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002985226,"about_ca_topic_score_gemma":0.003454156,"domain_scores_codex":[0.9995162,0.0001351034,0.00002170338,0.00004284115,0.0002101029,0.00007405386],"domain_scores_gemma":[0.9968225,0.002011915,0.000263549,0.0002516064,0.0004234128,0.0002270089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009019719,0.00007405153,0.001427537,0.0002243917,0.00003318986,0.0002162439,0.0003111277,0.08501765,0.003837856,0.8879934,0.004075255,0.01669903],"study_design_scores_gemma":[0.00002931993,0.00001922854,0.0009151825,0.00007702983,0.0000223497,0.0001429184,0.00009443051,0.6489119,0.003060967,0.3435203,0.003145819,0.00006050346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2439632,0.00252748,0.6805266,0.002566929,0.0005553557,0.0001101229,0.0003807496,0.001318751,0.06805082],"genre_scores_gemma":[0.8513299,0.001314638,0.1231899,0.0007398608,0.0003599365,0.0003477281,0.0004277623,0.0008415908,0.0214487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004879149,"threshold_uncertainty_score":0.01632237,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Martin Dietzfelbinger","is_ca":false},{"name":"Jonathan E. Rowe","is_ca":false},{"name":"Ingo Wegener","is_ca":false},{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03047207592302767,"gpt":0.2844527148049872,"spread":0.2539806388819595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01309647,0.002588417,0.003890502,0.003337335,0.002082367,0.005133765,0.004019652,0.003000097,0.007501793],"category_scores_gemma":[0.08573004,0.001327537,0.001982104,0.003311154,0.007088396,0.01482,0.005941942,0.005635059,0.001280769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005608568,"about_ca_system_score_gemma":0.003555728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003384494,"about_ca_topic_score_gemma":0.002704433,"domain_scores_codex":[0.9930407,0.002478078,0.0002955914,0.001176327,0.001482625,0.001526718],"domain_scores_gemma":[0.9263189,0.06184743,0.003998841,0.004079449,0.00175749,0.001997789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009136267,0.0002267604,0.001590757,0.0007145024,0.0001885027,0.0002090346,0.0004887685,0.3307489,0.003051531,0.627533,0.005068961,0.02926571],"study_design_scores_gemma":[0.00008037749,0.0001055836,0.0003408832,0.0001400034,0.00006027084,0.00009911362,0.00006785434,0.5615954,0.001141693,0.4342354,0.002083593,0.00004974016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.065828,0.007478531,0.9038102,0.003637744,0.0002278188,0.0001377552,0.0004963641,0.000831301,0.01755217],"genre_scores_gemma":[0.8257432,0.004914681,0.1532493,0.001450052,0.0005167532,0.0005845478,0.0005243816,0.0007469439,0.01227006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01309647,"threshold_uncertainty_score":0.06926155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"LINGSHENG SHI","is_ca":true},{"name":"Nicholas Wormald","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02219989384872011,"gpt":0.2602597606684917,"spread":0.2380598668197716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925273,0.0003091664,0.0006364383,0.001132452,0.0008384775,0.001173981,0.001223816,0.0009962437,0.002575401],"category_scores_gemma":[0.01294347,0.0004677224,0.0007251792,0.0005486108,0.003191706,0.002126156,0.001572801,0.001219186,0.0003566007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045712,"about_ca_system_score_gemma":0.0005882257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002041,"about_ca_topic_score_gemma":0.002012039,"domain_scores_codex":[0.9984887,0.0006146962,0.00003985318,0.0003037608,0.0003042876,0.0002487783],"domain_scores_gemma":[0.9916407,0.005538163,0.0006910596,0.001176696,0.000555161,0.0003982728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002549354,0.00005272089,0.002704242,0.0001228878,0.00005379214,0.000259313,0.0003928679,0.1307587,0.01531728,0.8343968,0.001667258,0.01401913],"study_design_scores_gemma":[0.0000450196,0.00005285961,0.0009182601,0.00001749368,0.00001848249,0.0001679657,0.00006708438,0.520689,0.00440871,0.4713266,0.002256305,0.00003222092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5187362,0.0004083589,0.4648634,0.0009424012,0.00008176584,0.000117454,0.000128932,0.0005067826,0.01421479],"genre_scores_gemma":[0.9507005,0.0002324568,0.04337145,0.0002209066,0.00003752757,0.00008973862,0.00008964623,0.0001080166,0.005149782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002575401,"threshold_uncertainty_score":0.01484269,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Eigenvalues and eigenvectors; Bipartite graph; Interval (graph theory); Graph; Degree (music); Complete bipartite graph","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.06222979210801924,"gpt":0.3082428999989921,"spread":0.2460131078909729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794072,0.0003128478,0.0003478071,0.001917906,0.0005850167,0.0008074267,0.0004144344,0.0003371026,0.004129106],"category_scores_gemma":[0.001954617,0.0001989791,0.0001691001,0.0008124979,0.00101139,0.0008650318,0.0008588716,0.0004541168,0.0004797605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005020081,"about_ca_system_score_gemma":0.0001852547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005295746,"about_ca_topic_score_gemma":0.0004366452,"domain_scores_codex":[0.9996843,0.00005990682,0.000009590347,0.00005973179,0.0001032926,0.0000832157],"domain_scores_gemma":[0.9990906,0.0003961491,0.0001518574,0.0000940275,0.0001118071,0.0001556357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003814227,0.00008093275,0.00397239,0.00012292,0.00003303857,0.0003422138,0.0006332865,0.03237436,0.0280542,0.8909586,0.004715816,0.03833078],"study_design_scores_gemma":[0.00002489555,0.00002782337,0.003630234,0.00001858806,0.000007219692,0.0001607561,0.0002030384,0.1044667,0.004177085,0.8846129,0.002650879,0.00001982005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8972751,0.0003601251,0.07428471,0.0003082696,0.00003044799,0.00001936795,0.0002539794,0.000271771,0.02719616],"genre_scores_gemma":[0.9932094,0.0001197667,0.004112476,0.00005143864,0.00003360921,0.00003262406,0.0001502981,0.00004142721,0.002248982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004129106,"threshold_uncertainty_score":0.01381326,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eric Blais","is_ca":true},{"name":"Amit Weinstein","is_ca":false},{"name":"Yuichi Yoshida","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03626950082489224,"gpt":0.2789058286776164,"spread":0.2426363278527242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840302,0.0004627972,0.000824809,0.00158188,0.001673013,0.00354811,0.001279968,0.001044124,0.003435825],"category_scores_gemma":[0.01195033,0.0008973005,0.0007837703,0.001612273,0.003800508,0.00521814,0.003844557,0.001871445,0.0004137719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001832483,"about_ca_system_score_gemma":0.0007122335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028214,"about_ca_topic_score_gemma":0.001255541,"domain_scores_codex":[0.9975792,0.0007392766,0.0001863984,0.0005838245,0.0005573281,0.0003540217],"domain_scores_gemma":[0.9839706,0.008325939,0.001771136,0.002323913,0.001374273,0.002234153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001993239,0.00005023776,0.002776969,0.0001158003,0.00003147227,0.000264703,0.0008586181,0.01265792,0.008809383,0.9579807,0.001538358,0.01471644],"study_design_scores_gemma":[0.00002514471,0.00004279593,0.0007796327,0.00003126696,0.00001781821,0.0003145264,0.0002381631,0.03964337,0.0030837,0.9527928,0.003009996,0.00002079702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6962303,0.0008435991,0.2743753,0.001191097,0.00007258895,0.00007489188,0.0004362051,0.0004685732,0.02630746],"genre_scores_gemma":[0.9362835,0.0003471539,0.0578089,0.0002087287,0.00009016746,0.00008162609,0.0003264327,0.00009668299,0.004756747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00354811,"threshold_uncertainty_score":0.01329565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"József Balogh","is_ca":false},{"name":"Jane Butterfield","is_ca":true},{"name":"Ping Hu","is_ca":true},{"name":"John Lenz","is_ca":false},{"name":"Dhruv Mubayi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1124812024018226,"gpt":0.3067277013778394,"spread":0.1942464989760168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135769,0.0005984303,0.0005657279,0.002747181,0.001050978,0.002103083,0.001136493,0.0007390354,0.003252626],"category_scores_gemma":[0.006194545,0.0004602614,0.0006101467,0.001361049,0.002756617,0.003183898,0.001570486,0.001943448,0.0003911887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003186551,"about_ca_system_score_gemma":0.0004496882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002774825,"about_ca_topic_score_gemma":0.001703979,"domain_scores_codex":[0.9992157,0.0001441329,0.00002948654,0.000223142,0.0001717109,0.0002156898],"domain_scores_gemma":[0.9935515,0.004366145,0.0005981439,0.0004764746,0.0003408318,0.0006668865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000260559,0.00006130691,0.00892741,0.0001453836,0.00006037739,0.0002134575,0.0008062305,0.05415657,0.01979989,0.898309,0.002821758,0.01443817],"study_design_scores_gemma":[0.00003991506,0.000117752,0.0105674,0.0001456171,0.00007130492,0.0004607013,0.0003908225,0.264124,0.009500525,0.7074045,0.007088651,0.00008888049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8278162,0.003669151,0.108411,0.001008849,0.00005835166,0.00005917342,0.000619243,0.0004558207,0.05790221],"genre_scores_gemma":[0.9877123,0.0008436872,0.008352218,0.0001556433,0.00007158883,0.00005867099,0.000271826,0.00007959745,0.002454328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003252626,"threshold_uncertainty_score":0.02312016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mark Holmes","is_ca":false},{"name":"Thomas S. Salisbury","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04983120555318541,"gpt":0.2969762892707818,"spread":0.2471450837175964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386358,0.0003326027,0.0004936688,0.001936016,0.001050264,0.001555675,0.0009987454,0.0009375947,0.002307174],"category_scores_gemma":[0.005233946,0.0003871154,0.0003548317,0.0007577412,0.001748927,0.001523033,0.001176262,0.0008309231,0.000417203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250527,"about_ca_system_score_gemma":0.0004020193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002643796,"about_ca_topic_score_gemma":0.002416043,"domain_scores_codex":[0.9996594,0.00008967162,0.00001202539,0.00006390452,0.00009878056,0.00007613613],"domain_scores_gemma":[0.9977987,0.001003541,0.0003866104,0.0001450701,0.000311403,0.0003546576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002135332,0.00006603466,0.004395882,0.00008194323,0.00002287241,0.0005969502,0.0006547093,0.0927225,0.007113896,0.8869681,0.001495641,0.005667896],"study_design_scores_gemma":[0.00005122987,0.00004504906,0.002106667,0.00002238037,0.00001728699,0.0003415512,0.0002234086,0.4677503,0.002823714,0.5255,0.001077999,0.00004041431],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9372454,0.0002612208,0.04978236,0.000507315,0.00001395509,0.00002757042,0.0001289016,0.0001447467,0.0118885],"genre_scores_gemma":[0.9937616,0.00008506977,0.004067947,0.00004314363,0.00001219568,0.00002751728,0.0001052963,0.00001868685,0.001878666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.002643796,"threshold_uncertainty_score":0.009073198,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"József Solymosi","is_ca":true},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02763155120852391,"gpt":0.2659481453081043,"spread":0.2383165940995804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279494,0.0005263516,0.001600956,0.001636612,0.003400915,0.005220217,0.001495071,0.00369326,0.009299529],"category_scores_gemma":[0.02527326,0.0005803248,0.0009239611,0.002426167,0.01099835,0.01439741,0.005091853,0.006915797,0.001809387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002325131,"about_ca_system_score_gemma":0.0008332442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001815568,"about_ca_topic_score_gemma":0.0007149149,"domain_scores_codex":[0.9980793,0.0006589559,0.00006574817,0.0004492228,0.0004918019,0.0002549732],"domain_scores_gemma":[0.9885998,0.008778317,0.0005023165,0.0008628523,0.0007472173,0.0005096495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009805783,0.00001834847,0.0004521554,0.00005357601,0.000007879216,0.00006876416,0.0004364004,0.001173933,0.0003693401,0.9794448,0.008888864,0.008987889],"study_design_scores_gemma":[0.00001528434,0.00001334533,0.0001743594,0.00001763951,0.000004076883,0.00008892541,0.000224411,0.0009263788,0.0002015619,0.989546,0.008778176,0.000009881825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3263024,0.01085456,0.2377715,0.1816688,0.002971748,0.00005164288,0.0008001811,0.00121582,0.2383634],"genre_scores_gemma":[0.9430269,0.003852268,0.02092176,0.007303485,0.002949296,0.00007356868,0.0003355023,0.0003902666,0.02114697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009299529,"threshold_uncertainty_score":0.03110999,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1409898485536636,"gpt":0.326499426148521,"spread":0.1855095775948574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498455,0.0009652477,0.001187521,0.001579462,0.002311879,0.003030012,0.003477725,0.002763752,0.01054205],"category_scores_gemma":[0.01752527,0.0008730041,0.001011703,0.003142718,0.002545616,0.005849179,0.008346431,0.005091998,0.002785479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001511511,"about_ca_system_score_gemma":0.0008158906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009090473,"about_ca_topic_score_gemma":0.0009245781,"domain_scores_codex":[0.9949381,0.0009874132,0.0003761968,0.001013293,0.002063549,0.0006213987],"domain_scores_gemma":[0.9871054,0.006430025,0.001551072,0.002381512,0.001392199,0.001139914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002149905,0.0002212922,0.01092788,0.0007429649,0.0002596813,0.001952103,0.001334282,0.02592909,0.02452692,0.8106147,0.01247688,0.1088643],"study_design_scores_gemma":[0.0003420648,0.0002103266,0.00456996,0.0001296934,0.0001015985,0.002618759,0.0009878015,0.05828307,0.01892846,0.8783252,0.03533409,0.0001690425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5103283,0.00186224,0.440488,0.002986164,0.0004671858,0.0001741888,0.002288796,0.0005200073,0.04088512],"genre_scores_gemma":[0.8163715,0.0008432688,0.170867,0.0005130044,0.0002059557,0.0002505557,0.002023471,0.0001489383,0.008776317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01054205,"threshold_uncertainty_score":0.0352667,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Computer science","authors":[{"name":"Luke Pebody","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02098889112792466,"gpt":0.2596845590390479,"spread":0.2386956679111233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692461,0.0006827644,0.0008243875,0.00160822,0.001476645,0.001963842,0.001189448,0.001294147,0.009702491],"category_scores_gemma":[0.007850242,0.0006036487,0.0008484906,0.0008455366,0.002295862,0.003683643,0.004107514,0.002250515,0.002180714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006757932,"about_ca_system_score_gemma":0.0005279923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007289936,"about_ca_topic_score_gemma":0.0009242337,"domain_scores_codex":[0.9986904,0.0002225916,0.00008501647,0.0002835183,0.0005019252,0.0002165366],"domain_scores_gemma":[0.9960448,0.00126036,0.0002995831,0.001796466,0.0003882974,0.000210599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000536894,0.00006184308,0.001776131,0.0003047356,0.00004045716,0.0004930073,0.0008550202,0.0280066,0.01642244,0.8390607,0.00981196,0.1026303],"study_design_scores_gemma":[0.00004362068,0.0001171446,0.000542594,0.00009558848,0.00003416497,0.0005100559,0.0003429583,0.09825154,0.02935817,0.8421854,0.02846164,0.00005711089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2326469,0.0005201112,0.7221565,0.0006962965,0.000400875,0.0001035916,0.000638896,0.001527153,0.0413097],"genre_scores_gemma":[0.7077319,0.000471128,0.2638825,0.0003453368,0.0001877785,0.000104589,0.001011161,0.0006608447,0.02560484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009702491,"threshold_uncertainty_score":0.03245813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}